Delay Aware Multipath Switching Zone Traversal (MSZT)

Delay Aware Multipath Switching Zone Traversal (MSZT) Approach for MANET
Abstract
Route discovery and data transmission in Mobile Ad-Hoc networks (MANETs) are the key procedures which influence the performance of the network. The data transmission through the discovered route with in minimum delay is considered as a major problem in the MANET. Hence this paper proposed an approach called Multipath Switching Zone Traversal (MSZT) approach to minimize average delay. In this approach, the broadcast has been converged to two zones after the initial broadcasting in order to minimize the broadcast delay. Based on the data size and the Time to Live (TTL), the data transmission is initiated via multipath or single path. Game theory approach (GTA) is a powerful mathematical tool for analyzing the strategic communications among several decision makers. Hence this paper utilizes the GTA for switching the path between inter-zonal and intra-zonal nodes for different source data to provide a successful data transmission. The simulation results show that the approach is efficient in terms of delay, packet delivery ratio, and localization error when compared to the existing approaches.
Keywords: Routing, MANET, MSZT, game theory approach, delay
1. Introduction
A multi-hop wireless Ad hoc network (MANET) is composed of mobile nodes, which can communicate without any aid of centralized Infrastructure (T.Durga , 2015) The demand of different multimedia applications such as surveillance system and video on demand service over MANET has been increasing rapidly in recent years. However, it is not easy to support the data transmission according to the end-to-end delay requirements over MANETs. A number of routing protocols have been proposed for Ad hoc mobile networks to improve the QoS ((K.S.Dinesh , 2014).

Get Help With Your Essay
If you need assistance with writing your essay, our professional essay writing service is here to help!
Essay Writing Service

Most of the routing protocols use the minimum hop numbers as a metric of route cost while taking routing decisions. However they ignore the some important link capacity properties because of simplicity and ease of implementation. Each node in the network may have different traffic load and hence, nodes which have more active neighbors may experience more collisions (Rakesh Kumar, et, al., 2010). Uncertainly some of the over loaded nodes may fall on the minimum hop route, it may considerably introduce a longer delay, even though the number of nodes in the chosen route is minimum. In addition, if some of the over loaded nodes are congested; it may result in huge packet drop rates and consequent retransmission. This may increase the end – to – end delay between two end points.
Thus in this paper Multipath Switching Zone Traversal (MSZT) routing approach has been proposed in order to reduce average delay. The approach reduces the number of broadcast after the initial broadcast in the network. Multipath data transmission is enabled based on the TTL and the data size. The game theory approach is used to switch the path between inter-zonal and intra-zonal nodes for different source data, which is a powerful mathematical tool. The path switching while during the data transmission provides a successful data transmission by checking the path availability. Thus this approach enhance the QoS demanded MANET applications
The rest of the paper is organized as follows: Section 2 presents the recent related work on the delay aware MANET. Section 3 describes the system model of the proposed Multipath Switching Zone Traversal (MSZT) routing approach. The explanation of the Multipath Switching Zone Traversal (MSZT) routing approach is presented in the section 4. Section 5 describes the simulation results. Finally, section 6 renders the conclusion
2. Related Work
(Saad M. Adam, et, al., 2013) presents an reactive routing protocols overview in terms of QoS requirements in MANET. Due to the requirements has been fulfilled for the commercial, real-time, and multimedia applications in MANET. The delay has been considered as one of the important QoS metric to satisfy the application requirements.
The delay optimization approach has been presented by the authors (Syed Jalal Ahmad, et, al., 2015) for multimedia application in MANET. The Knapsack algorithm is used for buffer management to maximize and minimize the in order and out order packets simultaneously. The buffer internals are exploited and the adjusting the buffer usage dynamically makes the node to transmit the packet in the preferred order to its successive nodes. The simulation results show that the approach transmits multimedia data packet without loss and in minimum delay.
(K. Sasikala,et, al., 2014) proposed the finite state machine for queue and transmission management mechanism to minimize the packet delay time in MANET. Information about the delay for each data flow in the queue is maintained in a node. A timer is fixed to each flow in a node and it has been updated dynamically. Based on the nodes characteristics the queue is controlled to minimize the packet delay.
(Obaidat, M, et, al., 2011) proposes a multipath routing protocol for MANETs. The protocol establishes the route, which having the lowest delays relied upon the communication of various layers. The performance of the protocol is compared with the AODV and AOMDV.
(V. R. Budyal and S. S. Manvi, 2013) presents a clever agent based on-demand QoS routing methodology in MANET. The intelligent agent utilizes the neuro-fuzzy logic aided by Q-learning. The DSR protocol has been enhanced to discover all the multiple paths and the condition of the path from source to destination. The fuzzy membership function has been optimized by the software agents and if then rules are made to take decision in the system.
A cross layer design is made for delay concerned Node Disjoint Multipath AODV in Ad Hoc Network by the author (GawasMahadev A, et,al., 2014). The channel and link information has been obtained by applying the cross layer design between the MAC and routing layer. The path status has been updated subsequently by concerning the lowest delay attained at each intermediate node. The protocol is compared with the AODV and NMDR and it perform better than the other two in terms of routing overhead and packet delivery ratio.
3. Multipath Switching Zone Traversal (MSZT)
The Multipath Switching Zone traversal routing approach is proposed in this paper to minimize the average delay in the network. The approach is implemented after the initial broadcast from the source. The MSZT is composed of two parts such as route discovery and path switching.
3.1 Route Discovery
During the initial broadcast the source node obtains the information about the location of the destination node by using the GPS service. After the initial broadcast, the source node divides its communication range into four equal zones for further broadcasting. The node broadcast the RREQ message through one or at most 2 zones, where the broadcast should be destination oriented zone based on the location information of the destination node. Only one node must be selected in each zone for forwarding the broadcast. Alike the source node, the forwarding node also divides its communication range into four equal zones and forward the broadcast in the same manner. The process will take place until the destination node is reached.
Before the data transmission via the shortest path, the Expected Transmission Time (ETT) and the TTL value has to be estimated to enable multipath through the different zones in order of increasing the packet delivery factor (PDF).
Expected Transmission Time (ETT) is the time taken for transmitting a data packet successfully to the destination. The ETT is estimated based on the data size of a packet.
(1)
Here ETX is the expected transmission count i.e. expected number of transmissions that a node needs to transmit a packet successfully to a neighbor. The ETX can be estimated as follows
(2)
Where dforward is the received probes from a A dreverse is the received probes from B
Where t is the average time a single data packet requires to be delivered and the t can be estimated as follows
(3)
The maximum Time to Live (TTL) is a timer data part in the IP header which specifies RREQ packet life time before it is discarded (Cheng-Yuan Ho,et, al., 2007). All the RREQ fields in its route cache have been maintained in order to find the route minimum Time to Live (TTL) value after TTL time expires and the information about the TTL is available in the RREP packet.
If the ETT is greater than the TTL, then the packets are fragmented and then the packet has been transmitted over the multiple paths.
3.2 Path Switching Algorithm based on the Game theory Approach
Game theory is a mathematical tool for analyzing and estimating how a person behaves in strategic situations. The game is composed of three fundamental components: a set of players, a set of strategies, and a set of payoffs. Nodes (players) are the decision takers in the game. The strategies are the various options available to nodes such as (TTL, node availability) (Badr Benmammar, Francine Krief, 2014). At last the utility function (payoffs) make a choice of all possible outcomes for each player. The components of the proposed game theory approach are given in the table 1.

Components of a game

Elements of a wireless network

Players

nodes

Strategies

Multiple path

Payoffs

TTL, node availability

Table 1 Components of the proposed Game Theory Approach
After each transmission, the next hop zonal node must update the path availability (zone availability) to its predecessor node. The competition is between the multiple paths available between the source nodes to the destination node. After each successful data transmission the payoff is considered such as the availability and the TTL in order to stay on the same path otherwise path is switched to the next highest probability value of the available path.
For each available path a probability value is estimated and it is formulated as follows
(4)
Here the total hops is the number of hops in the path and the not available hops is the number of hop which is not available for next data transmission due to the reason “the node is available for other source node in the network”. This information is updated to the source after each successful transmission. The proposed path switching algorithm based on the game theory approach is shown in the figure 1.

For each source node after each successful data transmission

{

For each available multiple path

{

Next hop zonal node must update the path availability (zone availability) to its predecessor node.

Calculate the not available node based on the collected zone availability information from all the predecessor node

Calculate the probability value using equation 4

}

Switch over the path based on the probability value of each path

}

Figure 1 Path switching algorithm based on the game theory approach
5. Simulation Results
The proposed Multipath Switching Zone Traversal (MSZT) routing approach make an effort to minimize average end to end delay to enhance the network performance. The NS2 simulation has been adopted to evaluate the performance of the MSZT approach and the simulation setup is shown in the table 2. The performance of the MSZT is compared with other existing approach such as Zone Tree Routing (ZTR), Path State Routing (PSR). The metrics used to measure the performance of the proposed approach are broadcast delay, localization error and packet delivery factor.

Simulation Parameter

Value

Simulator

NS-2

Topology size

500×500

Number of nodes

50,100, 150, 200

Transmission range

250 m

Traffic type

CBR

Packet size

512 bytes

Pause time

0s

Min speed

1 m/s

Max speed

5 m/s

MAC protocol

IEEE 802.11

Simulation time

100s

Table 2 Simulation Setup
A. Performance metrics
Broadcast Delay:
Broadcasting is the fundamental process where the probe transmission from the source to all other forwarding nodes to arrive at the destination. The broadcast delay is the difference between the packet receiving time (prt) by destination and the packet transmitted time (ptt) from the source node.
(5)
Localization Error:
Localization error (LE) is accounted as a one of the performance metric in the scattered network and it yields the LE of a node.
(6)
Where EMax is the maximum LE
(7)
(8)
Where a is the radius based on the communication range of node i in a network model and it can be determined as follows
(9)
Where N is the number of nodes A is the area of the network and is the connectivity order ie the number of neighbor nodes linked to the node i
The average value of LE for a network can be determined as follows
(10)
Packet Delivery Factor
Packet delivery factor is defined as the ratio of the number of packet arrived at the destinations to those transmitted data packets by the source.
(11)
B. Discussion
In the proposed approach the broadcast delay has been minimized by converging the broadcasting to one or at most two zones. The nodes distance increases then the broadcast delay increases simultaneously. Figure 2 shows the broadcast delay concerning the distance. The broadcast delay attained by the proposed MSZT for 10 m distance is 15 ms, while the PSR and the ZTR incurred 16ms, 19ms.

Figure 2 Broadcast delay
The localization is directed in our approach by broadcasting towards the destination oriented zones after the initial broadcast. The increase in distance between the nodes affects the localization error. Figure 3 shows the localization error concerned with the distance. The localization error attained by the proposed MSZT for 10 m distance is 2%, while PSR and ZTR attained 16%, 18%.

Figure 3 Localization error
The multipath switching algorithm in the proposed approach improves the packet delivery factor by considering the TTL and path availability. When the number of group (paths) involved in the data packet transmission increases then the packet delivery factor (PDF) will decrease. While in the proposed a minimum number of zones have been utilized than the existing methods in the network. Figure 4 shows the packet delivery considering the number of groups. For 2 groups the proposed approach MSZT acquired 0.94, while the PSR and ZTR incurred 0.91, 0.83.

Figure 4 Packet Delivery Factor
6. Conclusion
This paper proposes a Multipath Switching Zone Traversal (MSZT) routing approach for achieving a minimum average delay in a network. The number of broadcast has been converged to two zones after initial broadcast in order to minimize the broadcast delay. Multiple paths have been selected through different nodes presents in different zone. While during data transmission the TTL and the data size has been checked to provide a successful data transmission with minimum transmission delay. Furthermore a game theory approach based path switching algorithm has been proposed after each successful data transmission to improve the delay metric for each data transmission. The simulation results show that the proposed routing approach performs better than the existing approaches in terms of Localization error, broadcast delay and Packet delivery factor
References
1.Syed Jalal Ahmada , V.S.K. Reddyb, A. Damodaramc and P. RadhaKrishnad, “ Delay optimization using Knapsack algorithm for multimedia traffic over MANETs”, Expert Systems with Applications, Elsevier, vol 42, issue 20, pages 6819-6827.
2. K. Sasikala, Dr. R. S. D. Wahidabanu, “ Adaptive packet scheduling technique to minimize the packet delay time in MANET by maintaining a Queue for each flow through FSM Mechanism”, Journal of Convergence Information Technology(JCIT), Vol 9, No 3, 2014.
3. Saad M. Adam , Rosilah Hassan, “Delay aware Reactive Routing Protocols for QoS in MANETs: a Review”, Journal of Applied Research and Technology, Elsevier, vol 11, issue 6, pages 844-850, 2013.
4. Obaidat M, Ali M.A, Obaidat M.S, Obeidat S, Shahwan I, “A Novel Multipath Routing Protocol for MANETs”, International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM), pages 1-6, 2011.
5. Cheng-Yuan Ho, Yaw-Chung Chen, and Cheng-Yun Ho, “Improving Performance of Delay-Based TCPs with Rerouting”, International conference on Communication letters, IEEE, vol 11, no 1, 2007.
6. Badr Benmammar, Francine Krief, “Game theory applications in wireless networks: A survey” International Conference on Software Engineering, Applications of Information Systems in Engineering and Bioscience, 2014.
7. V. R. Budyal and S. S. Manvi, “Intelligent Agent Based Delay Aware QoS Unicast Routing in Mobile Ad hoc Networks”, International Journal of Multimedia and Ubiquitous Engineering, vol 8, no 1, 2013.
8. GawasMahadev A, Gudino, Lucy J, Anupama K. R, Rodrigues, Joseph, “A Cross-Layer Delay-Aware Node Disjoint Multipath Routing Algorithm For Mobile Ad Hoc Networks”, International Journal of Wireless & Mobile Networks, vol 6, issue 3, page 39, 2014.
11. K.S.Dinesh , “Routing Overhead Reduction and Selection of Stable Paths in MANET”, International Journal of Inventions in Computer Science and Engineering (IJICSE), vol 1, issue 9, pages 2348-3539, 2014.
12. T.Durga , “Maximizing the Network Lifetime by Using a Mobile Aware Topology Control Algorithm in MANET”, Journal of Recent Research in Engineering and Technology, pages 2349-2252, vol 2, issue 3, 2015.
13. Rakesh Kumar, Manoj Misra and Anil K. Sarje, “A Simplified Analytical Model for End-To-End Delay Analysis in MANET”, International Journal Computer Application (IJCA), no 4, article 6, 2010.