Wireless Networks

, Volume 11, Issue 3, pp 285–298

GRAdient Broadcast: A Robust Data Delivery Protocol for Large Scale Sensor Networks

Article

Abstract

Although data forwarding algorithms and protocols have been among the first set of issues explored in sensor networking, how to reliably deliver sensing data through a vast field of small, vulnerable sensors remains a research challenge. In this paper we present GRAdient Broadcast (GRAB), a new set of mechanisms and protocols which is designed specifically for robust data delivery in face of unreliable nodes and fallible wireless links. Similar to previous work [12,13], GRAB builds and maintains a cost field, providing each sensor the direction to forward sensing data. Different from all the previous approaches, however, GRAB forwards data along a band of interleaved mesh from each source to the receiver. GRAB controls the width of the band by the amount of credit carried in each data message, allowing the sender to adjust the robustness of data delivery. GRAB design harnesses the advantage of large scale and relies on the collective efforts of multiple nodes to deliver data, without dependency on any individual ones. We have evaluated the GRAB performance through both analysis and extensive simulation. Our analysis shows quantitatively the advantage of interleaved mesh over multiple parallel paths. Our simulation further confirms the analysis results and shows that GRAB can successfully deliver over 90% of packets with relatively low energy cost, even under the adverse conditions of 30% node failures compounded with 15% link message losses.

Keywords

sensor networks robust data delivery 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. Chen and K. Nahrstedt, Distributed quality-of-service routing in ad-Hoc networks. IEEE Journal of Selected Areas in Communications 17(8) 1999.Google Scholar
  2. [2]
    C.-C. Chiang, M. Gerla and L. Zhang, Forwarding group multicast protocol (FGMP) for multihop, mobile wireless networks, Cluster Computing 1(2) (1998) 187–196.CrossRefGoogle Scholar
  3. [3]
    B. Deb, S. Bhatnagar and B. Nath, ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks, in: 28th Annual IEEE Conference on Local Computer Networks (2003).Google Scholar
  4. [4]
    D. Ganesan, R. Govindan, S. Shenker and D. Estrin, Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks. ACM Mobile Computing and Communications Review 5(4) (2001).Google Scholar
  5. [5]
    J.J. Garcia-Luna-Aceves and E.L. Madruga, A multicast routing protocol for ad-hoc networks, in: INFOCOM (2) (1999), pp. 784–792.Google Scholar
  6. [6]
    J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler and K. Pister. System Architecture Directions for Networked Sensors, in: International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IX) (2000).Google Scholar
  7. [7]
    C. Intanagonwiwat, R. Govindan and D. Estrin, Directed diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks, in: ACM International Conference on Mobile Computing and Networking (MOBICOM’00) (2000).Google Scholar
  8. [8]
    D.B. Johnson and D.A. Maltz, Dynamic Source Routing in Ad-hoc Wireless Networks. Mobile Computing, (Kluwer Academic Publishers, 1996).Google Scholar
  9. [9]
    B. Karp and H. Kung, GPSR: Greedy Perimeter Stateless Routing for Wireless Networks, in: ACM International Conference on Mobile Computing and Networking (MOBICOM’00) (2000).Google Scholar
  10. [10]
    U. Parallel Computing Laboratory, Computer Science Department. Parsec. http://pcl.cs.ucla.edu/projects/parsec/.
  11. [11]
    C. Perkins, Ad-hoc On demand Distance Vector Routing (AODV), Internet-Draft, (Nov. 1997).Google Scholar
  12. [12]
    R. Poor, Gradient Routing in Ad Hoc Networks, http://www.media.mit.edu/pia/Research/ESP/texts/poorieeepaper.pdf.
  13. [13]
    R.C. Shah and J. Rabaey, Energy Aware Routing for Low Energy Ad Hoc Sensor Networks, in: WCNC (2002).Google Scholar
  14. [14]
    P.F. Tsuchiya, The landmark hierarchy: A new hierarchy for routing in very large networks, Computer Communication Review 18(4) (1988).Google Scholar
  15. [15]
    F. Ye, A. Chen, S. Lu and L. Zhang, A Scalable Solution to Minimum Cost Forwarding in Large Scale Sensor Networks, in: The Tenth International Conference on Computer Communications and Networks (2001).Google Scholar
  16. [16]
    F. Ye, S. Lu and L. Zhang, GRAdient broadcast: A Robust, Long-lived Large Sensor Network (2001) http://irl.cs.ucla.edu/papers/grab-tech-report.ps.
  17. [17]
    F. Ye, H. Luo, J. Cheng, S. Lu and L. Zhang, A two-tier data dissemination model for large-scale wireless sensor networks. In ACM International Conference on Mobile Computing and Networking (MOBICOM’02) (2002).Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.Computer Science DepartmentUniversity of CaliforniaLos Angeles

Personalised recommendations