Skip to main content
Log in

Cognitive and self-selective routing for sensor networks

  • Original Paper
  • Published:
Computational Management Science Aims and scope Submit manuscript

Abstract

New approaches to Quality-of-Service (QoS) routing in wireless sensor networks which use different forms of learning are the subject of this paper. The Cognitive Packet Network (CPN) algorithm uses smart packets for path discovery, together with reinforcement learning and neural networks, while Self-Selective Routing (SSR) is based on the “Ant Colony” paradigm which emulates the pheromone-based technique which ants use to mark paths and communicate information about paths between different insects of the same colony (Koenig et al. in Ann Math Artif Intell 31(1–4): 41–76, 2001). In this paper, we present first experimental results on a network test-bed to evaluate CPN’s ability to discover paths having the shortest delay, or shortest length. Then, we present small test-bed experiments and large-scale network simulations to evaluate the effectiveness of the SSR algorithm. Finally, the two approaches are compared with respect to their ability to adapt as network conditions change over time.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Babbitt TA, Morrell C, Szymanski BK, Branch JW (2008) Self-selecting reliable paths for wireless sensor network routing. Comput Commun, vol 20 (in print)

  • Chen G, Branch J, Pflug M, Zhu L, Szymanski BK (2004) Sense: a wireless sensor network simulator. Advances in pervasive computing and networking. Springer, New York, pp249–267

  • Chen G, Branch J, Szymanski BK (2005) Local leader election, signal strength aware flooding, and routeless routing. In: 5th IEEE Intern. Workshop Algorithms for Wireless, Mobile, Ad Hoc Networks and Sensor Networks, WMAN05

  • Chen G, Branch J, Szymanski BK (2006) A self-selection technique for flooding and routing in wireless ad-hoc networks. J Netw Syst Manage 14(3): 359–380

    Article  Google Scholar 

  • Chen S, Nahrstedt K (1998) An overview of quality-of-service routing for the next generation high-speed networks: problems and solutions. IEEE Netw Mag Special Issue Transm Distrib Digital Video 12(6): 64–79

    Google Scholar 

  • Gelenbe E (1993) Learning in the recurrent random neural network. Neural Comput 5(1): 154–164

    Article  Google Scholar 

  • Gelenbe E, Gellman M, Lent R, Liu P, Su P (2004) Autonomous smart routing for network QoS. In: Proceedings of the first international conference on autonomic computing, pp 232–239

  • Gelenbe E, Lent R (2004) Power aware ad hoc cognitive packet networks. Ad Hoc Netw 2: 205–216

    Article  Google Scholar 

  • Gelenbe E, Lent R, Xu Z (2001) Measurement and performance of a cognitive packet network. Comput Netw (Amsterdam, Netherlands: 1999) 37(6): 691–701

    Google Scholar 

  • Halici U (2000) Reinforcement learning with internal expectation for the random neural network. Eur J Oper Res 126(2): 288–307

    Article  Google Scholar 

  • Koenig S, Szymanski BK, Liu Y (2001) Efficient and inefficient ant coverage methods. Ann Math Artif Intell 31(1-4): 41–76

    Article  Google Scholar 

  • Kowalik K, Collier M (2003) Should QoS routing algorithms prefer shortest paths? In: Proceedings of the IEEE international conference on communications, pp 213–217

  • Malkin G (1998) RIP Version 2. RFC 2453, November

  • Moy J (1998) OSPF Version 2. RFC 2328, April

  • Perkins C, Belding-Royer E, Das S (2003) Ad hoc on-demand distance vector (AODV) routing. RFC 3561, July

  • Rappaport TS (1992) Wireless communications: principles and practice. Prentice Hall, Englewood Cliffs

    Google Scholar 

  • Szymanski BK, Chen GG (2008) Computing with time: from neural networks to sensor networks. Comput J 51(4): 511–522

    Article  Google Scholar 

  • Wasilewski K, Branch J, Lisee M, Szymanski BK (2007) Self-healing routing: a study in efficiency and resiliency of data delivery in wireless sensor networks. In: Proceedings of the unattended ground, sea, and air sensor technologies and applications IX, Orlando, FL, pp 9–13

  • Williams D, Apostolopoulos G (1999) QoS routing mechanisms and OSPF extensions. RFC 2676, August

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Boleslaw K. Szymanski.

Additional information

Research was sponsored by US Army Research Laboratory and the UK Ministry of Defence and was accomplished under Agreement Number W911NF-06-3-0001. The collaboration was also supported by the NSF Grant OISE-0334667. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the US Army Research Laboratory, the U.S. Government, the UK Ministry of Defence, or the UK Government. The US and UK Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gelenbe, E., Liu, P., Szymanski, B.K. et al. Cognitive and self-selective routing for sensor networks. Comput Manag Sci 8, 237–258 (2011). https://doi.org/10.1007/s10287-009-0102-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10287-009-0102-y

Keywords

Navigation