Wireless Routing Protocols Research Articles

PERFORMANCE COMPARISON OF PROACTIVE ROUTING PROTOCOLS: OLSR, DSDV, WRP

Mobile ad hoc networks (MANETs) are becoming more popular to wireless communications due to wide acceptance of mobile devices. In this paper, attempt has been made to evaluate the performance of proactive routing protocols through MATLAB. Simulations is carried over Optimized Link State Routing (OLSR), Destination-Sequenced Distance-Vector (DSDV) and Wireless Routing Protocol (WRP) routing protocols. We evaluate the Throughput, Packet Delivery Ratio (PDR), MAC collision, and Error Rate for said protocols.The evaluation results show that OLSR has the best performance than other protocols. Keywords: OLSR, DSDV, WRP, Proactive protocols, MANET’s

NEIGHBOURHOOD LOAD ROUTING AND MULTI-CHANNELS IN WIRELESS MESH NETWORKS

As an emerging technology, wireless mesh networks are making significant progress in the area of wireless networks in recent years. Routing in Wireless Mesh Network (WMN) is challenging because of the unpredictable variations of the wireless environment. Traditional mechanisms have been proved that the routing performance would get deteriorated and ideal metrics must be explored. Most wireless routing protocols that are currently available are designed to use a single channel. The available network capacity can be increased by using multiple channels, but this requires the development of new protocols specifically designed for multi-channel operation. In this paper, we propose Neighbourhood load routing metric in single channel mesh networks and also present the technique to utilize multiple channels and multiple interfaces between routers for communication. The traditional routing metrics Hop Count and Weighted Cumulative Expected Transmission Time (WCETT) are used in routing. We compare performance of AODV-HOP, WCETT and NLR routing metrics in singlechannel and multichannel environment by considering throughput and end to end delay performance metrics. Our results show that NLR performs better in singlechannel environment.

Comparison and Analysis of Routing Protocols Based on OPNET for Fiber-Wireless Broadband Access Network

As a promising communication technology for smart grid system, Fiber-Wireless (FiWi) broadband access network integrating wireless and optical access technologies, is becoming a promising “last mile” access technology. As the front-end of FiWi broadband access network, Wireless Mesh Network (WMN) has the features of high transmission rate, wide coverage and low cost of networking, etc, which can make FiWi broadband access network have the advantages of self-healing, self-configuring and flexibility. As one of the key technologies in WMN, wireless routing protocols play an important role in the performance optimization of WMN, which directly influence FiWi broadband access network. Thus, this paper mainly studies the routing protocols in WMN based on OPNET network simulation platform. By simulation and analysis, this paper shows that Ad hoc On-demand Distance Vector (AODV) routing protocol has low data dropped and good performance in network delay. Dynamic Source Routing (DSR) protocol has low network load. Meanwhile, Optimized Link State Routing (OLSR) protocol has high network throughput.

A multipath energy-conserving routing protocol for wireless ad hoc networks lifetime improvement

Ad hoc networks are wireless mobile networks that can operate without infrastructure and without centralized network management. Traditional techniques of routing are not well adapted. Indeed, their lack of reactivity with respect to the variability of network changes makes them difficult to use. Moreover, conserving energy is a critical concern in the design of routing protocols for ad hoc networks, because most mobile nodes operate with limited battery capacity, and the energy depletion of a node affects not only the node itself but also the overall network lifetime. In all proposed single-path routing schemes a new path-discovery process is required once a path failure is detected, and this process causes delay and wastage of node resources. A multipath routing scheme is an alternative to maximize the network lifetime. In this paper, we propose an energy-efficient multipath routing protocol, called AOMR-LM (Ad hoc On-demand Multipath Routing with Lifetime Maximization), which preserves the residual energy of nodes and balances the consumed energy to increase the network lifetime. To achieve this goal, we used the residual energy of nodes for calculating the node energy level. The multipath selection mechanism uses this energy level to classify the paths. Two parameters are analyzed: the energy threshold beta and the coefficient alpha. These parameters are required to classify the nodes and to ensure the preservation of node energy. Our protocol improves the performance of mobile ad hoc networks by prolonging the lifetime of the network. This novel protocol has been compared with other protocols: AOMDV and ZD-AOMDV. The protocol performance has been evaluated in terms of network lifetime, energy consumption, and end-to-end delay.

The Wireless Network Routing Protocols and Data Communication Methods for Multiple Sensor Information Used in Mining Mechanical

