Skip navigation
Skip navigation

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

Jerew, Oday; Blackmore, Kim

Description

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...[Show more]

dc.contributor.authorJerew, Oday
dc.contributor.authorBlackmore, Kim
dc.date.accessioned2015-12-13T22:16:37Z
dc.identifier.issn1741-1084
dc.identifier.urihttp://hdl.handle.net/1885/70946
dc.description.abstractIn 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.
dc.publisherInderscience Publishers
dc.sourceInternational Journal of Wireless and Mobile Computing
dc.titleEstimation of hop count in multi-hop wireless sensor networks with arbitrary node density
dc.typeJournal article
local.description.notesImported from ARIES
local.identifier.citationvolume7
dc.date.issued2014
local.identifier.absfor100510 - Wireless Communications
local.identifier.absfor100503 - Computer Communications Networks
local.identifier.ariespublicationU3488905xPUB2481
local.type.statusPublished Version
local.contributor.affiliationJerew, Oday, University of Canberra
local.contributor.affiliationBlackmore, Kim, College of Asia and the Pacific, ANU
local.description.embargo2037-12-31
local.bibliographicCitation.issue3
local.bibliographicCitation.startpage207
local.bibliographicCitation.lastpage216
local.identifier.doi10.1504/IJWMC.2014.062014
local.identifier.absseo890103 - Mobile Data Networks and Services
dc.date.updated2015-12-11T07:27:43Z
local.identifier.scopusID2-s2.0-84901922411
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Jerew_Estimation_of_hop_count_in_2014.pdf151.77 kBAdobe PDF    Request a copy
02_Jerew_Estimation_of_hop_count_in_2014.pdf966.3 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator