Sciweavers

817 search results - page 76 / 164
» Mobility-Driven Scheduling in Wireless Networks
Sort
View
WIOPT
2006
IEEE
14 years 3 months ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi
IPSN
2004
Springer
14 years 2 months ago
Flexible power scheduling for sensor networks
We propose a distributed on-demand power-management protocol for collecting data in sensor networks. The protocol aims to reduce power consumption while supporting fluctuating dem...
Barbara Hohlt, Lance Doherty, Eric A. Brewer
INFOCOM
2008
IEEE
14 years 3 months ago
Throughput Anonymity Trade-off in Wireless Networks under Latency Constraints
—Providing anonymity to routes in a wireless ad hoc network from passive eavesdroppers is considered. Using Shannon’s equivocation as an information theoretic measure of anonym...
Parvathinathan Venkitasubramaniam, Lang Tong
IPPS
2007
IEEE
14 years 3 months ago
Using Coroutines for RPC in Sensor Networks
This paper proposes a concurrency model which integrates the asynchronous and event-driven nature of wireless etworks with higher-level abstractions that provide a more familiar p...
Marcelo Cohen, Thiago Ponte, Silvana Rossetto, Noe...
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