Wireless Networks

, Volume 14, Issue 1, pp 55–70 | Cite as

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

Article

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.

Keywords

Wireless sensor networks Optimal routing Greedy forwarding policies Online optimization techniques Protocol design System analysis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.Google Scholar
  2. 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.Google Scholar
  3. 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.Google Scholar
  4. 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.CrossRefGoogle Scholar
  5. 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.CrossRefGoogle Scholar
  6. 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.Google Scholar
  7. 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.CrossRefGoogle Scholar
  8. 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).Google Scholar
  9. 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.CrossRefGoogle Scholar
  10. 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.CrossRefGoogle Scholar
  11. 11.
    M. Ilyas, The Handbook of Ad Hoc Wireless Networks. CRC Press (2002).Google Scholar
  12. 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.Google Scholar
  13. 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.Google Scholar
  14. 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. 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.Google Scholar
  16. 16.
    A.S. Tanenbaum, Computer Networks. Prentice Hall (1989).Google Scholar
  17. 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.Google Scholar
  18. 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.Google Scholar
  19. 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.Google Scholar
  20. 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).Google Scholar
  21. 21.
    R.E. Korf, “Real–time heuristic search,” Artificial Intelligence, Vol. 42 (1990) pp. 189–211.MATHCrossRefGoogle Scholar
  22. 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.Google Scholar
  23. 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.Google Scholar
  24. 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.Google Scholar
  25. 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.Google Scholar
  26. 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.Google Scholar
  27. 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.CrossRefGoogle Scholar
  28. 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.Google Scholar
  29. 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.CrossRefGoogle Scholar
  30. 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.Google Scholar
  31. 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.Google Scholar
  32. 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.Google Scholar
  33. 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.Google Scholar
  34. 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.Google Scholar
  35. 35.
    V. Chankong and Y.Y. Haimes, Multiobjective Decision Making: Theory and Metodology. New York: Elsevier Science Publishing Co. (1983).Google Scholar
  36. 36.
    V. Pareto, Cours d’Economie Politique. Lausanne, Switzerland: F. Rouge & Cie., Vol. 1 (1896).Google Scholar
  37. 37.
    D.-Z.Z. Du and P.M. Pardalos, Network Optimization Problems: Algorithms, Applications and Complexity. World Scientific Pub Co Inc. (1993).Google Scholar
  38. 38.
    S.M. Ross, Introduction to Stochastic Dynamic Programming. Academic Press (1983).Google Scholar
  39. 39.
    J. Seaborn, Hypergeometric Functions and Their Applications. New York: Springer–Verlag (1991).MATHGoogle Scholar
  40. 40.
    D.P. Bertsekas, Dynamic Programming and Optimal Control: Volume II. Athena Scientific (2001).Google Scholar
  41. 41.
    M. Shimbo and T. Ishida, “Controlling the learning process of real–time heuristic search,” Artificial Intelligence, Vol. 146 (2003) pp. 1–41.Google Scholar
  42. 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.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.Department of Information EngineeringUniversity of PadovaPadovaItaly
  2. 2.University of California San Diego (UCSD)La JollaUSA

Personalised recommendations