This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimized Broadcast Protocol for Sensor Networks
August 2005 (vol. 54 no. 8)
pp. 1013-1024
ASCII Text
x 
 
Arjan Durresi, Vamsi K. Paruchuri, S. Sitharama Iyengar, Rajgopal Kannan, "Optimized Broadcast Protocol for Sensor Networks," IEEE Transactions on Computers, vol. 54, no. 8, pp. 1013-1024, August, 2005.
 
 
BibTex
x
 
@article{ 10.1109/TC.2005.131,
author = {Arjan Durresi and Vamsi K. Paruchuri and S. Sitharama Iyengar and Rajgopal Kannan},
title = {Optimized Broadcast Protocol for Sensor Networks},
journal ={IEEE Transactions on Computers},
volume = {54},
number = {8},
issn = {0018-9340},
year = {2005},
pages = {1013-1024},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.131},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Optimized Broadcast Protocol for Sensor Networks
IS - 8
SN - 0018-9340
SP1013
EP1024
EPD - 1013-1024
A1 - Arjan Durresi,
A1 - Vamsi K. Paruchuri,
A1 - S. Sitharama Iyengar,
A1 - Rajgopal Kannan,
PY - 2005
KW - Index Terms- Broadcasting
KW - flooding protocols
KW - wireless sensor networks.
VL - 54
JA - IEEE Transactions on Computers
ER -
 
Sensor networks usually operate under very severe energy restrictions. Therefore, sensor communications should consume the minimum possible amount of energy. While broadcasting is a very energy-expensive protocol, it is also widely used as a building block for a variety of other network layer protocols. Therefore, reducing the energy consumption by optimizing broadcasting is a major improvement in sensor networking. In this paper, we propose an optimized Broadcast Protocol for Sensor networks (BPS). The major novelty of BPS is its adaptive-geometric approach that enables considerable reduction of retransmissions by maximizing each hop length. BPS adapts itself and gets the best out of existing radio conditions. In BPS, nodes do not need any neighborhood information, which leads to low communication and memory overhead. We analyze the worst-case scenario for BPS and show that the number of transmissions in such a scenario is a constant multiple of those required in the ideal case. Our simulation results show that BPS is very scalable with respect to network density. BPS is also resilient to transmission errors.

