Efficient routing algorithms for anycast routing
In this research project, we proposed three anycast routing heuristics: the shortest widest path routing algorithm (SWP), the widest shortest path routing algorithm (WSP), and the max-min matching routing algorithm (MMRA). The SWP and WSP are found to have better performance than the existing algori...
Saved in:
Main Author: | Tan, Choon Leng. |
---|---|
Other Authors: | Low, Chor Ping |
Format: | Theses and Dissertations |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/2455 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Similar Items
-
Efficient routing algorithms with quality of service constraints
by: Leong, Kock Kin.
Published: (2008) -
Efficient and robust routing on mobile ad hoc networks
by: Guo, Xiaoguang
Published: (2008) -
MobiRoute : routing towards a mobile sink for improving lifetime in sensor networks
by: Luo, Jun., et al.
Published: (2009) -
Adaptive routing on mesh networks
by: Jing, Wenge
Published: (2011) -
Efficient data collection through multi-path routing structures in wireless sensor networks
by: Luu, Van Hai
Published: (2012)