Routing Protocol For Wireless Networks Research Articles

DSDV Extension to Enhance the Performance of Ad Hoc Networks in High Diverse-Velocity Environments

<p class="0abstractCxSpFirst">Mobile Ad-Hoc Networks (MANETs) are characterized as decentralized control networks. The mobile nodes route and forward data based on their routing information without the need for routing devices. In this type of networks, nodes move in an unstructured environment where some nodes are still fixed, others are moving in a constant velocity, and others move with diverse velocities; and thus, they need special protocols to keep track of network changes and velocity changes among the nodes. Destination Sequenced Distance-Vector (DSDV) routing protocol is one of the most popular proactive routing protocols for wireless networks. This protocol has a good performance in general, but with high speed nodes and congested networks its performance degrades quickly.</p><p class="0abstractCxSpLast">In this paper we propose an extension to the DSDV (we call it Diverse-Velocity DSDV) to address this problem. The main idea is to modify the protocol to include node speed, determine update intervals and the duration of settling time. To evaluate the performance of the new protocol, we have carried a number of simulation scenarios using the Network Simulator tool (NS-3) and measured relevant parameters such as: packet delivery ratio, throughput, end-to-end delay, and routing overhead. We have compared our results with the original DSDV and some of its new variants. The new protocol has demonstrated a noticeable improvement of performance in all scenarios, and the measured performance metrics outperform the others except the average delay where the performance of the new protocol was modest.</p>

Research on Trust-Based Secure Routing in Wireless Sensor Networks

With the increasing scale of wireless sensor networks, the limited resource of sensor nodes and the uncertainty of the layout environment, sensor nodes are very vulnerable to malicious attacks, but the traditional security mechanism is not suitable for wireless sensor networks. This paper summarizes the common attack forms, security technologies and the security mechanisms of trust-based routing protocols in wireless sensor networks proposed in recent years, then analyzes and compares these secure routes.

Cooperative and Optimized Qos Enhanced Distributed Multipath Routing Protocol in Hybrid Wireless Networks

The Hybrid Wireless Networks (HWN) interconnects both mobile networks and wireless networks or combines a cellular and a multi-hopping wireless networks or inter and intra networks. These are networks in which any mobile node in a wireless network may have connectivity either directly or via a gateway node to an infrastructure based wireless network. The quick development of wireless networks has triggered enormous applications. They have been used in various fields such as commerce, emergency services, health care, education, entertainment, etc. In spite of more advantages in HWN, it has some challenges such as to increase data transmitting capacity, to strengthen the network connection, proper bandwidth allocation in Mobile Ad hoc Network (MANET), to maintain a connection during the handover, to reduce the connection failure in between two networks. Here, this research considered to improve the Quality of Service (QoS) by reducing the invalid reservation problem, race conditional problem and link failure. In this paper for guarantying reliable and continuous data transmission and also to ensure that cooperative routing is done faster response and effective packet transmission. Cooperative communications are the most recent fields of research: they combine wireless channels’ link quality and broadcasting nature. Ad-hoc mobile networks are successful in communication if routing and transmission of participating nodes are working. A flow is divided into batches of data packets. On departing from source node, every packet of alike batch encloses similar forwarder list. Proactive Source Routing (PSR) protocol offers every node along nodes in networks, the identity of path nodes are enclosed by forwarder list commencing the location of source node. On progressive packets forwarding nodes modifies the forwarder list on any modification notified in network topology. In addition, a few nodes in extra which is not in list of transmitting node may also be transmitted if it is helpful, called small-scale retransmission. Cooperative and optimized QoS distributed multipath routing protocol (COQDMRP) combines the link-quality and broadcasting nature of wireless channels. Thus communication in mobile ad-hoc networks functions properly only if the participating nodes cooperate in routing and forwarding. Also, here the routing utilizes the neighbouring nodes which are basically referred as “Co-operative nodes” that can help transmitting the data from the source and destination. Since many nodes take part in the routing process, it helps to improve the overall throughput and packet delivery ratio. This proposed solution could be deployed in cases where a portion of nodes are in remote areas, packets with varied priority, highly scaled distributed HWN and network with considerable amount of nodes with less battery power. It is designed to achieve high throughput and packet delivery ratio, and low energy consumption. end - to - end delay and packet loss ratio.

Solutions and Recent Challenges Related to Energy in Wireless Body Area Networks with Integrated Technologies: Applications and Perspectives

In this paper, we have investigated some of the most recent energy efficient routing protocols for wireless body area networks. This technology has seen advancements in recent times where wireless sensors are injected in the human body to sense and measure body parameters like temperature, heartbeat and glucose level. These tiny wireless sensors gather body data information and send it over a wireless network to the base station. The data measurements are examined by the doctor or physician and the suitable cure is suggested. The whole communication is done through routing protocols in a network environment. Routing protocol consumes energy while helping non-stop communication in a wireless environment. Because of the very tiny size, energy consumption matters a lot. We have focused on the protocols, which provide energy efficiency and improve network lifetime, through put and minimal path loss. We will be discussing some of the most recent energy efficient routing protocols in this paper; later their comparison with an appropriate table is presented. In addition, recent challenges, possible application and perspectives are discussed.

PC-RPL

We present PC-RPL , a transmission power-controlled IPv6 routing protocol for low-power and lossy wireless networks that significantly improves the end-to-end packet delivery performance under heavy traffic compared to the standard RPL. We show through actual design, implementation, and experiments that a multihop wireless network can achieve better throughput and routing stability when transmission power and routing topology are “jointly and adaptively” controlled. Our experiments show that the predominant “fixed and uniform” transmission power strategy with “link quality and hop distance”–based routing topology construction (i.e., RPL) loses significant bandwidth due to hidden terminal and load imbalance problems. We design an adaptive and distributed control mechanism for transmission power and routing topology, named PC-RPL , on top of the standard RPL routing protocol for hidden terminal mitigation and load balancing. We implement PC-RPL on real embedded devices and evaluate its performance on a 49-node multihop testbed. PC-RPL reduces total end-to-end packet losses by approximately sevenfold without increasing hop distance compared to RPL with the highest transmission power, resulting in 17% improvement in aggregate bandwidth and 64% improvement for the worst-case node by successfully alleviating both hidden terminal and load imbalance problems.

Dynamic energy efficient routing protocol in wireless sensor networks

Currently, IEEE 802.11 standard for ad-hoc wireless mode is inadequate for multi-hop network. Recent efforts for the advancement of 802.11 standards, such as 11e for QoS support and 11n for high data rates (> 100 Mbps), are still limited as they are dependent on the wired infrastructure backbone and single-hop wireless communication. One major challenge in quality-of-service (QoS) oriented routing in wireless ad-hoc networks is to find a route that satisfies multiple constraints including energy consumption minimization, delay, node failure and throughput maximization. In this paper, we propose a novel Dynamic Energy Efficient Routing (DEER) protocol that guarantees message delivery, maximum network lifetime and message flow. DEER uses those specific nodes on the fly which has maximum residual energy above a defined energy level for relaying message from a source to a destination. Our proposed approach has been evaluated using realistic channel model and it demonstrates improved session lifetime and efficient data flow compared to Probabilistic Energy Profile, Efficient Hop Count Routing, Dijkstra and Random/opportunistic algorithms. In addition, DEER can lend itself easily to battery-based sensor networks or energy-harvested based sensor networks.

High Throughput and Thermal Aware Routing Protocol (HTTRP) for Wireless Body Area Networks

High Throughput and Thermal Aware Routing Protocol (HTTRP) for Wireless Body Area Networks

QoS Aware Cross Layer for SIP Based VoIP Over Enhanced OLSR Routing Protocol in Hybrid Wireless Network

