Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks
Top Cited Papers
- 7 August 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 13 (1), 14-25
- https://doi.org/10.1109/71.980024
Abstract
In a multihop wireless network, each node has a transmission radius and is able to send a message to all of its neighbors that are located within the radius. In a broadcasting task, a source node sends the same message to all the nodes in the network. In this paper, we propose to significantly reduce or eliminate the communication overhead of a broadcasting task by applying the concept of localized dominating sets. Their maintenance does not require any communication overhead in addition to maintaining positions of neighboring nodes. Retransmissions by only internal nodes in a dominating set is sufficient for reliable broadcasting. Existing dominating sets are improved by using node degrees instead of their ids as primary keys. We also propose to eliminate neighbors that already received the message and rebroadcast only if the list of neighbors that might need the message is nonempty. A retransmission after negative acknowledgements scheme is also described. The important features of the proposed algorithms are their reliability (reaching all nodes in the absence of message collisions), significant rebroadcast savings, and their localized and parameterless behavior. The reduction in communication overhead for the broadcasting task is measured experimentally. Dominating set based broadcasting, enhanced by a neighbor elimination scheme and highest degree key, provides reliable broadcast with /spl les/53 percent of node retransmissions (on random unit graphs with 100 nodes) for all average degrees d. Critical d is around 4, with <48 percent for /spl les/3, /spl les/40 percent for d/spl ges/10, and /spl les/20 percent for d/spl ges/25. The proposed methods are better than existing ones in all considered aspects: reliability, rebroadcast savings, and maintenance communication overhead. In particular, the cluster structure is inefficient for broadcasting because of considerable communication overhead for maintaining the structure and is also inferior in terms of rebroadcast savings.Keywords
This publication has 24 references indexed in Scilit:
- Role-based multicast in highly mobile but sparsely connected ad hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Power-aware localized routing in wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the reduction of broadcast redundancy in mobile ad hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networksIEEE Transactions on Parallel and Distributed Systems, 2001
- RNG and internal node based broadcasting algorithms for wireless one-to-one networksACM SIGMOBILE Mobile Computing and Communications Review, 2001
- Flooding for reliable multicast in multi-hop ad hoc networksPublished by Association for Computing Machinery (ACM) ,1999
- Routing with guaranteed delivery in ad hoc wireless networksPublished by Association for Computing Machinery (ACM) ,1999
- Providing reliable and fault tolerant broadcast delivery in mobile ad‐hoc networksMobile Networks and Applications, 1999
- Multicluster, mobile, multimedia radio networkWireless Networks, 1995
- On the complexity of some arborescences finding problems on a multihop radio networkBIT Numerical Mathematics, 1989