In view of the development of wireless sensor system data transmission model in mine mechanical, we construct a ground reflection model of double path combined with the actual background demand based on the analysis of the wireless network routing protocol. Firstly, we put forward the selection strategy on wireless communication transmission power of multiple information sensor nodes. To build a data communication mode, we proposed the selection and evaluation method of network parameters based on graph theory. In consideration of the wireless channel model, combined with the initial random layout problem of network node, we explore whether to be neighbors between any two nodes arranged at random and the constraint relationship of wireless communication distance between nodes. Finally, we make up a dynamic routing selection algorithm with a view to dynamic nodes, and conduct the simulation analysis and experiment design. The research results show that with the increase of the random movement speed about network nodes, the process of depleting the energy of the nodes in the wireless sensor network speeds up, which explain the protocol given in the paper requires more energy to cope with the problem that the network topology changes frequently because of the random motion of nodes in network. The research results provide a reference to the wireless network node research and design in the electromechanical integration design.

EHCM: A Multihop Aided Wireless Routing Protocol Based on Flow Priority in Smart Grid

In traditional smart grid, data aggregator (DA) and distribution box (DB) send the data collected by sensors to base station (BS) through cellular interface, which is called single-hop communication mode (SCM). In smart grid, different data packets have different delay priorities and the BS cannot satisfy all the delay requirements of different data because of limited resources through SCM. In order to meet the QoS requirements of different priority data, we propose a new scheme: enhanced hybrid communication mode (EHCM), by introducing multihop communication mode (MCM) into this scenario to improve the network's performance by adding another wireless interface on each node. Our scheme EHCM consists of two parts: the intracell data transmission and the cell edge data transmission. In the first part, we propose a solution to choose a relay node according to the node's energy consumption and its residual energy and a solution to forward packets based on its priority and residual lifetime (RLT). In the second part, the tasks of data transmission can be delivered from the congested DB nodes to the adjacent idle ones to provide optimal performance. At last, the simulation shows that our scheme can satisfy the performance requirement of smart grid.

Improving Performance of Routing Protocols Using MRP Framework

These days MANET (Mobile Ad-hoc Network) is an amazing remarkably altering or rising technology, for the reason that of its elite nature of scattered mobile devices and self-motivated network topology. The mobile ad-hoc routing protocol follows several principles in wireless MANET’s. The up to date and novel applications based on wireless technology are being produced in the private as well as commercial sectors. A lot of challenges which are facing wireless MANETs like network stability, security, energy efficiency and performance analysis etc. At present wireless ad-hoc network get much more attention because of its accessibility everywhere. As a result researchers produce several routing protocols. In this paper first of all we analyzed the performance investigation of wireless routing protocols on the basis of ROH (Routing Overhead), throughput, end-2-end delay and PDR (Packet Delivery Ratio). After that we proposed an MRP (Mixed Routing Protocol) framework which improve performance.

Research on Wireless Sensor Network Routing Protocol Based on Internet of Things

The development and application of the Internet of things and the basic structure of wireless sensor network are briefly introduced,routing protocol in wireless sensor network is studied in detail. Since the wireless sensor network is a kind of energy-limited and resource-limited network, the routing protocol must guarantee the smaller routing expenses and the reducing energy consumption. Based on the analysis and research of existing wireless sensor network routing protocol, this paper emphasizes on the detailed analysis of the hierarchy routing protocol LEACH algorithm.The paper also introduces two improved algorithms according to the limit of LEACH protocol.

Study on Data Fusion and Optimization Based on Neural Networks

Due to limited energy wireless sensor networks, in order to extend the life cycle of WSN, the need for wireless sensor network routing protocol has been improved, based on the original model of hierarchical routing protocol LEACH algorithm, combined with efficient use of energy, new determine the clustering structure methods. The paper used in each sub-clan structures BP neural network algorithm for nodes preclude the data set is processed to reduce the amount of data transmitted to the sink node, reduce communication energy consumption to prolong the network lifetime goal.

MAP: Multiconstrained Anypath Routing in Wireless Mesh Networks

Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. Previous studies on anypath routing have concentrated on finding an anypath, which optimizes a single quality of service (QoS) parameter. In this paper, we study anypath routing subject to multiple constraints. We first prove that the problem is NP-hard when the number of constraints is larger than one. We then present a polynomial time K--approximation algorithm MAP, where K is the number of constraints. Our algorithm is as simple as Dijkstra's shortest path algorithm. Therefore, it is suitable for implementation in wireless routing protocols.

A Sensor Network Routing Protocol Based on Node Residual Energy

