Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Evaluation of the Probability of K-hop Connection in Homogeneous Wireless Sensor Networks

Simple item page
dc.contributor.authorTa, Xiaoyuan
dc.contributor.authorMao, Guoqiang
dc.contributor.authorAnderson, Brian
dc.coverage.spatialWashington USA
dc.date.accessioned2015-12-08T22:10:38Z
dc.date.createdNovember 26-30 2007
dc.date.issued2007
dc.date.updated2015-12-08T07:33:59Z
dc.description.abstractGiven a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density p and each sensor has a uniform transmission radius of ro, we investigate the probability that two random sensors separated by a known distance x are fe-hop neighbors for some positive integer k in this paper. We give a closed-form equation for computing this probability for k = 2; and also give a recursive equation for evaluating this probability for k > 2 by using some approximations. The accuracy of the approximate analytical solution is validated by simulations. Furthermore, we present an empirical method to correct the discrepancies between the analytical results and the simulation results caused by the approximation. The result of this paper can be useful in a number of sensor network problems, e.g., estimating the transmission delay between two sensors and energy consumed in the transmission, and WSN routing problems.
dc.identifier.urihttp://hdl.handle.net/1885/29427
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE Inc)
dc.relation.ispartofseriesIEEE Global Communications Conference, Exhibition & Industry Forum (Globecom 2007)
dc.sourceProceedings of IEEE Global Communications Conference, Exhibition & Industry Forum (Globecom 2007)
dc.subjectKeywords: Sensor network problems; Uniform transmission radius; Approximation theory; Data communication systems; Distributed computer systems; Poisson distribution; Probability; Wireless sensor networks
dc.titleEvaluation of the Probability of K-hop Connection in Homogeneous Wireless Sensor Networks
dc.typeConference paper
local.bibliographicCitation.startpage6
local.contributor.affiliationTa, Xiaoyuan, University of Sydney
local.contributor.affiliationMao, Guoqiang , University of Sydney
local.contributor.affiliationAnderson, Brian, College of Engineering and Computer Science, ANU
local.contributor.authoruidAnderson, Brian, u8104642
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor090609 - Signal Processing
local.identifier.ariespublicationu4334215xPUB65
local.identifier.doi10.1109/GLOCOM.2007.246
local.identifier.scopusID2-s2.0-39349114210
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Ta_Evaluation_of_the_Probability_2007.pdf
Size:
246.88 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS