477 search results - page 94 / 96 » Information-Theoretic Bounds for Mobile Ad-hoc Networks Rout... |
GLOBECOM
2009
IEEE
14 years 1 months ago
2009
IEEE
—We consider a Delay Tolerant Network (DTN) whose users (nodes) are connected by an underlying Mobile Ad hoc Network (MANET) substrate. Users can declaratively express high-level...
SPAA
2005
ACM
14 years 4 days ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
ESA
2011
Springer
12 years 6 months ago
2011
Springer
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— Many tasks require multiple sensing capabilities; in Wireless Sensor Networks (WSN), it is expensive to deploy a homogeneous network wherein every sensor has the same functiona...
WINET
2010
13 years 5 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...