Sciweavers

21 search results - page 3 / 5
» Preserving Area Coverage in Wireless Sensor Networks by Usin...
Sort
View
IPPS
2005
IEEE
13 years 11 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
ICPP
2009
IEEE
13 years 12 months ago
Run to Potential: Sweep Coverage in Wireless Sensor Networks
—Wireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how w...
Min Xi, Kui Wu, Yong Qi, Jizhong Zhao, Yunhao Liu,...
CN
2010
183views more  CN 2010»
13 years 5 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi
INFOCOM
2008
IEEE
13 years 11 months ago
On Maximizing the Lifetime of Delay-Sensitive Wireless Sensor Networks with Anycast
—Sleep-wake scheduling is an effective mechanism to prolong the lifetime of energy-constrained wireless sensor networks. However, it incurs an additional delay for packet deliver...
Joohwan Kim, Xiaojun Lin, Ness B. Shroff, Prasun S...
IJSNET
2008
115views more  IJSNET 2008»
13 years 5 months ago
Event-driven sensor deployment using self-organizing maps
: Coverage is an important optimization objective in pre and post-deployment stage of a Wireless Sensor Network (WSN). In this paper, we address the issue of placing a finite set o...
Cris Koutsougeras, Yi Liu, Rong Zheng