The Routing Protocol Efficiency of Named Data Network

In recent times, different routing protocols have been proposed in the Internet of Things enabled Underwater Wireless Sensor Networks (IoT-UWSNs) to explore the underwater environment for different purposes, i.e., scientific and military purposes. However, high Energy Consumption (EC), End to End (E2E) delay, low Packet Delivery Ratio (PDR) and minimum network lifetime make the energy efficient communication a challenging task in Underwater Wireless Sensor Network (UWSN). The high E2E delay, EC and reliable data delivery are the critical issues, which play an important role to enhance the network throughput. So, this paper presents two energy efficient routing protocols namely: Shortest Path-Collision avoidance Based Energy Efficient Routing (SP-CBE2R) protocol and Improved-Collision avoidance Based Energy Efficient Routing (Im-CBE2R) protocol. At this end, both routing protocols minimize the probability of void hole occurrence and in return minimizes the EC and E2E delay. In both routing protocols, courier nodes are positioned at different strategic locations to keep the greedy forwarding continuous. The proposed routing protocols are also analyzed by varying the Packet Size (PS) and Data Rate (DR). Additionally, various simulations have been performed to authenticate the proposed routing protocols. Simulation results show that the proposed routing protocols outperform the baseline routing protocols in counterparts.

An unmanned aerial vehicle communication Networks (UAVCN) is a group of UAVs (unmanned aerial vehicles) that is able to communicate and trigger information to each other for a particular mission. This network node is power limited. However, the routing mechanism should be improved which extend the lifetime and performance of UAV nodes. This manuscript intends to introduce a concept of a cross-layer method for efficient power and routing for UAVCN to increase communication performance. The cross-layer methodology integrates the physical, link and network layer. An efficient power optimized link state routing (EP-OLSR) protocol is proposed which is an extension to optimized link state routing (OLSR) protocol. The proposed routing protocol evaluated by developing scenarios of UAVCN in OPNET modeler 14.5. The simulation is carried out by implementing OLSR and EP-OLSR using different network parameters and compared the routing protocols performance. The results showed that the EP-OLSR maximizes network performance efficiency as compared to OLSR. It minimizes the delay and maximizes the throughput and increases the network performance.

Ad Hoc Routing with Distributed Ordered Sequences

Named Data Networking (NDN) need routing to build NDN systems. Similar IP protocol, NDN has routing protocols intra-domain and inter-domain routing protocol. Named-data Link State Routing (NLSR) is one of the NDN intra-domain routing protocols in NDN. Deployment NLSR on actual hardware and operating systems give more performance feedback which might not be obtained in a simulation. This paper explain how a NLSR work and performance use Ubuntu installed as NDN router.

The digital transmission amongst vehicles and roadway equipment is necessary for the realization of smart transportation systems. Vehicular ad-hoc network (VANet) is an ascension field of engineering that presents brilliant transport applications, road safety, comfort and luxury to drivers. VANet protocols face many challenges because of the changing nature of vehicular ad-hoc network. VANet routing protocols perform a vital role in terms of the performance efficiency because they decide the mode of sending and receiving packets between mobile vehicular nodes. Finding suitable and efficient routing protocol is very important for the efficient implementation of VANet. The foremost objective of this research is to suggest the relevant and efficient VANet routing protocols in a high traffic density area. This research work presents a practical evaluation of the VANet topology’s features with respect to time for the high traffic situations. This evaluation incorporates the actual creation of roadway layout. An accurate traffic flow is produced by extracting run-time facts and figures from PeMS (Freeway Performance Measurement System) database and assigning this extracted information into a microscopic mobility model. To achieve our goal, we consider three routing protocols i.e., AOMDV, AODV and DSDV. The simulation results prove that the performance of AOMDV is greater in comparison to DSDV and AODV protocols in high traffic density areas. The AOMDV protocol improves overall network performance by achieving maximum throughput and minimum end to end delay.

