Skip to main content
SpringerLink
Log in

Statistically assisted routing algorithms (SARA) for hop count based forwarding in wireless sensor networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

The main goal of this paper is to provide routing–table-free online algorithms for wireless sensor networks (WSNs) to select cost (e.g., node residual energies) and delay efficient paths. As basic information to drive the routing process, both node costs and hop count distances are considered. Particular emphasis is given to greedy routing schemes, due to their suitability for resource constrained and highly dynamic networks. For what concerns greedy forwarding, we present the Statistically Assisted Routing Algorithm (SARA), where forwarding decisions are driven by statistical information on the costs of the nodes within coverage and in the second order neighborhood. By analysis, we prove that an optimal online policy exists, we derive its form and we exploit it as the core of SARA. Besides greedy techniques, sub–optimal algorithms where node costs can be partially propagated through the network are also presented. These techniques are based on real time learning LRTA algorithms which, through an initial exploratory phase, converge to quasi globally optimal paths. All the proposed schemes are then compared by simulation against globally optimal solutions, discussing the involved trade–offs and possible performance gains. The results show that the exploitation of second order cost information in SARA substantially increases the goodness of the selected paths with respect to fully localized greedy routing. Finally, the path quality can be further increased by LRTA schemes, whose convergence can be considerably enhanced by properly setting real time search parameters. However, these solutions fail in highly dynamic scenarios as they are unable to adapt the search process to time varying costs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B. Karp and H.T. Kung, “GPSR: Greedy perimeter stateless routing for wireless networks,” in ACM MobiCom, Boston, Massachusetts, US (Aug. 2000) pp. 243–254.

  2. C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann and F. Silva, “Directed diffusion for wireless sensor networking,” IEEE/ACM Trans. on Networking, Vol. 1 (Feb. 2003) pp. 2–16.

  3. A. Lindgren, A. Doria and O. Schelen, “Probabilistic routing in intermittently connected networks,” ACM SIGMOBILE Mob. Comput. Commun. Rev., No. 3 (July 2003) pp. 19–20.

  4. M. Zorzi and R. R. Rao, “Geographic random forwarding (GeRaF) for ad hoc and sensor networks: multihop performance,” IEEE Trans. on Mobile Computing, Vol. 2 (Oct.-Dec. 2003) pp. 337–348.

    Article  Google Scholar 

  5. C. Schurgers, V. Tsiatsis, S. Ganeriwal and M.B. Srivastava, “Optimizing sensor networks in the energy-latency-density design space,” IEEE Trans. on Mobile Computing, Vol. 1, No. 1 (Jan.-Mar. 2002) pp. 70–80.

    Article  Google Scholar 

  6. G. Xing, C. Lu, R. Pless and Q. Huang, “On greedy geographic routing algorithms in sensing-covered networks,” in ACM MobiHoc, Roppongi Hills, Tokyo, Japan (May 2004) pp. 31–42.

  7. F. Ye, G. Zhong, S. Lu and L. Zhang, “GRAdient broadcast: a robust data delivery protocol for large scale sensor networks,” ACM Wireless Networks, Vol. 11, No. 3 (May 2005) pp. 285–298.

    Article  Google Scholar 

  8. X. Chen and A.L. Murphy, “Enabling disconnected transitive communication in mobile ad hoc networks,” in ACM Workshop on Principles of Mobile Computing (POMC), Newport, Rhode Island, US (Aug. 2001).

  9. T. Melodia, D. Pompili and I. Akyildiz, “On the interdependence of distributed topology control and geographical routing in ad hoc and sensor networks,” IEEE J. Select. Areas Commun., Vol. 23, No. 3 (Mar. 2005) pp. 520–532.

    Article  Google Scholar 

  10. A. Cerpa and D. Estrin, “ASCENT: adaptive self-configuring sensor networks topologies,” IEEE Trans. on Mobile Computing, Vol. 3, No. 3 (Jul.-Aug. 2004) pp. 272–285.

    Article  Google Scholar 

  11. M. Ilyas, The Handbook of Ad Hoc Wireless Networks. CRC Press (2002).

  12. Wei Ye, J. Heidemann and D. Estrin, “Medium access control with coordinated adaptive sleeping for wireless sensor networks,” IEEE/ACM Trans. on Networking, Vol. 12, No. 3 (June 2004) pp. 493–506.

  13. D.B. Johnson and D.A. Maltz, “Dynamic source routing in ad hoc wireless networks,” in Mobile Computing, T. Imielinsky and H. Korth, Eds. Norwell, MA: Kluwer (1996) Ch. 5, pp. 153–181.

  14. C.E. Perkins, E.M. Belding-Royer and S.R. Das, “Ad-hoc on demand distance vector routing,” IETF Mobile Ad-hoc Networks (MANET) Working Group RFC. [Online]. Available: http://www.ietf.org/rfc/rfc3561.txt

  15. 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,” in ACM MobiCom, Dallas, Texas, US (Oct. 1998) pp. 85–97.

  16. A.S. Tanenbaum, Computer Networks. Prentice Hall (1989).

  17. G. Pei, M. Gerla and T.-W.Chen, “Fisheye state routing: a routing scheme for ad hoc wireless networks,” in IEEE ICC, New Orleans, Louisiana, US (June) pp. 70–74.

  18. R. Guérin and A. Orda, “Computing shortest paths for any number of hops,” IEEE/ACM Trans. Networking, Vol. 10, No. 5 (Oct. 2002) pp. 613–620.

  19. P. Bose, P. Morin, I. Stojmenović and J. Urrutia, “Routing with guaranteed delivery in ad hoc wireless networks,” in ACM Workshop for Distributed Algorithms and Methods for Mobile Computing and Communications (DialM), Seattle, Washington, US (Aug. 1999) pp. 48–55.

  20. Y. Yu, R. Govindan and D. Estrin, “Geographical and energy aware routing: a recursive data dissemination protocol for wireless sensor networks,” in UCLA Computer Science Department Technical Report UCLA/CSD-TR-01-0023 (May 2001).

  21. R.E. Korf, “Real–time heuristic search,” Artificial Intelligence, Vol. 42 (1990) pp. 189–211.

    Article  MATH  Google Scholar 

  22. M. Rossi and M. Zorzi, “Cost efficient localized geographical forwarding strategies for wireless sensor networks,” in TIWDC 2005, Sorrento, Italy (July 2005) to be published in LNCS, Springer.

  23. K. Seada, M. Zuniga, A. Helmy and B. Krishnamachari, “Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks,” in ACM SenSys 2004, Baltimore, Maryland, US (Nov. 2004) pp. 108–121.

  24. S. Lee, B. Bhattacharjee and S. Banerjee, “Efficient geographic routing in multihop wireless networks,” in ACM MobiHoc 2005, Urbana-Champaign, Illinois, US (May 2005) pp. 230–241.

  25. L. Kleinrock and J. Silvester, “Optimum transmission radii for packet radio networks or why six is a magic number,” in IEEE National Communication Conference, Birminghan, Alabama (1978) pp. 4.3.1–4.3.5.

  26. F. Kuhn, R. Wattenhofer, Y. Zhang and A. Zollinger, “Geometric ad–hoc routing: of theory and practice,” in ACM Symposium on Principles of Distributed Computing (PODC), Zurich, Switzerland (2003) pp. 63–72.

  27. I.I. Akyildiz, D. Pompili and T. Melodia, “Underwater acoustic sensor networks: research challenges,” Elsevier Ad Hoc Networks, Vol. 3 (Mar. 2005) pp. 257–279.

    Article  Google Scholar 

  28. A. Beaufour, M. Leopold and P. Bonnet, “Smart-tag based data dissemination,” in ACM International Workshop on Wireless Sensor Networks and Applications (WSNA ’02), Atlanta, Georgia, US (Sept. 2002) pp. 68–77.

  29. H. Sabbineni and K. Chakrabarty, “Location-aided flooding: an energy-efficient data dissemination protocol for wireless sensor networks,” IEEE Trans. on Computers, Vol. 54, No. 1 (Jan. 2005) pp. 36–46.

    Article  Google Scholar 

  30. F. Ye, A. Chen, S. Lu and L. Zhang, “A scalable solution to minimum cost forwarding in large sensor networks,” in IEEE ICCCN, Scottsdale, Arizona, US (Oct. 2001) pp. 304–309.

  31. C. Schurgers and M.B. Srivastava, “Energy efficient routing in wireless sensor networks,” in IEEE MILCOM, McLean, Virginia, US (Oct. 2001) pp. 357–361.

  32. K.-H. Han, Y.-B. Ko and J.-H. Kim, “A novel gradient approach for efficient data dissemination in wireless sensor networks,” in IEEE VTC, Los Angeles, California, US (Sept. 2004) pp. 2979–2983.

  33. S. Basagni, M. Elia and R. Ghosh, “ViBES: virtual backbone for energy saving in wireless sensor networks,” in IEEE MILCOM, Monterey, California, US (Oct.-Nov. 2004) pp. 1240–1246.

  34. X. Jinghao, B. Peric and B. Vojcic, “Energy-aware and link-adaptive routing metrics for ultra wideband sensor networks,” in IEEE Networking with Ultra Wide Band and Workshop on Ultra Wide Band for Sensor Networks, Rome, Italy (July 2005) pp. 1–8.

  35. V. Chankong and Y.Y. Haimes, Multiobjective Decision Making: Theory and Metodology. New York: Elsevier Science Publishing Co. (1983).

    Google Scholar 

  36. V. Pareto, Cours d’Economie Politique. Lausanne, Switzerland: F. Rouge & Cie., Vol. 1 (1896).

  37. D.-Z.Z. Du and P.M. Pardalos, Network Optimization Problems: Algorithms, Applications and Complexity. World Scientific Pub Co Inc. (1993).

  38. S.M. Ross, Introduction to Stochastic Dynamic Programming. Academic Press (1983).

  39. J. Seaborn, Hypergeometric Functions and Their Applications. New York: Springer–Verlag (1991).

    MATH  Google Scholar 

  40. D.P. Bertsekas, Dynamic Programming and Optimal Control: Volume II. Athena Scientific (2001).

  41. M. Shimbo and T. Ishida, “Controlling the learning process of real–time heuristic search,” Artificial Intelligence, Vol. 146 (2003) pp. 1–41.

  42. B.N. Clark, C.J. Colbourn, and D.S. Johnson, “Unit disk graphs,” Discrete Mathematics, Vol. 86, No. 1-3 (Aug. 1991) pp. 165–177.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, University of Padova, via Gradenigo 6/B, 35131, Padova, Italy

    Michele Rossi & Michele Zorzi

  2. University of California San Diego (UCSD), 9500 Gilman Drive, La Jolla, CA, 92093-0436, USA

    Ramesh R. Rao

