This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks
January 2005 (vol. 54 no. 1)
pp. 36-46
ASCII Text
x 
 
Harshavardhan Sabbineni, Krishnendu Chakrabarty, "Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks," IEEE Transactions on Computers, vol. 54, no. 1, pp. 36-46, January, 2005.
 
 
BibTex
x
 
@article{ 10.1109/TC.2005.8,
author = {Harshavardhan Sabbineni and Krishnendu Chakrabarty},
title = {Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks},
journal ={IEEE Transactions on Computers},
volume = {54},
number = {1},
issn = {0018-9340},
year = {2005},
pages = {36-46},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.8},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks
IS - 1
SN - 0018-9340
SP36
EP46
EPD - 36-46
A1 - Harshavardhan Sabbineni,
A1 - Krishnendu Chakrabarty,
PY - 2005
KW - Communication protocol
KW - location
KW - energy management
KW - information dissemination
KW - flooding.
VL - 54
JA - IEEE Transactions on Computers
ER -
 
We present a new information dissemination protocol for wireless sensor networks. This protocol uses location information to reduce redundant transmissions, thereby saving energy. The sensor network is divided into virtual grids and each sensor node associates itself with a virtual grid based on its location. Sensor nodes within a virtual grid are classified as either gateway nodes or internal nodes. While gateway nodes are responsible for forwarding the data across virtual grids, internal nodes forward the data within a virtual grid. The proposed approach, termed location-aided flooding (LAF), achieves energy savings by reducing the redundant transmissions of the same packet by a node. We study the performance of LAF for different grid sizes and different node densities and compare it to other well-known methods. We show that LAF can save a significant amount of energy compared to prior methods.

