This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
January 2002 (vol. 13 no. 1)
pp. 14-25
ASCII Text
x 
 
Ivan Stojmenovic, Mahtab Seddigh, Jovisa Zunic, "Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, January, 2002.
 
 
BibTex
x
 
@article{ 10.1109/71.980024,
author = {Ivan Stojmenovic and Mahtab Seddigh and Jovisa Zunic},
title = {Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {13},
number = {1},
issn = {1045-9219},
year = {2002},
pages = {14-25},
doi = {http://doi.ieeecomputersociety.org/10.1109/71.980024},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IS - 1
SN - 1045-9219
SP14
EP25
EPD - 14-25
A1 - Ivan Stojmenovic,
A1 - Mahtab Seddigh,
A1 - Jovisa Zunic,
PY - 2002
KW - Broadcasting
KW - wireless networks
KW - distributed algorithms
KW - dominating sets
KW - clustering.
VL - 13
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 

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 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 broadcasting task is measured experimentally. Dominating sets based broadcasting, enhanced by neighbor elimination scheme and highest degree key, provides reliable broadcast with \leq 53 percent of node retransmissions (on random unit graphs with 100 nodes) for all average degrees d. Critical d is around 4, with \leq 48 percent for \leq 3,\leq 40 percent for d\geq 10, and \leq 20 percent for d\geq 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] L. Briesemeister and G. Hommel, “Role-Based Multicast in Highly Mobile but Sparsely Connected Ad Hoc Networks,” Proc. ACM Symp. Mobile Ad Hoc Networking and Computing (MobiHOC), pp. 45-50, Aug. 2000.
[2] J. Broch, D.A. Maltz, D.B. Johnson, Y.C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. Conf. Mobile Computing MOBICOM, pp. 85-97, 1998.
[3] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 48-55, Aug. 1999.
[4] G. Calinescu, I. Mandoiu, P.J. Wan, and A. Zelikovsky, “Selecting Forwarding Neighbors in Wireless Ad Hoc Networks,” Proc. Fifth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL M), 2001.
[5] G. Chen and I. Stojmenovic, “Clustering and Routing in Wireless Ad Hoc Networks,” Technical Report TR-99-05, Dept. of Computer Science, SITE, Univ. of Ottawa, June 1999.
[6] S. Datta, I. Stojmenovic, and J. Wu, “Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks,” Cluster Computing, Special issue on, Mobile Ad Hoc Networks, vol. 5, no. 2, pp. 169-178, Apr. 2002.
[7] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, “Next Century Challenges: Scalable Coordination in Sensor Networks,” Proc. Mobile Computing MOBICOM, pp. 263-270, 1999.
[8] ITSI STC-RES10 Committee. “Radio Equipment and Systems: High Performance Radio Local Area Network Type 1, Functional Specifications,” June 1996.
[9] A. Ephremides, J.E. Wieselthier, and D.J. Baker, “A Design Concept for Reliable Mobile Radio Networks with Frequency Hoping Signaling,” Proc. IEEE, vol. 75, pp. 56-73, 1987.
[10] S. Guha and S. Khuller, “Approximation Algorithms for Connected Dominating Sets,” Algorithmica, vol. 20, pp. 347-387, 1998.
[11] M. Gerla, T.J. Kwon, and G. Pei, “On Demand Routing in Large Ad Hoc Wireless Networks with Passive Clustering,” Proc. IEEE Wireless Comm. and Network Conf., Sept. 2000.
[12] M. Gerla and T.-C. Tsai, “Multicluster, Mobile, Multimedia Radio Network,” Wireless Networks, vol. 1, pp. 255–265, 1995.
[13] N.F. Huang and T.H. Huang, “On the Complexity of Some Arborescences Finding Problems on a Multihop Radio Network,” BIT, vol. 29, pp. 212-216, 1989.
[14] C. Ho, K. Obraczka, G. Tsudik, and K. Viswanath, “Flooding for Reliable Multicast in Multihop Ad Hoc Networks,” Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL M), Aug. 1999.
[15] G. Lauer, “Address Servers in Hierarchical Networks,” Proc. Int'l Conf. Comm., pp. 443-451, 1988.
[16] E.L. Lloyd, “Broadcast Scheduling for TDMA in Wireless Multi-Hop Networks,” Handbook of Wireless Networks and Mobile Computing, to appear.
[17] C.R. Lin and M. Gerla, “Adaptive Clustering in Mobile Wireless Networks,” IEEE J. Selected Areas in Communications, vol. 16, pp. 1,265–1,275, 1997.
[18] S-Y. Ni et al., "The Broadcast Storm Problem in a Mobile Ad Hoc Network," Proc. 5th Ann. ACM/ IEEE Int'l Conf. Mobile Computing and Networking (Mobicom 99), ACM Press, 1999, pp. 151-162.
[19] S.Y. Ni, Y.C. Tseng, and J.P. Sheu, “Efficient Broadcasting in a Mobile Ad Hoc Network,” Proc. IEEE Int'l Conf. Distributed Computing and Systems, pp. 16-19, Apr. 2001.
[20] A.K. Parekh, “Selecting Routers in Ad Hoc Wireless Networks,” Proc. SBT/IEEE Int'l Telecomm. Symp., 1994.
[21] A. Pelc, “Broadcasting in Wireless Networks,” Handbook of Wireless Networks and Mobile Computing, to appear.
[22] W. Peng and X.-C. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. First Ann. Workshop Mobile and Ad Hoc Networking and Computing, pp. 129-130, Aug. 2000.
[23] E. Pagani and G.P. Rossi, “Providing Reliable and Fault Tolerant Broadcast Delivery in Mobile Ad-Hoc Networks,” Mobile Networks and Applications, vol. 4, pp. 175-192, 1999.
[24] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks,” Research Report RR-3898, INRIA, Mar. 2000. www.inria.fr/RRRTRR-3898.html.
[25] M.T. Sun, W.C. Feng, T.H. Lai, K. Yamada, and H. Okada, “GPS Based Message Broadcast for Adaptive Intervehicle Communications,” Proc. Int'l Conf. Parallel Processing, Aug. 2000.
[26] I. Stojmenovic and X. Lin, “Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 10, pp. 1023-1032, Oct. 2001.
[27] I. Stojmenovic and X. Lin, “Power-Aware Localized Routing in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, to appear.
[28] I. Stojmenovic and M. Seddigh, “Broadcasting Algorithms in Wireless Networks,” Proc. Int'l Conf. Advances in Infrastructure for Electronic Business, Science, and Education on the Internet SSGRR, July/Aug. 2000.
[29] M. Seddigh, J. Solano Gonzalez, and I. Stojmenovic, “RNG and Internal Node Based Broadcasting Algorithms for Wireless One-to-One Networks,” ACM Mobile Computing and Comm. Rev., vol. 5, no. 2, 2001.
[30] I. Stojmenovic, “Location Updates for Efficient Routing in Ad Hoc Networks,” Handbook on Wireless Networks and Mobile Computing, Wiley&Sons, 2001.
[31] I. Stojmenovic, M. Russell, and B. Vukojevic, “Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks,” Proc. IEEE Int'l Conf. Parallel Processing, pp. 173-180, Aug. 2000.
[32] P. Sinha, R. Sivakumar, and B. Vaduvur, “Enhancing Ad Hoc Routing with Dynamic Virtual Infrastructures,” IEEE Joint Conf. Computer and Comm. Societies (INFOCOM), 2001.
[33] J. Wu, M. Gao, and I. Stojmenovic, “On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks,” IEEE Int'l Conf. Parallel Processing, Sept. 2001.
[34] J. Wu and H. Li, “A Dominating Set Based Routing Scheme in Ad Hoc Wireless Networks,” Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL M), pp. 7-14, Aug. 1999.
[35] P.-J. Wan, G. Calinescu, X. Li, and O. Frieder, “Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM 2001, 2001.
[36] J. Wieselthier, G. Nguyen, and A. Ephremides, "On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks," Proc. IEEE Infocom 2000, IEEE Press, 2000, pp. 585-594.

Index Terms:
Broadcasting, wireless networks, distributed algorithms, dominating sets, clustering.
Citation:
Ivan Stojmenovic, Mahtab Seddigh, Jovisa Zunic, "Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002, doi:10.1109/71.980024
Usage of this product signifies your acceptance of the Terms of Use.