Sciweavers

345 search results - page 27 / 69
» Probabilistic Coverage in Wireless Sensor Networks
Sort
View
SUTC
2006
IEEE
14 years 2 months ago
Power-aware Node Deployment in Wireless Sensor Networks
Sensor networks have attracted intensive interests due to its extendable capability. In this paper, we attempt to answer a fundamental but practical question:” how should we dep...
Yunhuai Liu, Hoilun Ngan, Lionel M. Ni
QSHINE
2009
IEEE
14 years 3 months ago
On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-Lived Sensor Networks
To achieve required sensing coverage for a very long period of time is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node rep...
Bin Tong, Zi Li, Guiling Wang, Wensheng Zhang
AHSWN
2006
148views more  AHSWN 2006»
13 years 8 months ago
Geometric Chemotaxis: A Biologically-Inspired Framework for a Class of Wireless Coverage Problems
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
Hidayet Ozgur Sanli, Rahul Simha, Bhagirath Naraha...
WOWMOM
2006
ACM
149views Multimedia» more  WOWMOM 2006»
14 years 2 months ago
On-Demand Reliable Medium Access in Sensor Networks
A wireless sensor network typically consists of a dense deployment of sensor nodes to achieve higher resolution and better network coverage. A dense network also increases the fau...
Ratnabali Biswas, Vivek Jain, Chittabrata Ghosh, D...
IPPS
2005
IEEE
14 years 2 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