Mathematical Problems in Engineering

Mathematical Problems in Engineering / 2015 / Article
Special Issue

Advanced Modeling and Services Based Mathematics for Ubiquitous Computing

View this Special Issue

Research Article | Open Access

Volume 2015 |Article ID 105245 | https://doi.org/10.1155/2015/105245

N. Javaid, Z. A. Khan, U. Qasim, M. Jamil, M. Ishfaq, T. A. Alghamdi, "Modeling Routing Overhead of Reactive Protocols at Link Layer and Network Layer in Wireless Multihop Networks", Mathematical Problems in Engineering, vol. 2015, Article ID 105245, 14 pages, 2015. https://doi.org/10.1155/2015/105245

Modeling Routing Overhead of Reactive Protocols at Link Layer and Network Layer in Wireless Multihop Networks

Academic Editor: Young-Sik Jeong
Received23 Mar 2014
Revised26 Aug 2014
Accepted08 Sep 2014
Published27 Jul 2015

Abstract

To keep information recent between two nodes, two types of link sensing feed-back mechanisms are used: link layer (LL) and network layer (NL). In this paper, we model and evaluate these link sensing mechanisms in three widely used reactive routing protocols: ad hoc on-demand distance vector (AODV), dynamic source routing (DSR), and dynamic MANET on-demand (DYMO). Total cost paid by a routing protocol is the sum of cost paid in the form of energy consumed (in terms of packet reception/transmission) and time spent (in terms of processing route information). Routing operations are divided into two phases: route discovery (RD) and route maintenance (RM). These protocols majorly focus on broadcast cost optimization performed by expanding ring search (ERS) algorithm to control blind flooding. Hence, our model relates link sensing mechanisms in RD and RM for the selected routing protocols to compute consumed energy and processing time. The proposed framework is evaluated via NS-2, where the selected protocols are tested with different nodes' mobilities and densities.

1. Introduction

Recent research mainly focusses on wireless multihop networks (WMhNs) due to increased use of wireless devices all around. A mobile node, in WMhNs, acts as a transmitter and as a router (relay node) for nodes not in the direct transmission range of each other. Applications of these networks range from a small room to large areas like a battlefield or a natural disaster. Performance of WMhNs majorly depends on the routing protocols operating these networks.

On the basis of route calculation, routing protocols are divided into two major categories: reactive and proactive. Protocols from the former category calculate routes when data request arrives, thus, also called “on-demand” protocols. Examples of these protocols are ad hoc on-demand distance vector (AODV) [1, 2], dynamic source routing (DSR) [3, 4], dynamic MANET on-demand (DYMO) [5, 6], and so forth, whereas protocols belonging to the later category periodically perform routing table calculation independently from data request arrival. These protocols include destination-sequence distant vector (DSDV) [7], fish-eye state routing (FSR) [8, 9], optimized link state routing (OLSR) [10, 11], and so forth.

Reactive protocols are well suited for highly dynamic networks, whereas proactive ones are designed for large networks with low mobility. Reactive protocols exchange lot of control (routing) information to accurately route data within or outside the network. There are two main phases in which these protocols calculate routing information: route discovery (RD) and route maintenance (RM). After computation and establishment of a route for the requested destination during RD phase, RM phase starts if a link breaks. The first step is to perform periodic links’ sensing in active route (which are established during RD for data transmission). Links are sensed by the routing protocols either from link layer (LL) or from network layer (NL). After detecting a link breakage while sensing, the second step (RM phase) repairs the link. The control messages generated by routing protocols and the time which is spent during RD and RM, collectively generate routing overhead.

In this paper, we model routing overhead produced by three reactive protocols: AODV, DSR, and DYMO. We choose the selected three routing protocols because these are widely used in literature. Our main focus is to measure routing overhead for LL and NL feed-back mechanisms. To analyze the link sensing mechanisms of AODV, DSR, and DYMO, we conduct simulations in NS-2. The overhead is measured for nodes’ different mobilities and densities.

2.1. Related Work

Routing protocols play an important role for performance optimization in wireless networks. Many protocols, including bioinspired routing [12, 13], security based routing [14, 15], and balanced load routing [16, 17], have been proposed for wireless networks. However, we focus on the modeling of overhead for reactive routing protocols at NL and LL. In [18], authors focus on quality routing link metrics for wireless multihop networks. Authors in [19] address performance evaluation of two on-demand routing protocols in WMhNs, DSR, and AODV. They simulate these protocols for and number of sources with speeds of 2 m/s and 6 m/s. Simulation results show that AODV protocol is more suitable as compared to DSR for wireless transmission with rapid change of network topology.

