The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Algorithms and Complexity
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Ad hoc Networking
Comparison of routing metrics for static multi-hop wireless networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
A Multi-Radio Unification Protocol for IEEE 802.11 Wireless Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Contact-Based Mobility Metrics for Delay-Tolerant Ad Hoc Networking
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
A Turnover based Adaptive HELLO Protocol for Mobile Ad Hoc and Sensor Networks
MASCOTS '07 Proceedings of the 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Impact of node density on throughput and delay scaling in multi-hop wireless networks
IEEE Transactions on Wireless Communications
Handbook of Mobile Ad Hoc Networks for Mobility Models
Handbook of Mobile Ad Hoc Networks for Mobility Models
Integrating machine learning in ad hoc routing: A wireless adaptive routing protocol
International Journal of Communication Systems
Survey Paper: Routing protocols in ad hoc networks: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Transmission range adaptation based energy efficient neighborhood discovery
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
| Hi-index | 0.00 |
So far the hop-count has been considered as a good metric for routing in wired and wireless networks thanks to its simplicity and effectiveness. In spite of that, the hop-count still manifests itself to be low adaptable to the environment in which nodes may be densely distributed and move at high speeds as in mobile ad-hoc networks (MANETs). Several metrics have been proposed as the replacements for the hop-count in routing of MANET such as the Expected Transmission Count (ETX) and the Expected Transmission Time (ETT). However, they only showed their outperformance in static scenarios. To deal with the mobility, some routing models employed a metric named Mobility Factor (MF) based on detecting the change of neighbour sets in a period of HELLO messages to examine the link stability before sending a packet. Nonetheless, to calculate MF values, each node needs to keep historical information of its neighbours which causes more resource usage and more computational complexity when MANETs scale up. In an attempt to find a suitable and effective metric for MANET's routing, this paper introduces the Path Encounter Rate (PER) metric based on the concept of ''encounter''. The proposed metric reflects the environment's changes and therefore boosting the performance of routing protocols in MANETs. The throughput achieved by using the proposed metric is 30% higher than those obtained by the hop-count metric when 100 nodes move at a maximum speed of 20m/s in the area of 300x1500m^2. This is a remarkable improvement compared to other metrics in mobility scenarios. Additionally, the proposed metric is much simple and has less computation compared to MF metric in terms of implementation. Though, the proposed metric and routing model in this paper is demonstrated on the Ad-hoc On-demand Distance Vector (AODV) protocol, it is generic and can be applied for various kinds of routing protocols in MANETs.