Abstract
This paper evaluates three routing strategies for wireless sensor networks: source, shortest path, and hierarchical-geographical, which are the three most commonly employed by wireless ad-hoc and sensor networks algorithms. Source routing was selected because it does not require costly topology maintenance, while shortest path routing was chosen because of its simple discovery routing approach and hierarchical-geographical routing was elected because it uses location information via Global Positioning System (GPS). The performance of these three routing strategies is evaluated by simulation using OPNET, in terms of latency, End to End Delay (EED), packet delivery ratio, routing overhead, overhead and routing load.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call