Research Journal of Applied Sciences
ISSN: Online 1993-6079ISSN: Print 1815-932x
Abstract
Topology control is a powerful solution to reduce power consumption and the number of collisions by minimizing the transmission range of each node by maintaining a certain level of network connectivity. The term "topology control" is consumed mostly by the wireless ad hoc and sensor networks research community. K-Edge Connected Topology Control algorithm have been proposed to construct robost topologies for mobile networks. The original K-Edge Connected algorithm uniformly using the same value of k for Localized Topology Control algorithms in any local graph is not effective because nodes move at different speeds. Moreover, the existing algorithm need to determine the value of k a priori but moving speed of the nodes are unpredictable and therefore it is not practical in Mobile Ad hoc Networks (MANETs). A dynamic method is proposed in this study to assistant the K-Edge Connected algorithm. The proposed method automatically determines the value of k for each local graph based on local information while promising the network connectivity. The result provides that dynamic method is more scalable and efficient than the existing K-Edge Connected Topology Control algorithms while preserving the network connectivity.
How to cite this article:
P. Indira Priya and P. Chandramohan. Finding the K-Edge Connectivity in MANET Using DLTRT.
DOI: https://doi.org/10.36478/rjasci.2014.407.411
URL: https://www.makhillpublications.co/view-article/1815-932x/rjasci.2014.407.411