Showing papers on "Hazy Sighted Link State Routing Protocol published in 2016"

Recent Advances in Energy-Efficient Routing Protocols for Wireless Sensor Networks: A Review

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.

Joint Clustering and Routing Design for Reliable and Efficient Data Collection in Large-Scale Wireless Sensor Networks

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.

An improved harmony search based energy-efficient routing algorithm for wireless sensor networks

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.

Energy Efficient Direction-Based PDORP Routing Protocol for WSN

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.

An Energy-Efficient Region-Based RPL Routing Protocol for Low-Power and Lossy Networks

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.

An ant colony optimization based routing algorithm for extending network lifetime in wireless sensor networks

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.

P-LEACH: Energy efficient routing protocol for Wireless Sensor Networks

Abstract: Wireless Sensor Network (WSN) are of paramount significance since they are responsible for maintaining the routes in the network, data forwarding, and ensuring reliable multi-hop communication. The main requirement of a wireless sensor network is to prolong network energy efficiency and lifetime. Researchers have developed protocols Low Energy Adaptive Clustering Hierarchy (LEACH) and Power-Efficient Gathering in Sensor Information Systems (PEGASIS) for reducing energy consumption in the network. However, the existing routing protocols experience many shortcomings with respect to energy and power consumption. LEACH features the dynamicity but has limitations due to its cluster-based architecture, while PEGASIS overcomes the limitations of LEACH but lacks dynamicity. In this paper, we introduce PEGASIS-LEACH (P-LEACH), a near optimal cluster-based chain protocol that is an improvement over PEGASIS and LEACH both. This protocol uses an energy-efficient routing algorithm to transfer the data in WSN. To validate the energy effectiveness of P-LEACH, we simulate the performance using Network Simulator (NS2) and MATLAB.

UVAR: An intersection UAV-assisted VANET routing protocol

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.

A Survey on Heuristic-Based Routing Methods in Vehicular Ad-Hoc Network: Technical Challenges and Future Trends

Abstract: Vehicular $ad~ hoc$ network (VANET) is a set of vehicles trying to exchange security and comfort data even if they are not directly within radio range of each other. As VANET presented several challenges, the various contributions defined are not efficient to provide reliable services. Consequently, several researches and projects have been launched to develop an intelligent transportation system that guarantees both safety and comfort for users. Although the use of metaheuristics seems to be the most convenient to overcome these issues, actually, to the best of our knowledge, there are no studies addressing the uses of those approaches in VANET. This paper surveys and discusses different metaheuristics applied to solve the routing problem within VANET. Furthermore, technical challenges and future trends are treated and presented.

A genetic algorithm-based system for wireless mesh networks: analysis of system data considering different routing protocols and architectures

Abstract: Wireless mesh networks (WMNs) are attracting a lot of attention from wireless network researchers. Node placement problems have been investigated for a long time in the optimization field due to numerous applications in location science. In our previous work, we evaluated WMN-GA system which is based on genetic algorithms (GAs) to find an optimal location assignment for mesh routers. In this paper, we evaluate the performance of four different distributions of mesh clients for two WMN architectures considering throughput, delay and energy metrics. For simulations, we used ns-3, optimized link state routing (OLSR) and hybrid wireless mesh protocols (HWMP). We compare the performance for Normal, Uniform, Exponential and Weibull distributions of mesh clients by sending multiple constant bit rate flows in the network. The simulation results show that for HWM protocol the throughput of Uniform distribution is higher than other distributions. However, for OLSR protocol, the throughput of Exponential distribution is better than other distributions. For both protocols, the delay and remaining energy are better for Weibull distribution.

A Street-Centric Routing Protocol Based on Microtopology in Vehicular Ad Hoc Networks

Abstract: In a vehicular ad hoc network (VANET), high mobility and uneven distribution of vehicles are important factors affecting the performance of routing protocols. The high mobility may cause frequent changes of network topology, whereas the uneven distribution of vehicles may lead to routing failures due to network partition; even high density of vehicles may cause severe wireless channel contentions in an urban environment. In this paper, we propose a novel concept called the microtopology (MT), which consists of vehicles and wireless links among vehicles along a street as a basic component of routing paths and even the entire network topology. We abstract the MT model reflecting the dynamic routing-related characteristics in practical urban scenarios along streets, including the effect of mobility of vehicles, signal fading, wireless channel contention, and existing data traffic. We first analyze the endside-to-endside routing performance in an MT as a basis of routing decision. Then, we propose a novel street-centric routing protocol based on MT (SRPMT) along the streets for VANETs. Simulation results show that our proposed SRPMT protocol achieves higher data delivery rate and shorter average end-to-end delay compared with the performance of greedy perimeter stateless routing (GPSR) and greedy traffic-aware routing (GyTAR).