To improve SIP signal execution in MANET, routing parameters must be powerfully balanced through SIP methods dependent on a set equal for execution improvement measurements to help the SIP signal framework. In this manner, the presentation of the Optimal Link State Routing Protocol (OLSR) is to be additionally improved. In MANET, vitality is a key anxiety for secure communication, making it conceivable to avoid enemies or childish hubs since the system. In term of this paper, the projected secure as well as QoS based energy aware multipath routing in MANET. In support of multipath path collection, we have provided the Optimal Link State Routing Protocol (OLSR) algorithm. Energy efficient multipath routes are designated on the system using this method. Afterward a quantity of transactions, a route may misplace its connection quality. Hence the optimal path is selected to the paths installed on the system utilizing the Spider Monkey Optimization (SMO) algorithm. At last the presentation measurements of our planned SMO-OLSR task are contrasted and the current OLSR. SMOOLSR used for hybrid wireless network for efficient communication. The reproduction results demonstrate that the presentation of our planned work, the packet delivery rate, the delay, and the packet fallout are improved over the existing work. This planned methodology is actualized on the foundation of NS2.

Malicious node detection using heterogeneous cluster based secure routing protocol (HCBS) in wireless adhoc sensor networks

In wireless, every device can moves anywhere without any infrastructure also the information can be maintained constantly for routing the traffic. The open issues of wireless Adhoc network the attacks which are chosen the forwarding attack that is dropped by malicious node to corrupt the network performance then the information integrity exposure. Aim of the problem that existing methods in Adhoc network for malicious node detection which cannot assure the traceability of the node as well as the fairness of node detection. In this paper, the proposed heterogeneous cluster based secure routing scheme provides trust based secure network for detection of attacks such as wormhole and black hole caused by malicious nodes presence in wireless Adhoc network. The simulation result shows that the proposed model is detect the malicious nodes effectively in wireless Adhoc networks. The malicious node detection efficiency can be achieved 96% also energy consumption also 10% better than existing method.

Implementation and Evaluation of Opportunistic Routing Protocols for Wireless and New Generation Communication Networks

Current wireless networks are based on unicast routing protocol derived from wired networks. The purpose of this paper is to implement and to evaluate opportunistic routing protocols in new generation’s wireless network. This is a comparative study between two opportunistic protocols, which are extremely opportunistic routing protocol and simple opportunistic adaptive routing protocol. The main goal of this survey is to show the benefits required by using opportunistic approach to optimize the new generation’s wireless networks operations and implemented the most used protocols under MATLAB framework.

Novel Reliable and Energy-Efficient Routing Protocols for Wireless Sensor Networks

In this paper, novel energy-aware and reliable routing protocols are proposed. The aim is to maximize the lifespan of wireless sensor networks (WSNs) subject to predefined reliability constraints by using multi-hop routing schemes, in which the source node forwards the packet to the base station (BS) via other nodes as relays. In the first proposed protocol, energy efficiency is achieved by maximizing the minimum residual energy of the path subject to fulfilling a predefined reliability constraints. The second protocol is an optimized version of the first one with respect to lifespan and complexity. The optimal path is the one in which the residual energy distribution of the nodes along the path is as close to uniform as possible and the packet arrives at the base station with a given success probability. To measure the uniformity of the residual energy distribution, we use an entropy like measure. The information about the current energy state of the network is maintained by using a look-up-table from which the optimal routes are computed on the BS. The BS broadcasts the updated optimal paths to each node after each round of packet transmission.

ECRP: an energy-aware cluster-based routing protocol for wireless sensor networks

Energy conservation is the main issue in wireless sensor networks. Many existing clustering protocols have been proposed to balance the energy consumption and maximize the battery lifetime of sensor nodes. However, these protocols suffer from the excessive overhead due to repetitive clustering resulting in high-energy consumption. In this paper, we propose energy-aware cluster-based routing protocol (ECRP) in which not only the cluster head (CH) role rotates based on energy around all cluster members until the end of network functioning to avoid frequent re-clustering, but also it can adapt the network topology change. Further, ECRP introduces a multi-hop routing algorithm so that the energy consumption is minimized and balanced. As well, a fault-tolerant mechanism is proposed to cope up with the failure of CHs and relay nodes. We perform extensive simulations on the proposed protocol using different network scenarios. The simulation results demonstrate the superiority of ECRP compared with recent and relevant existing protocols in terms of main performance metrics.

