Showing papers on "Wireless Routing Protocol published in 2015"
TL;DR: Simulation results show that the proposed LARP outperforms the existing routing protocols in terms of packet delivery ratio and normalized routing overhead, and are expected to be of greater value than other existing solutions in underwater environment.
Abstract: As the network communications technology developing, a new type of networks has appeared in the daily life which is named underwater sensor networks (UWSNs). UWSNs are a class of emerging networks that experience variable and high propagation delays and limited available bandwidth. There are comprehensive applications in this area such as oceanographic data collection, pollution monitoring, offshore exploration, assisted navigation and so on. Due to the different environment under the ocean, routing protocols in UWSNs should be re-designed to fit for the surroundings. In particular, routing protocols in UWSNs should ensure the reliability of message transmission, not just decrease the delay. In this paper, we propose a novel routing protocol named Location-Aware Routing Protocol (LARP) for UWSNs, where the location information of nodes is used to help the transmission of the message. Simulation results show that the proposed LARP outperforms the existing routing protocols in terms of packet delivery ratio and normalized routing overhead. We expect LARP to be of greater value than other existing solutions in underwater environment.
384 citations
TL;DR: This work aims to provide a review of the routing protocols in the Internet of Vehicles from routing algorithms to their evaluation approaches, and provides five different taxonomies of routing protocols.
Abstract: This work aims to provide a review of the routing protocols in the Internet of Vehicles (IoV) from routing algorithms to their evaluation approaches. We provide five different taxonomies of routing protocols. First, we classify them based on their transmission strategy into three categories: unicast, geocast, and broadcast ones. Second, we classify them into four categories based on information required to perform routing: topology-, position-, map-, and path-based ones. Third, we identify them in delay-sensitive and delay-tolerant ones. Fourth, we discuss them according to their applicability in different dimensions, i.e., 1-D, 2-D, and 3-D. Finally, we discuss their target networks, i.e., homogeneous and heterogeneous ones. As the evaluation is also a vital part in IoV routing protocol studies, we examine the evaluation approaches, i.e., simulation and real-world experiments. IoV includes not only the traditional vehicular ad hoc networks, which usually involve a small-scale and homogeneous network, but also a much larger scale and heterogeneous one. The composition of classical routing protocols and latest heterogeneous network approaches is a promising topic in the future. This work should motivate IoV researchers, practitioners, and new comers to develop IoV routing protocols and technologies.
334 citations
TL;DR: This work develops one data collection protocol called EDAL, which stands for Energy-efficient Delay-aware Lifetime-balancing data collection, and proposes both a centralized heuristic to reduce its computational overhead and a distributed heuristics to make the algorithm scalable for large-scale network operations.
Abstract: Our work in this paper stems from our insight that recent research efforts on open vehicle routing (OVR) problems, an active area in operations research, are based on similar assumptions and constraints compared to sensor networks. Therefore, it may be feasible that we could adapt these techniques in such a way that they will provide valuable solutions to certain tricky problems in the wireless sensor network (WSN) domain. To demonstrate that this approach is feasible, we develop one data collection protocol called EDAL, which stands for Energy-efficient Delay-aware Lifetime-balancing data collection. The algorithm design of EDAL leverages one result from OVR to prove that the problem formulation is inherently NP-hard. Therefore, we proposed both a centralized heuristic to reduce its computational overhead and a distributed heuristic to make the algorithm scalable for large-scale network operations. We also develop EDAL to be closely integrated with compressive sensing, an emerging technique that promises considerable reduction in total traffic cost for collecting sensor readings under loose delay bounds. Finally, we systematically evaluate EDAL to compare its performance to related protocols in both simulations and a hardware testbed.
332 citations
16 Apr 2015
TL;DR: Possible attacks on RPL and 6LoWPAN network, counter measure against them and consequences on network parameters are focused on and the research opportunities in network layer security are discussed.
Abstract: 6LoWPAN (IPv6 over Low-Power Wireless Personal Area Networks) standard allows heavily constrained devices to connect to IPv6 networks. 6LoWPAN is novel IPv6 header compression protocol, it may go easily under attack. Internet of Things consist of devices which are limited in resource like battery powered, memory and processing capability etc. for this a new network layer routing protocol is designed called RPL (Routing Protocol for low power Lossy network). RPL is light weight protocol and doesn't have the functionality like of traditional routing protocols. This rank based routing protocol may goes under attack. Providing security in Internet of Things is challenging as the devices are connected to the unsecured Internet, limited resources, the communication links are lossy and set of novel technologies used such as RPL, 6LoWPAN etc. This paper focus on possible attacks on RPL and 6LoWPAN network, counter measure against them and consequences on network parameters. Along with comparative analysis of methods to mitigate these attacks are done and finally the research opportunities in network layer security are discussed.
245 citations
TL;DR: Extensive simulations and real testbed results show that the proposed solution ENS_OR can significantly improve the network performance on energy saving and wireless connectivity in comparison with other existing WSN routing schemes.
Abstract: Energy savings optimization becomes one of the major concerns in the wireless sensor network (WSN) routing protocol design, due to the fact that most sensor nodes are equipped with the limited nonrechargeable battery power. In this paper, we focus on minimizing energy consumption and maximizing network lifetime for data relay in one-dimensional (1-D) queue network. Following the principle of opportunistic routing theory, multihop relay decision to optimize the network energy efficiency is made based on the differences among sensor nodes, in terms of both their distance to sink and the residual energy of each other. Specifically, an Energy Saving via Opportunistic Routing (ENS_OR) algorithm is designed to ensure minimum power cost during data relay and protect the nodes with relatively low residual energy. Extensive simulations and real testbed results show that the proposed solution ENS_OR can significantly improve the network performance on energy saving and wireless connectivity in comparison with other existing WSN routing schemes.
243 citations
TL;DR: This paper provides a taxonomy for opportunistic routing proposals, based on their routing objectives as well as the optimization tools and approaches used in the routing design, and identifies and discusses the main future research directions related to the opportunistic routed design, optimization, and deployment.
Abstract: The great advances made in the wireless technology have enabled the deployment of wireless communication networks in some of the harshest environments such as volcanoes, hurricane-affected regions, and underground mines. In such challenging environments suffering from the lack of infrastructure, traditional routing is not efficient and sometimes not even feasible. Moreover, the exponential growth of the number of wireless connected devices has created the need for a new routing paradigm that could benefit from the potentials offered by these heterogeneous wireless devices. Hence, in order to overcome the traditional routing limitations, and to increase the capacity of current dynamic heterogeneous wireless networks, the opportunistic routing paradigm has been proposed and developed in recent research works. Motivated by the great interest that has been attributed to this new paradigm within the last decade, we provide a comprehensive survey of the existing literature related to opportunistic routing. We first study the main design building blocks of opportunistic routing. Then, we provide a taxonomy for opportunistic routing proposals, based on their routing objectives as well as the optimization tools and approaches used in the routing design. Hence, five opportunistic routing classes are defined and studied in this paper, namely, geographic opportunistic routing, link-state-aware opportunistic routing, probabilistic opportunistic routing, optimization-based opportunistic routing, and cross-layer opportunistic routing. We also review the main protocols proposed in the literature for each class. Finally, we identify and discuss the main future research directions related to the opportunistic routing design, optimization, and deployment.
229 citations
TL;DR: This paper outlines the merits and limitations of the clustering schemes in WSNs, and proposes a taxonomy of cluster based routing methods, which are broadly classified into three categories: flat routing, hierarchical or clusterbased routing, and location based routing.
197 citations
TL;DR: Ring Routing is proposed, a novel, distributed, energy-efficient mobile sink routing protocol, suitable for time-sensitive applications, which aims to minimize this overhead while preserving the advantages of mobile sinks.
Abstract: In a typical wireless sensor network, the batteries of the nodes near the sink deplete quicker than other nodes due to the data traffic concentrating towards the sink, leaving it stranded and disrupting the sensor data reporting. To mitigate this problem, mobile sinks are proposed. They implicitly provide load-balanced data delivery and achieve uniform-energy consumption across the network. On the other hand, advertising the position of the mobile sink to the network introduces an overhead in terms of energy consumption and packet delays. In this paper, we propose Ring Routing, a novel, distributed, energy-efficient mobile sink routing protocol, suitable for time-sensitive applications, which aims to minimize this overhead while preserving the advantages of mobile sinks. Furthermore, we evaluate the performance of Ring Routing via extensive simulations.
193 citations
TL;DR: This paper offers a classification of atypical hierarchical routing of WSNs, and gives detailed analysis of different logical topologies, to provide useful guidance for system designers on how to evaluate and select appropriate logical topological protocols for specific applications.
Abstract: Hierarchical routing in wireless sensor networks (WSNs) is a very important topic that has been attracting the research community in the last decade. Typical hierarchical routing is called clustering routing, in which the network is divided into multiple clusters. Recently, some types of atypical hierarchical routing arise, including chain-based, tree-based, grid-based routing, and area-based routing. There are several survey papers that present and compare the hierarchical routing protocols from various perspectives, but a survey on atypical hierarchical routing is still missing. This paper makes a first attempt to provide a comprehensive review on atypical hierarchical routing. We offer a classification of atypical hierarchical routing of WSNs, and give detailed analysis of different logical topologies. The most representative atypical hierarchical routing protocols are described, discussed, and qualitatively compared. In particular, the advantages and disadvantages of different atypical hierarchical routing protocols are analyzed with respect to their significant performances and application scenarios. Finally, we put forward some open issues concerning the design of hierarchical WSNs. This survey aims to provide useful guidance for system designers on how to evaluate and select appropriate logical topologies and hierarchical routing protocols for specific applications.
180 citations
TL;DR: The proposed energy aware routing algorithm is based on a clever strategy of cluster head (CH) selection, residual energy of the CHs and the intra-cluster distance for cluster formation and achieves constant message and linear time complexity.
176 citations
TL;DR: A mobile sink-based adaptive immune energy-efficient clustering protocol (MSIEEP) that improves the lifetime, the stability, and the instability periods over the previous protocols, because it always selects CHs from high-energy nodes.
Abstract: Energy hole problem is a critical issue for data gathering in wireless sensor networks. Sensors near the static sink act as relays for far sensors and thus will deplete their energy very quickly, resulting energy holes in the sensor field. Exploiting the mobility of a sink has been widely accepted as an efficient way to alleviate this problem. However, determining an optimal moving trajectory for a mobile sink is a non-deterministic polynomial-time hard problem. Thus, this paper proposed a mobile sink-based adaptive immune energy-efficient clustering protocol (MSIEEP) to alleviate the energy holes. A MSIEEP uses the adaptive immune algorithm (AIA) to guide the mobile sink-based on minimizing the total dissipated energy in communication and overhead control packets. Moreover, AIA is used to find the optimum number of cluster heads (CHs) to improve the lifetime and stability period of the network. The performance of MSIEEP is compared with the previously published protocols; namely, low-energy adaptive clustering hierarchy (LEACH), genetic algorithm-based LEACH, amend LEACH, rendezvous, and mobile sink improved energy-efficient PEGASIS-based routing protocol using MATLAB. Simulation results show that MSIEEP is more reliable and energy efficient as compared with other protocols. Furthermore, it improves the lifetime, the stability, and the instability periods over the previous protocols, because it always selects CHs from high-energy nodes. Moreover, the mobile sink increases the ability of the proposed protocol to deliver packets to the destination.
01 Nov 2015
TL;DR: Results show that CARP robust mechanism for relay selection doubles the packet delivery, which has been investigated through ns2-based simulations and experiments at sea.
Abstract: The paper concerns the definition and performance evaluation of a new multi-hop routing protocol for underwater wireless sensor networks Our solution, termed CARP for Channel-aware Routing Protocol, exploits link quality information for data forwarding, in that nodes are selected as relays if they exhibit recent history of successful transmissions to their neighbors CARP avoids loops and can successfully route around connectivity voids and shadow zones by using simple topology information, such as hop count The protocol is also designed to take advantage of power control for selecting robust links The performance of CARP has been compared with that of two other protocols for underwater routing, namely, the Focused Beam Routing (FBR) and a flooding-based solution (EFlood) Metrics of interest include packet delivery ratio, end-to-end packet latency and energy consumption, which have been investigated through ns2-based simulations and experiments at sea The in-field trials have been conducted at two European locations, namely, a Norwegian fjord and the Mediterranean Sea The tests in the Mediterranean Sea have been performed jointly with the NATO Science and Technology Organization Centre for Maritime Research and Experimentation (STO CMRE), under a collaboration agreement between the University of Roma and CMRE 1 Our results show that CARP robust mechanism for relay selection doubles the packet delivery
TL;DR: Existing routing protocols in UWSNs are classified into two categories based on a route decision maker and the performance of existing routing protocols is compared in detail.
Abstract: Recently, underwater wireless sensor networks (UWSNs) have emerged as a promising networking technique for various underwater applications. An energy efficient routing protocol plays a vital role in data transmission and practical applications. However, due to the specific characteristics of UWSNs, such as dynamic structure, narrow bandwidth, rapid energy consumption, and high latency, it is difficult to build routing protocols for UWSNs. In this article we focus on surveying existing routing protocols in UWSNs. First, we classify existing routing protocols into two categories based on a route decision maker. Then the performance of existing routing protocols is compared in detail. Furthermore, future research issues of routing protocols in UWSNs are carefully analyzed.
24 Aug 2015
TL;DR: This paper develops a traffic matrix oblivious algorithm for robust segment routing in the offline case and a competitive algorithm for online segment routing and shows that both these algorithms work well in practice.
Abstract: Segment Routing is a proposed IETF protocol to improve traffic engineering and online route selection in IP networks. The key idea in segment routing is to break up the routing path into segments in order to enable better network utilization. Segment routing also enables finer control of the routing paths and can be used to route traffic through middle boxes. This paper considers the problem of determining the optimal parameters for segment routing in the offline and online cases. We develop a traffic matrix oblivious algorithm for robust segment routing in the offline case and a competitive algorithm for online segment routing. We also show that both these algorithms work well in practice.
01 Feb 2015
TL;DR: A classification of the probabilistic schemes, an exhaustive review of the evaluation methodology including their performance metrics, types of network simulators, their comparisons, and some examples of real implementations are presented in this paper.
Abstract: Broadcast or flooding is a dissemination technique of paramount importance in wireless ad hoc networks. The broadcast scheme is widely used within routing protocols by a wide range of wireless ad hoc networks such as mobile ad hoc networks, vehicular ad hoc networks, and wireless sensor networks, and used to spread emergency messages in critical scenarios after a disaster scenario and/or an accidents. As the type broadcast scheme used plays an important role in the performance of the network, it has to be selected carefully. Though several types of broadcast schemes have been proposed, probabilistic broadcast schemes have been demonstrated to be suitable schemes for wireless ad hoc networks due to a range of benefits offered by them such as low overhead, balanced energy consumption, and robustness against failures and mobility of nodes. In the last decade, many probabilistic broadcast schemes have been proposed by researchers. In addition to reviewing the main features of the probabilistic schemes found in the literature, we also present a classification of the probabilistic schemes, an exhaustive review of the evaluation methodology including their performance metrics, types of network simulators, their comparisons, and present some examples of real implementations, in this paper.
TL;DR: A hybrid algorithm based on genetic algorithm and simulated annealing is applied to optimize ASLPR in order to prolong the network lifetime, based on the application specifications.
Abstract: Energy consumption is a major issue in designing wireless sensor networks. To achieve the energy efficiency, many routing protocols have been proposed and LEACH is the representative one. LEACH utilizes randomize rotation of the cluster heads to evenly distribute energy load among all nodes. However, it depends only on a probability model and energy efficiency could not be maximized. In this paper, a new application specific low power routing protocol named ASLPR is introduced that takes into account some concepts from sensor nodes (e.g., distance from base station, residual energy, distance between cluster heads) to elect the optimal cluster heads. As the proposed routing protocol is complex and has some controllable parameters, tuning of its parameters is an important problem to achieve the best performance based on the application. In this work, a hybrid algorithm based on genetic algorithm and simulated annealing is applied to optimize ASLPR in order to prolong the network lifetime, based on the application specifications. Simulation results demonstrate the efficiency of the proposed methodology to balance the energy consumption of nodes and maximize network lifetime. The gain (on average) in stable region of ASLPR until first node dies is 78%, as compared with three LEACH-based protocols.
TL;DR: The results demonstrate that the proposed protocol performs better than well-known cluster-based sensor network protocols in terms of various performance metrics such as scalability, Packet Delivery Rate (PDR) at the CHs and delivery of total data packets to the BS.
TL;DR: A unified formal model of the bio-inspired multimodular approaches applied to VANET routing is proposed and is highlighted to highlight main future research directions in this area.
Abstract: Vehicular Ad hoc NETworks (VANETs) play a key role in the design and development of Intelligent Transportation Systems (ITS) that aim to improve road safety and transportation productivity VANETs cover vehicle-to-vehicle and vehicle-to-roadside communications One of the most important challenges of this type of network is the timely and reliable dissemination of messages among vehicular nodes that enable drivers to take appropriate decisions to improve road safety In the past decade, many routing protocols for VANETs that can support reliability and safety requirements have been proposed These protocols suffer from several limitations, including complexity, lack of scalability to large scale networks, routing overheads, etc To address these limitations, various bio-inspired approaches have been proposed to route packets among vehicular nodes in an optimized manner We survey recent proposed bio-inspired routing algorithms for the VANET environment In particular, we identify the key features, strengths, and weaknesses of these algorithms and compare them by using various criteria Moreover, we propose a unified formal model of the bio-inspired multimodular approaches applied to VANET routing We highlight main future research directions in this area
01 Jan 2015
TL;DR: This paper presents a analysis of the main routing protocols proposed for wireless sensor networks and their implications for military, environment, health, and commercial applications.
Abstract: wireless sensor networks is one of the most common communication tools used in many areas such as military, environment, health, and commercial applications. The wireless sensor network comprised of huge number of sensor nodes. The sensor nodes communicate by means of many communication strategies. Then, the data exchange is supported by multi-hop communications. Routing protocols are responsible for discovering and maintaining the routes in the network. The correctness of a particular routing protocol mainly depends on the capabilities of the nodes and on the application requirements. This paper presents a analysis of the main routing protocols proposed for wireless sensor networks
11 May 2015
TL;DR: In this paper, a number of well-know energy efficient routing algorithms for WSNs have been classified and presented based on their attributes.
Abstract: Wireless sensor networks have a wide range of applications because they can be adapted for various environments. They can operate independently in harsh places where a human presence is risky or even impossible. Since their life time is dependent on their batteries and replacing or recharging their batteries is impossible in rough places, it is necessary to find energy efficient routing protocols for them. In this paper, a number of well-know energy efficient routing algorithms for WSNs have been classified and presented based on their attributes.
TL;DR: Performance analysis demonstrates that the proposed FSC can efficiently save energy, which is much better than hybrid, energy-efficient, and distributed clustering in terms of both energy saving and packet collection rate.
Abstract: Due to the energy limit of sensor nodes, prolonging lifetime of wireless sensor networks (WSNs) is a big challenge. This challenge becomes even more critical in large-scale sensor networks, in which more energy is consumed because of more data collections and packet transmissions. It is believed that clustering-based protocols are the best choice for such kind of WSNs. In this paper, we propose a clustering protocol called fan-shaped clustering (FSC) to partition a large-scale network into fan-shaped clusters. Based on this clustering scheme, different energy saving methods are proposed, such as efficient cluster head and relay selection, locality of re-clustering, simple but robust routing and hotspot solution. Performance analysis demonstrates that the proposed FSC can efficiently save energy, which is much better than hybrid, energy-efficient, and distributed clustering in terms of both energy saving and packet collection rate.
Book•
13 Nov 2015
TL;DR: This paper presents a meta-modelling framework for estimating the resilience of wireless mesh networks to disruption-tolerant routing in Vehicular Ad-hoc Networks and some of the mechanisms that control their resilience.
Abstract: Introduction Principles of Communication Networks Resilience Resilience of Future Internet Communications Resilience of Wireless Mesh Networks Disruption-tolerant Routing in Vehicular Ad-hoc Networks
[...]
TL;DR: Simulation results show improved performance of the proposed protocols in comparison to the selected existing ones in terms of the chosen performance metrics.
TL;DR: The proposed genetic algorithm based approaches for clustering and routing in wireless sensor networks outperform the existing algorithms in terms of various performance metrics including energy consumption, number of active nodes, first gateway die and number of dead gateway per round.
Abstract: Energy efficient clustering and routing are two well known problems in wireless sensor networks. In this paper, we propose genetic algorithm based approaches for clustering and routing in wireless sensor networks. The clustering is based on residual energy of the gateways and distance from sensor nodes to their corresponding cluster head. The routing scheme is also based on the residual energy of the gateways along with a trade-off between transmission distance and number of forwards. We perform extensive simulations of the proposed algorithms and compare the simulation results with that of the existing algorithms. The results demonstrate that the proposed algorithms outperform the existing algorithms in terms of various performance metrics including energy consumption, number of active nodes, first gateway die and number of dead gateway per round.
01 Jul 2015
TL;DR: This paper extends OLSR by using the proposed trust model and trust based routing algorithm, called FPNT-OLSR, and designs a trust factor collecting method and an efficient trust information propagating method, which do not generate extra control messages.
Abstract: A mobile ad hoc network (MANET) is a kind of infrastructure-less wireless network that is self-organized by mobile nodes communicating with each other freely and dynamically. MANET can be applied to many fields, such as emergency communications after disaster, intelligent transportation, and Internet of things. With the rapid development of wireless network applications, MANET will become dense and large because more and more mobile devices are required to be interconnected. The optimized link state routing (OLSR) protocol is an efficient proactive routing protocol which is very suitable for such dense and large-scale MANET. However, in both data plane and routing plane, OLSR-based MANET suffers from many serious security threats which are difficult to resist via traditional security mechanisms. In this paper, we propose a trust based routing mechanism to alleviate this issue. In this mechanism, a trust reasoning model based on fuzzy Petri net is presented to evaluate trust values of mobile nodes. In addition, to avoid malicious or compromised nodes, a trust based routing algorithm is proposed to select a path with the maximum path trust value among all possible paths. Then we extend OLSR by using the proposed trust model and trust based routing algorithm, called FPNT-OLSR. For the implementation of FPNT-OLSR, we design a trust factor collecting method and an efficient trust information propagating method, which do not generate extra control messages. Simulation results show that FPNT-OLSR is very effective in establishing secure routes. It also performs better than existing trust based OLSR protocols in terms of packet delivery ratio, average latency and overhead.
TL;DR: This paper proposes a multi-agent framework that enables each sensor node to build a cooperative neighbour set based on past routing experience and can be used to assist many existing routing approaches to improve their routing performance.
Abstract: Wireless sensor networks (WSNs) have been widely investigated in recent years. One of the fundamental issues in WSNs is packet routing, because in many application domains, packets have to be routed from source nodes to destination nodes as soon and as energy efficiently as possible. To address this issue, a large number of routing approaches have been proposed. Although every existing routing approach has advantages, they also have some disadvantages. In this paper, a multi-agent framework is proposed that can assist existing routing approaches to improve their routing performance. This framework enables each sensor node to build a cooperative neighbour set based on past routing experience. Such cooperative neighbours, in turn, can help the sensor to effectively relay packets in the future. This framework is independent of existing routing approaches and can be used to assist many existing routing approaches. Simulation results demonstrate the good performance of this framework in terms of four metrics: average delivery latency, successful delivery ratio, number of live nodes and total sensing coverage.
TL;DR: Survey of various mechanisms to improve different ad-hoc routing protocols for secure routing process by enhancing the trust among different nodes in VANETs is presented.
TL;DR: This paper presents a trust and energy aware routing protocol (TERP) that makes use of a distributed trust model for the detection and isolation of misbehaving and faulty nodes, and incorporates a composite routing function that encompasses trust, residual-energy, and hopcounts of neighbor nodes in making routing decisions.
Abstract: In most of the applications of wireless sensor networks (WSNs), nodes operate in unattended environments and are, therefore, vulnerable to variety of attacks. Due to dynamic and unpredictable changing behavior of nodes, the reliable data delivery is a challenging task. For WSNs, the traditional cryptographic and authentication-based solutions cannot be adopted due to their associated cost and incapability to counter nodes misbehavior attacks. Recently, trust-based solutions have proved to be more effective to address nodes' misbehavior attacks. However, the existing solutions give rise to high energy consumption and control overheads in pursuit of trust estimation and network-wide dissemination, which not only adds to network congestion but also undermines network lifetime. In this paper, we present a trust and energy aware routing protocol (TERP) that makes use of a distributed trust model for the detection and isolation of misbehaving and faulty nodes. Moreover, TERP incorporates a composite routing function that encompasses trust, residual-energy, and hopcounts of neighbor nodes in making routing decisions. This multi-facet routing strategy helps to balance out energy consumption among trusted nodes, while routing data using shorter paths. The simulation results demonstrate reduced energy consumption, improved throughout and network lifetime of TERP when compared with the existing work.
TL;DR: This article focuses on the application of the traditional, as well as the enhanced, RL models, to routing in wireless networks, and an extensive review on new features in RL-based routing, and how various routing challenges and problems have been approached using RL.
Abstract: The dynamicity of distributed wireless networks caused by node mobility, dynamic network topology, and others has been a major challenge to routing in such networks. In the traditional routing schemes, routing decisions of a wireless node may solely depend on a predefined set of routing policies, which may only be suitable for a certain network circumstances. Reinforcement Learning (RL) has been shown to address this routing challenge by enabling wireless nodes to observe and gather information from their dynamic local operating environment, learn, and make efficient routing decisions on the fly. In this article, we focus on the application of the traditional, as well as the enhanced, RL models, to routing in wireless networks. The routing challenges associated with different types of distributed wireless networks, and the advantages brought about by the application of RL to routing are identified. In general, three types of RL models have been applied to routing schemes in order to improve network performance, namely Q-routing, multi-agent reinforcement learning, and partially observable Markov decision process. We provide an extensive review on new features in RL-based routing, and how various routing challenges and problems have been approached using RL. We also present a real hardware implementation of a RL-based routing scheme. Subsequently, we present performance enhancements achieved by the RL-based routing schemes. Finally, we discuss various open issues related to RL-based routing schemes in distributed wireless networks, which help to explore new research directions in this area. Discussions in this article are presented in a tutorial manner in order to establish a foundation for further research in this field.
TL;DR: A new protocol to reach energy efficiency is proposed an intelligent routing protocol algorithm based on reinforcement learning techniques that has improvement in different parameters such as network lifetime, packet delivery, packet delay, and network balance.
Abstract: In wireless sensor networks energy is a very important issue because these networks consist of lowpower sensor nodes. This paper proposes a new protocol to reach energy efficiency. The protocol has a different priority in energy efficiency as reducing energy consumption in nodes, prolonging lifetime of the whole network, increasing system reliability, increasing the load balance of the network, and reducing packet delays in the network. In the new protocol is proposed an intelligent routing protocol algorithm. It is based on reinforcement learning techniques. In the first step of the protocol, a new clustering method is applied to the network and the network is established using a connected graph. Then data is transmitted using the Q-value parameter of reinforcement learning technique. The simulation results show that our protocol has improvement in different parameters such as network lifetime, packet delivery, packet delay, and network balance.