This paper mainly discusses the problem of wireless sensor network routing protocols. The flooding routing protocol has disadvantages of hidden terminal, information implosion and emerging redundant packet copies which consume more node energy. A sensor network routing protocol based on node residual energy (RPBEN) is proposed and evaluated. The new protocol choices a small number of nodes that have maximum remaining energy as next hop routing nodes. It saves the energy by avoiding redundancy packet copies produced and improve the disadvantages of flooding routing protocol. Performance analysis and simulation experiment show that the new protocol effectively reduces the data redundancy, reduces the energy consumption and prolongs the network lifetime.

Energy-Efficient Routing Protocol of Wireless Sensor Network for Industrial Application

An energy-efficient wireless sensor routing protocol (Energy-efficient clustering hierarchy routing protocol, EECH) for industrial field is proposed based on LEACH protocol according to the energy inefficiency of existing routing protocols and the characteristics of industrial field applications. The EECH protocol takes full advantages of the node clustering and time slot distribution in LEACH and implements the functions such as clustering, multi hop time slot distribution, node sleeping and data gathering. The cluster heads can be evenly distributed in the area with the geography location information of the wireless nodes, so that the optimal data gathering path can be established. Meanwhile, the EECH protocol can reduce the conflict in data receiving/transmitting and the energy consumption of the nodes, and extend the network lifetime through the multi hop time slot distribution and node sleep mechanism. The simulation results have shown that the death time of the first node in EECH protocol is extended double time than that of LEACH protocol. When most of the nodes dies, the amount of received data of the base station node is more than twice as much as the LEACH protocol, which has verified the energy efficiency characteristic of the EECH protocol.

Avoidance of misbehaving nodes in wireless mesh networks

A wireless mesh network is a self organized set of nodes that are connected by wireless links. Communicating parties that are not in wireless range of each other relay packets via intermediate nodes. A common approach to wireless mesh routing is reactive routing, where a fixed path between the communicating endpoints is established on-demand when a new session is initiated. This paper proposes a distributed algorithm which guarantees service even when some wireless mesh nodes deliberately change, discard, or misroute data packets to disrupt service. When a misbehaving route is encountered, the proposed algorithm starts a process in which a virtual cost penalty is iteratively added to suspicious nodes and a new shortest route is derived until the disrupted path is replaced with one that avoids the misbehaving nodes. The algorithm enables proactive calculation of several alternative routes. The proactively calculated routes can be used to perform multipath routing that drastically enhances the robustness of the algorithm versus adversaries that dynamically change their behavior. Our algorithm can co-exist with common reactive wireless routing protocols. Furthermore, although every intermediate nodes may be malicious, the proposed algorithm does not impose costly authentication of messages from the participating intermediate nodes. This means that existing deployed infrastructures of wireless mesh nodes can be software-modified to work with the algorithm. We show that the proposed algorithm quickly converges to efficient alternative routes and present a bounded complexity for its time, communication, and computation overhead. Copyright © 2013 John Wiley & Sons, Ltd.

Application and Research of Routing Protocol Based on AODV in Cognitive Radio

With the rapid development of science and technology, the current spectrum resources can not simply cope with the high-load wireless networks transmission. In addition, because the use of spectrum resources can not be fully maximize the overload load phenomenon, which leads to the waste of resources and loss of the spectrum, the existing overall spectrum resources are not adequate utilization and its utilization can not be improved. Obviously, in order to meet the growing demand for Internet and wireless communications, we must address the low rate of utilization of spectrum resources To this end, it is proposed to use the spectrum resources in cognitive radio drainage techniques, cognitive radio node to perceive the change of radio spectrum resources, and thus connected in the most appropriate timing and spectral integration, the effect of radio data transmission, and adequately addressed the problem of the spectrum resource low utilization. This thesis is based on the in-depth analysis of cognitive radio technology to understand the routing protocol in wireless cross-layer data transmission, and then discuss the relevant characteristics of the AODV routing protocol, and base on the AODV, the routing protocol uses in the analysis of the radio network organization based on the proposed to the possibility of cognitive radio.

A Comparision Study of Common Routing Protocols Used In Wireless Ad-Hoc Networks