PASER: Secure and Efficient Routing Approach for Airborne Mesh Networks

Abstract: Low-altitude unmanned aerial vehicles (UAVs) combined with WLAN mesh networks (WMNs) have facilitated the emergence of airborne network-assisted applications. In disaster relief, they are key solutions for 1) on-demand ubiquitous network access and 2) efficient exploration of sized areas. Nevertheless, these solutions still face major security challenges as WMNs are prone to routing attacks. Consequently, the network can be sabotaged, and the attacker might manipulate payload data or even hijack the UAVs. Contemporary security standards, such as the IEEE 802.11i and the security mechanisms of the IEEE 802.11s mesh standard, are vulnerable to routing attacks as we experimentally showed in previous works. Therefore, a secure routing protocol is indispensable for making feasible the deployment of UAV-WMN. As far as we know, none of the existing research approaches have gained acceptance in practice due to their high overhead or strong assumptions. Here, we present the position-aware, secure, and efficient mesh routing approach (PASER). Our proposal prevents more attacks than the IEEE 802.11s/i security mechanisms and the well-known, secure routing protocol ARAN, without making restrictive assumptions. In realistic UAV-WMN scenarios, PASER achieves similar performance results as the well-established, nonsecure routing protocol HWMP combined with the IEEE 802.11s security mechanisms.

SDN Partitioning: A Centralized Control Plane for Distributed Routing Protocols

Abstract: Hybrid IP networks that use both control paradigms - distributed and centralized - promise the best of two worlds: programmability and agility of SDN, and reliability and fault tolerance of distributed routing protocols like OSPF. The common approaches follow a division of labor concept, where SDN controls prioritized traffic and OSPF assures care-free operation of best effort traffic. We propose SDN Partitioning, which establishes centralized control over the distributed routing protocol by partitioning the topology into sub-domains with SDN-enabled border nodes, such that OSPF's routing updates have to traverse SDN border nodes to reach neighboring sub-domains. This allows the central controller to modify how sub-domains view one another, which in turn allows to steer inter-sub-domain traffic. The degree of dynamic control against simplicity of OSPF can be trade off by adjusting the size of the sub-domains. This paper explains the technical requirements, presents a novel scheme for balanced topology partitioning, and provides the models for common network management tasks. Our performance evaluation shows that - already in its minimum configuration with two sub-domains - SDN Partitioning provides significant improvements in all respects compared to legacy routing protocols, whereas smaller sub-domains provide network control capabilities comparable to full SDN deployment.

SCMon: Leveraging segment routing to improve network monitoring

Abstract: To guarantee correct operation of their networks, operators have to promptly detect and diagnose data-plane issues, like broken interface cards or link failures. Networks are becoming more complex, with a growing number of Equal Cost MultiPath (ECMP) and link bundles. Hence, some data-plane problems (e.g. silent packet dropping at one router) can hardly be detected with control-plane protocols or simple monitoring tools like ping or traceroute. In this paper, we propose a new technique, called SCMon, that enables continuous monitoring of the data-plane, in order to track the health of all routers and links. SCMon leverages the recently proposed Segment Routing (SR) architecture to monitor the entire network with a single box (and no additional monitoring protocol). In particular, SCMon uses SR to (i) force monitoring probes to travel over cycles; and (ii) test parallel links and bundles at a per-link granularity. We present original algorithms to compute cycles that cover all network links with a limited number of SR segments. Further, we prototype and evaluate SCMon both with simulations and Linux-based emulations. Our experiments show that SCMon quickly detects and precisely pinpoints data-plane problems, with a limited overhead.

An optimization-based robust routing algorithm to energy-efficient networks for cloud computing

Abstract: This paper studies the routing problem in energy-efficient networks for cloud computing. We propose a robust routing algorithm to reach the higher network energy efficiency, which is based on optimization problem. To attain the highly energy-efficient routing in energy-efficient networks for cloud computing, the link of low utilization is turned into the sleeping state to save the network energy. At the same time, the low link traffic is aggregated to the link with high utilization to enhance the link utilization and to sleep the links as many as possible. We present an optimized link sleeping method to maximize the number of the sleeping links. By targeting the network robustness, a weight adaptive strategy is brought forth to reduce the link congestion and enhance the robustness of the network. Simulation results indicate that our algorithm is effective and feasible to achieve energy-efficient networks for cloud computing.

A reliable QoS-aware routing scheme for neighbor area network in smart grid

