Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
Depth First Search-based and power-aware geo-routing in ad hoc and sensor wireless networks
International Journal of Autonomous and Adaptive Communications Systems
The impact of delay in dominating set and neighbor elimination based broadcasting in ad hoc networks
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Hi-index | 0.00 |
Our paper [1] generated a lot of interest among researchers in ad hoc networks. A number of researchers questioned, through their articles, or directly to the first author, the correctness of the described procedure, and the correctness of the claim that the procedure does not need any communication exchange between nodes, in addition to "hello驴 messages needed to learn information about neighboring nodes. This correspondence completes the article by providing the actual dominating set definitions used in the procedure (from which zero communication overhead follows easily), the correct procedure (the published one has few misprints at key places), and the proof that the new definitions and procedure indeed define connected dominating sets.