Abstract
In this paper we tackle the problem of designing simple, localized, low energy consuming, reliable protocols for one-to-all communication in large scale wireless sensor networks. Our first proposed technique, called the Irrigator protocol, relies on the idea to first build a sparse overlay network, and then flood over it. The overlay network is set up by means of a simple, distributed, localized probabilistic protocol and spans all the sensor nodes with high probability. Based on the algorithmic ideas of the Irrigator protocol we then develop a second protocol, dubbed Fireworks, with similar performance that does not require any overlay network to be set up in advance. Asymptotic analytical results are provided which assess the reliability of the Irrigator and Fireworks techniques. The theoretical analysis of the proposed protocols is complemented and validated by a (simulation based) comparative performance evaluation that assesses several advantages of our new protocols with respect to gossiping and simple flooding. Differently from previous studies, we analyze and demonstrate the performance of our protocols for two different node distributions: The typical uniform distribution and a newly defined “hill” distribution, here introduced to capture some of the important and more realistic aspects of node deployment in heterogeneous terrain. Simulation results show that the proposed schemes achieve very good trade-offs between low overhead, low energy consumption and high reliability. In particular, the Irrigator and Fireworks protocols are more reliable than gossiping, and significantly reduce the number of links along which a message is sent over both flooding and gossiping.
Similar content being viewed by others
References
Asmussen, S., Hering, H.: Branching Processes. Birkhäuser, Boston (1983)
Badishi, G., Keidar, I., Sasson, A.: Exposing and eliminating vulnerabilities to denial of service attacks in secure gossip-based multicast. IEEE Trans. Dependable Secur. Comput. 3(1), 45 (Jan. 2006)
Badishi, G., Keidar, I., Melamed, R.: Towards survivability of application-level multicast. In: Proceedings of S.O.S. Survivability: Obstacles and Solutions 2nd Bertinoro Workshop on Future Directions in Distributed Computing, http://www.cs.utexas.edu/users/lorenzo/sos
Basagni, S., Carosi, A., Petrioli, C.: Sensor-DMAC: dynamic topology control for wireless sensor network. In: Proc. of IEEE VTC 2004 Fall, Los Angles, California, September 26–29, 2004
Basagni, S., Chlamtac, I., Syrotiuk, V.R., Woodward, B.A.: A distance routing effect algorithm for mobility (DREAM). In: ACM/IEEE Intl. Conference on Mobile Computing and Networking (MobiCom), 1998
Birman, K.P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Trans. Comput. Syst. 17(2), 1999
Eugster, P.T., Guerraoui, R., Handurukande, S.B., Kermarrec, A.-M.: Lightweight probabilistic broadcast. ACM Trans. Comput. Syst. 21(4), Nov. 2003
Eugster, P.T., Guerraoui, R., Kermarrec, A.-M., Massoulié, L.: Epidemic information dissemination in distributed systems. Computer 37(5), 60–67 (May 2004)
Ferraguto, F., Mambrini, G., Panconesi, A., Petrioli, C.: A new approach to device discovery and scatternet formation in bluetooth networks. In: Proc. of the 18th International Parallel and Distributed Processing Symposium (IPDPS’04), Santa Fe, New Mexico, April 26–30, 2004, pp. 221
Gupta, I., Birman, K.P., van Renesse, R.: Fighting fire with fire: using randomized gossip to combat stochastic scalability limits. Qual. Reliab. Eng. Int. 18 (2002)
Haas, Z., Halpern, J., Li, L.: Gossip-based ad hoc routing. In: Proc. of IEEE INfocom 2002, New York, June 23–27, 2002
Häggström, O., Meester, R.: Nearest neighbor and hard sphere models in continuum percolation. Random Struct. Algorithms 9(3), 295–315 (1996)
Harris, T.E.: The Theory of Branching Processes. Springer, Berlin (1963)
Hass, Z.J., Halpern, J.Y., Li, L.: Gossip-based ad hoc routing. In: IEEE Infocom, June 2002
Johnson, D., Maltz, D., Broch, J.: DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks. In: Perkins, C. (ed.) Ad Hoc Networking. Addison-Wesley, Reading (2001)
Kermarrec, A.-M., Massoulié, L., Ganesh, A.J.: Probabilistic reliable dissemination in large-scale systems. IEEE Trans. Parallel Distrib. Syst. 14(3) (March 2003)
Ko, Y.B., Vaidya, N.H.: Location-aided routing (LAR) in mobile ad-hoc networks. In: ACM/IEEE Intl. Conference on Mobile Computing and Networking (MobiCom), 1998
Li, X., Stojmenovic, I.: Partial Delaunay triangulation and degree limited localized bluetooth scatternet formation. In: Proc. of AD-HOC Networks and Wireless (ADHOC-NOW), Fields Institute, Toronto, CA, September 20–21, 2002, pp. 17–32
Lim, H., Kim, C.: Multicast tree construction and flooding in wireless ad hoc networks. In: Proc. of the ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM), Boston, MA, August 11, 2000, pp. 61–68
Lindvall, T.: Lectures on the Coupling Method. Wiley, New York (1992)
Ni, S.Y., Tseng, Y.C., Chen, Y.S., Sheu, J.P.: The broadcast storm problem in a mobile ad hoc network. In: Proc. of the 5th annual ACM/IEEE International Conference on Mobile Computing and networking (MobiCOM ’99), Seattle, Washington, August 15–20, 1999, pp. 151–162
Paruchuri, V., Durresi, A., Jain, R.: Optimal flooding protocol for routing in ad-hoc networks. Comput. Netw. (submitted)
Peng, W., Lu, X.: On the reduction of broadcast redundancy in mobile ad hoc networks. In: Proc. of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2000), Boston, MA, August 11, 2000, pp. 129–130
Perkins, C.E., Roper, E.M.: Ad hoc on demand distance vector routing. In: IEEE Workshop on Mobile Systems and Applications, Feb. 1999
Qayyum, A., Viennot, L., Laouiti, A.: Multipoint relaying: an efficient technique for flooding in mobile wireless networks. Technical Report 3898, INRIA, Rapport de recherche (2000)
Schurgers, C., Tsiatsis, V., Ganeriwal, S., Srivastava, M.B.: Topology management for sensor networks: exploiting latency and density. In: Proc. of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’02), Lausanne, Switzerland, June 9–11, 2002, pp. 135–145
Stojmenovic, I., Wu, J.: Broadcasting and activity scheduling in ad hoc networks. In: Basagni, S., Conti, M., Giordano, S., Stojmenoviceds, I. (eds.) Ad Hoc Networking. IEEE Press, New York (2004)
Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Trans. Parallel Distrib. Syst. 13(1), 14–25 (2002)
Vogels, W., van Renesse, R., Birman, K.: The power of epidemics: robust communication for large-scale distributed systems. ACM SIGCOMM Comput. Commun. Rev. 33(1) (January 2003)
Williams, B., Camp, T.: Comparison of broadcasting techniques for mobile ad hoc networks. In: Proc. of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2002), Lausanne, Switzerland, June 9–11, 2002, pp. 194–205
Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proc. of the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM 1999), Seattle, Washington, August 20, 1999, pp. 7–14
Xu, Y., Heidemann, J., Estrin, D.: Geography-informed energy conservation for ad hoc routing. In: Proc. of the 7th Annual International Conference on Mobile Computing and Networking (Mobicom’01), Rome, Italy, July 16–21, 2001, pp. 70–84
Xue, F., Kumar, P.R.: The number of neighbors needed for connectivity of wireless networks. Wirel. Netw. 10(2), 169–181 (2004)
Yi, Y., Gerla, M., Kwon, T.J.: Efficient flooding in ad hoc networks: a comparative performance study. In: Proc. of the IEEE International Conference on Communications (ICC 2003), Anchorage, AK, May 11–15, 2003
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dubhashi, D., Häggström, O., Orecchia, L. et al. Localized Techniques for Broadcasting in Wireless Sensor Networks. Algorithmica 49, 412–446 (2007). https://doi.org/10.1007/s00453-007-9092-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-007-9092-8