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 76
- Downloads 0
Update Vehicle Traffic Routing Using Ant Colony Optimization Algorithm
In this paper, the authors want to implement the solution of combinatorial problem, based on the heuristic behavior of ant. This paper focuses on a highly developed solution procedure using ACO algorithm. This helps to s...
INTERNAL COMPACT PRINTED LOOP ANTENNA WITH MATCHING ELEMENT FOR LAPTOP APPLICATIONS
An internal compact printed loop antenna with matching element is presented for laptop applications. Bending to the printed loop structure is employed to reduce the size of antenna. A matching element is used at backside...
Differential Evolution and Dynamic Differential Evolution Variants for High Dimensional Function Optimization : An Empirical Scalability Study
This paper empirically compares the performance and scalability of Differential Evolution (DE) and Dynamic Differential Evolution (DDE) variants for solving high dimensional unconstrained global optimization functions. F...
Implementation of an Energy Efficient Reconfigurable uthentication Unit for Software Radio
To promote the commercial implementation of software ownload for Software Defined Radio (SDR) terminals, a secure method of download is vital. Downloading of all the relevant software is performed via a public channel,...
FACE RECOGNITION FROM LOWER JAW OR MANDIBLE OF A HUMAN
Identify a human by his face is a very easy job for a human but it is most difficult job for a machine. These papers presenting some approaches for recognize a human face from skull. Then a totally new conception is intr...