To ensure uninterrupted communication in a mobile ad hoc network, efficient route discovery is crucial when nodes move and/or fail. Hence, protocols such as Dynamic Source Routing (DSR) precompute alternate routes before a node moves and/or fails. In this paper, we modify the way these alternate rou
β¦ LIBER β¦
Adaptive load balancing scheme in ad hoc networks
β Scribed by Yu-hua Yuan; Hui-min Chen; Min Jia
- Book ID
- 107482498
- Publisher
- Chinese Electronic Periodical Services
- Year
- 2007
- Tongue
- English
- Weight
- 351 KB
- Volume
- 11
- Category
- Article
- ISSN
- 1007-6417
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Load balancing and resource reservation
β
Gautam Chakrabarti; Sandeep Kulkarni
π
Article
π
2006
π
Elsevier Science
π
English
β 384 KB
Least-mean-square routing with load-bala
β
Xi-hao Chen; Hui-min Chen; Wei Zhou
π
Article
π
2008
π
Chinese Electronic Periodical Services
π
English
β 143 KB
Adaptive backoff scheme for ad hoc netwo
β
Chien-Min Wu; Ting-Chao Hou; Maw-Lin Leou; Yi-Ching Liaw; Ming-Chieh Chan
π
Article
π
2010
π
John Wiley and Sons
π
English
β 297 KB
Energy-aware load-balaning fault-toleran
β
Wen-qing Cheng; Zhi-qiang Xiong; Wei Liu; Zong-kai Yang; Yong-jian Xu
π
Article
π
2008
π
Chinese Electronic Periodical Services
π
English
β 230 KB
Highly reliable trust establishment sche
β
Kui Ren; Tieyan Li; Zhiguo Wan; Feng Bao; Robert H. Deng; Kwangjo Kim
π
Article
π
2004
π
Elsevier Science
π
English
β 565 KB
On adaptive deterministic gossiping in a
β
Leszek GaΜ§sieniec; Andrzej Lingas
π
Article
π
2002
π
Elsevier Science
π
English
β 64 KB
We study deterministic algorithms for gossiping problem in ad hoc radio networks. The efficiency of communication algorithms in radio networks is very often expressed in terms of: maximum eccentricity D, maximum in-degree β, and size (number of nodes) n of underlying graph of connections. The maximu