Sciweavers

1280 search results - page 9 / 256
» A Probabilistic Coverage Protocol for Wireless Sensor Networ...
Sort
View
IPPS
2005
IEEE
14 years 18 days 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
DCOSS
2006
Springer
13 years 10 months ago
Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
Wei Mo, Daji Qiao, Zhengdao Wang
NETCOOP
2009
Springer
14 years 1 months ago
Probabilistic Analysis of Hierarchical Cluster Protocols for Wireless Sensor Networks
Wireless sensor networks are designed to extract data from the deployment environment and combine sensing, data processing and wireless communication to provide useful information ...
Ingemar Kaj
INTERSENSE
2006
ACM
14 years 29 days ago
Location-free fault repair in hybrid sensor networks
— In this paper, we consider the sensor replacement problem in hybrid wireless sensor networks composed of mobile and static sensors. Mobility equipped mobile sensors are utilize...
Tuan D. Le, Nadeem Ahmed, Sanjay Jha
ENTCS
2007
98views more  ENTCS 2007»
13 years 7 months ago
Evaluating Complex MAC Protocols for Sensor Networks with APMC
In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by con...
Michaël Cadilhac, Thomas Hérault, Rich...