Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

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.

[1]  StojmenovicIvan,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002 .

[2]  Gene Tsudik,et al.  Flooding for reliable multicast in multi-hop ad hoc networks , 1999, DIALM '99.

[3]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

[4]  Günter Hommel,et al.  Role-based multicast in highly mobile but sparsely connected ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[5]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[7]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[8]  Gregory Lauer,et al.  Address servers in hierarchical networks , 1988, IEEE International Conference on Communications, - Spanning the Universe..

[9]  Ivan Stojmenovic,et al.  Power-aware localized routing in wireless networks , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[10]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[11]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[12]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[13]  Jie Wu,et al.  A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks , 2001, Telecommun. Syst..

[14]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[15]  Günter Hommel,et al.  Role-based multicast in highly mobile but sparsely connected ad hoc networks , 2000, MobiHoc.

[16]  Ivan Stojmenovic,et al.  Power-Aware Localized Routing in Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[17]  Anis Laouiti,et al.  Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks , 2000 .

[18]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[19]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, ESA.

[20]  RNG and internal node based broadcasting algorithms for wireless one-to-one networks , 2001, MOCO.

[21]  Wei Peng,et al.  On the reduction of broadcast redundancy in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[22]  Jie Wu,et al.  Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks , 2004, Cluster Computing.

[23]  Ivan Stojmenovic,et al.  Depth first search and location based localized routing and QoS routing in wireless networks , 2000, Proceedings 2000 International Conference on Parallel Processing.

[24]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[25]  Nen-Fu Huang,et al.  On the complexity of some arborescences finding problems on a multihop radio network , 1989, BIT Comput. Sci. Sect..

[26]  Elena Pagani,et al.  Providing reliable and fault tolerant broadcast delivery in mobile ad‐hoc networks , 1999, Mob. Networks Appl..

[27]  Mario Gerla,et al.  On-demand routing in large ad hoc wireless networks with passive clustering , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[28]  Mahtab Seddigh.  Broadcasting in wireless networks. , 2001 .

[29]  Vaduvur Bharghavan,et al.  Enhancing ad hoc routing with dynamic virtual infrastructures , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[30]  Ion I. Mandoiu,et al.  Selecting Forwarding Neighbors in Wireless Ad Hoc Networks , 2001, DIALM '01.

[31]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[32]  T. Nandagopal,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, MobiCom 1999.

[33]  Errol L. Lloyd,et al.  Broadcast scheduling for TDMA in wireless multihop networks , 2002 .