Sciweavers

436 search results - page 13 / 88
» A distributed algorithmic framework for coverage problems in...
Sort
View
DCOSS
2006
Springer
13 years 11 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
WINET
2002
144views more  WINET 2002»
13 years 7 months ago
Exposure in Wireless Sensor Networks: Theory and Practical Solutions
Wireless ad-hoc sensor networks have the potential to provide the missing interface between the physical world and the Internet, thus impacting a large number of users. This conne...
Seapahn Megerian, Farinaz Koushanfar, Gang Qu, Gia...
ICDCS
2003
IEEE
14 years 29 days ago
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
—We propose a generic framework for distributed broadcasting in ad hoc wireless networks. The approach is based on selecting a small subset of nodes to form a forward node set to...
Jie Wu, Fei Dai
GI
2008
Springer
13 years 8 months ago
A Self-Organized Localization-Free Clustering Approach for Redundancy Exploitation in Large Wireless Sensor Networks
: This paper investigates organization problems of large wireless sensor networks. In spite of their random deployment, nodes have to organize themselves as energy efficient as pos...
Jakob Salzmann
WINET
2011
13 years 2 months ago
Sleep scheduling with expected common coverage in wireless sensor networks
Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor...
Eyuphan Bulut, Ibrahim Korpeoglu