Evaluation of the Effects of Predicted Associativity on the Reliability and Performance of Mobile Ad Hoc Networks

Routing in Mobile Ad Hoc Networks (MANETs) presents unique challenges not encountered in conventional networks. Predicted Associativity Routing (PAR) is a protocol designed to address reliability in MANETs. Using associativity information, PAR calculates the expected lifetime of neighboring links. Nodes use this expected lifetime, and their neighbor\u27s connectivity to determine a residual lifetime. The routes are selected from those with the longest residual lifetimes. In this way, PAR attempts to improve the reliability of discovered routes. PAR is compared to AODV using a variety of reliability and performance metrics. Despite its focus on reliability, PAR does not provide more reliable routes. Rather, AODV produces routes which last as much as three times longer than PAR. However, PAR delivers more data and has greater throughput. Both protocols are affected most by the node density of the networks. Node density accounts for 48.62% of the variation in route lifetime in AODV, and 70.66% of the variation in PAR. As node density increases from 25 to 75 nodes route lifetimes are halved, while throughput increases drastically with the increased routing overhead. Furthermore, PAR increases end-to-end delay, while AODV displays better efficiency

Exploiting the power of multiplicity: a holistic survey of network-layer multipath

The Internet is inherently a multipath network: For an underlying network with only a single path, connecting various nodes would have been debilitatingly fragile. Unfortunately, traditional Internet technologies have been designed around the restrictive assumption of a single working path between a source and a destination. The lack of native multipath support constrains network performance even as the underlying network is richly connected and has redundant multiple paths. Computer networks can exploit the power of multiplicity, through which a diverse collection of paths is resource pooled as a single resource, to unlock the inherent redundancy of the Internet. This opens up a new vista of opportunities, promising increased throughput (through concurrent usage of multiple paths) and increased reliability and fault tolerance (through the use of multiple paths in backup/redundant arrangements). There are many emerging trends in networking that signify that the Internet's future will be multipath, including the use of multipath technology in data center computing; the ready availability of multiple heterogeneous radio interfaces in wireless (such as Wi-Fi and cellular) in wireless devices; ubiquity of mobile devices that are multihomed with heterogeneous access networks; and the development and standardization of multipath transport protocols such as multipath TCP. The aim of this paper is to provide a comprehensive survey of the literature on network-layer multipath solutions. We will present a detailed investigation of two important design issues, namely, the control plane problem of how to compute and select the routes and the data plane problem of how to split the flow on the computed paths. The main contribution of this paper is a systematic articulation of the main design issues in network-layer multipath routing along with a broad-ranging survey of the vast literature on network-layer multipathing. We also highlight open issues and identify directions for future work

Recent Trends in Communication Networks

In recent years there has been many developments in communication technology. This has greatly enhanced the computing power of small handheld resource-constrained mobile devices. Different generations of communication technology have evolved. This had led to new research for communication of large volumes of data in different transmission media and the design of different communication protocols. Another direction of research concerns the secure and error-free communication between the sender and receiver despite the risk of the presence of an eavesdropper. For the communication requirement of a huge amount of multimedia streaming data, a lot of research has been carried out in the design of proper overlay networks. The book addresses new research techniques that have evolved to handle these challenges

Hierarchical routing protocols for wireless sensor network: a compressive survey

Wireless Sensor Networks (WSNs) are one of the key enabling technologies for the Internet of Things (IoT). WSNs play a major role in data communications in applications such as home, health care, environmental monitoring, smart grids, and transportation. WSNs are used in IoT applications and should be secured and energy efficient in order to provide highly reliable data communications. Because of the constraints of energy, memory and computational power of the WSN nodes, clustering algorithms are considered as energy efficient approaches for resource-constrained WSNs. In this paper, we present a survey of the state-of-the-art routing techniques in WSNs. We first present the most relevant previous work in routing protocols surveys then highlight our contribution. Next, we outline the background, robustness criteria, and constraints of WSNs. This is followed by a survey of different WSN routing techniques. Routing techniques are generally classified as flat, hierarchical, and location-based routing. This survey focuses on the deep analysis of WSN hierarchical routing protocols. We further classify hierarchical protocols based on their routing techniques. We carefully choose the most relevant state-of-the-art protocols in order to compare and highlight the advantages, disadvantage and performance issues of each routing technique. Finally, we conclude this survey by presenting a comprehensive survey of the recent improvements of Low-Energy Adaptive Clustering Hierarchy (LEACH) routing protocols and a comparison of the different versions presented in the literature

