On Constructing k-Connected k-Dominating Set in Wireless Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
IEEE Transactions on Parallel and Distributed Systems
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Mobile Networks and Applications
Local solutions for global problems in wireless networks
Journal of Discrete Algorithms
Depth First Search-based and power-aware geo-routing in ad hoc and sensor wireless networks
International Journal of Autonomous and Adaptive Communications Systems
Minimization of the Redundant Coverage for Dense Wireless Sensor Networks
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On fault tolerant ad hoc network design
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
IEEE Transactions on Neural Networks
Maximizing lifetime of connected-dominating-set in cognitive radio networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Connected dominating set algorithms for wireless sensor networks
International Journal of Sensor Networks
Hi-index | 0.00 |
In a multi-hop wireless network, each node is able tosend a message to all of its neighbors that are locatedwithin its transmission radius. In a flooding task, a sourcesends the same message to all the network. Routingproblem deals with finding a route between a source anda destination. In the activity-scheduling problem, eachnode decides between active or passive state. We presenta scheme whose goal is to prolong network life whilepreserving connectivity. Each node is either active or hasan active neighbor node. Routing and broadcasting arerestricted to active nodes that create such dominating set.Activity status is periodically updated during a shorttransition period. The main contribution of this article isto propose new metrics for previously studied source - independent localized dominating sets, based on combinations of node degrees and remaining energylevels, for deciding activity status.