Reliable and Efficient Information Forwarding and Traffic Engineering in Wireless Sensor Networks

  • Fernand S. Cohen
  • Joshua Goldberg
  • Jaudelice C. de Oliveira
Part of the Signals and Communication Technology book series (SCT)

Sensor nodes often transmit via a wireless medium in which the power required to send data is proportional to the square of the distance between the source and the destination. This problem is compounded by the fact that the sink (node which collects the sensed data) can be far removed from any given node. In many situations, it is likely that most nodes will not be able to have a direct connection with the sink. In order to address these issues, a multi-hop distributed routing protocol needs to be implemented to relay the information in a quick and power effecient manner.

In this chapter, routing protocols for sensor networks are surveyed, with an emphasis on trajectory-centric routing mechanisms. Existing routing protocols are classiffed and their advantage and disadvantages are compared. Design trade-offs between constrained and unconstrained routing with regards to effeciency, speed of routing, and computational complexity are discussed. Finally, a new trajectory-centric routing mechanism, called Traffic Engineering Routing (TE-Routing or TER), is described and analyzed. With the objective of securely forwarding data in a sensor network, in TE-Routing, a preferred trajectory is traced a priori. This is particularly needed in problems where obstacle avoidance is necessary. In these scenarios, the network needs to be supplied with a trajectory that would serve as a “nominal” trajectory that the routing protocol will try to adhere to, taking into account its own constraints, such as node power depletion. The use of a computer aided design (CAD) tool is proposed to allow an expert to enter a set of ordered coordinate points and have the CAD design come up with a compact description of the “nominal” trajectory, adapting it to the given constraints. Simulation results are discussed and a comparison with existing mechanisms is also given.