Abstract: A reliable bi-directional communication network is one of the key factors in smart grid (SG) to meet application requirements and improve energy efficiency. As a promising communication infrastructure, wireless mesh network (WMN) can provide high speed and cost-effect communication for SG. However, challenges remain to maintain high reliability and quality of service (QoS) when applying WMNs to SG. In this paper, we first propose a hybrid wireless mesh protocol (HWMP) based neighbor area network (NAN) QoS-aware routing scheme, named HWMP-NQ, to meet the QoS requirements by applying an integrated routing metric to route decision with effective link condition probing and queue optimization. To further improve the reliability of the proposed HWMP-NQ, we present a multi-gateway backup routing scheme along with a routing reliability correction factor to mitigate the impact of routing oscillations. Finally, we evaluate the performances of the proposed schemes on NS3 simulator. Extensive simulations demonstrate that HWMP-NQ can distinguish different applications and satisfy the QoS requirements respectively, and also improve the average packet delivery ratio and throughput with a reduced routing overhead, even with a high failure rate of mesh nodes.

A Resilient Routing Algorithm with Formal Reliability Analysis for Partially Connected 3D-NoCs

Abstract: 3D ICs can take advantage of a scalable communication platform, commonly referred to as the Networks-on-Chip (NoC). In the basic form of 3D-NoC, all routers are vertically connected. Partially connected 3D-NoC has emerged because of physical limitations of using vertical links. Routing is of great importance in such partially connected architectures. A high-performance, fault-tolerant and adaptive routing strategy with respect to the communication flow among the cores is crucial while freedom from livelock and deadlock has to be guaranteed. In this paper we introduce a new routing algorithm for partially connected 3D-NoCs. The routing algorithm is adaptive and tolerates the faults on vertical links as compared to the predesigned routing algorithms. Our results show a $40-50\%$ improvement in the fraction of intact inter-level communications when the fault tolerant algorithm is used. This routing algorithm is light-weight and has only one virtual channel along the $Y$ dimension.

ESR: Energy aware and stable routing protocol for WBAN networks

Abstract: Wireless body area network (WBAN) calls for a next generation in wireless networks. This new generation is designed to operate autonomously, to connect various medical sensors and appliances located on or inside a human body. Mobile WBANs have been designed, offering numerous practical and innovative services so that health care and quality of life can be improved. Thus, the equipment used in WBAN is usually mobile and autonomous which imposes high constraint on energy. That is, the energy efficiency must be taken into account as one of the objectives of the routing protocol designed for this type of network. Although mobile nodes may cause link breaks, most of studies ignore the link stability. In this paper, we propose a stable, reliable, energy efficient routing protocol for mobile Wireless Body Area Networks. It preserves the residual energy of nodes with an increase network lifetime. To achieve this goal, we use an objective model to select energy-efficient paths with stable links. Simulation results demonstrate that our protocol improves the state of the art in terms of energy consumption and routing overhead.

A Novel Cluster Arrangement Energy Efficient Routing Protocol for Wireless Sensor Networks

Abstract: Background: Wireless sensor networks are application-based networks designed by large number of sensor nodes. Utilizing the energy in efficient way is the one of the main design issue in Wireless Sensor Network (WSN). Limited battery capacity of sensor nodes makes energy efficiency a major and challenging problem in wireless sensor networks. Methods : In order to improve Network lifetime, Energy efficiency and Load balance in Wireless Sensor Network, a Cluster Arrangement Energy Efficient Routing Protocol CAERP is proposed. It mainly includes efficient way of node clustering and distributed multi-hop routing. In the clustering part of CAERP we introduce an un-even clustering mechanism. Cluster head which are closer to the Base Station (BS) have smaller cluster size than those farther from BS, so in here they can preserve some energy in the time of inter-cluster data communication. Our protocol consists of cluster head selection algorithm, a cluster formation scheme and a routing algorithm for the data transmission between cluster heads and the base station. Findings: Each sensor node should effectively handle its energy in order to keep the WSN at its operation state. In each time duration Q-leach is consume more energy than the CAERP. CAERP eliminate the initial dead node problem. During the initial stage the message overhead between the Q-Leach and CAERP have somewhat similar, but after the uneven clustering formation the CAERP message overhead is reduced comparing with the Q-LEACH. In CAERP protocol it mainly focuses for utilizing the energy in efficient way. This improvement is accomplished because the nodes remain alive due to the efficient way of cluster arrangement. CAERP has mainly five cluster Head so each cycle the Cluster Head varying based on the CAERP CH selection algorithm. Due to efficient CH selection algorithm the CAERP have high network life time compared to Q-LEACH. The simulation result shows that CAERP significantly increasing the network lifetime and minimizes energy consumption of nodes compared with Q-leach protocol. Conclusion: The performance of the proposed protocol is compared with that of Q-LEACH using different parameters with the help network simulators. Our protocol CAERP has significantly improved in average energy consumption, survival rate and the extended the network life cycle which means the energy efficiency of the CAERP network is improved.