[1] D. Agrawal, A. El Abbadi, and R. Steinke, “Epidemic Algorithms in Replicated Databases,” Proc. ACM Symp. Principles of Database Systems, pp. 161-172, 1997.
[2] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayiri, “Wireless Sensor Networks: A Survey,” Computer Networks, vol. 38, pp. 393-422, Mar. 2002.
[3] J. Albowicz, A. Chen, and L. Zhang, “Recursive Position Estimation in Sensor Networks,” Proc. Int'l Conf. Network Protocols, pp. 35-41, 2001.
[4] “Ash Transceiver's Designers Guide,” http:/www.rfm.com, 2004.
[5] P. Bergamo and G. Mazzini, “Localization in Sensor Networks with Fading and Mobility,” Proc. 13th IEEE Int'l Symp. Personal, Indoor, and Mobile Radio Comm., pp. 750-754, 2002.
[6] K.P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networking, pp. 151-162, Aug. 1999.
[7] K.P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky, “Bimodal Multicast,” ACM Trans. Computer Systems, vol. 17, pp. 41-88, May 1999.
[8] J. Broch, D. Maltz, D. Johnson, Y. Su, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networking, pp. 85-97, 1998.
[9] R.R. Brooks, P. Ramanathan, and A.A. Sayeed, “Distributed Target Classification and Tracking in Sensor Networks,” Proc. IEEE, vol. 91, pp. 1163-1171, Aug. 2003.
[10] R.R. Brooks and S.S. Iyengar, Multi-Sensor Fusion: Fundamentals and Applications with Software. Prentice Hall, 1997.
[11] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Co-Ordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networking, pp. 85-96, 2001.
[12] T. Clouqueur, K.K. Saluja, and P. Ramanathan, “Fault Tolerance in Collaborative Sensor Networks for Target Detection,” IEEE Trans. Computers, vol. 53, pp. 320-333, Mar. 2004.
[13] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, “Next Century Challenges: Mobile Networking for Smart Dust,” Proc. ACM Conf. Mobile Computing and Networking, pp. 271-278, 1999.
[14] L. Girod and D. Estrin, “Robust Range Estimation for Localization in Ad Hoc Sensor Networks,” UCLA CS-TR-2000XX, 2000.
[15] Z. Haas, J. Halpern, and L. Li, “Gossip Based Ad Hoc Routing,” Proc. IEEE Infocom Conf., pp. 1702-1706, 2002.
[16] B. Hoffman-Wellenhof, H. Lichteneger, and J. Collins, Global Positioning System: Theory and Practice, fourth ed. Vienna: Springer-Verlag, 1997.
[17] C. Huitema, Routing in Internet. Prentice Hall, 1996.
[18] C. Intanagonwiwat, R. Govindan, and D. Estrin, “Directed Diffusion: A Scalable And Robust Communication Paradigm for Wireless Sensor Networks,” Proc. ACM/IEEE Int' Conf. Mobile Computing and Networking, pp. 56-67, 2000.
[19] J. Jetcheva, Y. Hu, D. Maltz, and D. Johnson, “A Simple Protocol for Multicast and Broadcast in Wireless Ad Hoc Networks,” Internet Draft: draft-ietf-manet-simple-mbcast-01.txt, July 2001.
[20] R. Kannan, S. Sarangi, S.S. Iyengar, and L. Ray, “Sensor-Centric Quality of Routing In Sensor Networks,” Proc. IEEE Infocom, pp. 693-701, 2003.
[21] B. Krishnamachari and S.S. Iyengar, “Distributed Bayesian Algorithms for Fault-Tolerant Event Region Detection in Wireless Sensor Networks,” IEEE Trans. Computers, vol. 53, pp. 241-250, Mar. 2004.
[22] J. Kulik, W.R. Heinzelman, and H. Balakrishnan, “Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks,” Wireless Networks, vol. 8, pp. 169-185, 2002.
[23] T.J. Kwon, M. Gerla, V.K. Varma, M. Barton, and T.R. Hsing, “Efficient Flooding with Passive Clustering— An Overhead-Free Selective Forward Mechanism for Ad Hoc/Sensor Networks,” Proc. IEEE, vol. 91, pp. 1210-1220, Aug. 2003.
[24] H. Lim and C. Kim, “Multicast Tree Construction and Flooding in Wireless Ad Hoc Networks,” Proc. ACM Modeling, Analysis, and Simulation of Wireless and Mobile Systems, pp. 61-68, 2000.
[25] J. Moy, OSPF Version 2, RFC 1583, http://www.ietf.org/rfcrfc1583.txt, 1991.
[26] D.C. Oppen and Y.K. Dalal, “The Clearinghouse: A Decentralized Agent for Locating Named Objects in a Distributed Environment,” ACM Trans. Office Information Systems, vol. 1, pp. 230-253, July 1983.
[27] N. Patwari and R.J. O'Dea, “Relative Location in Wireless Networks,” Proc. IEEE Vehicular Technology Conf., pp. 1149-1153, 1991.
[28] A. Pelt, “Fault-Tolerant Broadcasting and Gossiping in Communication,” Networks, vol. 3, pp. 143-156, Oct. 1996.
[29] W. Peng and X. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. ACM Int'l Symp. Mobile and Ad Hoc Networking and Computing, pp. 129-130, 2000.
[30] V. Phipatanasuphorn and P. Ramanathan, “Vulnerability of Sensor Networks to Unauthorized Traversal and Monitoring,” IEEE Trans. Computers, vol. 53, no. 3, pp. 364-369, Mar. 2004.
[31] G.J. Pottie and W. Kaiser, “Wireless Sensor Networks,” Comm. ACM, vol. 43, pp. 51-58, 2000.
[32] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks,” Proc. IEEE Hawaii Int'l Conf. System Sciences (HICSS), pp. 3898-3907, 2002.
[33] H. Qi, Y. Xu, and X. Wang, “Mobile-Agent-Based Collaborative Signal and Information Processing in Sensor Networks,” Proc. IEEE, vol. 91, pp. 1172-1183, Aug. 2003.
[34] C. Raghavendra and S. Singh, “PAMAS: Power-Aware Multi-Access Protocol with Signaling for Ad Hoc Networks,” ACM Comm. Rev., pp. 5-26, July 1998.
[35] A. Savvides, C.-C. Han, and M. Srivastava, “Dynamic Fine-Grained Localization in Ad Hoc Networks of Sensors,” Proc. Int'l Con. Mobile Computing and Networking, pp. 166-179, 2001.
[36] C. Schurgers, V. Tsiatsis, and M. Srivastava, “STEM: Topology Management for Energy-Efficient Sensor Networks,” Proc. IEEE Aerospace Conf., pp. 135-145, 2002.
[37] K. Sohrabi and G.J. Pottie, “Performance of a Novel Self Organization Protocol for Wireless Ad Hoc Sensor Networks,” Proc. IEEE Vehicular Technology Conf., pp. 1222-1226, 1999.
[38] K. Whitehouse and D. Culler, “Calibration as Parameter Estimation in Sensor Networks,” Proc. ACM Int'l Workshop Sensor Networks and Applications, pp. 59-67, 2002.
[39] R. Williams, The Geometrical Foundation of Natural Structure: A Source Book of Design. New York: Dover Publications, 1979.
[40] J. Wu and F. Dai, “Broadcasting in Ad Hoc Networks Based on Self-Pruning,” Proc. Infocom, pp. 2240-2250, 2003.
[41] Y. Xu, J. Heidemann, and D. Estrin, “Geography Informed Energy Conservation for Ad Hoc Routing,” Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networking, pp. 70-84, July 2001.
[42] Y. Xu, J. Heidemann, and D. Estrin, “Adaptive Energy Conservating Routing for Multihop Ad Hoc Routing,” Technical Report 527, USC/ISI, Oct. 2000.
[43] Wireless LAN Medium Access Control and Physical Layer Specifications, IEEE 802.11 Standard (IEEE CS LAN MAN Standards Committee), Aug. 1999.

Index Terms:
Communication protocol, location, energy management, information dissemination, flooding.
Citation:
Harshavardhan Sabbineni, Krishnendu Chakrabarty, "Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks," IEEE Transactions on Computers, vol. 54, no. 1, pp. 36-46, Jan. 2005, doi:10.1109/TC.2005.8
Usage of this product signifies your acceptance of the Terms of Use.