Sciweavers

461 search results - page 59 / 93
» p-Percent Coverage Schedule in Wireless Sensor Networks
Sort
View
IJDSN
2007
111views more  IJDSN 2007»
15 years 1 months ago
Architecture of Wireless Sensor Networks with Mobile Sinks: Multiple Access Case
We propose to develop wireless Sensor Networks with Mobile Sinks (MSSN), under high sensor node density, where multiple sensor nodes need to share one single communication channel...
Liang Song, Dimitrios Hatzinakos
ALGOSENSORS
2007
Springer
15 years 6 months ago
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
Sotiris E. Nikoletseas, Paul G. Spirakis
VTC
2010
IEEE
147views Communications» more  VTC 2010»
15 years 9 days ago
Generalized Proportionally Fair Scheduling for Multi-User Amplify-and-Forward Relay Networks
—Providing ubiquitous very high data rate coverage in next generation wireless networks is a formidable goal, requiring cost-effective radio access network (RAN) devices, such as...
Alireza Sharifian, Petar Djukic, Halim Yanikomerog...
INFOCOM
2006
IEEE
15 years 8 months ago
Is Deterministic Deployment Worse than Random Deployment for Wireless Sensor Networks?
— Before a sensor network is deployed, it is important to determine how many sensors are required to achieve a certain coverage degree. The number of sensor required for maintain...
Honghai Zhang, Jennifer C. Hou
ALGOSENSORS
2004
Springer
15 years 7 months ago
A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
Abstract. Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule tra...
Ted Herman, Sébastien Tixeuil