Sciweavers

1118 search results - page 46 / 224
» The coverage problem in a wireless sensor network
Sort
View
110
Voted
WADS
2007
Springer
98views Algorithms» more  WADS 2007»
15 years 9 months ago
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
Senjuti Basu Roy, Gautam Das, Sajal Das
SECON
2008
IEEE
15 years 10 months ago
Coordinated Locomotion of Mobile Sensor Networks
Stationary wireless sensor networks (WSNs) fail to scale when the area to be monitored is open (i.e borderless) and the physical phenomena to be monitored may migrate through a la...
Seokhoon Yoon, Onur Soysal, Murat Demirbas, Chunmi...
126
Voted
CORR
2006
Springer
142views Education» more  CORR 2006»
15 years 3 months ago
Order-Optimal Data Aggregation in Wireless Sensor Networks - Part I: Regular Networks
The predominate traffic patterns in a wireless sensor network are many-to-one and one-to-many communication. Hence, the performance of wireless sensor networks is characterized by ...
Richard J. Barton, Rong Zheng
168
Voted
TMC
2010
138views more  TMC 2010»
15 years 1 months ago
Distributed Relay-Assignment Protocols for Coverage Expansion in Cooperative Wireless Networks
—One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implem...
Ahmed K. Sadek, Zhu Han, K. J. Ray Liu
130
Voted
IPPS
2005
IEEE
15 years 9 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu