625 search results - page 108 / 125 » Approximating Travel Times Using Opportunistic Networking |
131
Voted
IPSN
2009
Springer
15 years 10 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 ...
143
Voted
MOBIHOC
2007
ACM
16 years 3 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...
146
Voted
INFOCOM
2008
IEEE
15 years 10 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...
164
Voted
AINA
2005
IEEE
15 years 9 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...
120
Voted
WOWMOM
2005
ACM
15 years 9 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...