Authors
  1. Michele Rossi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michele Zorzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ramesh R. Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michele Rossi.

Additional information

Michele Rossi was born in Ferrara, Italy on October 30th, 1974. He received the Laurea degree in Electrical Engineering (with honors) and the Ph.D. degree in Information Engineering from the University of Ferrara in 2000 and 2004, respectively. Since 2000 he has been a Research Fellow at the Department of Engineering of the University of Ferrara. During 2003 he was on leave at the Center for Wireless Communications (CWC) at the University of California San Diego (UCSD), where he did research on wireless sensor networks. In November 2005 he joined the Department of Information Engineering of the University of Padova, Italy, where he is currently an Assistant Professor. Michele Rossi is currently part of the EU funded Ambient Networks and eSENSE projects. His research interests include: TCP/IP protocols over wireless networks, performance analysis of link layer retransmission techniques, routing and access selection in heterogeneous wireless networks and MAC/routing algorithms for wireless sensor networks.

Michele Zorzi was born in Venice, Italy, in 1966. He received the Laurea degree and the Ph.D. degree in Electrical Engineering from the University of Padova, Italy, in 1990 and 1994, respectively. During the Academic Year 1992/93, he was on leave at the University of California, San Diego (UCSD), attending graduate courses and doing research on multiple access in mobile radio networks. In 1993, he joined the faculty of the Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy. After spending three years with the Center for Wireless Communications at UCSD, in 1998 he joined the School of Engineering of the University of Ferrara, Italy, and in 2003 joined the Department of Information Engineering of the University of Padova, Italy, where he is currently a Professor. His present research interests include performance evaluation in mobile communications systems, random access in mobile radio networks, ad hoc and sensor networks, and energy constrained communications protocols. Dr. Zorzi from 2003 to 2005 was the Editor-In-Chief of the IEEE Wireless Communications Magazine, and currently serves on the Editorial Boards of the IEEE Transactions on Communications, the IEEE Transactions on Wireless Communications, the IEEE Transactions on Mobile Computing, the Wiley Journal of Wireless Communications and Mobile Computing and the ACM/URSI/Kluwer Journal of Wireless Networks. He was also guest editor for special issues in the IEEE Personal Communications Magazine (Energy Management in Personal Communications Systems) and the IEEE Journal on Selected Areas in Communications (Multi-media Network Radios).

