Maximum interference of random sensors on a line

DOI10.1007/978-3-642-13284-1_16MaRDI QIDQ3569126zbMATH OpenOpenAlexFDO

Authors Ladislav Stacho, Evangelos Kranakis, D. Krizanc, Lata Narayanan

Publication date 17 June 2010

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1007.2120

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Abstract: Consider $n$ sensors whose positions are represented by $n$ uniform, independent and identically distributed random variables assuming values in the open unit interval $(0,1)$. A natural way to guarantee connectivity in the resulting sensor network is to assign to each sensor as its range, the maximum of the two possible distances to its two neighbors. The interference at a given sensor is defined as the number of sensors that have this sensor within their range. In this paper we prove that the expected maximum interference of the sensors is $Theta(sqrtlnn)$.

Recommendations

• Displacing random sensors to avoid interference
• A note on interference in random networks
• On interference among moving sensors and related problems
• Sensor allocation problems on the real line

Cited in

(7)

• A note on interference in random networks
• On the moment absolute deviation of order statistics from uniform distribution
• Sensor allocation problems on the real line
• Displacing random sensors to avoid interference
• On interference among moving sensors and related problems
• How many wireless sensors are needed to guarantee connectivity of a one-dimensional network with random inter-node spacing?
• On interference among moving sensors and related problems

This page was built for publication: Maximum interference of random sensors on a line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569126)