In [20], authors compare AODV and DYMO, using packet-level simulations for different speeds (1 m/s, 9 m/s, and 15 m/s) in NS-2. They select throughput, routing overhead, and average packet size of the routing packets as performance metrics. From simulation results, they conclude that AODV achieves higher throughput than DYMO. This is because the distance vector information of AODV consumes less bandwidth than source routing of DYMO.

The control overhead of ad hoc routing protocols is surveyed in [21]. The authors classify reactive and proactive protocols as “hello protocol” and “flooding protocol,” respectively. They conclude through simulations that “hello protocols” generate more control overheads than “flooding protocols” in mobile scenarios. Hence, “hello protocols” are more suitable for static scenarios and “flooding protocols” for mobile scenarios.

The failure or unability of a routing protocol to identify all disjoint paths between a pair of nodes is called path diminution. In [22], this phenomenon is studied. The paper states that diminution of path becomes unavoidable whenever a protocol becomes aware of multiple disjoint paths while discovering a single route. In order to mitigate path diminution, the paper discusses various schemes. However, as per conclusion none of the discussed schemes guarantee to discover all disjoint paths between a pair of nodes.

Saleem et al. in [23] analytically model and compare the routing control overhead. The flooding mechanism of reactive protocols is compared with relay node technique of proactive protocols.

Packet drop and link failure significantly degrade network performance. As the root cause of these problems is congestion so [24] presents congestion and link failure aware data delivery mechanism. This work jointly considers control approaches, congestion detection, and buffering while increasing reliability of delivering data. Simulation results validate better performance of the proposed mechanism as compared to the selected existing ones in terms of end to end delay, throughput, and reliability.

Saleem et al. [25] propose a framework for flooding cost in routing protocols. They evaluate the framework using two key performance metrics: routing overhead and route optimality for DSDV, DSR, AODV-LL, and gossiping.

A reactive traffic-aware routing strategy for urban vehicular environments has been proposed in [26]. The beauty of this strategy is the avoidance of dead ends and unnecessary routes. In this work, dynamic paths are created on the basis of prior global knowledge of the traffic for each vehicle. Moreover, this prior global knowledge is used by decision making nodes while taking critical decisions.

As mobility and PHY/MAC layers implementation affect the routing protocols in ad hoc networks so [27] presents simulation based analysis of the two reactive routing protocols: DSR and AODV. The simulations are carried with modified IEEE 802.11a (PHY/MAC layers) along with modified mobility models (freeway, traffic sign, and stop sign). From OPNET based simulation results, they conclude that modified version of AODV performs better than DSR in terms of delay, throughput, and number of retransmission attempts.

2.2. Motivation

In our previous work [28], we model the routing overhead incurred by AODV, DSR, and DYMO in terms of energy and time costs for the generated control packets. We presented a framework for RD and RM of the protocols. These protocols mainly focus on the optimization performed by expanding ring search (ERS) algorithm to minimize the overhead generated due to blind flooding. The proposed framework is evaluated via NS-2 to compare performance of the chosen routing protocols.

A comparative evaluation of AODV and DYMO is also presented in [29]. Both the protocols are compared through simulations using LL feed-back mechanism.

Inspired from [28, 29], we enhance the framework of [29] for LL and NL link sensing mechanisms. Moreover, to validate the proposed framework, we simulate AODV, DSR, and DYMO with two link sensing mechanisms: LL and NL. Simulations are performed against varying network sizes and nodes’ mobilities.

3. Modeling the Cost Paid by Reactive Protocols

Flooding is a process used by routing protocols to exchange routing information throughout the network. In this process, each node acts as router and each node broadcasts route information to all of its neighbors. This process is repeated until destination is reached. Blind flooding is a simple approach in which each node rebroadcasts the packet, whenever it receives packet for the first time.

In [25], an approximate per packet cost paid by a protocol for RD using blind flooding is presented aswhere denotes the average degree or the average number of immediate one-hop neighbors of a node. A node is isolated, if it has . In (1), is the number of hops in the network, is the expected forward degree of a node at th hop, and is the broadcast probability [30].