Sensor Network Sensor Node Wireless Sensor Network Destination Node Destination Sequence Distance Vector 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Braginsky and D. Estrin, “Rumor Routing Algorithm for Sensor Networks,” in the Proceedings of the First Workshop on Sensor Networks and Applications (WSNA), Atlanta, GA, October 2002.Google Scholar
  2. 2.
    M. Chu, H. Haussecker, and F. Zhao, “Scalable Information-Driven Sensor Query-ing and Routing for ad hoc Heterogeneous Sensor Networks,” The International Journal of High Performance Computing Applications, Vol. 16, No. 3, August 2002.Google Scholar
  3. 3.
    F. S. Cohen, Z. Yang, Z. Huang, and Y. Nissanov,“Computer Matching of His-tological Rat Brain Sections,” IEEE Trans. on Biomedical Engineering, Vol. 45, No. 5, pp. 642-649, May 1998.CrossRefGoogle Scholar
  4. 4.
    M. Handy, M. Haase and D. Timmermann. “Low-Energy Adaptive Clustering Hierarchy With Deterministic Clusterhead Selection,” in the Proceedings of IEEE Int. Conference on Mobile and Wireless Communications Networks, Stockholm, September 2002.Google Scholar
  5. 5.
    W. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive Protocols for Informa-tion Dissemination in Wireless Sensor Networks,” in the Proceedings of the 5th ACM/IEEE Mobicom Conference (MobiCom ’99), Seattle, WA, August, 1999.Google Scholar
  6. 6.
    Z. Huang and F. S. Cohen, “Affine-Invariant Moments and B-Splines for Object Recognition from Image Curves,” IEEE Trans. on Image Processing, Vol. 5, No. 10, pp. 1473-1480, October 1996.CrossRefGoogle Scholar
  7. 7.
    C. Intanagonwiwat, R. Govindan and D. Estrin, “Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks,” In the Proceedings of the Sixth Annual International Conference on Mobile Computing and Networks (MobiCOM 2000), Boston, Massachusetts, August 2000.Google Scholar
  8. 8.
    B. Karp and H. T. Kung, “GPSR: greedy perimeter stateless routing for wireless networks,” in the Proceedings of ACM MOBICOM 2000, pp. 243-254.Google Scholar
  9. 9.
    J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris, “A Scalable Location Service for Geographic Ad Hoc Routing,” in the Proceedings of IEEE/ACM Mobicom 2000, pp. 120-30.Google Scholar
  10. 10.
    L. Li and J. Y Halpern, “Minimum energy mobile wireless networks revisited,” in the Proceedings of IEEE International Conference on Communications (ICC01), Helsinki, Finland, June 2001.Google Scholar
  11. 11.
    S. Lindsey and C. S. Raghavendra, “PEGASIS: Power Efficient Gathering in Sensor Information Systems,” in the Proceedings of the IEEE Aerospace Confer-ence, Big Sky, Montana, March 2002.Google Scholar
  12. 12.
    A. Manjeshwar and D. P. Agrawal, “TEEN: A Protocol for Enhanced Efficiency in Wireless Sensor Networks,” in the Proceedings of the 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing, San Francisco, CA, April 2001.Google Scholar
  13. 13.
    A. Manjeshwar and D. P. Agrawal, “APTEEN: A Hybrid Protocol for Efficient Routing and Comprehensive Information Retrieval in Wireless Sensor Networks, in the Proceedings of the 2nd International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile computing, Ft. Lauderdale, FL, April 2002.Google Scholar
  14. 14.
    B. Nath and D. Niculescu, “Routing on a Curve,” in Proceedings of ACM HOTNETS-I 2002 and SIGCOMM Computer Communication Review, January 2003.Google Scholar
  15. 15.
    D. Niculescu and B. Nath, “Localized positioning in ad hoc networks,” in Pro-ceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, Anchorage, AK, USA, May 2003.Google Scholar
  16. 16.
    D. Niculescu and B. Nath, “Trajectory Based Forwarding and Its Applications,” in Proceedings of ACM MOBICOM 2003, San Diego, CA, USA, September 2003.Google Scholar
  17. 17.
    C. Perkins and P. Bhagwat. “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” in Proceedings of the ACM SIGCOMM, October 1994.Google Scholar
  18. 18.
    C. Perkins. “Ad Hoc On Demand Distance Vector (AODV) Routing,” IETF, Internet Draft, draft-ietf-manet-aodv-00.txt, November 1997.Google Scholar
  19. 19.
    W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-Efficient Communication Protocol for Wireless Microsensor Networks,” in the Proceedings of HICSS 2000.Google Scholar
  20. 20.
    V. Rodoplu and T.H. Ming, “Minimum energy mobile wireless networks,” IEEE Journal of Selected Areas in Communications, Vol. 17, No. 8, pp. 1333-1344, 1999.CrossRefGoogle Scholar
  21. 21.
    N. Sadagopan, B. Krishnamachari, A. Helmy, “The ACQUIRE Mechanism for Efficient Querying in Sensor Networks,” First IEEE International Workshop on Sensor Network Protocols and Applications (SNPA), in conjunction with IEEE ICC 2003, May 2003, Anchorage, AK, USA.Google Scholar
  22. 22.
    C. Schurgers and M.B. Srivastava, “Energy efficient routing in wireless sensor networks,” in the MILCOM Proceedings on Communications for Network-Centric Operations: Creating the Information Force, McLean, VA, 2001.Google Scholar
  23. 23.
    R. Shah and J. Rabaey, “Energy Aware Routing for Low Energy Ad Hoc Sen-sor Networks,” in the Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), Orlando, FL, March 2002.Google Scholar
  24. 24.
    O. J. A. Smith, “Ray-Tracing With Affine Transforms,” MathVISION Inc, June 1995.Google Scholar
  25. 25.
    L. Subramanian and R. H. Katz, “An Architecture for Building Self Config-urable Systems,” in the Proceedings of IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing, Boston, MA, August 2000.Google Scholar
  26. 26.
    Les Piegl, Wayne Tiller, “The NURBS Book Monographs in Visual Communi-cation,” Berlin: Springer, 1997.Google Scholar
  27. 27.
    B. Krishnamachari, D. Estrin, and S. Wicker, “Modelling Data-Centric Routing in Wireless Sensor Networks,” in the Proceedings of IEEE INFOCOM, New York, NY, USA, 2002.Google Scholar
  28. 28.
    Y. Yao and J. Gehrke, “The cougar approach to in-network query processing in sensor networks,” in SIGMOD Record, September 2002.Google Scholar
  29. 29.
    M. Younis, M. Youssef and K. Arisha, “Energy-Aware Routing in Cluster-Based Sensor Networks,” in the Proceedings of the 10th IEEE/ACM International Sym-posium on Modeling, Analysis and Simulation of Computer and Telecommunica-tion Systems (MASCOTS2002), Fort Worth, TX, October 2002.Google Scholar
  30. 30.
    Y. Yu, D. Estrin, and R. Govindan, “Geographical and Energy-Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks,” UCLA Computer Science Department Technical Report, UCLA-CSD TR-01-0023, May 2001.Google Scholar
  31. 31.
    M. Yuksel, R. Pradhan and S. Kalyanaraman, “An Implementation Framework for Trajectory-Based Forwarding in Ad Hoc Networks,” in the Proceedings of Wireless Networking Symposium part of IEEE International Conference on Com-munications (ICC), Paris, France, June, 2004.Google Scholar
  32. 32.
    Y. Xu, J. Heidemann, and D. Estrin, “Geography-informed energy conservation for ad hoc routing,” in the Proceedings of the 7th Annual ACM/IEEE Interna-tional Conference on Mobile Computing and Networking (MobiCom01), Rome, Italy, July 2001.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Fernand S. Cohen
    • 1
  • Joshua Goldberg
    • 1
  • Jaudelice C. de Oliveira
    • 1
  1. 1.Department of Electrical and Computer EngineeringDrexel UniversityPhiladelphiaUSA

Personalised recommendations