Skip to main content
Log in

The hop count shift problem and its impacts on protocol design in wireless ad hoc networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

The hop count information has been exploited in the design of networking protocols in wireless ad hoc multi-hop networks. The hop count setup process normally assumes a perfect disk communication model and uses a simple controlled flooding approach. However, the practical communication model may not be such a disk communication model but time-varying and lossy. Sometimes transmissions can be successful beyond the nominal transmission range, i.e., the radius of such a disk model. The defacto hop count which are setup via time-varying and lossy radio channels may be different from the one based on the disk communication model. This paper introduces the hop count shift problem in realistic radio channels and investigates its impacts, via extensive simulations, on some representative hop count based protocols. Our simulation results suggest that these protocols’ performance generally suffers from the hop count shift problem, and the degradation is dependent on how the practical communication model deviates from the disk communication model. We also propose a strategy to combat the hop count shift problem and conduct simulations to show its effectiveness. The study of this paper necessitates reexaminations for the design of new hop count setup mechanism and the hop count based networking protocols.

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. Niculescu, D., & Nath, B. (2001). Ad hoc positioning system (aps). In IEEE global telecommunications conference (Globecom) (pp. 25–29).

  2. Niculescu, D., & Nath, B. (2003). Dv based positioning in ad hoc networks. Telecommunication Systems, 22(1–4), 267–280.

    Article  Google Scholar 

  3. Dulman, S., & Havinga, P. (2004). Statistically enhanced localization schemes for randomly deployed wireless sensor networks. In IEEE proceedings of the intelligent sensors, sensor networks and information processing (ISSNIP) (pp. 403–410).

  4. Wong, S. Y., Lim, J. G., Rao, S., & Seah, W. K. (2005). Density-aware hop-count localization (dhl) in wireless sensor networks with variable density. In IEEE wireless communications and networking conference (WCNC) (pp. 1848–1853).

  5. Yang, S., Yi, J., & Cha, H. (2007). Hcrl: A hop-count-ratio based localization in wireless sensor networks. In IEEE the 4th sensor, mesh and ad hoc communications and networks (SECON) (pp. 31–40).

  6. Zhao, Y., Chen, Y., Li, B., & Zhang, Q. (2007). Hop id: A virtual coordinate based routing for sparse mobile ad hoc networks. IEEE Transactions on Mobile Computing, 6(9), 1075–1089.

    Article  Google Scholar 

  7. Vural, S., & Ekici, E. (2007). Hop-distance based addressing and routing for dense sensor networks without location information. Ad Hoc Networks Journal, 5(4), 486–503.

    Article  Google Scholar 

  8. Wang, B., Fu, C., & Lim, H. B. (2009). Layered diffusion based-coverage control in wireless sensor networks. Computer Networks. doi:10.1016/j.comnet.2008.12.013.

    Google Scholar 

  9. Rappaport, T. S. (2001). Wireless communications: principles and practice (2nd edn.). New York: Prentice Hall.

    Google Scholar 

  10. Hekmat, R., & Mieghem, P. V. (2003). Degree distribution and hopcount in wireless ad-hoc networks. In IEEE the 11th international conferences on networks (ICON) (pp. 603–609).

  11. Hekmat, R., & Mieghem, P. V. (2006). Connectivity in wireless ad-hoc networks with log-normal radio model. Mobile Networks and Applications, 11(3), 351–360.

    Article  Google Scholar 

  12. Dulman, S., Rossi, M., Havinga, P., & Zorzi, M. (2006). On the hop count statistics for randomly deployed wireless sensor networks. International Journal of Sensor Networks, 1(1–2), 89–102.

    Article  Google Scholar 

  13. Vural, S., & Ekici, E. (2007). Probability distribution of multi-hop-distance in one-dimensional sensor networks. Computer Networks, 51(3), 3727–3749.

    Article  Google Scholar 

  14. Lam, L., & Suen, C. Y. (1997). Application of majority voting to pattern recognition: An analysis of its behavior and performance. IEEE Transactions on Systems, Man, and Cybernetics–Part A: Systems and Humans, 27(5), 553–568.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bang Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, B., Lim, H.B., Ma, D. et al. The hop count shift problem and its impacts on protocol design in wireless ad hoc networks. Telecommun Syst 44, 49–60 (2010). https://doi.org/10.1007/s11235-009-9221-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-009-9221-6

Navigation