Enhancing the Sensor Node Localization Algorithm Based on Improved DV-Hop and DE Algorithms in Wireless Sensor Networks.

The Distance Vector-Hop (DV-Hop) algorithm is the most well-known range-free localization algorithm based on the distance vector routing protocol in wireless sensor networks; however, it is widely known that its localization accuracy is limited. In this paper, DEIDV-Hop is proposed, an enhanced wireless sensor node localization algorithm based on the differential evolution (DE) and improved DV-Hop algorithms, which improves the problem of potential error about average distance per hop. Introduced into the random individuals of mutation operation that increase the diversity of the population, random mutation is infused to enhance the search stagnation and premature convergence of the DE algorithm. On the basis of the generated individual, the social learning part of the Particle Swarm (PSO) algorithm is embedded into the crossover operation that accelerates the convergence speed as well as improves the optimization result of the algorithm. The improved DE algorithm is applied to obtain the global optimal solution corresponding to the estimated location of the unknown node. Among the four different network environments, the simulation results show that the proposed algorithm has smaller localization errors and more excellent stability than previous ones. Still, it is promising for application scenarios with higher localization accuracy and stability requirements.

Symphony

Deterministic Synchronous Multichannel Extension (DSME) is a prominent MAC behavior first introduced in IEEE 802.15.4e. It can avail deterministic and best effort Service using its multisuperframe structure. RPL is a routing protocol for wireless networks with low power consumption and generally susceptible to packet loss. These two standards were designed independently but with the common objective to satisfy the requirements of IoT devices in terms of limited energy, reliability and determinism. A combination of these two protocols can integrate real-time QoS demanding and large-scale IoT networks. In this paper, we propose a new multi-channel, multi-timeslot scheduling algorithm called Symphony that provides QoS efficient schedules in DSME networks. In this paper we provide analytical and simulation based delay analysis for our approach against some state of the art algorithms. In this work, we show that integrating routing with DSME can improve reliability by 40% and by using Symphony, we can reduce the network delay by 10--20% against the state of the art algorithms.

Prediction-based energy efficient opportunistic routing protocol in wireless sensor networks

Opportunistic routing is a most promising routing method for improving the network lifetime and throughput of wireless sensor networks (WSN). It utilises the broadcast nature of WSN, that allows to select and prioritise a node from the potential forwarder set as next-hop forwarder. The design of energy efficient routing protocol becomes one of the major concern in WSN, due to limited battery power of a sensor node. The common energy loss reasons of existing routing protocols are: 1) packets may travel through a specific set of sensor nodes will drain out a battery energy very soon; 2) packets discard will create a packet retransmission. Opportunistic routing broadcast nature will avoid packet retransmission. The proposed energy efficient Markov prediction-based opportunistic routing (EEMPOR) protocol uses the following metrics to select and prioritise the energy efficient nodes namely, number of transactions of a node and residual energy of a node. Then proposed protocol shows that Markov prediction-based opportunistic routing protocol provides better network performance than non-prediction-based method. Simulation results show, that the proposed protocol outperforms the existing OR in terms of consumed energy, residual energy, network lifetime, and throughput.

An energy-efficient and novel populated cluster aware routing protocol (PCRP) for wireless sensor networks (WSN)