The vital part to prolong the active time of Wireless Senor Network (WSN) is to reduce the transmission energy consumption between individual nodes/path belonging to the network. In order to minimize the transmission energy consumption in the network, a novel methodology called a “sleeping pill” packet into the network has been proposed. This technique has reduced 4% of energy consumption in a transmission experiment for 10,000 packets at -25dBm transmission power. This transmission experiment was carried out by transmitting a new packet of size 108 bytes for every 3 seconds leading to a total transmission time of 8 hours 33 minutes. This methodology has a potential to increase the lifetime of the network to about 60% for multi-hop multipath routing protocols. These measurements and comparisons are first step towards energy efficient multi-hop routing protocol in a mesh network. This study also investigates various connectivity issues and energy consumption scenario that prevail in real world situation. The experiments were done and analyzed various performance issues which arise due to deployment/distribution of the sensor for the multi-hop network according to the environment. These experiments provide more insights to reduce the packet loss and effective energy utilization of the nodes in the network. One of the focuses of this research work is on establishing the correlation between Link Quality Indicator (LQI) values to the Packet delivery ratio (PDR) based on environment. These methodical analyses play an important role in energy efficient mesh routing protocol and deployment.

Introduction: This article is the result of the research “Energy efficient routing protocols in wireless sensor network: Examine the impact of M-SEEC routing protocols on the lifetime of WSN with an energy efficient TABU optimization routing protocol”developed in the IKG, Punjab Technical University, India in 2019.Problem: The task of finding and maintaining routes in WSNs is non-trivialsince energy restrictions and sudden changes in node status cause frequent and unpredictable changes.Objective: The objective of this paper is to propose an energy efficient heterogeneous protocolwith the help of a hybrid meta-heuristic technique.Methodology: In the hybrid meta-heuristic technique, the shortest route has been selected and the data forwarded to the sink in a minimal time span,savingenergy and making the network more stable. To evaluate the technique, a new hybrid technique has been created where the data transmission is implemented from the beginning under MATLAB 2013a.Results: The proposed technique is better than the existing ones since the remaining energy in the network is increased by 62% compared to normal nodes in MSEEC, 65% compared to advanced nodes in MSEEC and 70% compared to super nodes in MSEEC. The network lifetime was also enhanced by 70.8% compared to MSEEC.Conclusion: The proposed protocol was found to be superior based on the average residual energy.This paper proposes an efficient routing mechanism towards the energy efficient network.Originality: Through this research, a novel version of MSEEC protocol is carried out using the TABU search mechanism to generate the functions of two neighbourhoods to detect the optimum path with the aim of maximizing the network lifetime in an area of 200×200m2.Limitations: The lack of other routing techniques falls under swarm intelligence.

An adhoc network is a collection of mobile nodes connected by a wireless link, where each node acts as a router. In order to facilitate the communication within the network, a routing protocol is needed. Due to bandwidth constraint and dynamic topology of the mobile adhoc Networks supporting Quality of Service (QoS) is challenging task. The aim of this work is to present QoS enabled routing protocol in adhoc networks and compare it with normal routing protocol. The Optimized Link State Routing (OLSR) protocol is an optimization of the classical link state protocol, which is used for implement the QoS. Such protocol is adopted for the reason that it reduces the size of control messages and minimizes the overhead from the flooding of control traffic. The performance of both routing and QoS routing protocols are evaluated using Network simulator Ns-2.QoS enabled routing protocol shows a significant improvement in protocol performance metrics applied in our measurements, such as packet delivery ratio, packet loss and delay.

Research on vehicular ad hoc networks (VANETs) has focused primarily on efficient routing protocol design under conditions where there are relatively large numbers of closely spaced vehicles, typical of major highways and urban areas. These routing protocols are designed principally for fully connected networks and are not suitable for packet delivery in a sparse, partially connected VANET. In rural areas, vehicle densities are low and roadway communication infrastructure is scarce, leading to long periods where vehicle-to-vehicle or vehicleto- roadside communications is infrequent, interrupted, or simply not possible. These attributes characterize a sparse VANET, and are characteristic of delay tolerant networks (DTNs). In this paper, we examine the challenges of VANETs in sparse network conditions, review alternatives including epidemic routing and propose a Border node Based Routing (BBR) protocol for partially connected VANETs. Unlike many VANET protocols that assume location awareness or mobility patterns to aid in routing decisions, BBR is designed to function in domains where location and mobility information is not available, as is typical in rugged terrain conditions. The BBR protocol can tolerate network partition due to low node density and high node mobility. The performance of this protocol is evaluated in OPNET TM with a Random Waypoint mobility model and a Geographic and Traffic Information (GTI) based mobility model that captures typical highway conditions. The simulation results are compared with those obtained using the Dynamic Source Routing (DSR) protocol and with an epidemic routing protocol. The simulation results show that BBR performs well for partially connected VANETs where other protocols fail and provides the advantage of not relying on a location service required by other protocols proposed for VANETs.