Dynamic fuzzy logic and reinforcement learning for adaptive energy efficient routing in mobile ad-hoc networks

Abstract: To ensure good network performance, a routing protocol for MANETs must change its routing policy online to account for changes in network conditions and to deal with routing information imprecision.The main focus of this paper is on the use of fuzzy logic and reinforcement learning.A dynamic membership function is defined to enhance the adaptivity of legacy fuzzy logic systems.A fuzzy extension of a reinforcement learning based routing protocol for MANETs is presented.Dynamic fuzzy logic is more appropriate than reinforcement learning for adaptive energy aware routing in MANETs. In this paper, a dynamic fuzzy energy state based AODV (DFES-AODV) routing protocol for Mobile Ad-hoc NETworks (MANETs) is presented. In DFES-AODV route discovery phase, each node uses a Mamdani fuzzy logic system (FLS) to decide its Route REQuests (RREQs) forwarding probability. The FLS inputs are residual battery level and energy drain rate of mobile node. Unlike previous related-works, membership function of residual energy input is made dynamic. Also, a zero-order Takagi Sugeno FLS with the same inputs is used as a means of generalization for state-space in SARSA-AODV a reinforcement learning based energy-aware routing protocol. The simulation study confirms that using a dynamic fuzzy system ensures more energy efficiency in comparison to its static counterpart. Moreover, DFES-AODV exhibits similar performance to SARSA-AODV and its fuzzy extension FSARSA-AODV. Therefore, the use of dynamic fuzzy logic for adaptive routing in MANETs is recommended.

Neighbor-Based Dynamic Connectivity Factor Routing Protocol for Mobile Ad Hoc Network

Abstract: Recently, Mobile Ad hoc Networks (MANETs) have witnessed rapid development due to the low cost, diversity, and simplicity of mobile devices. Such devices can form a reliable network in a short time for use as a rescue information system after a natural disaster, where the communication infrastructure may no longer be available or accessible. Because the nodes in such a network are free to move at any time in the absence of centralized control, routing is considered to be the most challenging issue. Moreover, some routing protocols, such as Neighbor Coverage-Based Probabilistic Rebroadcast (NCPR), completely rely on preset variables, which are required to be set by the system administrator based on the scenario. Unfortunately, the setting that is proper for a specific scenario is not suitable for another scenario. In addition, some other routing protocols, such as Ad hoc On-demand Distance Vector (AODV), employ the Route REQuest message (RREQ) flooding scheme to find a path to a particular destination in the route discovery stage. Although the flooding scheme guarantees better reachability, it introduces undesirable routing overhead, which in turn leads to system performance degradation. Thus, this paper proposes a novel routing protocol, neighbor-based Dynamic Connectivity Factor routing Protocol (DCFP), that is able to dynamically probe the status of the underlying network without the intervention of a system administrator based on a novel connectivity metric, while reducing the RREQ overhead using a new connectivity factor. Furthermore, extensive simulation experiments are conducted to evaluate the performance of the proposed DCFP, where the NCPR and AODV are used as a benchmark. The proposed DCFP manages to address the need for preset variables in NCPR. Simulation results show that DCFP outperforms both NCPR and AODV in terms of end-to-end delay, normalized routing overhead, MAC collision, energy consumption, network connectivity, and packet delivery ratio due to its novel mechanism for reducing redundant RREQ.

A grid-based reliable routing protocol for wireless sensor networks with randomly distributed clusters

Abstract: The need for implementing reliable data transfer in wireless sensor networks is still an open issue in the research community. Although cluster routing schemes are characterized by their low overhead and efficiency in reliable data transfer in traditional wireless sensor network, this potential is still yet to be utilized for viable routing options in the environment with obstacles and voids, via greedy and perimeter forwarding. In this paper, a novel Grid-Based Reliable Routing (GBRR) technique is presented. This is achieved by the creation of virtual clusters based on square grids from which the next hop choice is made based on intra-cluster and inter-cluster communication quality. The simulation result shows that the developed scheme can make more advancement to the BS as against the usual decisions of relevant clustering route select operations, while ensuring channel quality. Further simulation results have shown the enhanced reliability, lower latency and energy efficiency of the presented scheme with randomly nodes and obstacles distribution.

