Sciweavers

113 search results - page 13 / 23
» Asymptotic Coverage and Detection in Randomized Scheduling A...
Sort
View
MOBIHOC
2006
ACM
14 years 6 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu
COCOA
2008
Springer
13 years 8 months ago
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
Intrusion detection, area coverage and border surveillance are important applications of wireless sensor networks today. They can be (and are being) used to monitor large unprotec...
Binay K. Bhattacharya, B. Burmester, Yuzhuang Hu, ...
ICRA
2009
IEEE
185views Robotics» more  ICRA 2009»
14 years 1 months ago
Ad-hoc wireless network coverage with networked robots that cannot localize
— We study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless ...
Nikolaus Correll, Jonathan Bachrach, Daniel Vicker...
ICESS
2007
Springer
14 years 26 days ago
Sleep Nodes Scheduling in Cluster-Based Heterogeneous Sensor Networks Using AHP
Abstract. Wireless sensor networks (WSNs) are comprised of energy constrained nodes. This limitation has led to the crucial need for energy-aware protocols to produce an efficient ...
Xiaoling Wu, Jinsung Cho, Brian J. d'Auriol, Sungy...
AINA
2007
IEEE
14 years 1 months ago
An Adaptive Localized Algorithm for Multiple Sensor Area Coverage
— Wireless sensor networks are made up of hundreds of devices deployed over a distant or sensitive field to be monitored. Energy consumption is balanced by taking advantage of t...
Antoine Gallais, Jean Carle