The Named-data Link State Routing protocol (NLSR) is an intra-domain routing protocol for Named Data Networking (NDN). It is an application level protocol similar with many IP routing protocols, but NLSR uses NDN's Interest/Data packets to disseminate the routing updates, directly benefit from NDN's built-in data authenticity. The security mechanism has been directly embedded inside the NDN protocol, thus a digital signature scheme is needed to check the integrity of each NLSR packets that exchanged between node that run NLSR. By default, NLSR uses RSA and ECDSA as digital signature algorithms that are proven to be efficient against attacks, but both have their respective advantages and disadvantages due to differences in computation and key methods used. The main purpose of our research was to find the optimal algorithm that give the best synchronization time during the signature scheme. Our experiment result show that RSA scheme performance speed is better than ECDSA scheme on NLSR in sync speed with 0.062558226% difference.

Critical and public safety operations require real-time communication from the incident area(s) to the distant operations command center going through the evacuation and medical support areas. Data transmitted throughout such type of network is extremely useful for decisions makers and operations' conducting. Therefore, any delay in communication may cause lives' loss. Above all, the existing infrastructure communication systems (PSTN, WiFi, 4/5 G, etc.) can be damaged and is often not available solution. An alternate option is to deploy autonomous tactical network at unpredictable location and time. However, in this context there are many challenge especially how to effectively rout or disseminate the information. In this paper, we present behavior of varied multi-hops routing protocols evaluated in a disaster-simulated scenario with different communication technologies (i.e. WiFi IEEE 802.11; WSN IEEE 802.15.4; WBAN IEEE 802.15.6). Studied routing strategies are classified: Ad hoc proactive and reactive protocols, geographic-based and gradient-based protocols. To be realistic, we have conducted our simulations by considering a Mall in Doha city in the State of Qatar. Moreover, we have generated a mobility trace to model the rescue teams and crowd movements during the disaster. In conclusion, extensive simulations showed that WiFi IEEE 802.11 is the best wireless technology to consider in an emergency urban with the studied protocols. On the other hand, gradient based routing protocol performed much better especially with WBAN IEEE 802.15.6. Keyword: Tactical Ad-hoc Networks; Public Safety and Emergency; Routing Protocols; IEEE 802.11; IEEE 802.15.4; IEEE 802.15.6; Performance Evaluation I. Introduction Public safety is a worldwide governments' concern. It is a special continuous reactive set of studies, operations and actions in order to predict plan and perform a successful reaction in a disaster case. Coupled with the raise of number and variety of disasters, not only the economies and infrastructures are affected, but significant number of human lives. With regards to the emergency response to these disasters, the role of existing Public Safety Network (PSN) infrastructures (e.g. TETRA, LTE) is extremely vital. However, it is anticipated that, during and after the disasters, existing PSN infrastructures can be flawed, oversaturated or completely damaged. Therefore, there is a growing demand for ubiquitous emergency response system that could be easily and rapidly deployed at unpredictable location and time. Wherefore Wearable Body Area Networks (W-BAN) is a relevant candidate that can play a key role to monitor the physiological status of involved workforces and the affected individuals. Composed by small and low-power devices connected to a coordinator, WBAN communication architecture relies on three levels: On-Body (or intra-Body), Body-to-Body (or inter-Body) and off-Body communication networks. In disaster scenarios, the network connectivity and data is a challenging problem due to the dynamic mobility and harsh environment [1]. It is envisioned that, in case of unavailable or out-of-range network infrastructures, the WBANs coordinators along with WBANs sensors can exploit cooperative and multi-hop body-to-body communications to extend the end-to-end network connectivity. The Opportunistic and Mobility Aware Routing (OMAR) scheme is an on-body routing protocol proposed in one of our earlier works [2]. A realistic mobility model is also a major challenge related to the simulations. To the best knowledge of the authors, no comparable study in disaster context is conducted by considering a realistic disaster mobility pattern. In this paper, we investigate varied classes of multi-hop Body-to-Body routing protocols using a realistic mobility modeling software provided by Bonn University in Germany [3]. The mobility pattern is exploited by the WSNET simulator as a mobility trace of the nodes moving during and after the disaster. Note here that individuals are considered mobile nodes in the scenario. In the conducted simulations, each iteration, one communication technology configuration is selected (i.e. WiFi IEEE 802.11; WSN IEEE 802.15.4; WBAN IEEE 802.15.6), then simulations are ran with the routing protocols (i.e. proactive, reactive, gradient-based and geographical-based). This strategy provides a vision not only on the behavior of the routing protocols in the disaster context, but evaluates the communication technologies in such case also. For proactive, reactive, gradient-based and geographical-based routing protocols, Optimized Link State Routing protocol version 2 (OLSRv2) [4], Ad-hoc On-Demand Distance Vector (AODVv2) [5], Directed Diffusion (DD) [6] and Greedy Perimeter Stateless Routing (GPSR) [7] protocols are selected respectively The remainder of this abstract is organized as follows. In section II, we present briefly the disaster scenario considered. In section III, we explain the results of the simulations. Finally, in Section IV, we conclude and discuss perspectives. II. Landmark disaster scenario we are investigating a disaster scenario (fire triggering) in the “Landmark” shopping mall. The mobility model used is generated by the BonnMotion tool. We assume that the incident is caused by fire into two different locations. Rescuers are immediately called to intervene. We consider that firefighters are divided into 3 groups of vehicles with 26 firefighters in each group. Medical emergency teams that probably could reach the mall just after the incident, are consisting of 6 ambulances with 5 medical staff in each ambulance (30 rescuers in total). Civilians could also help rescuers and they are also considered in the mobility trace generation. Injured individuals are transported from the incident areas to the patients waiting for treatment areas to get first aids. Then, they will be transported to the patients clearing areas where they will be either put under observation or evacuated to hospitals by ambulance or helicopter. A tactical command center conducting the operations is represented by WSNET is an event-driven simulator for wireless networks. WSNET is able to design, configure and simulate a whole communication stack from the Physical to the Application Layer. We benefit from these features to vary the payload with the selected MAC and routing layer in each iteration. These combinations provided a deep review on the possible communication architecture to consider in disaster operations. The following section describes the outcome of these extensive simulations. III. Performance evaluation The main difference between the disaster and any other scenario is the emergency aspect. All flowing data in the network is considered highly important. The probability of packets that did not reach the destination must be zero. For this reason, our evaluation is regarded to the Packet Reception rate (PRR). Likewise, a delayed packet is such like an unreceived packet. That's why we consider the delay as decisive factor. Similarly, the energy consumption is also observed. The following table summarizes the obtained results. In terms of average PRR, WiFi IEEE 802.11 is convincingly better than the two counterparts combined with all the routing protocols. GPSR has a considerable PRR with WBAN IEEE 802.15.6, but the location information of the nodes is considered as known. Regarding the delay, DD is particularly efficient with WiFi and WBAN. To conclude, DD is an efficient routing protocol to consider in case of Indoor operations, while GPSR is most relevant in Outdoor operations where locations can be obtained from GPS. IV. Conclusion Disasters are growing remarkably worldwide. The existing communication infrastructures are not considered a part of the communication recuing system. Consequently, to monitor deployed individuals (rescue teams, injured individuals, etc.) data should be forwarded throughout these individuals (WBANs) to reach a distant command center. In order to evaluate the performance of diverse multi-hop routing protocols, we have conducted extensive simulations on WNSET using a realistic mobility model. The simulations showed that all evaluated routing protocols (i.e.AODVv2, OLSRv2, DD and GPSR) has the best PRR with the WiFi technology. While, DD was found to be the most efficient with the WBAN technology. GPSR also could be considered when the location information is available. Acknowledgment The work was supported by NPRP grant #[6-1508-2-616] from the Qatar National Research Fund which is a member of Qatar Foundation. The statements made herein are solely the responsibility of the authors.

Integration of trust in routing mechanisms already prevalent in Wireless Sensor Networks (WSN) has become an interesting research area of late. Several methods exist for the assignment of trust to the nodes present in a WSN. However the real challenge lies in proper integration of this trust to an existing routing protocol for the synthesis of a trust-aware routing algorithm. In this paper we try to take the help of Geometrical Mean based indirect trust evaluation mechanism for calculation of trust of individual nodes and thereby use the calculated trusts for determination of the different route trusts (RTs). We present a link state routing protocol based only on these indirect trusts which forms the routes and finds the best trustworthy route among them by comparing the values of all the calculated route trusts as for each route present in the network. We have developed three algorithms related to this and have shown their merits. Finally, we compare our work with similar trust integrated routing protocols and show its advantages over them.

The large-scale mobile Underwater Wireless Sensor Network (UWSN) is a useful networking paradigm to explore underwater environments. The characteristics of mobile UWSNs, such as low communication bandwidth, large propagation delay, and floating node mobility are significantly different from wireless sensor networks. In this paper, we propose a new efficient routing protocol, called multi-path routing (MPR) protocol, for UWSNs to improve the transmission delay. Multi-path is utilized during the path construction from the source node to the destination node, which is composed of a series of multi-subpaths. Each multi-subpath is a sub-path from a sending node to its two-hop neighboring node, called receiving node, by one more relay nodes, where these relay nodes simultaneously are neighboring nodes of sending and receiving nodes. Due to the different propagation delay of UWSN, the packet arrival time along the different sub-path is different; thus it may avoid the data collision in the receiving node when receiving different packets from different relay nodes. It surely sends the different packet along different sub-path to significantly improve delay time and packet delivery ratio. Finally, simulation results illustrate the performance achievements of the MPR protocol in improving delay time, packet delivery ratio, throughput and reducing overhead ratio.

