A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Lazy cross-link removal for geographic routing
Proceedings of the 4th international conference on Embedded networked sensor systems
Energy-aware geographic routing in lossy wireless sensor networks with environmental energy supply
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
Computers and Operations Research
| Hi-index | 0.00 |
Geographic routing, which is composed of greedy routing and perimeter routing, has been widely hailed owning to its efficiency and scalability. However, greedy forwarding always takes the local shortest path so that it has a problem of depleting the energy of nodes on the shortest path. The matter get worse when the nodes located on the boundaries of node holes suffer from excessive energy consumption, since the geographic routing tend to deliver data packets along the boundaries by perimeter routing. The imbalance of energy consumption may lead to a short network lifetime. In this paper, we present a novel Energy-Aware Geographic Routing (EGR) algorithm for mobile ad hoc network, which combines local position information and residual energy level to make routing decisions. In basic mode, it selects relay nodes with more residual energy. In void handling mode, a energy-based right-hand rule is proposed to balance consumption during perimeter routing. Our simulation shows that EGR exhibits noticeably longer network lifetime and higher delivery rate than some geographic routing algorithms, such as GPSR and GEAR.