ERS [31], adopted by AODV, DSR, and DYMO, is one of the optimization techniques that have been proposed to control the routing overhead. As ERS is adopted by the three reactive routing protocols so we focus on its working. This technique sets search diameters, based on time-to-live (TTL) value in RD phase, to limit broadcast overhead. In ERS, these search diameters are known as rings. In order to calculate the packet cost of a ring “,” is replaced by of that ring. Let be the cost of any ring . The selected protocols set in route REQuest (RREQ) message. In ERS, RD can either be successful or not; successful RD is stopped after receiving route REPly (RREP) message, whereas unsuccessful RD results in dissemination up to maximum and rediscovery attempts. An which generates RREP(s) is called and ring up to maximum TTL limit is known as resulting in either successful or unsuccessful RD. Therefore, is computed from our previous work in [28] as

In ERS, RD requires adjustments in TTL values to find destination. If source node fails to find destination, then TTL is incremented. In ERS, gradual growth of broadcast ring takes place to reduce the chances of flooding throughout the network which results in different rings for different broadcast levels. The cumulative routing cost for expanding rings, during RD process “,” is computed as

On encountering a dynamic topology due to varying number of nodes and mobility rates, a routing protocol “” pays some cost in the form of per packets consumed energy “” and in the form of per packet time spent “”. In [28], authors have computed this cost as

3.1. Cost of Energy Consumption

Each reactive protocol performs two routing operations: RD and RM. Therefore, we define the cost for energy consumption, during RD and RM processes, , respectively is different for each reactive protocol due to different routing strategies. For example, in DSR, multiple routes in route cache (RC) reduce the routing overhead with the help of gratuitous RREPs (grat. RREPs) and packet salvaging (PSing), whereas, in AODV, route length is shortened by grat. RREPs to reduce the cost of RD process and successful Local Link Repair (LLR) process diminishes route rediscoveries.

Receiver of the route REQuest (RREQ) generates a route REPly (RREP) to the originator, if it either is itself the destination or it contains an active route (AR) to the destination (also known as gratuitous RREPs (grat. RREPs)). Grat. RREPs are generated if the node generating the RREP is not the destination itself but is a substitute node along the path from originator to destination.

3.1.1. Energy Consumed during RD

AODV, DSR, and DYMO use ERS mechanism for RD via broadcasting the RREQ messages from the source node. Successful RD results in unicast of RREP message to the originator node. Depending upon the generating node, the RREP message is of two types: dest. RREP and grat. RREP. An RREP which is generated from destination node is known as dest. RREP which is used by all the three reactive protocols. A source node can receive RREP from the nodes that contain alternate (short) route to the desired destination. These replies are only supported in AODV and DSR and are known as grat. RREPs.

The cost paid for RREQ packets and for RREPs, produced during RD, is computed aswhere notation is used for number of nodes which unicast RREP to the sender. The ERS mechanism of AODV and DYMO is shown in Figure 1(a) with and using LL feed-back mechanism, whereas Figure 1(b) shows NL feed-back mechanism.

The generation of RREP(s) in AODV and DSR (refer Figure 2) is also due to valid routes in routing table (RT) or RC. Therefore, for DSR and AODV is less than DYMO due to the absence of grat. RREPs in DYMO. can be , depending upon the hop-distance from source to destination.

3.1.2. Energy Consumed during RM

After the establishment of a successful route, during RD process, the next process is to perform link state monitoring (LSM). During this process, links of active routes (ARs) are sensed, as we have mentioned earlier that this sensing can be performed at NL and LL.

During RM process, different protocols pay different link monitoring costs and also use different supplementary maintenance strategies in case of link breakage. Therefore, this cost metric depends upon the respective routing protocols; for AODV and for DSR, whereas DYMO does not use any supplementary mechanism. RM process for AODV, DSR, and DYMO is given in Algorithms 1, 2, and 3, respectively.

(1) if   = active_mode then
(2)  for all    do
(3)   start
(4)   if upstream node detects Link Breakage () then
(5)    start LLR
(6)    if successful repair through LLR then
(7)     repairing node sends data to repaired route
(8)    else
(9)     broadcast RERR message
(10)    receiver of RERR deletes faulty route from
(11)     starts route re-discovery based on
(12)   end if
(13)  else
(14)   repeat
(15)  end if
(16) end for
(17) else
(18) no action is performed for link checking
(19) end if

