On the Network Coverage Intensity in the Presence of Clock Asynchrony

Authors:
Saralees Nadarajah
Affiliations:
University of Manchester, Manchester, UK M13 9PL
Venue:
Wireless Personal Communications: An International Journal
Year:
2011

Citing 9
Cited 0

Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Nonmyopic sensor scheduling and its efficient implementation for target tracking applications

EURASIP Journal on Applied Signal Processing
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks

Computer Communications
Analyzing object detection quality under probabilistic coverage in sensor networks

IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Algorithms for optimal scheduling and management of hidden Markovmodel sensors

IEEE Transactions on Signal Processing
Optimal sensor scheduling for resource-constrained localization of mobile robot formations

IEEE Transactions on Robotics
Sensor scheduling in mobile robots using incomplete information via Min-Conflict with Happiness

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Brief Sensor scheduling in continuous time

Automatica (Journal of IFAC)
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

An exact and explicit expression is derived for the network coverage intensity in the presence of clock asynchrony. The expression involves the well known Lauricella function of type A. Its accuracy is compared with the most recently known bound/approximation for the network coverage intensity. A new better approximation for the network coverage intensity is also proposed.