The aim of this study is to analyze and compare performance of both reactive and proactive Mobile Ad hoc Networks (MANETs) routing protocols using different environments. Wireless networks are divided into two types: infrastructure and ad hoc network. In wireless ad hoc networks each node can be a sender, router and receiver, so these types of network are less structure compared to infrastructure network. Therefore wireless ad hoc networks need special routing protocols to overcome the limitations of wireless ad hoc networks. Wireless ad hoc networks routing protocols can be categorized into two types: reactive (on demand) routing protocols and proactive routing protocols. In proactive routing protocols the nodes periodically send control messages across the network to build routing table. Different routing protocols have been simulated using GloMoSim (Global Mobile Information system simulation) library and PARSEC compiler. Five multi-hop wireless ad hoc network routing protocols have been simulated to cover a range of design choices: Wireless Routing Protocol (WRP), Fisheye State Routing (FSR), Dynamic Source Routing (DSR), Ad hoc On-demand Distance Vector (AODV) and Location Aided Routing (LAR). The protocols are evaluated in different environments to investigate performance metrics. Performance metric includes the following aspects: packets deliver ratio, end-to-end delay and end-to-end throughput.

A Wireless Routing Protocol for Pumps Monitoring in Large Industrial Plant

According to the demands of pump monitoring in large industrial plant, a new routing protocol combined with proactive routing and on-demand routing named Command Substitution and Sequential Cache(CSSC) is designed in this paper. We fuse and modify traditional routing protocols and on-demand routing protocols to meet two main data acquisition ways in pump monitoring of large industrial plant: spot inspection and alarm. Experiments show that, this protocol can effectively reduce the controlling overhead and transmission delay.

The Application of Ant Colony Optimization in Wireless Sensor Network Routing

The paper proposes wireless sensor clustering routing protocol based on ant colony algorithm(ACO). The method firstly uses the network self-topology to get a stable cluster structure based on modularity clustering algorithm; secondly make a new cluster-head selection function according to each cluster node residual energy and the distribution of cluster node; then we propose inter-cluster multi-hop routing algorithm based on ant colony optimization, which in order to balance the energy between consumption on the transmission path and residual one of cluster-head node, developing new ant transmission probability and pheromone updating strategy, we verify the validity of algorithm through simulation.

Reliable Peer Discovery in Content-Aware Overlay Network

Peer to peer (p2p) file sharing protocol and ad hoc wireless routing protocol shares many intriguing similarities even though they operate on a totally different level of a network. With the popularity of p2p application for resource sharing and the availability of resources has motivated the researchers to examine the potentials of p2p applications in a dynamic environment. With the success of p2p for file sharing applications, its benefits can be brought by constructing the overlay network with easy access of content to improve their availability and performance. This paper is one such an attempt to exploit the potential of mobile characteristics for the benefit of p2p application to satisfy the users demand. This paper focuses on how reliable content sharing could be realized in an ad hoc environment through peer to peer (p2p) system. This efficient content delivering system reduces the search latency of content peer selection. Also the reliable path for sharing content with trust calculation has been proposed. Unstructured peer to peer network is considered for the platform, emphasizing the content based interaction with a pro-active routing protocol at the network layer. The experiments have been performed on the network simulator NS-2 and the results showed that the proposed system improves the hit ratio and reduces the overhead traffic.

An Analysis and Overview of Wireless Routing Protocols

Problem statement: In the past, the main focus of the research in the wireless network is to provide optimal routes between source and destination nodes. The wireless routing is required additional computational effort than wired routing in order to fulfill the major wireless characteristics such as battery power constraints, frequent mobility and less processing. Approach: In addition to wired routing the wireless routing requires some characteristics, such as scalability, higher throughput, lesser packet loss and providing QoS. The wireless routing protocol is categorized based on routing update mechanism, based on routing topology and based on special resources like energy aware and location aware. Results: Routing in the wireless network is classified as proactive, reactive and hybrid routing protocols. These routing protocols are discussed in this study with the experimental result. Conclusion: In this study, an analysis is described on the existing routing methodology which is proposed for solving various routing issues in the wireless communication.

Lessons Learned in Transforming from Traditional to Agile Development

Problem statement: In the past, the main focus of the research in the wireless network is to provide optimal routes between source and destination nodes. The wireless routing is required additional computational effort than wired routing in order to fulfill the major wireless characteristics such as battery power constraints, frequent mobility and less processing. Approach: In addition to wired routing the wireless routing requires some characteristics, such as scalability, higher throughput, lesser packet loss and providing QoS. The wireless routing protocol is categorized based on routing update mechanism, based on routing topology and based on special resources like energy aware and location aware. Results: Routing in the wireless network is classified as proactive, reactive and hybrid routing protocols. These routing protocols are discussed in this study with the experimental result. Conclusion: In this study, an analysis is described on the existing routing methodology which is proposed for solving various routing issues in the wireless communication.