(1) for all    do
(2)  start
(3)  if upstream node detects   then
(4)   remaining nodes of path search alternative route in RC
(5)   if found alternative   then
(6)    send data to this
(7)   else
(8)     starts route re-discovery
(9)     piggy-backs with new
(10)  end if
(11) else
(12)  upstream nodes receive feed-back from downstream nodes
(13) end if
(14) end for

(1) if   = active_mode  then
(2)  for all    do
(3)   start
(4)   if upstream node detects   then
(5)    disseminate message
(6)    receiver of deletes faulty route from
(7)     starts route re-discovery based on
(8)   else
(9)    check links of
(10)  end if
(11) end for
(12) else
(13) do not perform any action
(14) end if

After the detection of route failure due to link breakage, there are three different scenarios for reactive protocols describing the route repair mechanism. The most simple mechanism describes that RD reinitiation process takes place under limited retries for route rediscovery process: in DYMO, in AODV, and in retransmissions.

In AODV, after unsuccessful LLR and in DYMO ultimately after detecting link breakage, RERR messages are broadcasted by the node which detects any link breakage. If LLR becomes successful, then in a dense network, it saves the energy which is consumed for route rediscovery, otherwise reinitiating RD process after performing LLR strategy increases the energy consumption. DSR’s PS technique reduces both the energy and time costs paid by the reactive protocols by diminishing the route rediscovery. In case of successful PS, RERR messages are broadcasted to neighbors for the deletion of useless routes, whereas absence of alternate route(s) in RC leads to failure of PS. In this situation, RERR messages are piggy-backed in the next RREQ messages during route rediscovery process. There are some approaches for detecting link breakages. In this paper, we focuss on two approaches for the detection of link breakage. In the first approach, link sensing is performed at link layer, which uses LL feed-back to check link’s status. This checking is performed 100 times in every second. The principle behind notifying link breakage depends on failure of link level feed-back.

In Algorithms 1, 2, and 3, we use “” for link, “” for source node, and “” for route.

If a node in AR receives eight consecutive failures, then it notifies broken link status. The second approach uses sending and receiving of beacon messages on NL (i.e., messages and ACKnowledgement ) to check connectivity of ARs. If is not received, after a specific number of tries, then link is notified as broken. The example of this approach is the use of message in AODV. messages are sent after every and if is not received for value, then link is considered as broken.

Following equations give RM cost for the three protocols with NL and LL feed-back mechanisms. Cost of LLR in AODV is given by (8), where denotes the ring that limits LLR activity. for is calculated with and (i.e., the last known hop-count to the destination). The per packet cost of LLR in AODV, , depends upon the of . Consider

In large networks, successful LLR process is more useful because the chances of route rediscovery are reduced, which consumes more bandwidth. is computed aswhere represents the number of hops to the sender of the currently undeliverable data packet. for LLR is calculated from expression. Considerwhere is the LSM cost on NL, and is given belowwhere is the node before link breakage and is any node from source to . In wireless environment, route failures are due to frequent link breakages. We denote LSM cost at NL by and depending upon the link duration in AR, , is the periodic interval for link sensing and represent the number of hops in an active route.

Broadcast needs to send number of RERRs depending upon different situations for different protocols. In DYMO, link breakage causes the broadcasting of RERR messages. In AODV, when the probability of successful LLR becomes zero then it leads to the dissemination of RERRs. On the other hand, DSR piggybacks RERR messages along with next RREQs in case of route rediscovery process, while these RERR messages are broadcasted in case of PS success.

3.2. Cost of Time Consumption

The cost of end-to-end path computation time “” in reactive protocols depends upon and . Considerwith details in the following subsections.

3.2.1. Time Consumed during RD for DSR

Let denote constant time initially used for [3] and its value is  ms. , the maximum ring size, depends on the buffer time as well as the maximum allowed broadcasting during propagating RREQ [3]. Binary exponential back-off (BEB) is associated with each propagating ring (BEB mechanism doubles previous (refer Figure 1(b)) and to reduce routing overhead). The expression for time consumed during RD by DSR “” is given below:

3.2.2. Time Consumed during RD for AODV and DYMO

