Multipath Protocol Research Articles

ZBLE: Zone Based Efficient Energy Multipath Protocol for Routing in Mobile Ad Hoc Networks

Mobile ad-hoc networks (MANETs) are groups of independent nodes where the nodes do not feel the need for any infrastructure or central administration mechanism. These notes are self configured and individual. The primary purpose of this type of network is to ensure network quality. Network communication needs to be efficient and effective to achieve this objective. This type of network is formed using dynamic topology. These nodes require batteries to operate. Due to the limited battery capacity and high mobility of wireless networks, nodes present in the network soon lose battery energy. It is extremely valuable to use battery power carefully. The energy strength of the nodes affects the performance of any network. Therefore this energy power should be used in such a way that energy consumption is minimized and the performance of the network can be improved. Through this paper, the performance of the network is improved using a zone-based mechanism, which has been created by modifying the AOMDV protocol, by improving power usage. That protocol Referred to “Zone-Based Leader Election Energy Constrained AOMDV Routing Protocol (ZBLE)”. This protocol makes a great impact on metrics such as energy consumption and network lifetime by using the energy power of nodes in a very efficient manner by selecting the best path from the multipath based on labels, node tracking, and power analysis. A comparison of this protocol is presented by analyzing the performance of the network using NS2.35 from traditional routing protocols i.e. AOMDV and AODV. The ZBLE protocol presents more reliable results from this analysis.

Optimized Scheme to Secure IoT Systems Based on Sharing Secret in Multipath Protocol

Internet of Things (IoT) is a hot and emerging topic nowadays. In the world of today, all kinds of devices are supposed to be connected and all types of information are exchanged. This makes human daily life easier and much more intelligent than before. However, this life mode is vulnerable to several security threats. In fact, the mobile networks, by nature, are more exposed to malicious attacks that may read confidential information and modify or even drop important data. This risk should be taken in consideration prior to any construction of mobile networks especially in the coming 5G technology. The present paper aims to provide a contribution in securing such kinds of environment by proposing a new protocol that can be implemented in ad hoc networks.

System Reliability Assessment of a Fast Retransmit Through ${k}$ Separate Minimal Paths Under the Latency

A fast retransmit, which reduces the sender’s waiting time before retransmitting a lost segment, is applied to guarantee data integrity with no data loss in transmission. Based on fast retransmit, many application protocols have been enhanced and evolved to ensure quality of service and reduce data transmission time. One of application protocols is the multipath transmission control protocol which is catholically applied in modern computer networks. Communication lines used in this kind of network have different states, namely, failure, partial failure, and maintenance. Therefore, a computer network with a fast retransmit can be classified as stochastic and is called a stochastic-flow computer network with a fast retransmit (SCNFR). This paper assesses the system reliability of SCNFR for the successful transmission of demand d through ${k}$ ( ${k} \,\, >1$ ) separate minimal paths ( ${k}$ SMiP) under the latency. An algorithm is proposed to find all minimal capacity vectors (MCVs) that satisfy the demand and latency. Then, the system reliability is computed based on all MCVs. We adopt two practical cases of the pan-European research and education network and the Taiwan academic network to explore the effectiveness of the algorithm. The results show that the system reliability can be classified as decision reference while the manager decides the better ${k}$ SMiP with higher system reliability.

Enhanced handover mechanism using mobility prediction in wireless networks.

