Sciweavers

306 search results - page 27 / 62
» Routing Algorithms for Anycast Messages
Sort
View
84
Voted
INFOCOM
2009
IEEE
15 years 6 months ago
Fair Routing in Delay Tolerant Networks
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
Josep M. Pujol, Alberto Lopez Toledo, Pablo Rodrig...
MOBIHOC
2004
ACM
15 years 5 months ago
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and self-configuring network capacity required in many critical applications, e.g., battlefields, disaster relief and ...
Wenrui Zhao, Mostafa H. Ammar, Ellen W. Zegura
ADHOCNOW
2007
Springer
15 years 6 months ago
Routing in Wireless Networks with Position Trees
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...
Edgar Chávez, Nathalie Mitton, Hécto...
PEWASUN
2004
ACM
15 years 5 months ago
A framework of secure location service for position-based ad hoc routing
In large and dense mobile ad hoc networks, position-based routing protocols can offer significant performance improvement over topology-based routing protocols by using location i...
Joo-Han Song, Vincent W. S. Wong, Victor C. M. Leu...
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
15 years 5 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer