Sciweavers

306 search results - page 8 / 62
» Routing Algorithms for Anycast Messages
Sort
View
GLOBECOM
2008
IEEE
15 years 6 months ago
Time Dependent Message Spraying for Routing in Intermittently Connected Networks
—Intermittently connected mobile networks, also called Delay Tolerant Networks (DTNs), are wireless networks in which at any given time instance, the probability of having a comp...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski
MOBIHOC
2010
ACM
14 years 9 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
JCIT
2010
142views more  JCIT 2010»
14 years 6 months ago
A Novel Adaptive Load Balancing Routing Algorithm in Ad hoc Networks
In this paper a novel adaptive load balancing routing algorithm in Ad hoc networks based on a gossiping mechanism is proposed. Unlike previously published algorithms, this algorit...
Zhu Bin, Zeng Xiao-ping, Xiong Xian-sheng, Chen Qi...
JNW
2007
78views more  JNW 2007»
14 years 11 months ago
A Delay Constrained Minimum Hop Distributed Routing Algorithm using Adaptive Path Prediction
Abstract— We propose a new delay-constrained minimumhop distributed routing algorithm (DCMH) for unicastrouting. DCMH uses a novel path feasibility prediction (PFP) model that is...
Azizul R. Mohd. Shariff, Michael E. Woodward
SSS
2005
Springer
132views Control Systems» more  SSS 2005»
15 years 5 months ago
Self-stabilizing Mobile Node Location Management and Message Routing
We present simple algorithms for achieving self-stabilizing location management and routing in mobile ad-hoc networks. While mobile clients may be susceptible to corruption and sto...
Shlomi Dolev, Limor Lahiani, Nancy A. Lynch, Tina ...