The rapid increase in the usage of the mobile internet has led to a great expansion of cellular data networks in order to provide better quality of service. However, the cost to expand the cellular network is high. One of the solutions to provide affordable wireless connectivity is the deployment of a WiFi access point to offload users’ data usage. Nevertheless, the frequent and inefficient handover process between the WiFi AP and cellular network, especially when the mobile device is on the go, may degrade the network performance. Mobile devices do not have the intelligence to select the optimal network to enhance the quality of service (QoS). This paper presents an enhanced handover mechanism using mobility prediction (eHMP) to assist mobile devices in the handover process so that users can experience seamless connectivity. eHMP is tested in two wireless architectures, homogeneous and heterogeneous networks. The network performance significantly improved when eHMP is used in a homogeneous network, where the network throughput increases by 106% and the rate of retransmission decreases by 85%. When eHMP is used in a heterogeneous network, the network throughput increases by 55% and the retransmission rate decreases by 75%. The findings presented in this paper reveal that mobility prediction coupled with the multipath protocol can improve the QoS for mobile devices. These results will contribute to a better understanding of how the network service provider can offload traffic to the WiFi network without experiencing performance degradation.

An efficient energy aware link stable multipath routing protocol for mobile ad hoc networks in urban areas

Ad Hoc wireless mobile networks are characterized by a lack of central administration and the fact that any element of the network, being very mobile, is susceptible to disappear. In an Ad Hoc network, all the elements must cooperate in order to establish a temporary network to communicate. This communication is affected by the links stability mainly in a restricted environment such as a city and the depletion of the batteries energy of the nodes. These factors degrade the ad hoc networks performance. We propose in this paper a stable routing protocol with weak energy consumption for urban areas in order to improve these performances. The proposed solution is a multipath protocol named ESMRua (Efficient energy aware and Link Stable Multipath Routing Protocol in urban areas). ESMRua uses a path selection scheme based on energy constraint, signal quality and link stability. For the link stability, three calculation variants are used. ESMRua will be designed for realistic mobility, contrary to the main existing protocols which are designed to the random mobility models; these models have unrealistic behaviors such as a brusque acceleration and a sudden stop. Simulation results show that our multipath protocol enhances the performance of the ad hoc networks, mainly in terms of routing overhead, energy consumption and network reliability.

Analysis of Congestion Control for Multipath Transmission Control Protocol: Challenges and Solutions

Multipath Transmission Control Protocol has turned into an intriguing matter in today’s protocol stack. With the development of rising technologies, it is the most noteworthy expansion of Transmission Control Protocol. A cell phone normally supports both a 2G/3G/4G connectivity and a wireless connectivity. Limitation of Transmission Control Protocol particularly in a mobile environment is that it does not handle mobility very well. Multipath Transmission Control Protocol resolves the shortcomings of Transmission Control Protocol. It allows multihoming simultaneously. Here multiple network links act as a single link and a single stream of data is divided into subflows across multiple networking paths. This has clear advantages for reliability and it can prompt more productive utilization of networking resources. But Multipath Transmission Control Protocol is far away from being a flawless protocol. The significant issues are the congestion control and the reordering of the packet at the destination. Congestion control and packet reordering in this protocol have been very complex so far but if it’s not considered, it can radically influence the throughput for the protocol. Therefore, in this work, we will find various problems for congestion control and packet reordering techniques in Multipath Transmission Control Protocol and also, we will discuss possible solutions for these problems.

Multipath Mobile Internet Protocol for Mobility Networks

The internet data traffic is rapidly increases by twofold or even more in the near future. Most of the data traffic are generated from mobile devices. Due to this explosion of data traffic, existing network architecture is incapable in handling such a massive data traffic. The Network Mobility Basic Support Protocol (NEMO-BSP) is an extended version of Mobile Internet Protocol (MIPv6) that is designed to support seamless communications between homogenous and heterogeneous network domains. But NEMO-BSP is suffer very high binding and tunnel cost. The Proxy Mobility Scheme Protocol (PMIPv6) was developed to overcome issues of binding and tunnel cost. There have been many attempts to reduce the binding and tunnel cost. In this research work a multipath mobile IP protocol is designed that divides data packets on multiple paths (data packers on multiple sub-flows) without tunnel formation in the mobile network environment. the Multiple Mobile Internet Protocol Scheme (MMIPS). The network is divided into domain zones called intra-domain and inter-domain zones. The proposed protocol is aimed to remove the tunnel burden and reduce the packet size which significantly reduce the binding and tunnel cost. An analytical result are show that the proposed scheme binding and packet cost is less than compared schemes.

An Upward Max-Min Fairness Multipath Flow Control

Many rate allocation algorithms for multipath flows which satisfy max-min fairness are centralized and not scalable. Upward max-min fairness is a well-known relaxation of max-min fairness and can be achieved by an algorithm extended from water-filling algorithm. In this paper, we propose a price-based multipath congestion control protocol whose equilibrium point satisfies upward max-min fairness. Our protocol is derived from a network utility maximization model for multipath flows.

Optimizing Energy Utilization in Ant Based Multipath Routing

Energy is an important resource in the field of Mobile Ad hoc Networks (MANETs). Limited energy at a particular node may lead to failure of a route in MANETs. The energy is consumed each and every time a node participates in transmission and forwarding of the packets. Controlling the number of packets to be forwarded through a particular node i.e. controlling participation of a node as an intermediate node may improve the overall energy state of the network. Ant colony Based Energy Efficient Routing Protocol (ACBEEMR) works on this principal and controls the number of packets to be forwarded through a particular node. For achieving this goal, it uses a threshold value known as energy factor. ACBEEMR utilizes the benefits of Ant Colony Optimization along with the feature of being an energy efficient protocol. In this paper, a modified variant of ACBEEMR i.e. MACBEEMR with some added functionalities has been introduced. This variant of ACBEEMR aims to increase the lifetime of the network. The Modified ACBEEMR (MACBEEMR) has also been compared with other multipath protocols.

Improving the Network Performance using MP-OLSR Protocol for Wireless Ad Hoc Network (MANET)

MP-OLSR is the abbreviation of Multipath (Optimized Link source Routing) Protocol which is also known as hybrid protocol, that helps to increase the path in OLSR which clearly works on “proactive routing protocol” specifically developed for Ad Hoc Networks. Wireless Ah Hoc Networks are one among the emerging technology with many operations. This network has some uniquecharacteristics like shared co-operation, dynamic topology and wireless medium.MP-OLSR protocol has the potential to achieve dynamic exchange of data without relying on one base station or a backbone wired network and it is also capable of handling the intermittent exchange of data to manage the topology information for the network also it maintains the design of on-demand routing table and the packets will be forwarded to multiple paths. Here, we propose an idea for enhancing the Multipath-OLSR by using Clustering Algorithm which helps to avoid link failure and recovering the route and also routing protocol to reduce traffic delay and overhead of network that eventually increases the throughput and delivery ratio of a packet.

Channel Busyness Based Multipath Load Balancing Routing Protocol for Ad hoc Networks

Mobile ad hoc networks or MANETs are wireless networks designed to allow communication between mobile wireless nodes. In dense network areas, MANETs suffer mainly from frequent link failures and longer delays. These dense network areas are generally located in the core of the network, where the number of nodes as it is for network traffic is higher. A new parameter to measure the centrality of the network based on the channel busyness ratio is proposed. The proposed protocol called CBMLB is an enhancement of the already existing multipath protocol AOMDV. CBMLB tries to reduce load on central congested nodes that have a raised channel busyness ratio, by distributing load among available alternative paths. The proposed protocol relies on the least congested disjoint paths to route packets. A performance comparison with AODV, AOMDV and QMLB protocols shows that CBMLB performs well in terms of packet delivery ratio, end to end delay and communication overhead.

A Multi-Layer Self-Healing Algorithm for WSNs

