Affiliation:
1. Jackson State University, USA
Abstract
The set of nodes constituting a minimum connected dominating set (MCDS) in a wireless ad hoc network (WANET) could be considered as the minimum number of nodes that are required to forward a broadcast message so that the message reaches all the nodes in the network. With regards to MCDS construction, we notice that smaller the transmission range for the nodes, the larger the size of the MCDS and vice-versa. Hence, from an energy efficiency point of view, it is imperative to determine the minimum transmission range (we assume uniform transmission range for all the nodes) that would be needed to construct a MCDS of a certain threshold size in WANETs. In this pursuit, we propose a binary search algorithm of logarithmic time complexity to determine the minimum uniform transmission range that would be sufficient to obtain a connected network and construct a MCDS whose size is within a threshold.
Subject
Industrial and Manufacturing Engineering,Metals and Alloys,Strategy and Management,Mechanical Engineering
Reference39 articles.
1. Distributed heuristics for connected dominating sets in wireless ad hoc networks
2. Construction of connected dominating set to reduce contention in wireless ad-hoc network
3. Stochastic Properties of the Random Waypoint Mobility Model
4. Blum, J., Ding, M., Thaeler, A., & Cheng, X. (2004). Connected Dominating Set in Sensor Networks and MANETs. In D.-Z. Du & P. Pardalos (Eds.), Handbook of Combinatorial Optimization (pp. 329–369). Academic Press.
5. Chen, Y., Sirer, E. G., & Wicker, S. B. (2003). On Selection of Optimal Transmission Power for Ad Hoc Networks. In Proceedings of the 36th Hawaii International Conference on System Sciences. Academic Press.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献