Wireless Sensor Networks (WSNs) is created, stemming from their applications in distinct areas. Huge sensor nodes are deployed in geographically isolated regions in WSN. As a result of uninterrupted transmission, the energy level of the nodes gets rapidly depleted. Sensor node batteries cannot be replaced or recharged often and maintaining the energy level is a crucial issue. Thus energy efficiency is the significant factor to be consider in WSN. This paper focuses to implement an efficient clustering and routing protocols for maximized network lifetime. Clustering has been confirmed as a successful approach in network organization. The fundamental responsibilities of the clustering mechanism include improved energy efficiency and extended network lifespan. In this work, energy efficiency is improved to maximize lifespan of the WSN by proposing a novel method known as the Populated Cluster aware Routing Protocol (PCRP). The proposed method comprises three different steps: cluster formation, cluster head selection, and multi-hop data transmission. All sensor nodes are joined to a Cluster Head in a single hop in the cluster formation phase. Node distance is calculated and from which cluster head is selected. Then, cluster head aggregates the data from sensor nodes and transfer to the Base Station (BS). The shortest pathway is estimated by the Energy Route Request Adhoc On-demand Distance Vector (ERRAODV) algorithm. The proposed method considers the residual energy involved to attain high energy efficiency and network stability. The experimental analysis is demonstrated to validate the proposed method with existing, which improves the network lifespan. Vital parameters are validated using Network Simulator (NS2).

Hierarchical routing protocol in wireless sensor network: a state-of-the-art review

Hierarchical routing protocol in wireless sensor network: a state-of-the-art review

Hierarchical routing protocol in wireless sensor network: a state-of-the-art review

The hierarchical routing protocol in the wireless sensor network (WSN) is widely applied because of its good network stability and effective communication capability. Its cluster structure and the integration process of the data have a satisfactory performance in energy consumption and data transmission. To guide the design of hierarchical routing protocol, in this paper, we review the current research on these protocols, some typical technical characteristics such as the cluster head selection, clustering, and data routing are analysed, and a suggestion on the direction of the hierarchical routing protocol research is given. The work of this paper will be beneficial to the research, design, and optimisation of the hierarchical routing protocol.

Adaptation of Smart Antenna with AODV Routing Protocol for Ad Hoc Wireless Networks

In the recent years, Mobile Ad-Hoc Wireless Networks (MANET) have played a key role in communication system. It is a self-configured and infrastructure-less network. It is used in different application areas like disaster recovery operations, hospitals and agricultural sectors. However, there are a lot of problems that limit the performances of this network for significantly achieving its roles in different areas. To overcome these problems, this paper enhances the performances of MANET in wireless communication system by adapting smart antenna in Ad-hoc On-Demand Distance Vector (AODV) routing protocol combining with multiple network interfaces. The improved new version AODV utilizing directional antenna and multiple network interface compared with Omni-directional antenna is evaluated based on simulations, which was done with the Network Simulator version two (NS2). Through this study, we found out that directional antennas integrating with multiple network interface throughput and end to end delays always outperform Omni-directional antennas in both random and grid scenarios for AODV routing protocol. In high communication paths and long communication distances also directional antennas have significant improvements in contrast to traditional Omni-directional antennas. Finally, we recommend that for increasing throughput and decreasing end to end delay utilizing directional antennas and multiple network interfaces in MANET technology improve the performances of the wireless communication system.

Performance evaluation of main approaches for determining optimal number of clusters in wireless sensor networks

Among important issues in the current energy-efficient routing protocols for wireless sensor networks (WSNs) based on clustering approaches are how to determine the optimal number of clusters, how to generate clusters and how select cluster-heads to improve WSNs performance. These approaches aim to reduce energy consumption of the WSN nodes and to extend the network lifetime. This paper reviews and compares the performance of three clustering techniques for determining number of clusters: rule of thumb, elbow, and silhouette. Each of these techniques involves a distributed K-means approach to generate clusters. Moreover, we compare these three clustering methods with low energy adaptive clustering hierarchy (LEACH), Imp LEACH and MODLEACH in terms of network lifetime, energy consumption and the number of packets sent to the base station (BS). The results obtained indicate that rule of thumb method provides better performance compared to other clustering techniques in terms of energy consumption and network lifetime.