Predicted Link Expiration Time Based Connected Dominating Sets for Mobile Ad hoc Networks
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 6
Abstract
We propose an algorithm to determine stable connected dominating sets (CDS), based on the predicted link expiration time (LET), for mobile ad hoc networks (MANETs). The roposed LETbased CDS algorithm is the first such algorithm that constructs a CDS based on edge weights represented by predicted link expiration time, rather the traditional approach of using node weights like the wellknown maximum ensity-based CDS (MaxD-CDS) algorithm. The construction of the LET-CDS starts with the inclusion of the edge having the largest predicted link expiration time, into the CDS. Once an edge is included as the CDS edge list, the two constituent nodes of the edge becomes part of the CDS node list. The neighbors and the edges incident to either one or both the end nodes of the CDS edge are also said to be covered. The covered edges are considered in the increasing order of their predicted link expiration time, for inclusion in the CDS. If an edge has a higher predicted xpiration time and is the next candidate edge to be onsidered for inclusion into the CDS, it is added to the CDS edge list if either one or both of the end nodes of the edge has at least one neighbor node that is yet to be covered. This procedure is repeated until all the nodes in the network are covered. Simulation results illustrate that the LET-CDS has a longer lifetime compared to the MaxD-CDS, especially in networks of moderate and high density. The LET-CDS also has a larger number of nodes and edges compared to the MaxD-CDS and this helps to reduce the hop count as well as the end-to-end delay and improves the fairness of node usage.
Authors and Affiliations
Pervis Fly , Natarajan Meghanathan
Keywords
Related Articles
- EP ID EP134532
- DOI -
- Views 95
- Downloads 0
General Framework for Cluster based Active Learning Algorithm
This paper revisits the problem of active learning and decision making when the cost of labeling incurs cost and unlabeled data is available in abundance. In many real world applications large amounts of data are availab...
DEFINING RELATIONS IN PRECISIATION OF NATURAL LANGUAGE PROCESSING FOR SEMANTIC WEB
As we know people using semantic web which facilitates them to organize, locate and process content. The content access by people comfortably is the natural language which we all use in our day to day life. The Semantic...
A Probabilistic Approach of Coverage prediction in Mobile Ad hoc Networks
A fundamental issue arising in mobile ad-hoc networks (MANETs) is the selection of the optimal path between any two nodes. It’s very difficult to select of optimal path due to different factors affects the stability of t...
DESIGN AND SIMULATION OF MULTIBAND PLANAR INVERTED-F ANTENNA FOR MOBILE PHONE APPLICATIONS
The proposed multiband planar inverted-F antenna has a very simple structure. The antenna has only one layer so it is easy to fabricate. The size of radiating patch of proposed antenna is 20mm× 25mm, while the size of gr...
New Design Metrics for Complexity Estimation in Object Oriented Systems
This paper proposes four design metrics of class level for early and effective feedback to manage the quality of object-oriented software. These metrics measure the complexity induced by the use of various object-oriente...