An ad hoc wireless mobile network is an infrastructureless mobile network that has no fixed routers; instead, all nodes are capable of movement and can be connected dynamically in an arbitrary manner. In order to facilitate communication of mobile nodes that may not be within the wireless range of each other, an efficient routing protocol is used to discover routes between nodes so that messages may be delivered in a timely manner. We present a novel load-balanced ad hoc routing (LBAR) protocol for communication in wireless ad hoc networks. LBAR defines a new metric for routing known as the degree of nodal activity. In LBAR, path discovery takes charge of searching routes and then selecting a route that has least traffic load and transmit traffic in a timely manner based on activity of the nodes. LBAR provides efficient path maintenance to patch up broken links by detouring traffic to the destination. A comprehensive simulation model was conducted to study the performance of the proposed scheme. Performance results show that LBAR outperforms existing ad hoc routing protocols in terms of packet delivery and average end-to-end delay.

The performance of mobile ad-hoc networks (MANET) is related to the efficiency of the routing protocols in adapting to frequently changing network topology and link status. This paper addresses the issue by comparing the relative performance of three key ad-hoc routing protocols: destination-sequenced distance vector (DSDV), ad-hoc on-demand distance vector (AODV) and optimized link state routing (OLSR). The protocols are tested based on two scenarios, namely, tactical networks for ships and sensor-based network nodes. Four performance metrics were measured by varying the maximum speed of mobile hosts, network size and traffic load, to assess the routing capability and protocol efficiency. The simulation results indicate that AODV performs better than OSLR and DSDV in the first scenario. Although OLSR also performed relatively well, the associated high routing overhead is the dominant reason for not choosing it. On the other hand, OLSR emerged as the protocol of choice for sensor networks, where the high routing overhead is counteracted by consistently better performance in all other metrics. Due to the slow evolution of the sensor network topology, OLSR performed satisfactorily for best effort traffic but needed subtle adjustments to balance between latency and bandwidth to meet the requirements of delay-sensitive applications