A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Integration of mobile-IP and OLSR for a universal mobility
Wireless Networks
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Common Gateway Architecture for Mobile Ad-Hoc Networks
WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
Comparison of forwarding strategies in internet connected MANETs
ACM SIGMOBILE Mobile Computing and Communications Review
A cost matrix agent for shortest path routing in ad hoc networks
Journal of Network and Computer Applications
Hi-index | 0.01 |
Many have proposed to connect Mobile Ad Hoc Networks (MANETs) to a wired backbone Internet access network. This paper demonstrates that a wired backbone network can be utilized for more than just providing access to the global Internet. Traffic between mobile nodes in the ad hoc network may also be routed via this backbone network to achieve higher throughput, and to reduce the load in the ad hoc network. This is referred to as transit routing. This paper proposes a cost metric algorithm that facilitates transit routing for some of the traffic flows between nodes in the MANET. The algorithm aims at carrying out transit routing for a flow only when it leads to improvements of the performance. The proposal is implemented and tested in the ns-2 network simulator, and the simulation results are promising.