625 search results - page 108 / 125 » Approximating Travel Times Using Opportunistic Networking |
IPSN
2009
Springer
15 years 4 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
MOBIHOC
2007
ACM
15 years 9 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
INFOCOM
2008
IEEE
15 years 3 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
103
click to vote
AINA
2005
IEEE
15 years 3 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
WOWMOM
2005
ACM
15 years 3 months ago
2005
ACM
— We consider the design of optimal strategies for joint power adaptation, rate adaptation and scheduling in a multi-hop wireless network. Most existing strategies control either...