A formal performance modeling framework for bio-inspired ad hoc routing protocols

Abstract

Bio-inspired ad hoc routing is an active area of research. The designers of these algorithms predominantly evaluate the performance of their protocols with the help of simulation studies. Such studies are mostly scenario and simulator specific and their results cannot be generalized to other scenarios and simulators. Therefore, we argue that mathematical tools should be utilized to develop a consistent, provable and compatible formal framework in order to provide an unbiased evaluation of Bio-inspired ad hoc routing protocols. Motivated by this requirement, in this paper, we develop a probabilistic performance evaluation framework that can be used to model the following key performance metrics of an ad hoc routing algorithm: (1) routing overhead, (2) route optimality, and (3) energy consumption. We utilize this framework to model a well known Bee-inspired routing protocol for ad hoc sensor networks, BeeSensor. We also show that the proposed framework is generic enough and can easily be adapted to even model a classical routing protocol, Ad Hoc on Demand Distance Vector (AODV). The modeled metrics of the two algorithms not only allow unbiased performance comparison but also provide interesting insights into the parameters governing the behavior of these routing protocols.

Analysis of Different Pheromone Decay Techniques for ACO based Routing in Ad Hoc Wireless Networks

“…This when applied in AWN comes to a convergence state (equilibrium) and attracts all the data packets to follow the same path, which leads to congestion. The next packet without aware of the congestion follows a non-optimal path and loses its packets due to frequent packet drops [4] [5] [6] [7].…”

Analysis of Ant-Based Routing with Wireless Medium Access Control

“…For larger networks, Bean and Costa developed a framework for studying ant-based systems, connecting equilibrium solutions with Wardrop equilibrium, a special case of Nash equilibrium, from traffic flow theory [1]. Saleem et al have developed mathematical frameworks for the analysis and measurement of collision probabilities to routing overhead, route optimality and energy consumption [7]. Along similar lines, Zhahid et al have developed a mathematical framework for analyzing beehive based protocols.…”

Formal Modeling of BeeAdHoc: A Bio-inspired Mobile Ad Hoc Network Routing Protocol

“…Secondly, it also applies to small sized networks. With these limitations, an expression for d f is derived in [8] and we simply reproduce it here for the sake of brevity.…”

“…Keeping in mind the concept of forward degree, M = d avg − d f − 2. Therefore, using (7), the probability of no collision is (8) shows that p c decreases exponentially with an increase in the number of nodes contending for the channel access.…”

“…The formal modeling of Bio-inspired protocols have received little attention. The exceptions are the work of Roth and Wicker [7], Saleem et al [8] and Zahid et al [9]. The later is however limited to fixed networks.…”