A comparison of load-distributive path routing and shortest path routing in wireless ad hoc networks
Wireless ad-hoc networks are collections of wireless nodes having no predefined infrastructure. Most of the existing routing protocols for wireless ad-hoc networks use the shortest path or minimum distance path to the destination. However, the shortest path routing does not provide a good balance of...
Saved in:
Main Authors: | Habib, I., Badruddin, N., Drieberg, M. |
---|---|
Format: | Conference or Workshop Item |
Published: |
IEEE Computer Society
2014
|
Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84906335935&doi=10.1109%2fICIAS.2014.6869484&partnerID=40&md5=331402ace0a27aa755e5fdaafa0295ff http://eprints.utp.edu.my/32162/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks
by: Habib, I., et al.
Published: (2015) -
Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks
by: Habib, I., et al.
Published: (2015) -
A routing protocol based on trusted and shortest path selection for mobile ad hoc network
by: Jassim H.Sh., et al.
Published: (2023) -
A Matrix Usage for Load Balancing in Shortest Path Routing
by: Mustafa, Nor Musliza
Published: (2009) -
Traffic Balancing Method in Shortest Path Routing
by: Mohamed Abdulqader, Makarem
Published: (2007)