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
Computer Vision for Malaria Parasite Classification in Erythrocytes
In this is paper, we introduce a new approach to represent a mathematical modeling technique by means of linear programming as an efficient tool to solve problems related to medical imaging problems especially Malaria Di...
Image Segmentation using Extended Edge Operator for Mammographic Images
Detection of edges in an image is a very important step owards understanding image features. Since edges often occur at mage locations representing object boundaries, edge etection is extensively used in image segmenta...
Extraction of Flat and Nested Data Records from Web Pages
This paper studies the problem of identification and extraction of flat and nested data records from a given web page. With the explosive growth of information sources available on the World Wide Web, it has become incre...
Audio Compression Codec Using a Dynamic Gammachirp Psychoacoustic Model And a D.W.T Multiresolution Analysis
Audio compression algorithms are used to obtain compact digital representations of high-fidelity audio signals for the purpose of efficient transmission over larger distances and storage. This paper presents an audio cod...
Fuzzy Shortest Path For Steiner Tree Problem
In this paper, a modification of the shortest path approximation based on the fuzzy shortest paths evaluations. The Steiner tree problem on a graph in which a fuzzy number instead of a real number is assigned to each edg...