Estimation of hop count in multi-hop wireless sensor networks with arbitrary node density

被引：5

作者：

机构：

[1] School of Information Systems and Accounting, University of Canberra, Canberra

[2] Australian National University, Canberra

来源：

Jerew, O. (oday.jerew@canberra.edu.au) | 1600年 / Inderscience Publishers, 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland卷 / 07期

关键词：

Hop count; Multi-hop communication; Node degree; Node density;

D O I：

10.1504/IJWMC.2014.062014

中图分类号：

学科分类号：

摘要：

In multi-hop wireless sensor networks, the number of hops between the source and the destination has a significant impact on network performance and has been extensively identified in the literature. However, the methods most commonly used significantly underestimate the number of hops for sparse networks. The impact of node density is significant, and this factor is not adequately addressed. In effect, many schemes to calculate hop count imply geographic routing, even if they intend to consider the shortest path routes. Therefore, we propose a new technique for estimating hop count. We consider the hop progress when the network nodes are uniformly deployed and the shortest path between the source and the destination is selected. We determine a distribution of the remaining distance to destination. In order to correctly capture the situation for a sparse network, we examine the selection of the next neighbour node as a relaying node for the next hop. The analytical model is verified by simulation. Copyright © 2014 Inderscience Enterprises Ltd.

引用

页码：207 / 216

页数：9

共 27 条

[1]

Bettstetter C., Eberspacher J., Hop distances in homogeneous ad hoc networks, Proceedings of the 57th IEEE Semi-annual Vehicular Technology Conference, 22-25 April, Jeju, South Korea, pp. 2286-2290, (2003)

[2]

Bulbul K., Ercetin O., Unluyurt T., Hop constrained energy-efficient broadcasting: Insights from massively dense ad hoc networks, IEEE Transactions on Mobile Computing, 8, 2, pp. 188-202, (2009)

[3]

Das G.K., Ghosh S.C., Nandy S.C., An efficient heuristic algorithm for 2D h-hops range assignment problem, Proceedings of the IEEE Global Telecommunications Conference, 29 November-3 December, pp. 1051-1055, (2004)

[4]

De S., Caruso A., Chaira T., Chessa S., Bounds on hop distance in greedy routing approach in wireless ad hoc networks, International Journal of Wireless and Mobile Computing, 1, 2, pp. 131-140, (2006)

[5]

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

[6]

Gandham S., Dawande M., Prakash R., Hop-constrained energy-aware routing in wireless sensor networks, Proceedings of the IEEE Global Telecommunications Conference, 28 November-2 December, St. Louis, MO, pp. 3112-3116, (2005)

[7]

Gandhi R., Mishra A., Parthasarathy S., Minimizing broadcast latency and redundancy in ad hoc networks, IEEE/ACM Transactions on Networking, 16, 4, pp. 840-851, (2008)

[8]

Gulati M.K., Kumar K., QoS routing protocols for mobile ad hoc networks: A survey, International Journal of Wireless and Mobile Computing, 5, 2, pp. 107-118, (2012)

[9]

Hou T.-C., Li V., Transmission range control in multihop packet radio networks, IEEE Transactions on Communications, 34, 1, pp. 38-44, (1986)

[10]

Jerew O., Liang W., Prolonging network lifetime through the use of mobile base station in wireless sensor networks, Proceedings of the 7th International Conference on Advances in Mobile Computing & Multimedia, 14-16 December, Kuala Lumpur, Malaysia, pp. 170-178, (2009)

← 1 2 3 →