Percolation Driven Flooding for Energy Efficient Routing in Dense Sensor Networks

• Autorzy: Vakulya G. , Simon G.
• Języki publikacji: EN

Abstrakty

EN

Simple flooding algorithms are widely used in ad hoc sensor networks either for information dissemination or as building blocks of more sophisticated routing protocols. In this paper a percolation driven probabilistic flooding algorithm is proposed, which provides large message delivery ratio with small number of sent messages, compared to traditional flooding. To control the number of sent messages the proposed algorithm uses locally available information only, thus induces negligible overhead on network traffic. The performance of the algorithm is analyzed and the theoretical results are verified through simulation examples.

Słowa kluczowe

EN

flood routing; percolation; sensor network

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2009
• Tom: nr 2
• Strony: 5--12
• Opis fizyczny: Bibliogr. 28 poz., rys.

Twórcy

autor

Vakulya G.

autor

Simon G.

• University of Pannonia, Egyetem u. 10, 8200 Veszprém, Hungary,

Bibliografia

• [1] A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk, and J. Anderson, “Wireless sensor networks for habitat monitoring”, in Proc. WSNA Conf., Atlanta, USA, 2002, pp. 88—97.
• [2] A. Arora et al., “A line in the sand: a wireless sensor network for target detection, classification, and tracking”, Comput. Netw., vol. 46, no. 5, pp. 605–634, 2004.
• [3] A. Ledeczi et al., “Countersniper system for urban warfare”, ACM Trans. Sen. Netw., vol. 1, no. 2, pp. 153–177, 2005.
• [4] T. He et al., “VigilNet: an integrated sensor network system for energy-efficient surveillance”, ACM Trans. Sen. Netw., vol. 2, no. 1, pp. 1–38, 2006.
• [5] B. Karp and H. T. Kung, “Greedy perimeter stateless routing (GPSR) for wireless networks”, in Proc. ACM MobiCom Conf., Boston, USA, 2000, pp. 243–254.
• [6] Y. B. Ko and N. H. Vaidya,“Location-aided routing (LAR) in mobile ad hoc networks”, in Proc. ACM MobiCom Conf., Dallas, USA, 1998, pp. 66–75.
• [7] S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward, “A distance routing effect algorithm for mobility (DREAM)”, in Proc. ACM MobiCom Conf., Dallas, USA, 1998, pp. 76–84.
• [8] C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, “Directed diffusion for wireless sensor networking”, IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 2–16, 2003.
• [9] C. E. Perkins and E. M. Royer, “Ad-hoc on-demand distance vector routing”, in Proc. 2nd IEEE Worksh. Mob. Comput. Syst. Appl., New Orleans, USA, 1999, pp. 90–100.
• [10] D. B. Johnson and D. A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks. Boston: Kluwer, 1996.
• [11] V. Park and M. S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks”, in Proc. IEEE Infocom Conf., Kobe, Japan, 1997, pp. 1405–1413.
• [12] Z. Haas and M. Pearlman, “The performance of query control schemes for the zone routing protocol”, in Proc. ACM SIGCOMM Conf., Vancouver, Canada, 1998, pp. 167–177.
• [13] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energyefficient communication protocol for wireless sensor networks”, in Proc. Hawaii Int. Conf. Syst. Sci., Hawaii, USA, 2000.
• [14] A. Manjeshwar and D. P. Agrawal, “TEEN: a protocol for enhanced efficiency in wireless sensor networks”, in Proc. 1st Int. Worksh. Paral. Distrib. Comput. Iss. Wirel. Netw. Mob. Comput., San Francisco, USA, 2001.
• [15] Z. J. Haas, J. Y. Halpern, and L. Li, “Gossip-based ad hoc routing”, IEEE/ACM Trans. Netw., vol. 14, no. 3, pp. 479–491, 2006.
• [16] M. Maróti, “Directed flood-routing framework for wireless sensor networks”, in Proc. 5th ACM/IFIP/USENIX Int. Conf. Middlew., Toronto, Canada, 2004, pp. 99–114.
• [17] L. H. Costa, M. D. De Amorim, and S. Fdida, “Reducing latency and overhead of route repair with controlled flooding”, Wirel. Netw., vol. 10, no. 4, pp. 347–358, 2004.
• [18] P. Gburzynski and W. Olesinski, “On a practical approach to lowcost ad hoc wireless networking”, J. Telecommun. Inform. Technol., no. 1, pp. 29–42, 2008.
• [19] Zigbee Alliance [Online]. Available: http://www.zigbee.org
• [20] Y. C. Tseng, S. Y. Ni, and E. Y. Shih, “Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network”, in Proc. 21st Int. Conf. Distrib. Comput. Syst., Phoenix, USA, 2001, pp. 481–488.
• [21] J. Yang, B. Kim, M.-T. Sun, and T.-H. Lai, “Location-aided broadcast in wireless ad hoc networks”, J. Inform. Sci. Eng., vol. 23, no. 3, pp. 869–884, 2007.
• [22] J. Wu, F. Dai, M. Gao, and I. Stojmenovic, “On calculating power aware connected dominating set for efficient routing in ad hoc wireless networks”, J. Commun. Netw., vol. 5, no. 2, pp. 169–178, 2002.
• [23] M. Franceschetti, L. Booth, M. Cook, R. Meester, and J. Bruck, “Percolation in multi-hop wireless networks”, in Caltech Paradise, ETR055, 2003 [Online]. Available: http://www.paradise.caltech.edu/papers/etr055.pdf
• [24] G. Grimmet, Percolation. New York: Springer, 1989.
• [25] I. Glauche, W. Krause, R. Sollacher, and M. Greiner, “Continuum percolation of wireless ad hoc communication networks”, Physica A, vol. 325, no. 3–4, pp. 577–600, 2003.
• [26] J. Jonasson, “Optimization of shape in continuum percolation”, Ann. Probab., vol. 29, no. 2, pp. 624–635, 2001.
• [27] O. Dousse, P. Mannersalo, and P. Thiran, “Latency of wireless sensor networks with uncoordinated power saving mechanisms”, in Proc. 5th ACM Int. Symp. MobiHoc’04, Tokyo, Japan, 2004, pp. 109–120.
• [28] Z. Kong and E. M. Yeh, “Distributed energy management algorithm for large-scale wireless sensor networks”, in Proc. 8th ACM Int. Symp. MobiHoc’07, Montreal, Canada, 2007, pp. 209–218.