A secure and low-energy zone-based wireless sensor networks routing protocol for pollution monitoring

Abstract: Sensor networks can be used in many sorts of environments. The increase of pollution and carbon footprint are nowadays an important environmental problem. The use of sensors and sensor networks can help to make an early detection in order to mitigate their effect over the medium. The deployment of wireless sensor networks (WSNs) requires high-energy efficiency and secures mechanisms to ensure the data veracity. Moreover, when WSNs are deployed in harsh environments, it is very difficult to recharge or replace the sensor's batteries. For this reason, the increase of network lifetime is highly desired. WSNs also work in unattended environments, which is vulnerable to different sort of attacks. Therefore, both energy efficiency and security must be considered in the development of routing protocols for WSNs. In this paper, we present a novel Secure and Low-energy Zone-based Routing Protocol (SeLeZoR) where the nodes of the WSN are split into zones and each zone is separated into clusters. Each cluster is controlled by a cluster head. Firstly, the information is securely sent to the zone-head using a secret key; then, the zone-head sends the data to the base station using the secure and energy efficient mechanism. This paper demonstrates that SeLeZoR achieves better energy efficiency and security levels than existing routing protocols for WSNs. Copyright © 2016 John Wiley & Sons, Ltd.

Routing Protocol for Heterogeneous Wireless Mesh Networks

Abstract: The introduction of heterogeneous wireless mesh technologies provides an opportunity for higher network capacity, wider coverage, and higher quality of service (QoS). Each wireless device utilizes different standards, data formats, protocols, and access technologies. However, the diversity and complexity of such technologies create challenges for traditional control and management systems. This paper proposes a heterogeneous metropolitan area network architecture that combines an IEEE 802.11 wireless mesh network (WMN) with a long-term evolution (LTE) network. In addition, a new heterogeneous routing protocol and a routing algorithm based on reinforcement learning called cognitive heterogeneous routing are proposed to select the appropriate transmission technology based on parameters from each network. The proposed heterogeneous network overcomes the problems of sending packets over long paths, island nodes, and interference in WMNs and increases the overall capacity of the combined network by utilizing unlicensed frequency bands instead of buying more license frequency bands for LTE. The work is validated through extensive simulations that indicate that the proposed heterogeneous WMN outperforms the LTE and Wi-Fi networks when used individually. The simulation results show that the proposed network achieves an increase of up to 200% in throughput compared with Wi-Fi-only networks or LTE-only networks.

Ant colony optimization based polymorphism-aware routing algorithm for ad hoc UAV network

Abstract: Ad hoc UAV network is characterized for its high node mobility, fast changing network topology, high frequency of interchanging data and complex application environment. The performance of traditional routing algorithms are so poor over aspects such as end to end delay, data packet delivery ratio and routing overhead that they cannot provide efficient communication for multi-UAVs carrying out missions synergistically. An ant colony optimization based polymorphism-aware routing algorithm--- APAR algorithm is proposed to solve the problems. This algorithm integrates ACO algorithm and dynamic source routing algorithm, the level of pheromone in routes which are gained in routing discovery process, is chosen as a standard to choose route and calculated by sensing the distance of a route, the congestion level of a route, and the stability of a route. A new volatilization mechanism of pheromone is also introduced to the algorithm. Meanwhile, the algorithm can make adjustment to the variance of UAV formation to prevent the compromise of the network performance. The simulation results show the APAR algorithm has superiority over traditional algorithms in data package delivery ratio, end to end delay, routing overhead and it is dependable in battlefield environment.

Mitigating Denial of Service Attacks in OLSR Protocol Using Fictitious Nodes

Abstract: With the main focus of research in routing protocols for Mobile Ad-Hoc Networks (MANET) geared towards routing efficiency, the resulting protocols tend to be vulnerable to various attacks. Over the years, emphasis has also been placed on improving the security of these networks. Different solutions have been proposed for different types of attacks, however, these solutions often compromise routing efficiency or network overload. One major DOS attack against the Optimized Link State Routing protocol (OLSR) known as the node isolation attack occurs when topological knowledge of the network is exploited by an attacker who is able to isolate the victim from the rest of the network and subsequently deny communication services to the victim. In this paper, we suggest a novel solution to defend the OLSR protocol from node isolation attack by employing the same tactics used by the attack itself. Through extensive experimentation, we demonstrate that 1) the proposed protection prevents more than 95 percent of attacks, and 2) the overhead required drastically decreases as the network size increases until it is non-discernable. Last, we suggest that this type of solution can be extended to other similar DOS attacks on OLSR.