The implementation of Wireless Sensor Networks (WSNs) is a challenging task due to their intrinsic characteristics, e.g., energy limitations and unreliable wireless links. Considering this, we have developed the Disjoint path And Clustering Algorithm (DACA) that combines topology control and self-healing mechanisms to increase the network lifetime with minimum loss of coverage. Initially, DACA constructs a tree that includes all nodes of the network by using the Collection Tree Protocol (CTP). This tree is an initial communication backbone through which DACA centralizes the information. Then, DACA builds a set of spatial clusters using Kmeans and selects the Cluster Heads (CHs) using Particle Swarm Optimization (PSO) and a multi-objective optimization (MOO) function. Subsequently, DACA reconstructs the tree using only the CHs. In this way, DACA reduces the number of active nodes in the network and saves energy. Finally, DACA finds disjoint paths on the reconstructed tree by executing the N-to-1 multipath discovery protocol. By doing so, the network can overcome communications failures with a low control message overhead. The simulations on Castalia show that DACA considerably extends the network lifetime by having a set of inactive nodes and disjoint paths that support the communication when active nodes die. Besides, DACA still maintains a good coverage of the area of interest despite the inactive nodes. Additionally, we evaluate the shape of the tree (i.e., the average number of hops) and the risk of connection loss of the network.

Security Enhanced Location-aided Level-based Disjoint Multipath Routing Algorithm for Mobile Ad Hoc Networks

In mobile ad hoc networks (MANET), the location-based multipath routing protocols involves less routing overhead compared to non-location-based protocols. This paper proposes two location-based algorithms, Enhanced Location-aided Level-based node Disjoint Multipath routing (ELLDMR) and Secure Location-aided Level-based node Disjoint Multipath routing (SLLDMR), to enhance the link lifetime and the security of the MANET. The objective of ELLDMR is to build multiple paths with non-critical nodes so that the lifetime of the routing path is significantly increased. It also hides the source, destination and path identity in intermediate nodes to avoid intrusion of routing attacks in the routing path. The SLLDMR is an enhancement over ELLDMR where it aims to overcome rushing attack and exhibit secure data transmission using two-level cryptographic processes. The performances of ELLDMR and SLLDMR are simulated using NS2 where it shows a minimum routing overhead, less end to end delay and high packet delivery compared to existing Location-aided Level-based node Disjoint Multipath routing (LLDMR) algorithm and Topology Hiding multipath protocol (TOHIP).

Low-Latency Scheduling in MPTCP

The demand for mobile communication is continuously increasing, and mobile devices are now the communication device of choice for many people. To guarantee connectivity and performance, mobile devices are typically equipped with multiple interfaces. To this end, exploiting multiple available interfaces is also a crucial aspect of the upcoming 5G standard for reducing costs, easing network management, and providing a good user experience. Multi-path protocols, such as multi-path TCP (MPTCP), can be used to provide performance optimization through load-balancing and resilience to coverage drops and link failures, however, they do not automatically guarantee better performance. For instance, low-latency communication has been proven hard to achieve when a device has network interfaces with asymmetric capacity and delay (e.g., LTE and WLAN). For multi-path communication, the data scheduler is vital to provide low latency, since it decides over which network interface to send individual data segments. In this paper, we focus on the MPTCP scheduler with the goal of providing a good user experience for latency-sensitive applications when interface quality is asymmetric. After an initial assessment of existing scheduling algorithms, we present two novel scheduling techniques: the block estimation (BLEST) scheduler and the shortest transmission time first (STTF) scheduler. BLEST and STTF are compared with existing schedulers in both emulated and real-world environments and are shown to reduce web object transmission times with up to 51% and provide 45% faster communication for interactive applications, compared with MPTCP's default scheduler.

Priority-based bandwidth allocation and load balancing for multipath IP networks

Frequent route failures are common in a multipath internet protocol (IP) network. Backup configuration is one of the techniques used to re-establish alternate path in case of route failure. The existing multi route configurations (MRC) for fast IP network does not address quality of service (QoS) issues such as bandwidth optimisation and load balancing with traffic shaping. There is a need to focus on priority-based routing and load balancing during congestion in multipath networks. In this paper, we are proposing a priority-based bandwidth allocation and load balancing (PBALB) approach for multipath routing. In order to reduce packet drop and to enhance fairness, throughput and lower delay transmissions, traffic shaping based on different type of traffic flows in differential service domain is proposed. Experimental result shows that the proposed PBALB technique improves the throughput compared to MRC.

