Sciweavers

1464 search results - page 28 / 293
» Worst case mobility in ad hoc networks
Sort
View
PDPTA
2004
13 years 9 months ago
A New Adaptive Distributed Routing Protocol Using d-hop Dominating Sets for Mobile Ad Hoc Networks
In this paper, we propose an adaptive self- stabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with commun...
Zhengnan Shi, Pradip K. Srimani
MIDDLEWARE
2004
Springer
14 years 27 days ago
Designing a context-aware middleware for asynchronous communication in mobile ad hoc environments
In mobile ad hoc networks, synchronous communication mechanisms appear to be not suitable, since these assume that the involved entities are present at the same time during the in...
Mirco Musolesi
ICDCS
2002
IEEE
14 years 15 days ago
A Reliable Multicast Algorithm for Mobile Ad Hoc Networks
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
Thiagaraja Gopalsamy, Mukesh Singhal, Dhabaleswar ...
SAJ
2002
127views more  SAJ 2002»
13 years 7 months ago
Limited flooding protocol for mobile ad hoc networks
Mobile ad hoc networks are collections of mobile nodes without any fixed infrastructure or central co-ordinating mechanism for packet routing. Consequently, routing is a challenge...
Mieso K. Denko, W. Goddard
WCNC
2008
IEEE
14 years 1 months ago
Adaptive Routing in Dynamic Ad Hoc Networks
Abstract—Dynamic ad hoc networks are mobile ad hoc networks (MANETs) where network characteristics, such as network density and node mobility, change significantly over time and...
Cong Liu, Jie Wu