Sciweavers

3467 search results - page 24 / 694
» A New Localized Network Based Routing Model in Computer and ...
Sort
View
MOBIHOC
2006
ACM
14 years 8 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt
ICNP
2005
IEEE
14 years 2 months ago
Path Vector Face Routing: Geographic Routing with Local Face Information
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
Ben Leong, Sayan Mitra, Barbara Liskov
SIMUTOOLS
2008
13 years 10 months ago
A simulation model of DYMO for ad hoc routing in OMNeT++
Mobile Ad Hoc Networks (MANETs) have evolved in the last years into standards in the communication world. By definition, they do not need any network infrastructure to facilitate ...
Christoph Sommer, Isabel Dietrich, Falko Dressler
INFOCOM
1999
IEEE
14 years 1 months ago
CEDAR: a Core-Extraction Distributed Ad Hoc Routing Algorithm
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...
Prasun Sinha, Raghupathy Sivakumar, Vaduvur Bhargh...
WICON
2008
13 years 10 months ago
Towards distributed network classification for mobile ad hoc networks
Mobile ad hoc networks range from traditional MANETs where end-to-end paths exist from sources to destinations, to DTNs where no contemporaneous end-to-end paths exist and communi...
Dimitrios Antonellis, Ahmed Mansy, Konstantinos Ps...