Sciweavers

1118 search results - page 26 / 224
» The coverage problem in a wireless sensor network
Sort
View
JSAC
2008
140views more  JSAC 2008»
15 years 3 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
166
Voted
INFOCOM
2008
IEEE
15 years 10 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...
118
Voted
AMAI
2008
Springer
15 years 3 months ago
A framework for multi-robot node coverage in sensor networks
Area coverage is a well-known problem in robotics. Extensive research has been conducted for the single robot coverage problem in the past decades. More recently, the research comm...
Andrea Gasparri, Bhaskar Krishnamachari, Gaurav S....
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
15 years 10 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
WCNC
2010
IEEE
15 years 7 months ago
Deploying Wireless Sensors for Differentiated Coverage and Probabilistic Connectivity
—The deployment strategy for achieving differentiated coverage and probabilistic connectivity in wireless sensor networks is studied in this paper. A novel solution based on elit...
Yanjun Li, Ye-Qiong Song, Yi-hua Zhu, René ...