Computational Management Science

, Volume 8, Issue 3, pp 237–258 | Cite as

Cognitive and self-selective routing for sensor networks

  • Erol Gelenbe
  • Peixiang Liu
  • Boleslaw K. SzymanskiEmail author
  • Christopher Morrell
Original Paper


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.


Sensor Network Wireless Sensor Network Data Packet Packet Loss Rate Output Link 
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. Babbitt TA, Morrell C, Szymanski BK, Branch JW (2008) Self-selecting reliable paths for wireless sensor network routing. Comput Commun, vol 20 (in print)Google Scholar
  2. 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–267Google Scholar
  3. 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, WMAN05Google Scholar
  4. 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–380CrossRefGoogle Scholar
  5. 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–79Google Scholar
  6. Gelenbe E (1993) Learning in the recurrent random neural network. Neural Comput 5(1): 154–164CrossRefGoogle Scholar
  7. 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–239Google Scholar
  8. Gelenbe E, Lent R (2004) Power aware ad hoc cognitive packet networks. Ad Hoc Netw 2: 205–216CrossRefGoogle Scholar
  9. Gelenbe E, Lent R, Xu Z (2001) Measurement and performance of a cognitive packet network. Comput Netw (Amsterdam, Netherlands: 1999) 37(6): 691–701Google Scholar
  10. Halici U (2000) Reinforcement learning with internal expectation for the random neural network. Eur J Oper Res 126(2): 288–307CrossRefGoogle Scholar
  11. Koenig S, Szymanski BK, Liu Y (2001) Efficient and inefficient ant coverage methods. Ann Math Artif Intell 31(1-4): 41–76CrossRefGoogle Scholar
  12. Kowalik K, Collier M (2003) Should QoS routing algorithms prefer shortest paths? In: Proceedings of the IEEE international conference on communications, pp 213–217Google Scholar
  13. Malkin G (1998) RIP Version 2. RFC 2453, NovemberGoogle Scholar
  14. Moy J (1998) OSPF Version 2. RFC 2328, AprilGoogle Scholar
  15. Perkins C, Belding-Royer E, Das S (2003) Ad hoc on-demand distance vector (AODV) routing. RFC 3561, JulyGoogle Scholar
  16. Rappaport TS (1992) Wireless communications: principles and practice. Prentice Hall, Englewood CliffsGoogle Scholar
  17. Szymanski BK, Chen GG (2008) Computing with time: from neural networks to sensor networks. Comput J 51(4): 511–522CrossRefGoogle Scholar
  18. 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–13Google Scholar
  19. Williams D, Apostolopoulos G (1999) QoS routing mechanisms and OSPF extensions. RFC 2676, AugustGoogle Scholar

Copyright information

© US Government 2009

Authors and Affiliations

  • Erol Gelenbe
    • 1
  • Peixiang Liu
    • 2
  • Boleslaw K. Szymanski
    • 3
    Email author
  • Christopher Morrell
    • 3
  1. 1.Imperial CollegeLondonUK
  2. 2.Nova Southeastern UniversityFort LauderdaleUSA
  3. 3.Rensselaer Polytechnic InstituteTroyUSA

Personalised recommendations