A Study of Routing Protocols for Ad-Hoc Network Based on Named Data Networking

電気通信大学202

Techniques to enhance the lifetime of mobile ad hoc networks

Devices in Mobile Ad Hoc Networks (MANETs) are mostly powered by battery. Since the battery capacity is fixed, some techniques to save energy at the device level or at the protocol stack should be applied to enhance the MANETs lifetime. In this thesis, we have proposed a few energy saving approaches at the network layer, and MAC layer. First, we proposed a routing technique, to which the following metrics are built into: (i) node lifetime, (ii) maximum limit on the number of connections to a destination, and (iii) variable transmission power. In this technique, we consider a new cost metric which takes into account the residual battery power and energy consumption rate in computing the lifetime of a node. To minimize the overutilization of a node, an upper bound is set on the number of connections that can be established to a destination. The proposed technique is compared with AODV [1] and LER [2]. It outperforms AODV and LER in terms of network lifetime. Next, a technique called Location Based Topology Control with Sleep Scheduling (LBTC) is proposed. It uses the feature of both topology control approach in which the transmission power of a node is reduced, and power management approach in which nodes are put to sleep state. In LBTC the transmission power of a node is determined from the neighborhood location information. A node goes to sleep state only when: (i) it has no traffic to participate, and (ii) its absence does not create a local partition. LBTC is compared with LFTC [3] and ANTC [4]. We observed that the network lifetime in LBTC is substantially enhanced. A framework for post-disaster communication using wireless ad hoc networks is proposed. This framework includes: (i) a multi-channel MAC protocol, (ii) a node-disjoint multipath routing, and (iii) a distributed topology aware scheme. Multi-channel MAC protocol minimizes the congestion in the network by transmitting data through multiple channels. Multipath routing overcomes the higher energy depletion rate at nodes associated with shortest path routing. Topology aware scheme minimizes the maximum power used at node level. Above proposals, taken together intend to increase the network throughput, reduce the end-to-end delay, and enhance the network lifetime of an ad hoc network deployed for disaster response

Energy efficient chain based routing protocol for deterministic node deployment in wireless sensor networks

Wireless Sensor Network (WSN) consists of small sensor devices, which are connected wirelessly for sensing and delivering specific data to Base Station (BS). Routing protocols in WSN becomes an active area for both researchers and industrial, due to its responsibility for delivering data, extending network lifetime, reducing the delay and saving the node’s energy. According to hierarchical approach, chain base routing protocol is a promising type that can prolong the network lifetime and decrease the energy consumption. However, it is still suffering from long/single chain impacts such as delay, data redundancy, distance between the neighbors, chain head (CH) energy consumption and bottleneck. This research proposes a Deterministic Chain-Based Routing Protocol (DCBRP) for uniform nodes deployment, which consists of Backbone Construction Mechanism (BCM), Chain Heads Selection mechanism (CHS) and Next Hop Connection mechanism (NHC). BCM is responsible for chain construction by using multi chain concept, so it will divide the network to specific number of clusters depending on the number of columns. While, CHS is answerable on the number of chain heads and CH nodes selection based on their ability for data delivery. On the other hand, NHC is responsible for next hop connection in each row based on the energy and distance between the nodes to eliminate the weak nodes to be in the main chain. Network Simulator 3 (ns-3) is used to simulate DCBRP and it is evaluated with the closest routing protocols in the deterministic deployment in WSN, which are Chain-Cluster Mixed protocol (CCM) and Two Stage Chain based Protocol (TSCP). The results show that DCBRP outperforms CCM and TSCP in terms of end to end delay, CH energy consumption, overall energy consumption, network lifetime and energy*delay metrics. DCBRP or one of its mechanisms helps WSN applications by extending the sensor nodes lifetime and saving the energy for sensing purposes as long as possible