Sciweavers

123 search results - page 4 / 25
» Expected k-coverage in wireless sensor networks
Sort
View
INFOCOM
2010
IEEE
14 years 8 months ago
Understanding Node Localizability of Wireless Ad-hoc Networks
— Location awareness is highly critical for wireless ad-hoc and sensor networks. Many efforts have been made to solve the problem of whether or not a network can be localized. Ne...
Zheng Yang, Yunhao Liu
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
14 years 7 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras
TSP
2010
14 years 4 months ago
Distributed estimation of channel gains in wireless sensor networks
We consider the problem of distributed channel estimation in a sensor network which employs a random sleep strategy to conserve energy. If the N network nodes are randomly placed a...
Sivagnanasundaram Ramanan, John MacLaren Walsh
ADHOCNOW
2004
Springer
15 years 3 months ago
Connectivity of Wireless Sensor Networks with Constant Density
We consider a wireless sensor network in which each sensor is able to transmit within a disk of radius one. We show with elementary techniques that there exists a constant c such t...
Sarah Carruthers, Valerie King
TPDS
2010
222views more  TPDS 2010»
14 years 8 months ago
Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks
—Geographic routing is an attractive localized routing scheme for wireless sensor networks (WSNs) due to its desirable scalability and efficiency. Maintaining neighborhood inform...
Haibo Zhang, Hong Shen