In both AODV and DYMO, (in IP header) is set to ( in case of link layer feedback otherwise = 2); then it is incremented by up to [2]. When is reached, is set to (for AODV = 35 [2] and for DYMO = 10 [4]). For dissemination in the entire network, both and are set to . Moreover, maximum RREQ retries are 3 for DYMO [4] and maximum retries are 2 for AODV. The is set to (whereas, . See complete detail of and in Figure 1. Considerwhere and . There are two possibilities for AODV and DYMO: first case, when RD process becomes successful in threshold rings “,” whereas in second case RD process needs to disseminate the request throughout the network, . For these two rings, we define and . The earlier one represents in a ring that generates RREP(s) inside with and the later one shows for the entire network: with .

3.2.3. Time Consumed during RM for AODV

AODV starts LLR process after noticing a link failure. gives the time cost of LLR which depends upon of the ring, . In case of LLR failure, AODV disseminates RERR messages. represents the time spent to reach RERR message from the node which detects link failure to the originator node. () cost is to be paid to start route rediscovery based on the value . This cost is given as

3.2.4. Time Consumed during RM for DSR

After detecting a link failure, time is utilized to check alternative routes in RC of intermediate nodes (from a node which detects link failure to a node having alternate route for this broken link, ). In case of failure of PSing or in the case of presence of alternative route in RCing of the originator node, the cost for consumed time during RM for DSR is given aswhere , is the node just before link breakage, and is the node which originates RD process.

3.2.5. Time Consumed during RM for DYMO

An RERR message is broadcasted by the node which detects link breakage. After is consumed by the source node for receiving RERR message, source node initiates RD; is based on . This cost is computed as

4. Analytical Simulation Results Corresponding to the Designed Framework

We evaluate performance of our modeled framework in NS-2. For simulation setup, we have chosen continuous bit rate (CBR) traffic sources with packet size of bytes. Nodes are dispersed in 1000 m × 1000 m of network square space allowing mobile nodes to move inside the network area. Links are provided with bandwidth of 2 Mbps to transmit on. We consider three performance metrics: packet delivery rate (PDR), end-to-end delay (E2ED), and normalized routing load (NRL) for our analysis. We simulate 50 nodes with variable pauses from 0 s to 900 s at 30 m/s for mobility analysis, whereas nodes with different densities, from 10 to 100, are simulated with 15 m/s and a constant pause of 2 s using random way point (RWP) mobility model. The random way point model is chosen due to the following reasons: (i) simplicity in implementation, and (ii) it meets all the required design considerations.

4.1. PDR

AODV attains highest PDR among all the selected protocols because during RD, timely-based route checking in the routing table provides correct route information and grat. RREPs are generated to reduce routing delay by shortening the routes, as depicted in Figures 3(a), 3(c), 3(b), and 3(d). Moreover, LLR mechanism helps to deliver more data packets in high node densities. AODV-LL achieves 5.2% and 6% more cumulative PDR as compared to AODV-NL (refer to Figures 3(e) and 3(f)). This is due to quick notification through LL feed-back mechanism which results in instant repairing, whereas, in DSR, RC contains stale routes due to very high of 1024 bytes and high period for storage of routes in the RC, of 300 s. As there is no explicit mechanism to delete stale routes except RERR messages, so incorrect RCing in high nodes’ mobilities generates faulty information and thus causes packets to be dropped. DSR-NL drops more data packets as compared to DSR-LL, as shown in Figures 3(e) and 3(f), because quick link sensing on LL provides more convergence as compared to NL feedback. In moderate and no-mobilities, DSR’s throughput is the highest as compared to AODV and DYMO because RCing during RD phase and PSing for RM phase makes end-to-end path calculation quick, as portrayed in Figure 3.

DYMO does not implement any ancillary mechanism as grat. RREPs in AODV and DSR: LLR of AODV and RCing as well as PSing of DSR (refer Figure 3). Same as that of AODV-LL and DSR-LL, LL mechanism in DYMO-LL achieves more PDR as compared to DYMO-NL. DYMO-LL achieve 5% and 4% more cumulative PDR in different nodes’ mobilities and densities, respectively, which can be seen in Figures 3(e) and 3(f). AODV outperforms all the selected protocols when network is denser. LLR, the distinguished feature of AODV, makes this protocol more suitable for high node densities due to reduction of routing latency.

4.2. E2ED

In all the selected nodes’ mobilities as well as densities, DYMO attains lowest routing latency due to simple ERS mechanism and lack of checking routes in RC or in RT as depicted in Figure 4. In high mobilities, quick repair is needed after detecting link breakage for maintaining broken link(s) (path(s) reestablishment). To avoid these route-rediscoveries, AODV starts LLR process to quickly upkeep the broken link for achieving low routing latency. AODV, among the reactive protocols, attains highest delay as shown in Figures 4(a), 4(c), and 4(e). Because LLR for link breakages in routes sometimes results in increased path lengths, DYMO produces the lowest E2ED among the reactive protocols because it only uses ERS for route finding that causes less delay due to absence of PSing, RCing, and grat. RREPs. At higher mobilities, DSR-NL suffers the most, that is, highest E2ED (refer Figure 4(a)). The reasons include RCing and PSing failure in high dynamicity which introduce routing latencies. As DSR does not implement LLR, so its E2ED is less than AODV; however, during moderate and high nodes’ mobilities, RC search frequently fails and results in increased delay.

Absence of grat. RREPs and any supplementary mechanism keeps the lowest E2ED of DYMO in all the node densities, as depicted in Figure 4(b). PS and grat. RREPs keep the delay low in medium and high traffic scenarios for DSR (while first checking the RC instead of simple ERS based RD process), augments the delay when population increases. Thus more delay of DSR is shown in Figures 4(b), 4(d), and 4(f), as compared to DYMO. AODV experiences the highest E2ED in all the node densities due to LLR process.

AODV-NL possesses less delay as compared to AODV-LL and same as that of DSR. In AODV and DSR, auxiliary mechanisms during RM produce more routing latencies, because quick detection LB via LL feed-back mechanisms initiate these mechanisms (refer Figures 4(e) and 4(f)). As these mechanisms are absent in DYMO, thus, quick link failure detection in DYMO-LL results in less routing load as compared to DYMO-NL.

4.3. NRL

Due to absence of grat. RREPs, DYMO produces higher routing overhead among the selected reactive protocols, whereas in DSR route RCing and PSing due to promiscuous listening mode produce the lowest routing load in all the selected nodes’ mobilities (refer Figure 5). Moreover, high rate of link breakages causes more route rediscoveries for path repairing. In DYMO, routing load increases with high nodes’ mobilities because RERR messages are instantly broadcasted after detecting link breakage. Although, AODV uses grat. RREPs however due to the use of messages (to check the connectivity of the ARs in DYMO) and LLR, the DYMO causes more routing load than DSR, as shown in Figure 5(a).

One common noticeable behavior of the selected protocols is that, in high nodes’ mobilities, routing overhead is higher as compared to moderate and low nodes’ mobilities as shown in Figures 5(a), 5(c), and 5(e). Because, in response to link breakage, all the on-demand protocols disseminate RERR message to inform the route request generator about faulty links and thus prevent the use of invalid routes. As link breakage, in highly dynamic situations, is frequent, more RERR messages are generated resulting in high NRL.

In medium and high populations, routing load of DYMO is less than that of DSR and AODV (refer to Figures 5(b), 5(d), and 5(f)), whereas, in medium and high densities, AODV-NL attains the highest routing load. The messages (to check the connectivity of active routes), LLR and grat. RREPs increase the generation of routing packets. Each node that participates during RD (including intermediate nodes) of DSR, learns the routes to other nodes on the route due to source routing information in their RCs. During RD and RM phases, RCing and PSing processes are, respectively, used to get routes from RC of intermediate nodes. This approach is used to quickly access and to solve broken link issues by providing an alternative route. Thus, PSing and RCing mutually reduce the routing overhead in low node densities of 10, 20, and 30 nodes (refer to Figure 5(b)). However, in high densities, intermediate nodes, generating more grat. RREPs, augment routing overhead as shown in Figure 5(b). NL mechanism in all the three protocols augments routing packet cost as shown in Figure 5.

5. Conclusion

In wireless networks, routing protocols are responsible for efficient routing. In this paper, we select three reactive routing protocols: AODV, DSR, and DYMO. These protocols perform two phases for routing: RD and RM. During RM phase, LSM is more important to repair broken routes. We study two mechanisms of LSM: LL and NL feed-backs. A framework is also modelled for energy as well as time costs during RD and RM with LSM mechanism. For analytical comparison of these LSM mechanisms in the selected protocols, three performance metrics are chosen: PDR, E2ED, and NRL using NS-2. From analytical comparison, we deduce that LL mechanism is more suitable for LSM in reactive protocols as compared to NL feed-back mechanism.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

  1. C. Perkins, E. Belding-Royer, and S. Das, IETF RFC3561, “Ad hoc On-Demand Distance Vector (AODV) Routing”, 2003, http://www.ietf.org/rfc/rfc3561.txt.
  2. S. Das, E. Belding-Royer, and C. Perkins, “Ad hoc on demand distance vector (AODV) routing,” Mobile Ad-hoc Network (MANET) Working Group, IETF, 2003. View at: Google Scholar
  3. D. Johnson, Y. Hu, and D. Maltz, “The dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4,” IETF RFC, 2007. View at: Google Scholar
  4. D. Johnson, D. Maltz, and J. Broch, “DSR: the dynamic source routing protocol for multi-hop wireless Ad Hoc networks,” in Ad Hoc Networking, pp. 139–172, 2001. View at: Google Scholar
  5. I. Chakeres and C. Perkins, “Dynamic MANET On-Demand (DYMO) Routing,” IETF Draft Dymo-05, 2006. View at: Google Scholar
  6. R. E. Thorup, Implementing and evaluating the DYMO routing protocol [Ph.D. dissertation], Aarhus Universitet, Datalogisk Institute, 2007.
  7. C. Perkins and P. Bhagwat, “Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers,” in Proceedings of the Conference on Communications Architectures, Protocols and Applications (SIGCOMM '94), vol. 24, pp. 234–244, ACM SIGCOMM Computer Communication Review, 1994. View at: Publisher Site | Google Scholar
  8. M. Gerla, X. Hong, and G. Pei, “Fisheye State Routing Protocol (FSR) for Ad Hoc Networks,” IETF Draft-01, 2000. View at: Google Scholar
  9. G. Pei, M. Gerla, and T. W. Chen, “Fisheye state routing in mobile Ad Hoc networks,” in Proceedings of the IEEE International Conference on Communications (ICC '00), vol. 1, pp. 70–74, June 2000. View at: Publisher Site | Google Scholar
  10. T. Clausen and P. Jacquet, “Optimized link state routing protocol OLSR,” Tech. Rep. IETF RFC-3626, 2003, http://www.ietf.org/rfc/rfc3626.txt. View at: Google Scholar
  11. T. Clausen, P. Jacquet, C. Adjih et al., “Optimized link state routing protocol (OLSR),” 2003. View at: Google Scholar
  12. S. Bitam and A. Mellouk, “Bee life-based multi constraints multicast routing optimization for vehicular ad hoc networks,” Journal of Network and Computer Applications, vol. 36, no. 3, pp. 981–991, 2013. View at: Publisher Site | Google Scholar
  13. S. Bitam, A. Mellouk, and S. Zeadally, “HyBR: a hybrid bio-inspired bee swarm routing protocol for safety applications in Vehicular Ad hoc NETworks (VANETs),” Journal of Systems Architecture, vol. 59, no. 10, pp. 953–957, 2013. View at: Publisher Site | Google Scholar
  14. A. L. S. Orozco, J. G. Matesanz, L. J. G. Villalba, J. D. M. Diaz, and T.-H. Kim, “Security issues in mobile Ad Hoc networks,” International Journal of Distributed Sensor Networks, vol. 2012, Article ID 818054, 6 pages, 2012. View at: Publisher Site | Google Scholar
  15. J. Ben Othman and L. Mokdad, “Enhancing data security in ad hoc networks based on multipath routing,” Journal of Parallel and Distributed Computing, vol. 70, no. 3, pp. 309–316, 2010. View at: Publisher Site | Google Scholar | Zentralblatt MATH
  16. V. Nazari Talooki, J. Rodriguez, and H. Marques, “Energy efficient and load balanced routing for wireless multihop network applications,” International Journal of Distributed Sensor Networks, vol. 2014, Article ID 927659, 13 pages, 2014. View at: Publisher Site | Google Scholar
  17. A. Loutfi, M. Elkoutbi, J. Benothman, and A. Kobbane, “An energy aware algorithm for OLSR clustering,” Annales des Telecommunications/Annals of Telecommunications, vol. 69, no. 3-4, pp. 201–207, 2014. View at: Publisher Site | Google Scholar
  18. N. Javaid, A. Bibi, A. Javaid, Z. A. Khan, K. Latif, and M. Ishfaq, “Investigating quality routing link metrics in wireless multi-hop networks,” Annals of Telecommunications, vol. 69, no. 3-4, pp. 209–217, 2014. View at: Publisher Site | Google Scholar
  19. P. Jacquet and L. Viennot, “Overhead in mobile ad-hoc network protocols,” Rapport de Recherche-Institu National de Recherche en Iformatique et en Automatique, 2000. View at: Google Scholar
  20. I. Park and I. Pu, “Energy efficient expanding ring search,” in Proceedings of the Asia International Conference on Modelling and Simulation, pp. 198–199, 2007. View at: Google Scholar
  21. T. Lin, S. F. Midkiff, and J. S. Park, “A framework for wireless ad hoc routing protocols,” in Proceedings of the Wireless Communications and Networking Conference (WCNC '03), vol. 2, pp. 1162–1167, 2003. View at: Publisher Site | Google Scholar
  22. A. M. Abbas and B. N. Jain, “Path diminution in node-disjoint multipath routing for mobile ad hoc networks is unavoidable with single route discovery,” International Journal of Ad Hoc and Ubiquitous Computing, vol. 5, no. 1, pp. 7–21, 2010. View at: Publisher Site | Google Scholar
  23. M. Saleem, S. A. Khayam, and M. Farooq, “On performance modeling of ad hoc routing protocols,” Eurasip Journal on Wireless Communications and Networking, vol. 2010, Article ID 373759, 13 pages, 2010. View at: Publisher Site | Google Scholar
  24. M. Islam, A. Razzaque, M. R. Bosunia, A. Alamri, and M. M. Hassan, “Link failure and congestion-aware reliable data delivery mechanism for mobile ad hoc networks,” Annals of Telecommunications, vol. 68, no. 9-10, pp. 539–551, 2013. View at: Publisher Site | Google Scholar
  25. M. Saleem, S. A. Khayam, and M. Farooq, “A formal performance modeling framework for bio-inspired ad hoc routing protocols,” in Proceedings of the 10th Annual Cnference on Genetic and Evolutionary Computation, pp. 103–110, ACM, 2008. View at: Publisher Site | Google Scholar
  26. R. H. Khokhar, M. A. Ngadi, M. S. Latiff, and M. A. Amin, “Reactive traffic-aware routing strategy for urban vehicular environments,” International Journal of Ad Hoc and Ubiquitous Computing, vol. 10, no. 3, pp. 149–163, 2012. View at: Publisher Site | Google Scholar
  27. M. A. Iqbal, F. Wang, X. Xu, S. M. Eljack, and A. H. Mohammad, “Reactive routing evaluation using modified 802.11a with realistic vehicular mobility,” Annales des Telecommunications, vol. 66, no. 11-12, pp. 643–656, 2011. View at: Publisher Site | Google Scholar
  28. N. Javaid, A. Bibi, A. Javaid, and S. A. Malik, “Modeling routing overhead generated by wireless reactive routing protocols,” in Proceedings of the 17th Asia Pacific Conference on Communications (APCC '11), pp. 631–636, Sabah, Malaysia, October 2011. View at: Publisher Site | Google Scholar
  29. A. Ariza, A. Trivifio, E. Casilari, J.-C. Cano, C. T. Calafate, and P. Manzoni, “Assessing the impact of link layer feedback mechanisms on MANET routing protocols,” in Proceedings of the IEEE Symposium on Computers and Communications (ISCC '09), pp. 770–775, July 2009. View at: Publisher Site | Google Scholar
  30. J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva, “A performance comparison of multi-hop wireless ad hoc network routing protocols,” in Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 85–97, ACM, 1998. View at: Publisher Site | Google Scholar
  31. R. Castañeda, S. R. Das, and M. K. Marina, “Query localization techniques for on-demand routing protocols in ad hoc networks,” Wireless Networks, vol. 8, no. 2-3, pp. 137–151, 2002. View at: Publisher Site | Google Scholar | Zentralblatt MATH

Copyright © 2015 N. Javaid et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder
Views2306
Downloads694
Citations

Related articles