Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing performance in the presence of unidirectional links in multihop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Impact of radio irregularity on wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
A routing protocol for power constrained networks with asymmetric links
PE-WASUN '04 Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Practical and robust geographic routing in wireless networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Statistical model of lossy links in wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Understanding the causes of packet delivery success and failure in dense wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
An analysis of unreliability and asymmetry in low-power wireless links
ACM Transactions on Sensor Networks (TOSN)
On exploiting asymmetric wireless links via one-way estimation
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
DEAL: discover and exploit asymmetric links in dense wireless sensor networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Hi-index | 0.00 |
Geographic Forwarding GF algorithms typically employ a neighbor discovery method to maintain a neighborhood table that works well only if all wireless links are symmetric. Recent experimental research has revealed that the link conditions in realistic wireless networks vary significantly from the ideal disk model and a substantial percentage of links are asymmetric. Existing GF algorithms fail to consider asymmetric links in neighbor discovery and thus discount a significant number of potentially stable routes with good one-way reliability. This paper introduces Asymmetric Geographic Forwarding A-GF, which discovers asymmetric links in the network, evaluates them for stability e.g., based on mobility, and uses them to obtain more efficient and shorter routes. A-GF also successfully identifies transient asymmetric links and ignores them to further improve the routing efficiency. Comparisons of A-GF to the original GF algorithm and another related symmetric routing algorithm indicate a decrease in hop count and therefore latency and an increase in successful route establishments, with only a small increase in overhead.