Sciweavers

1464 search results - page 103 / 293
» Worst case mobility in ad hoc networks
Sort
View
IPPS
2006
IEEE
15 years 3 months ago
k-anycast routing schemes for mobile ad hoc networks
— Anycast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the...
Bing Wu, Jie Wu
COMCOM
2004
153views more  COMCOM 2004»
14 years 9 months ago
BLR: beacon-less routing algorithm for mobile ad hoc networks
Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well wit...
Marc Heissenbüttel, Torsten Braun, Thomas Ber...
IPPS
2008
IEEE
15 years 4 months ago
Middleware support for delay-tolerant service provision in disconnected mobile ad hoc networks
The service-oriented approach is known to be adequate for building distributed applications for mobile ad hoc networks, and a number of successful research works using this approa...
Yves Mahéo, Romeo Said, Frédé...
PDP
2006
IEEE
15 years 3 months ago
A Hierarchical Consensus Protocol for Mobile Ad Hoc Networks
Mobile ad hoc networks (MANETs) raise new challenges in designing protocols for solving the consensus problem. Among the others, how to design message efficient protocols so as to...
Weigang Wu, Jiannong Cao, Jin Yang, Michel Raynal
EUROPAR
2010
Springer
14 years 11 months ago
cTrust: Trust Aggregation in Cyclic Mobile Ad Hoc Networks
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
Huanyu Zhao, Xin Yang, Xiaolin Li