Performance comparison between progressive mobility prediction using hidden Markov model and multipath transmission control protocol

Performance comparison between progressive mobility prediction using hidden Markov model and multipath transmission control protocol

MFAST: A Multipath Congestion Control Protocol for High Bandwidth-Delay Connection

Today, the smart devices are usually equipped with more than one network interfaces. A multipath congestion control protocol that exploits different paths to transmit data will improve the throughput and high-availability. Many multipath congestion control protocols have been developed in the literature. However, most of them are loss-based algorithms, hence they do not well utilize the bandwidth in high bandwidth-delay product (BDP) connections due to the conservative congestion control. From the single-path Fast TCP, we develop a multipath congestion control protocol, called mFast, for high BDP connections. MFast uses queueing delay to measure the congestion as Fast TCP does. Our framework is based on a network utility maximization model for multipath flows. The features of mFast such as load-balancing, TCP friendliness, and throughput improvement are verified via analysis and extensive simulations.

Collaboration of Trusted Node and QoS Based Energy Multi Path Routing Protocol for Vehicular Ad Hoc Networks

In the recent past information transmission through the vehicular ad hoc network (VANET) playing a vital role due to increase in accident statistics. There are numerous networking and VANET protocols helpful to control the trust while transmitting the data from source to destination nodes in traffic environment. In spite of many existing protocols for analyzing the trust in the network, the challenge of routing overhead, high energy consumption and malicious attacks issues still continue in the communication. This research introduces the trust collaboration nodes and Quality of Service (QoS) with energy multipath routing protocol for transmitting the information through VANET. Initially, the trusted nodes have been collected for analyzing the neighbouring nodes and the information are transmitted using the proposed QoS based energy efficient multipath routing protocol. During this transmission, the multi path protocol eliminates the intermediate attacks effectively when compared with the other existing protocols. The Proposed protocol maintains the QoS while routing the information from source to destination and further the efficiency has been analyzed through simulation experiments and Montgomery multiplier based Elliptic Curve Cryptography (ECC) will be used in future for better security and privacy.

Network Life Time maximization of the AOMDV Protocol Using Nodes Energy Variation

Mobile ad hoc network presents generally several challenges such as high dynamic topology, packet loss and frequent routes discovering that result in low throughput and reduced packet delivery ratio. To reduce the number of route discovering process, multipath routing protocols makes use of alternate paths to continue packets transmission. Ad Hoc On-demand, multipath distance vector routing protocol or AOMDV, is one of the well-known multipath protocols that relays on the hop count metric to route packets. However maintaining disjoint active routes can reduce nodes life time and lead to more control messages like error and discovering packets. In this paper, a pre-emptive approach is proposed based on the historical values of nodes energy. Nodes that excessively consume energy in time are considered overloaded and are excluded from route discovering, hence nodes with reduced energy variation are selected to route packets. Simulation results show reduced number of dead nodes by 30 %, overhead by 16%.

Interference-aware multipath routing for WSNs: Overview and performance evaluation

Multipath routing holds a great potential to provide sufficient bandwidth to a plethora of applications in wireless sensor networks. In this paper, we consider the problem of interference that can significantly affect the expected performances. We focus on the performance evaluation of the iterative paths discovery approach as opposed to the traditional concurrent multipath routing. Five different variants of multipath protocols are simulated and evaluated using different performance metrics. We mainly show that the iterative approach allows better performances when used jointly with an interference-aware metric or when an interference-zone marking strategy is employed. This latter appears to exhibit the best performances in terms of success ratio, achieved throughput, control messages overhead as well as energy consumption.