GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Efficient geographic routing in multihop wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Priority-based receiver-side relay election in wireless ad hoc sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
A greedy minimum energy consumption forwarding protocol for wireless sensor networks
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Mobile Networks and Applications
Hi-index | 0.00 |
Traditional purely greedy forwarding in wireless ad hoc networks is not optimal in most practical settings where perfect-reception-within-range cannot be assumed. Although a few link-aware routing schemes have been reported, the tradeoffs between greediness and link quality have not been studied. In this paper, we take a multi-criteria based receiver-side relay election approach in wireless multi-hop forwarding, where a single optimal node is elected among many candidates to relay packets toward the final destination. We introduce a general cost metric in the form of a multiparameter mapping function, that aggregates all decision criteria into a single virtual criterion to rank potential relay candidates. We show that a suitable mapping function can be found, which trades off greediness for link quality to obtain optimal end-to-end network performance. Compared with the previously reported link-aware forwarding schemes, our results show a better energy performance and a substantial improvement in end-to-end delay.