Showing papers on "Multipath routing published in 2016"
TL;DR: The most important innovation of ActiveTrust is that it avoids black holes through the active creation of a number of detection routes to quickly detect and obtain nodal trust and thus improve the data route security.
Abstract: Wireless sensor networks (WSNs) are increasingly being deployed in security-critical applications Because of their inherent resource-constrained characteristics, they are prone to various security attacks, and a black hole attack is a type of attack that seriously affects data collection To conquer that challenge, an active detection-based security and trust routing scheme named ActiveTrust is proposed for WSNs The most important innovation of ActiveTrust is that it avoids black holes through the active creation of a number of detection routes to quickly detect and obtain nodal trust and thus improve the data route security More importantly, the generation and the distribution of detection routes are given in the ActiveTrust scheme, which can fully use the energy in non-hotspots to create as many detection routes as needed to achieve the desired security and energy efficiency Both comprehensive theoretical analysis and experimental results indicate that the performance of the ActiveTrust scheme is better than that of the previous studies ActiveTrust can significantly improve the data route success probability and ability against black hole attacks and can optimize network lifetime
290 citations
25 Feb 2016
TL;DR: The present study reviews many proposals regarding routing problem and its solution and the state of the art analysis is presented.
Abstract: At present, the internet has grown exponentially due to its wide connectivity with different sets of devices. The only issue is the tolerances towards delay which leads to disconnection in case the delay is above tolerance level. Delay Tolerant Network (DTN) is the latest development to sustain longer delays by allowing disconnected operations. Among the various problems like buffering, resources allocation and energy consumption, routing is a major issue. The present study reviews many proposals regarding routing problem and its solution and the state of the art analysis is presented. General Terms Networks, delay, flooding, forwarding.
229 citations
TL;DR: It is argued that by carefully considering spatial reusability of the wireless communication media, one can tremendously improve the end-to-end throughput in multi-hop wireless networks and compare them with existing single-path routing and anypath routing protocols, respectively.
Abstract: In the problem of routing in multi-hop wireless networks, to achieve high end-to-end throughput, it is crucial to find the “best” path from the source node to the destination node. Although a large number of routing protocols have been proposed to find the path with minimum total transmission count/time for delivering a single packet, such transmission count/time minimizing protocols cannot be guaranteed to achieve maximum end-to-end throughput. In this paper, we argue that by carefully considering spatial reusability of the wireless communication media, we can tremendously improve the end-to-end throughput in multi-hop wireless networks. To support our argument, we propose spatial reusability-aware single-path routing (SASR) and anypath routing (SAAR) protocols, and compare them with existing single-path routing and anypath routing protocols, respectively. Our evaluation results show that our protocols significantly improve the end-to-end throughput compared with existing protocols. Specifically, for single-path routing, the median throughput gain is up to 60 percent, and for each source-destination pair, the throughput gain is as high as $5.3\times$ ; for anypath routing, the maximum per-flow throughput gain is 71.6 percent, while the median gain is up to 13.2 percent.
186 citations
TL;DR: A new clustering-based collaborative multi-hop cognitive routing algorithm is proposed to attain better network performance and takes into account the interference among nodes including primary and secondary users.
Abstract: The collaboration of nodes in cognitive wireless networks is a large challenge This paper studies the collaborative multi-hop routing in cognitive networks We propose a new algorithm to construct the collaborative routing in multi-hop cognitive networks Our algorithm takes into account the interference among nodes including primary and secondary users The clustering and collaboration are exploited to improve the performance of collaborative routing in multi-hop cognitive wireless networks with multiple primary and secondary users By analyzing the maximum transmission distance, collaborations, transmission angle control and power control, and channel allocation, we propose a new clustering-based collaborative multi-hop cognitive routing algorithm to attain better network performance Simulation results show that our approach is feasible and effective
159 citations
TL;DR: This paper makes the following contributions: a novel opportunistic routing mechanism to select the subset of forwarders that maximizes the greedy progress yet limits cochannel interference and an efficient underwater dead end recovery method that outperforms the recently proposed approaches.
Abstract: A Sensor Equipped Aquatic (SEA) swarm is a sensor cloud that drifts with water currents and enables 4-D (space and time) monitoring of local underwater events such as contaminants, marine life, and intruders. The swarm is escorted on the surface by drifting sonobuoys that collect data from the underwater sensors via acoustic modems and report it in real time via radio to a monitoring center. The goal of this study is to design an efficient anycast routing algorithm for reliable underwater sensor event reporting to any surface sonobuoy. Major challenges are the ocean current and limited resources (bandwidth and energy). In this paper, these challenges are addressed, and HydroCast, which is a hydraulic-pressure-based anycast routing protocol that exploits the measured pressure levels to route data to the surface sonobuoys, is proposed. This paper makes the following contributions: a novel opportunistic routing mechanism to select the subset of forwarders that maximizes the greedy progress yet limits cochannel interference and an efficient underwater dead end recovery method that outperforms the recently proposed approaches. The proposed routing protocols are validated through extensive simulations.
153 citations
TL;DR: This paper articulate this problem and classify current routing protocols for WSNs into two categories according to their orientation toward either homogeneous or heterogeneous W SNs, further classified into static and mobile ones.
Abstract: Due to a battery constraint in wireless sensor networks (WSNs), prolonging their lifetime is important. Energy-efficient routing techniques for WSNs play a great role in doing so. In this paper, we articulate this problem and classify current routing protocols for WSNs into two categories according to their orientation toward either homogeneous or heterogeneous WSNs. They are further classified into static and mobile ones. We give an overview of these protocols in each category by summarizing their characteristics, limitations, and applications. Finally, some open issues in energy-efficient routing protocol design for WSNs are indicated.
148 citations
TL;DR: This work presents a complete taxonomy pertaining to multipath transmission, including link, network, transport, application, and cross layers, and surveys the state-of-the-art for each layer, investigates the problems that each layer aims to address, and makes comprehensive assessment of the solutions.
Abstract: Smart devices equipped with multiple network interfaces are becoming commonplace. Nevertheless, even though multiple interfaces can be used to connect to the Internet, their capabilities have not been fully utilized yet because the default TCP/IP stack supports only a single interface for communication. This situation is now changing due to the emergence of multipath protocols on different network stack layers. For example, many IP level approaches have been proposed utilizing tunneling mechanisms for hiding multipath transmission from the transport protocols. Several working groups under IEEE and IETF are actively standardizing multipath transmission on the link layer and transport layer. Application level approaches enable multipath transmission capability by establishing multiple transport connections and distributing data over them. Given all these efforts, it is beneficial and timely to summarize the state-of-the-art, compare their pros and cons, and discuss about the future directions. To that end, we present a survey on multipath transmission and make several major contributions: 1) we present a complete taxonomy pertaining to multipath transmission, including link, network, transport, application, and cross layers; 2) we survey the state-of-the-art for each layer, investigate the problems that each layer aims to address, and make comprehensive assessment of the solutions; and 3) based on the comparison, we identify open issues and pinpoint future directions for multipath transmission research.
134 citations
TL;DR: The results show that the multihop routing in JCR may lead to the unbalanced CH selection, and the solution is provided to optimize the network lifetime by considering the gradient of one-hop neighbor nodes in the setting of backoff timer.
Abstract: For data collection in large-scale wireless sensor networks (WSNs), dynamic clustering provides a scalable and energy-efficient solution, which uses cluster head (CH) rotation and cluster range assignment algorithms to balance the energy consumption. Nevertheless, most existing works consider the clustering and routing as two isolated issues, which is harmful to the connectivity and energy efficiency of the network. In this paper, we provide a detailed analysis on the relations between clustering and routing, and then propose a joint clustering and routing (JCR) protocol for reliable and efficient data collection in large-scale WSN. JCR adopts the backoff timer and gradient routing to generate connected and efficient intercluster topology with the constraint of maximum transmission range. The relations between clustering and routing in JCR are further exploited by theoretical and numerical analyses. The results show that the multihop routing in JCR may lead to the unbalanced CH selection. Then, the solution is provided to optimize the network lifetime by considering the gradient of one-hop neighbor nodes in the setting of backoff timer. Theoretical analysis and simulation results prove the connectivity and efficiency of the network topology generated by JCR.
128 citations
TL;DR: A novel cluster-based routing protocol called ABC-SD that exploits the biologically inspired fast and efficient searching features of the Artificial Bee Colony metaheuristic to build low-power clusters and a realistic energy model is adopted in the considered network model.
125 citations
01 Apr 2016
TL;DR: An Improved Harmony Search Based Energy Efficient Routing Algorithm for WSNs is proposed, which is based on harmony search (HS) algorithm (a meta-heuristic) and an objective function model that considers both the energy consumption and the length of path is developed.
Abstract: Graphical abstractDisplay Omitted HighlightsA new encoding of harmony memory for routing in WSNs has been proposed.A new generation method of a new harmony for routing in WSNs has been proposed.The dynamic adaptation is introduced for the parameter HMCR to improve the performance of the proposed routing algorithm.An effective local search strategy is proposed to improve the convergence speed and the accuracy of the proposed routing algorithm.An energy efficient objective function model is proposed. Wireless sensor networks (WSNs) is one of the most important technologies in this century. As sensor nodes have limited energy resources, designing energy-efficient routing algorithms for WSNs has become the research focus. And because WSNs routing for maximizing the network lifetime is a NP-hard problem, many researchers try to optimize it with meta-heuristics. However, due to the uncertain variable number and strong constraints of WSNs routing problem, most meta-heuristics are inappropriate in designing routing algorithms for WSNs. This paper proposes an Improved Harmony Search Based Energy Efficient Routing Algorithm (IHSBEER) for WSNs, which is based on harmony search (HS) algorithm (a meta-heuristic). To address the WSNs routing problem with HS algorithm, several key improvements have been put forward: First of all, the encoding of harmony memory has been improved based on the characteristics of routing in WSNs. Secondly, the improvisation of a new harmony has also been improved. We have introduced dynamic adaptation for the parameter HMCR to avoid the prematurity in early generations and strengthen its local search ability in late generations. Meanwhile, the adjustment process of HS algorithm has been discarded to make the proposed routing algorithm containing less parameters. Thirdly, an effective local search strategy is proposed to enhance the local search ability, so as to improve the convergence speed and the accuracy of routing algorithm. In addition, an objective function model that considers both the energy consumption and the length of path is developed. The detailed descriptions and performance test results of the proposed approach are included. The experimental results clearly show the advantages of the proposed routing algorithm for WSNs.
123 citations
03 Oct 2016
TL;DR: An in-depth study of multipath for mobile settings, focusing on MPTCP, and design and implement a flexible software architecture for mobile multipath called MPFlex, which strategically employs multiplexing to improve multipath performance (by up to 63% for short-lived flows).
Abstract: Today's mobile devices are usually equipped with multiple wireless network interfaces that provide new opportunities for improving application performance. In this paper, we conduct an in-depth study of multipath for mobile settings, focusing on MPTCP, with the goal of developing key insights for evolving the mobile multipath design. First, we conduct to our knowledge the most in-depth and the longest user trial of mobile multipath that focuses not only on MPTCP performance, but also on cross-layer interactions. Second, we identify a new research problem of multipath-aware CDN server selection. We demonstrate its real-world importance and provide recommendations. Third, our measurement findings lead us to design and implement a flexible software architecture for mobile multipath called MPFlex, which strategically employs multiplexing to improve multipath performance (by up to 63% for short-lived flows). MPFlex decouples the high-level scheduling algorithm and the low-level OS protocol implementation, and enables developers to flexibly plug-in new multipath features. MPFlex also provides an ideal vantage point for flexibly realizing user-specified multipath policies and is friendly to middleboxes.
TL;DR: The proposed protocol PDORP has the characteristics of both power efficient gathering sensor information system and DSR routing protocols, and hybridization of genetic algorithm and bacterial foraging optimization is applied to proposed routing protocol to identify energy efficient optimal paths.
Abstract: Energy consumption is one of the constraints in wireless sensor networks (WSNs). The routing protocols are the hot areas to address quality-of-service (QoS) related issues, viz., energy consumption, network lifetime, network scalability, and packet overhead. The key issue in WSN is that these networks suffer from the packet overhead, which is the root cause of more energy consumption and degrade the QoS in sensor networks. In WSN, there are several routing protocols, which are used to enhance the performance of the network. Out of those protocols, dynamic source routing (DSR) protocol is more suitable in terms of small energy density, but sometimes when the mode of a node changes from active to sleep, the efficiency decreases as the data packets need to wait at the initial point, where the packet has been sent and this increases the waiting time and end-to-end delay of the packets, which leads to increase in energy consumption. Our problem is to identify the dead nodes and to choose another suitable path so that the data transmission becomes smoother and less energy gets conserved. In order to resolve these issues, we propose directional transmission-based energy aware routing protocol named PDORP. The proposed protocol PDORP has the characteristics of both power efficient gathering sensor information system and DSR routing protocols. In addition, hybridization of genetic algorithm and bacterial foraging optimization is applied to proposed routing protocol to identify energy efficient optimal paths. The performance analysis, comparison through a hybridization approach of the proposed routing protocol, gives better result comprising less bit error rate, less delay, less energy consumption, and better throughput, which leads to better QoS and prolong the lifetime of the network. Moreover, the computation model is adopted to evaluate and compare the performance of the both routing protocols using soft computing techniques.
TL;DR: A survey of congestion control solutions for multipath transport protocols and discusses the multipath congestion control design in order to address the need for some desirable properties including TCP-friendliness, load balancing, stability, and Pareto optimality.
Abstract: High-quality services over wired and wireless networks require high bitrate network content delivery. Multipath transport protocols utilize multiple paths to support increased throughput for network applications. Ubiquitous mobile devices with multiple interfaces such as WiFi and 4G/5G cellular, and data centers supporting big data analysis and cloud-computing, motivate adoption of multipath transmission in current and future network architectures. Congestion control mechanisms play a fundamental role in these multipath transport protocols. Diverse approaches have been proposed in the literature, differing in terms of their goals, principles, performance, and mostly in how various issues are addressed in their design. This paper presents a survey of congestion control solutions for multipath transport protocols and discusses the multipath congestion control design in order to address the need for some desirable properties including TCP-friendliness, load balancing, stability, and Pareto optimality. Existing window-based and rate-based multipath congestion control algorithms are investigated and categorized based on their theoretical algorithm design. Next, this paper discusses the congestion control mechanisms used in diverse multipath transport protocols in the context of different network scenarios. Finally, the trends in the future multipath congestion control design are presented.
TL;DR: This paper employs the ant colony optimisation (ACO) technique to compute feasible routes in VANETs subject to multiple QoS constraints determined by the data traffic type, and extends the VANet-oriented evolving graph (VoEG) model to perform plausibility checks on the routing control messages exchanged among vehicles.
Abstract: Secure QoS routing algorithms are a fundamental part of wireless networks that aim to provide services with QoS and security guarantees. In vehicular ad hoc networks (VANETs), vehicles perform routing functions, and at the same time act as end-systems thus routing control messages are transmitted unprotected over wireless channels. The QoS of the entire network could be degraded by an attack on the routing process, and manipulation of the routing control messages. In this paper, we propose a novel secure and reliable multi-constrained QoS aware routing algorithm for VANETs. We employ the ant colony optimisation (ACO) technique to compute feasible routes in VANETs subject to multiple QoS constraints determined by the data traffic type. Moreover, we extend the VANET-oriented evolving graph (VoEG) model to perform plausibility checks on the routing control messages exchanged among vehicles. Simulation results show that the QoS can be guaranteed while applying security mechanisms to ensure a reliable and robust routing service.
TL;DR: In this work, an attempt is carried out to assess the diverse hierarchical routing protocols, developed from LEACH and is extended to other presented routing protocols like TEEN, APTEEN, and PEGASIS.
TL;DR: This paper begins with the challenges and requirements in the design of WMSN routing, followed by an exhaustive survey on routing from the perspective of application requirements and key techniques, that is, QoS provisioning, multimedia awareness, energy efficiency, congestion avoidance, bandwidth optimization.
TL;DR: This paper proposes a novel energy-efficient region-based routing protocol (ER-RPL), which achieves energy- efficient data delivery without compromising reliability and the key of energy saving.
Abstract: Routing plays an important role in the overall architecture of the Internet of Things. IETF has standardized the RPL routing protocol to provide the interoperability for low-power and lossy networks (LLNs). LLNs cover a wide scope of applications, such as building automation, industrial control, healthcare, and so on. LLNs applications require reliable and energy-efficient routing support. Point-to-point (P2P) communication is a fundamental requirement of many LLNs applications. However, traditional routing protocols usually propagate throughout the whole network to discover a reliable P2P route, which requires large amount energy consumption. Again, it is challenging to achieve both reliability and energy-efficiency simultaneously, especially for LLNs. In this paper, we propose a novel energy-efficient region-based routing protocol (ER-RPL), which achieves energy-efficient data delivery without compromising reliability. In contrast of traditional routing protocols where all nodes are required for route discovery, the proposed scheme only requires a subset of nodes to do the job, which is the key of energy saving. Our theoretical analysis and extensive simulation studies demonstrate that ER-RPL has a great performance superiority over two conventional benchmark protocols, i.e., RPL and P2P-RPL.
TL;DR: The routing problems are categorized and the routing-related optimization problems are examined and the optimization of the routing algorithms and the meta-heuristic study of routing optimization are explored.
Abstract: Routing in Wireless Sensor Networks (WSNs) plays a significant role in the field of environment-oriented monitoring, traffic monitoring, etc. Here, wide contributions that are made toward routing in WSN are explored. The paper mainly aims to categorize the routing problems and examines the routing-related optimization problems. For achieving the motive, 50 papers from the standard journals are collected and primarily reviewed in a chronological way. Later, various features that are related to energy, security, speed and reliability problems of routing are discussed. Subsequently, the literature is analyzed based on the simulation environment and experimental setup, awareness over the Quality of Service (QoS) and the deployment against various applications. In addition, the optimization of the routing algorithms and the meta-heuristic study of routing optimization are explored. Routing is a vast area with numerous unsolved issues and hence, various research gaps along with future directions are also presented.
28 Oct 2016
TL;DR: Transmission reliability is one of the most important metrics to evaluate the performance of wireless sensor networks and immune based multiple paths can be quickly established from the source node to the destination node.
Abstract: Transmission reliability is one of the most important metrics to evaluate the performance of wireless sensor networks. For the fault of nodes or links affecting the stability and reliability of network, Immune based multipath transmission algorithm is proposed. For giving the consideration to the factors of transmission delay and energy consumption beside the hops/distance, immune based multiple paths can be quickly established from the source node to the destination node. Metrics of data receiving rate are adopted to evaluate the performance of multipath transmission. The result shows good performance of fault tolerance, stability and reliability of data transmission.
TL;DR: Two novel multi-path strategies called Greedy Geographic Forwarding based on Geospatial Division (GGFGD and GFGD) are proposed, which helps to save energy consumption and prolong network lifetime and take sleep schedule into account.
TL;DR: The results of the multiple simulations were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless Sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime.
Abstract: Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony optimization based routing algorithm that uses special parameters in its competency function for reducing energy consumption of network nodes. In this new proposed algorithm called life time aware routing algorithm for wireless sensor networks (LTAWSN), a new pheromone update operator was designed to integrate energy consumption and hops into routing choice. Finally, with the results of the multiple simulations we were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime.
TL;DR: A congestion avoidance multipath routing protocol which uses composite routing metrics based on RPL, named CA-RPL, which can effectively alleviate the network congestion in the network with poor link quality and large data traffic and significantly improve the performance of LLNs.
Abstract: Designing routing protocols in Low power and Lossy Networks (LLNs) imposes great challenges. In emergency scenarios, the large and rapid data traffic caused by emergencies will lead to network congestion and bring about significant packet loss and delay. Routing protocol for LLNs (RPL) is the IETF standard for IPv6 routing in LLNs. The basic version of RPL uses Expected Transmission Count (ETX) as the default routing metric; it cannot solve the problem of sudden large data traffic. In this paper, we propose a congestion avoidance multipath routing protocol which uses composite routing metrics based on RPL, named CA-RPL. A routing metric for RPL that minimized the average delay towards the DAG root is proposed, and the weight of each path is computed by four metrics. The mechanism is explained and its performance is evaluated through simulation experiments based on Contiki. Simulation results show that the proposed CA-RPL reduces the average time delay by about 30% compared to original RPL when the interpacket interval is short and has almost 20% reduction in packet loss ratio. The CA-RPL can effectively alleviate the network congestion in the network with poor link quality and large data traffic and significantly improve the performance of LLNs.
TL;DR: A new decision criterion is proposed, called the Requirements Violation Index, which quantifies the risk associated with the violation of requirements taking into account both the frequency of violations and their magnitudes whenever they occur, and develops practically efficient algorithms to find the exact optimal routing solution in which the RV Index criterion is minimized.
Abstract: We consider a class of routing optimization problems under uncertainty in which all decisions are made before the uncertainty is realized. The objective is to obtain optimal routing solutions that ...
TL;DR: This paper proposes a routing algorithm for SDN with SR that can meet the bandwidth requirements of routing requests and considers the balance of traffic load and reduces the extra cost of packet header size in a network.
TL;DR: This work proposes an adaptive large-neighborhood search with several specifically designed operators and features, showing the excellent performance of the algorithm in terms of solution quality and computational efficiency.
Abstract: This problem involves optimizing product collection and redistribution from production locations to a set of processing plants over a planning horizon. This horizon consists of several days, and the collection-redistribution is performed on a repeating daily basis. A single routing plan must be prepared for the whole horizon, taking into account the seasonal variations in the supply. We model the problem using a sequence of periods, each corresponding to a season. We propose an adaptive large-neighborhood search with several specifically designed operators and features. The results show the excellent performance of the algorithm in terms of solution quality and computational efficiency.
TL;DR: A hybrid algorithm is presented that integrates biased-randomised versions of vehicle routing and packing heuristics within a Large Neighbourhood Search metaheuristic framework to better guide the local search process.
03 Apr 2016
TL;DR: Through vehicle-to-UAV (V2U) communication, the overall connectivity between vehicles is improved and therefore the routing process is efficiently improved.
Abstract: It is a challenging task to develop an efficient routing solution for a reliable data delivery in urban vehicular environments. Indeed, it is difficult to find a shortest end-to-end connected path especially in urban city given the mobility pattern of the vehicles and the various obstructions to a clear transmission such as buildings. To overcome these difficulties, we investigate how unmanned aerial vehicles (UAVs) can assist vehicles on the ground in relaying in urban areas. In this paper, we propose UVAR (UAV-Assisted VANET Routing Protocol), a new routing technique for Vehicular Ad hoc Networks (VANets). This protocol is based on the use of the traffic density and the knowledge of vehicular connectivity in the streets. With this approach UAVs collect information about the traffic density on the ground and the state of vehicles connectivity, and exchange them with vehicles through Hello messages. These information allow UAV to place themselves so as to allow relaying data when connectivity between sole vehicles on the ground is not possible. Through vehicle-to-UAV (V2U) communication, the overall connectivity between vehicles is improved and therefore the routing process is efficiently improved. The performance of the proposed protocol is evaluated and the results to different scenarios are discussed.
TL;DR: This article has elaborated the basic concept of Opportunistic routing, different areas in which it has been claimed to be beneficial, some protocols their metrics and their drawbacks.
TL;DR: This article calls routing protocols that can balance out the trade-off between network lifetime and QoS requirements “green routing protocols” and presents a detailed survey of existing routing protocols for WMSNs.
Abstract: Wireless multimedia sensor networking (WMSN) is an efficient technology and has been widely used in multimedia data transport and applications. The key to the success of multimedia data transport is the transmission quality. Real-time critical multimedia requires efficient routing for data delivery with guaranteed QoS. However, satisfying the stringent QoS requirements of multimedia transmission usually translates to high energy consumption. How to efficiently minimize the energy consumption while ensuring QoS requirements is an acute problem. Therefore, in this article, we call routing protocols that can balance out the trade-off between network lifetime and QoS requirements “green routing protocols.” First, a detailed survey of existing routing protocols for WMSNs is presented, which are classified into two categories based on network structures. Moreover, the performance of existing routing protocols is compared in detail. Finally, future research issues of green routing protocols in WMSNs are presented and carefully discussed.