Algorithm for A Connected Dominating Set in Wireless Networks

A wireless adhoc network is a collection of wireless mobile nodes forming a temporary network without the aid of any established infrastructure or centralized administration. The wireless networks face challenges to form an optimal routing protocol. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. Routing based on a connected dominating set is a Efficient approach, where the searching space for a route is reduced to nodes in the set, The proposed algorithm is an enhancement of the distributed algorithm proposed by Wu and Li. In this book, we propose a simple and efficient distributed algorithm for calculating connected dominating set in adhoc wireless networks, where connections of nodes are determined by their geographical distances. We also propose an update/recalculation algorithm for the connected dominating set when the topology of the adhoc wireless network changes dynamically. The simulation results show that the average dominating set of nodes decreased considerable after applying the new algorithm. Our approach can be potentially used in designing efficient routing algorithms based on a connected dominating set.

Autorentext

Dr. Mukesh Kumar Awasthi has done his post-graduation in Mathematics from the University of Lucknow in the year 2007. He has obtained his Ph.D degree in Mathematics from Indian Institute of Technology Roorkee in 2012. Currently he is working as an assistant Professor in the Department of Mathematics, Graphic Era University, Dehradun.