Skip to main content
Log in

A Small-World Routing Protocol and the Effect of Pass-Over for Wireless Sensor Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

One of the fundamental issues of wireless sensor networks is that an event can be detected by some sensor nodes and delivered to the query devices. This kind of queries and events can be happening anytime and anywhere. Due to the battery constrained nature of sensor nodes, it is important to design routing protocols that are efficient and power saving. In this work, we propose a new routing protocol, the small-world routing protocol (SWRP), which is at the same time a generalization of both flooding and rumor routing and can be operating in between both extremes. With the idea originating from the small-world theory, the proposed protocol finds paths between the queries and events through recurrent propagations of strong and weak links. The operation of the protocol is simple, flexible and requires not much computational power. The SWRP may also minimize the pass-over problem, which occurs when a query agent passes over an event agent even though the two lines cross each other and thus prevents a query from finding the event. It has been shown that by increasing the number of strong links of the SWRP within a controlled area, we may be able to reduce the occurrences of pass-over. Accordingly, the proposed SWRP may achieve much better successful rate in routing as well as cut the number of hop-count at the same time. In particular, our simulation results show that with approximately the same routing overhead (in term of number of routing messages), our protocol may achieve up to 22% more in success rate and 10-hop less in average path length. To reach a 100% successful routing rate, our protocol may save up to 41.2% additional routing overhead as compared to the rumor routing. Most important of all, the SWRP makes the improvements without sacrificing the power consumption of each individual sensor node as the average inter-hop distance for discovered routing paths does not increase as a result of shorter path length.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akyildiz F., Su W., Sankarasubramaniam Y., Cayirci E. (2002) A survey on sensor networks. IEEE Communications Magazine 40: 102–114

    Article  Google Scholar 

  2. Akyildiz F., Su W., Sankarasubramaniam Y., Cayirci E. (2002) Wireless sensor networks: A survey. Computer Networks 38: 393–422

    Article  Google Scholar 

  3. Schurgers, C., & Srivastava, M. B. (2001). Energy efficient routing in wireless sensor networks. In IEEE military communications conference (pp. 357–361).

  4. Al-Karaki, J. N., & Kamal, A. E. (2004). Routing techniques in wireless sensor networks: A survey. IEEE Wireless Communications, pp. 6–28.

  5. Butler Z., Rus D. (2004) Controlling mobile sensor for monitoring events with coverage constraints. IEEE International Conference on Robotics and Automation 2: 1568–1573

    Google Scholar 

  6. Heinzelman, W., Chandrakasan, A., & Balakrishnan, H. (2000). Energy efficient communication protocols for wireless microsensor networks. In Proceedings of Hawaiian, international conference on systems science (pp. 3005–3014).

  7. Korteweg, P., Marchetti-Spaccamela, A., Stougie, L., & Vitaletti, A. (2007). Data aggregation in sensor networks: Balancing communication and delay costs. In Lecture notes in computer science, Springer, Berlin/Heidelberg (vol. 4474, pp. 139–150).

  8. Braginsky, D., & Estrin, D. (2002). Rumor routing algorithm for sensor networks. In Proceedings of first ACM workshop on sensor networks and applications, Atlanta, GA, USA (pp. 22–31).

  9. Papadimitratos, P., Haas, Z. J., & Gün Sirer, E. (2002). Path set selection in mobile ad hoc networks. In Proceedings of the 3rd ACM international symposium on mobile ad hoc networking & computing (pp. 1–11).

  10. Rahebi S., Asadi M. (2009) WBRR: A weight based reliable routing method in mobile ad hoc network. Australian Journal of Basic and Applied Sciences 3(3): 1888–1897

    Google Scholar 

  11. Shokrzadeh, H., Haghighat, A. T., Tashtarian, F., & Nayebi, A. (2007). Directional rumor routing in wireless sensor networks. In The 3rd IEEE/IFIP international conference in Central Asia on internet (pp. 1–5).

  12. Yu, C. W., Wu, T.-K., Chen, R.-H., & Jin, F.-W. (2008). A small-world routing protocol for wireless sensor networks. In Proceedings of the 4th IEEE international conference on wireless communications, networking & mobile computing (pp. 1–4).

  13. Karp, B. & Kung, H. T. (2000). GPSR: greedy perimeter stateless routing for wireless networks. In Proceedings of the ACM/IEEE international conference on mobile computing and networking, Boston, Mass., USA (pp. 243–254).

  14. Banka T., Tandon G., Jayasumana A. P. (2005) Zonal rumor routing for wireless sensor networks. International Conference on Information Technology: Coding and Computing 2: 562–567

    Google Scholar 

  15. Chou, C.-F., Su, J.-J., & Chen, C.-Y. (2005). Straight line routing for wireless sensor networks. In 10th IEEE symposium on computers and communications (pp. 110–115).

  16. Chim, T. W. (2005). Along & across algorithm for routing events and queries in wireless sensor networks. In Proceedings of 2005 international symposium on intelligent signal processing and communication systems (pp. 725–728).

  17. Rezaei B. A., Sarshar N., Roychowdhury V. P. (2004) Random walks in dynamic small-world space: Robust routing in large-scale sensor networks. Vehicular Technology Conference 7: 4640–4644

    Google Scholar 

  18. Watts D., Strogatz S. (1998) Collective dynamics of ‘small world’ networks. Nature 393: 440–442

    Article  Google Scholar 

  19. Watts D. J. (2003) Six degrees: The science of connected age. Norton, New York

    Google Scholar 

  20. Aldous D. (1991) Meeting times for independent Markov chains. Stochastic Processes and Their Applications 38: 185–193

    Article  MathSciNet  MATH  Google Scholar 

  21. Tetali, P., & Winkler, P. (1991). On a random walk problem arising in self-stabilizing token management. In The tenth annual ACM symposium on principles of distributed computing (pp. 273–280).

  22. Coppersmith, D., Tetali, P., & Winkler, P. (1992). Collisions among random walks (manuscript).

  23. Bshouty M. H., Higham L., Warpechowska-Gruca J. (1999) Meeting times of random walks on graphs. Information Processing Letters 69(5): 259–265

    Article  MathSciNet  Google Scholar 

  24. Bettstetter, C. (2002). On the minimum node degree and connectivity of a wireless multi-hop network, MobiHoc, pp. 80–91.

  25. Hall P. (1988) Introduction to the theory of coverage process. Wiley, New York

    Google Scholar 

  26. Penrose M. D. (2003) Random geometric graphs. Oxford University Press, Oxford

    Book  MATH  Google Scholar 

  27. Cheng R. H., Wu T.-K., Yu C. W. (2010) A highly topology adaptable ad hoc routing protocol with complementary preemptive link breaking avoidance and path shortening mechanisms. Wireless Networks 16(5): 1289–1311

    Article  Google Scholar 

  28. Yen, L. -H. & Yu, C. W. (2004). Link probability, network coverage, and related properties of wireless ad hoc networks. In The 1st IEEE international conference on mobile ad-hoc and sensor systems (pp. 525–527).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tung-Kuang Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheng, RH., Yu, C.W., Wu, TK. et al. A Small-World Routing Protocol and the Effect of Pass-Over for Wireless Sensor Networks. Wireless Pers Commun 68, 1493–1523 (2013). https://doi.org/10.1007/s11277-012-0536-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-012-0536-3

Keywords

Navigation