Sciweavers

1989 search results - page 276 / 398
» cost 2010
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran
INFOCOM
2010
IEEE
15 years 4 months ago
Recognizing Exponential Inter-Contact Time in VANETs
—Inter-contact time between moving vehicles is one of the key metrics in vehicular ad hoc networks (VANETs) and central to forwarding algorithms and the end-to-end delay. Due to ...
Hongzi Zhu, Luoyi Fu, Guangtao Xue, Yanmin Zhu, Mi...
INFOCOM
2010
IEEE
15 years 4 months ago
On the Age of Pseudonyms in Mobile Ad Hoc Networks
—In many envisioned mobile ad hoc networks, nodes are expected to periodically beacon to advertise their presence. In this way, they can receive messages addressed to them or par...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...
INFOCOM
2010
IEEE
15 years 4 months ago
Towards Reliable Scheduling Schemes for Long-lived Replaceable Sensor Networks
—To address energy constraint problem in sensor networks, node reclamation and replacement strategy has been proposed for networks accessible to human beings and robots. The majo...
Bin Tong, Zi Li, Guiling Wang, Wensheng Zhang
INFOCOM
2010
IEEE
15 years 4 months ago
PeopleRank: Social Opportunistic Forwarding
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
Abderrahmen Mtibaa, Martin May, Christophe Diot, M...