Energy efficient distributed connected dominating sets construction in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
International Journal of Sensor Networks
Connectivity and coverage maintenance in wireless sensor networks
The Journal of Supercomputing
IEEE Transactions on Communications
Adaptive multicast trees on static ad hoc networks: tradeoffs between delay and energy consumption
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
| Hi-index | 0.00 |
In this paper we have proposed a distributed algorithm for finding power aware connected dominating set in a graph representing an ad hoc network. Our simulation indicates that we always formulate power aware dominating sets using our method. The dominating sets we obtain are in general smaller in size compared to the same obtained in [1]. We manage to route more packets compared to [2] as we use power aware feature and look for alternative power aware dominating sets once energy levels of some of the nodes of our initial dominating set fall below certain threshold. We could ensure mobility support in our algorithm and under the condition of mobility obtain better lifespan using our algorithm compared to the one that has no power aware feature. To handle small topology changes due to switching on/off actions of mobile hosts we proposed a localized algorithm for maintaining the connected power aware dominating set.