Sciweavers

1464 search results - page 255 / 293
» Worst case mobility in ad hoc networks
Sort
View
IWCMC
2009
ACM
14 years 1 months ago
Scheduling cooperative emergency response: or how the meek shall overcome the greedy
We consider the problem of scheduling emergency responders to geospatially located finite duration temporally bounded tasks. We consider two different schedulers, Greedy and Mee...
Carol Dottin, Bilal Khan
WICON
2008
13 years 10 months ago
HxH: a hop-by-hop transport protocol for multi-hop wireless networks
TCP can perform poorly in multi-hop wireless networks due to problems that arise with contention and mobility. Endto-end protocols are at an inherent disadvantage in trying to sol...
Daniel Scofield, Lei Wang, Daniel Zappala
AICCSA
2005
IEEE
168views Hardware» more  AICCSA 2005»
14 years 2 months ago
A dynamic range resource reservation protocol for QoS support in wireless networks
— Mobile ad hoc networks (MANETs) provide a powerful and dynamic platform to enable mobile computers to establish communications without an existing infrastructure. In order to p...
Imad Jawhar, Jie Wu
EURONGI
2005
Springer
14 years 2 months ago
Receiver Oriented Trajectory Based Forwarding
Abstract— Trajectory Based Forwarding (TBF) is a new approach to routing in ad hoc wireless networks. It exploits node position information and, similarly to source routing, requ...
Antonio Capone, Ilario Filippini, Luigi Fratta, Lu...
SECON
2007
IEEE
14 years 3 months ago
The Optimum Number of OSPF Areas for MANETs
—Mobile ad hoc networks (MANETs) are a critical technology in filling the gap where the network infrastructure is insufficient or does not exist at all. The dynamic topology of...
Jangeun Jun, Mihail L. Sichitiu, Hector D. Flores,...