[1] R. Kershner, “The Number of Circles Covering a Set,” Am. J. Math., vol. 61, pp. 665-671, 1939.
[2] G. Dommety and R. Jain, “Potential Networking Applications of Global Positioning Systems (GPS),” Technical Report TR-24, Computer Science Dept., The Ohio State Univ., Apr. 1996.
[3] Z. Haas, J. Halpern, and L. Li, “Gossip Based Ad Hoc Routing,” Proc. IEEE INFOCOM, June 2002.
[4] S.Y. Ni et al., “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM MOBICOM, pp. 151-162, Aug. 1999.
[5] J. Li, C. Blake, D.S.J. De Couto, H.I. Lee, and R. Morris, “Capacity of Ad Hoc Wireless Networks,” Proc. Seventh Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom), pp. 61-69, July 2001.
[6] I. Chlamtac and O. Weinstein, “The Wave Expansion Approach to Broadcasting in Multi-Hop Radio Networks,” IEEE Trans. Comm., vol. 39, pp. 426-433, Mar. 1991.
[7] N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, “A Lower Bound for Radio Broadcast,” J. Computing Systems Science, vol. 43, pp. 290-298, Oct. 1991.
[8] I. Gaber and Y. Mansour, “Broadcast in Radio Networks,” Proc. Sixth Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 577-585, Jan. 1995.
[9] S. Guha and S. Khuller, “Approximation Algorithms for Connected Dominating Sets,” Proc. Fourth Ann. European Symp. Algorithms (ESA), pp. 179-193, 1996.
[10] C. Ho, K. Obraczka, G. Tsudik, and K. Viswanath, “Flooding for Reliable Multicast in Multi-Hop Ad Hoc Networks,” Proc. Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Communication (DIALM), pp. 64-71, 1999.
[11] J. Jetcheva, Y. Hu, D. Maltz, and D. Johnson, “A Simple Protocol for Multicast and Broadcast in Mobile Ad Hoc Networks,” Internet Draft: draft-ietf-manet-simple-mbcast-01.txt, July 2001.
[12] H. Lim and C. Kim, “Multicast Tree Construction and Flooding in Wireless Ad Hoc Networks,” Proc. ACM Int'l Workshop Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM), pp. 61-68, 2000.
[13] J. Wu and F. Dai, “Broadcasting in Ad Hoc Networks Based on Self-Pruning,” Proc. IEEE INFOCOM 2003, 2003.
[14] W. Peng and X. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. MOBIHOC, 2000.
[15] W. Peng and X. Lu, “AHBP: An Efficient Broadcast Protocol for Mobile Ad Hoc Networks,” J. Science and Technology-Beijing, China, 2002.
[16] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks,” Technical Report 3898, INRIA-Rapport de Recherche, 2000.
[17] I. Stojmenovic, M. Seddigh, and J. Zunic, “Internal Node Based Broadcasting in Wireless Networks,” Proc. Hawaii Int'l Conf. System Sciences (HICSS), 2001.
[18] J. Sucec and I. Marsic, “An Efficient Distributed Network-Wide Broadcast Algorithm for Mobile Ad Hoc Networks,” CAIP Technical Report 248, Rutgers Univ., Sept. 2000.
[19] J. Wu and H. Li, “On Calculating Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks,” Proc. Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL-M), pp. 7-14, 1999.
[20] B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks,” Proc. Third ACM Int'l Symp. Mobile Ad Hoc Networking & Computing, June 2002.
[21] M. Sun and T.H. Lai, “Location Aided Broadcast in Wireless Ad Hoc Network Systems,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC 2002), pp. 597-602, Mar. 2002.
[22] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Comm. & Mobile Computing (WCMC), vol. 2, no. 5, pp. 483-502, 2002.
[23] T. He, C. Huang, B.M. Blum, J.A. Stankovic, and T.F. Abdelzaher, “Range-Free Localization Schemes in Large Scale Sensor Networks,” Proc. Ninth Ann. Int'l Conf. Mobile Computing and Networking (MobiCom 2003), Sept. 2003.
[24] P. Bahl and V.N. Padmanabhan, “RADAR: An In-Building RF-Based User Location and Tracking System,” Proc. IEEE INFOCOM '00, 2000.
[25] A. Savvides, C.C. Han, and M.B. Srivastava, “Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors,” Proc. MOBICOM '01, July 2001.
[26] D. Niculescu and B. Nath, “Ad Hoc Positioning System (APS) Using AoA,” Proc. INFOCOM '03, 2003.
[27] A. Perrig, R. Szewczyk, V. Wen, D. Culler, and J.D. Tygar, “SPINS: Security Protocols for Sensor Networks,” Wireless Networks J. (WINE), Sept. 2002.
[28] W. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive Protocols for Information Dissemination in Wireless Sensor Network,” Proc. Fifth ACM/IEEE Mobicom Conf. (MobiCom '99), Aug. 1999.
[29] S. Tilak, A.L. Murphy, and W.B. Heinzelman, “Non-Uniform Information Dissemination for Sensor Networks,” Proc. 11th Int'l Conf. Network Protocols (ICNP '03), Nov. 2003.
[30] C. Intanagonwiwat, R. Govindan, and D. Estrin, “Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks,” Proc. Sixth Ann. Int'l Conf. Mobile Computing and Networking (MobiCOM '00), Aug. 2000.
[31] S. Dolev, T. Herman, and L. Lahiani, “Polygonal Broadcast for Sensor Networks,” Proc. Second IEEE Upstate New York Workshop Sensor Networks, 2003.
[32] J. Zhao and R. Govindan, “Understanding Packet Delivery Performance Indense Wireless Sensor Networks,” Proc. First Int'l Conf. Embedded Networked Sensor Systems (Sensys 2003), pp. 1-13, Nov. 2003.
[33] A. Woo, T. Tong, and D. Culler, “Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks,” Proc. First Int'l Conf. Embedded Networked Sensor Systems (Sensys 2003), pp. 14-27, Nov. 2003.
[34] A. Cerpa, N. Busek, and D. Estrin, “SCALE: A Tool for Simple Connectivity Assessment in Lossy Environments,” UCLA CENS-TR #21, 09/2003, http://deerhound.ats.ucla.edu:7777/pls/portal / docs/PAGE/CENS_MAIN/RESOURCES/LARGE_FILES TR21_SCALE-TECH-REPORT.PDF, 2003.
[35] G. Zhou, T. He, S. Krishnamurthy, and J.A. Stankovic, “Impact of Radio Irregularity on Wireless Sensor Networks,” Proc. Second Int'l Conf. Mobile Systems, Applications, and Services (Mobisys 2004), pp. 125-138, 2004.
[36] OMNeT++: Discrete Event Simulation System, http:/www. omnetpp.org/, 2005.
[37] S. Basavaraju, “SenSim: A Wireless Sensor Network Simulation Environment,” master's thesis, Dept. of Computer Science, Louisiana State Univ., June 2004.
[38] C. Mallanda, “Extensions of SenSim Simulation Platform for Sensor Networks,” master's thesis, Dept. of Computer Science, Louisiana State Univ., Dec. 2004.
[39] F. Dai and J. Wu, “Performance Analysis of Broadcast Protocols in Ad Hoc Networks Based on Self-Pruning,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 11, pp. 1027-1040, Nov. 2004.
[40] S. Giordano and I. Stojmenovic, “Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy,” Ad Hoc Wireless Networking, X. Cheng, X. Huang, and D.Z. Du, eds., pp. 103-136, Kluwer, 2004.

Index Terms:
Index Terms- Broadcasting, flooding protocols, wireless sensor networks.
Citation:
Arjan Durresi, Vamsi K. Paruchuri, S. Sitharama Iyengar, Rajgopal Kannan, "Optimized Broadcast Protocol for Sensor Networks," IEEE Transactions on Computers, vol. 54, no. 8, pp. 1013-1024, Aug. 2005, doi:10.1109/TC.2005.131
Usage of this product signifies your acceptance of the Terms of Use.