Ramesh R. Rao was born in Sindri, India, where he completed his undergraduate work at the Regional Engineering College of the University of Madras in Tiruchirapalli, obtaining a BE (Honors) degree in Electronics and Communications in 1980. He completed his graduate work at the University of Maryland, College Park, Maryland where he received his M.S. and Ph.D. Professor Rao is currently a Professor at the University of California, San Diego (UCSD) at the department of Electrical and Computer Engineering in the Irwin and Joan Jacobs School of Engineering, where he has been a member of the faculty since 1984. Professor Rao is the former director of UCSD’s Center for Wireless Communications (CWC), and currently serves as the Qualcomm Endowed Chair in Telecommunications and Information Technologies, and as the Director of the San Diego Division of the California Institute of Telecommunications and Information Technology [Cal-(IT)2]. As Director of the San Diego Division of Cal-(IT)2, he leads several interdisciplinary and collaborative projects. His research interests include architectures, protocols and performance analysis of computer and communication networks, and he has published extensively on these topics. Since 1984, Professor Rao has authored over 100 technical papers, contributed book chapters, conducted a number of short courses and delivered invited talks and plenary lectures. He is currently supervising both masters and doctoral students.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rossi, M., Zorzi, M. & Rao, R.R. Statistically assisted routing algorithms (SARA) for hop count based forwarding in wireless sensor networks. Wireless Netw 14, 55–70 (2008). https://doi.org/10.1007/s11276-006-7791-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-006-7791-8

Keywords

Search

Navigation