scispace - formally typeset
Search or ask a question

Showing papers on "Wireless Routing Protocol published in 2018"


Journal ArticleDOI
TL;DR: This article proposes a new, real-time deep learning based intelligent network traffic control method, exploiting deep Convolutional Neural Networks (deep CNNs) with uniquely characterized inputs and outputs to represent the considered Wireless Mesh Network (WMN) backbone.
Abstract: Recently, deep learning has appeared as a breakthrough machine learning technique for various areas in computer science as well as other disciplines. However, the application of deep learning for network traffic control in wireless/heterogeneous networks is a relatively new area. With the evolution of wireless networks, efficient network traffic control such as routing methodology in the wireless backbone network appears as a key challenge. This is because the conventional routing protocols do not learn from their previous experiences regarding network abnormalities such as congestion and so forth. Therefore, an intelligent network traffic control method is essential to avoid this problem. In this article, we address this issue and propose a new, real-time deep learning based intelligent network traffic control method, exploiting deep Convolutional Neural Networks (deep CNNs) with uniquely characterized inputs and outputs to represent the considered Wireless Mesh Network (WMN) backbone. Simulation results demonstrate that our proposal achieves significantly lower average delay and packet loss rate compared to those observed with the existing routing methods. We particularly focus on our proposed method's independence from existing routing protocols, which makes it a potential candidate to remove routing protocol(s) from future wired/ wireless networks.

221 citations


Journal ArticleDOI
TL;DR: An algorithm named Fuzzy logic based Unequal clustering, and Ant Colony Optimization (ACO) based Routing, Hybrid protocol for WSN to eliminate hot spot problem and extend the network lifetime is introduced.
Abstract: Wireless Sensor Networks (WSN) became a key technology for a ubiquitous living and remains an active research due to the wide range of applications. The design of energy efficient WSN is still a greater research challenge. Clustering techniques have been widely used to reduce the energy consumption and prolong the network lifetime. This paper introduces an algorithm named Fuzzy logic based Unequal clustering, and Ant Colony Optimization (ACO) based Routing, Hybrid protocol for WSN to eliminate hot spot problem and extend the network lifetime. This protocol comprises of Cluster Head (CH) selection, inter-cluster routing and cluster maintenance. Fuzzy logic selects CHs efficiently and divides the network into unequal clusters based on residual energy, distance to Base Station (BS), distance to its neighbors, node degree and node centrality. It uses ACO based routing technique for efficient and reliable inter-cluster routing from CHs to BS. Moreover, this protocol transmits data in a hybrid manner, i.e. both proactive and reactive manner. A threshold concept is employed to transmit/intimate sudden changes in the environment in addition to periodic data transmission. For proper load balancing, a new routing strategy is also employed where threshold based data transmission takes place in shortest path and the periodic data transmission takes place in unused paths. Cross-layer cluster maintenance phase is also used for uniform load distribution. The proposed method is intensively experimented and compared with existing protocols namely LEACH, TEEN, DEEC and EAUCF. The simulation results show that the proposed method attains maximum lifetime, eliminates hot spot problem and balances the energy consumption among all nodes efficiently.

149 citations


Journal ArticleDOI
TL;DR: A novel four-dimensional (4D) evaluation framework for QoS routing algorithms, whereby the 4D correspond to the type of topology, two forms of scalability of aTopology, and the tightness of the delay constraint, which identifies two algorithms, namely Lagrange relaxation-based aggregated cost (LARAC) and search space reduction delay-cost-constrained routing (SSR+DCCR), that perform very well in most of the4D evaluation space
Abstract: A variety of communication networks, such as industrial communication systems, have to provide strict delay guarantees to the carried flows. Fast and close to optimal quality of service (QoS) routing algorithms, e.g., delay-constrained least-cost (DCLC) routing algorithms, are required for routing flows in such networks with strict delay requirements. The emerging software-defined networking (SDN) paradigm centralizes the network control in SDN controllers that can centrally execute QoS routing algorithms. A wide range of QoS routing algorithms have been proposed in the literature and examined in individual studies. However, a comprehensive evaluation framework and quantitative comparison of QoS routing algorithms that can serve as a basis for selecting and further advancing QoS routing in SDN networks is missing in the literature. This makes it difficult to select the most appropriate QoS routing algorithm for a particular use case, e.g., for SDN controlled industrial communications. We close this gap in the literature by conducting a comprehensive up-to-date survey of centralized QoS routing algorithms. We introduce a novel four-dimensional (4D) evaluation framework for QoS routing algorithms, whereby the 4D correspond to the type of topology, two forms of scalability of a topology, and the tightness of the delay constraint. We implemented 26 selected DCLC algorithms and compared their runtime and cost inefficiency within the 4D evaluation framework. While the main conclusion of this evaluation is that the best algorithm depends on the specific sub-space of the 4D space that is targeted, we identify two algorithms, namely Lagrange relaxation-based aggregated cost (LARAC) and search space reduction delay-cost-constrained routing (SSR+DCCR), that perform very well in most of the 4D evaluation space.

126 citations


Journal ArticleDOI
TL;DR: Simulation results show that MLProph outperforms PROPHET+, a probabilistic-based routing protocol for OppNets, in terms of number of successful deliveries, dropped messages, overhead, and hop count, at the cost of small increases in buffer time and buffer occupancy values.
Abstract: This paper proposes a novel routing protocol for OppNets called MLProph, which uses machine learning (ML) algorithms, namely decision tree and neural networks, to determine the probability of successful deliveries. The ML model is trained by using various factors such as the predictability value inherited from the PROPHET routing scheme, node popularity, node's power consumption, speed, and location. Simulation results show that MLProph outperforms PROPHET+, a probabilistic-based routing protocol for OppNets, in terms of number of successful deliveries, dropped messages, overhead, and hop count, at the cost of small increases in buffer time and buffer occupancy values.

106 citations


Journal ArticleDOI
TL;DR: A location-free Reliable and Energy efficient Pressure-Based Routing (RE-PBR) protocol for UWSNs is proposed and the performance of the proposed protocol is compared with the stat-of-the-art techniques: DBR and EEDBR.
Abstract: Recently, Underwater Wireless Sensor Networks (UWSNs) has witnessed significant attention from both academia and industries in research and development, due to the growing number of applications for wide range of purposes including commercial, scientific, environmental and military. Some of the major applications include pollution monitoring, tactical surveillance, tsunami warnings and offshore exploration. Efficient communication among sensors in UWSNs is a challenging task due to the harsh environments and peculiar characteristics of UWSNs. Therefore, design of routing protocol for efficient communication among sensors and sink is one of the fundamental research themes in UWSNs. In this context, this paper proposes a location-free Reliable and Energy efficient Pressure-Based Routing (RE-PBR) protocol for UWSNs. RE-PBR considers three parameters including link quality, depth and residual energy for balancing energy consumption and reliable data delivery. Specifically, link quality is estimated using triangle metric method. A light weight information acquisition algorithm is developed for efficient knowledge discovery of the network. Multi-metric data forwarding algorithm is designed based on route cost calculation which utilizes residual energy and link quality. Simulations are carried out in NS-2 with Aqua-Sim package to evaluate the performance of RE-PBR. The performance of the proposed protocol is compared with the stat-of-the-art techniques: DBR and EEDBR. The comprehensive performance evaluation attests the benefit of RE-PBR as compared to the state-of-the-art techniques in terms of network lifetime, energy consumption, end-to-end delay and packet delivery ratio.

97 citations


Journal ArticleDOI
TL;DR: The proposed Intelligent Energy-aware Efficient Routing protocol for MANET (IE2R) is proposed, and the results obtained outperforms existing protocols in terms of several network metrics.
Abstract: Designing an energy efficient routing protocol is one of the main issue of Mobile Ad-hoc Networks (MANETs) It is challenging task to provide energy efficient routes because MANET is dynamic and mobile nodes are fitted with limited capacity of batteries The high mobility of nodes results in quick changes in the routes, thus requiring some mechanism for determining efficient routes In this paper, an Intelligent Energy-aware Efficient Routing protocol for MANET (IE2R) is proposed In IE2R, Multi Criteria Decision Making (MCDM) technique is used based on entropy and Preference Ranking Organization METHod for Enrichment of Evaluations-II (PROMETHEE-II) method to determine efficient route MCDM technique combines with an intelligent method, namely, Intuitionistic Fuzzy Soft Set (IFSS) which reduces uncertainty related to the mobile node and offers energy efficient route The proposed protocol is simulated using the NS-2 simulator The performance of the proposed protocol is compared with the existing routing protocols, and the results obtained outperforms existing protocols in terms of several network metrics

81 citations


Journal ArticleDOI
TL;DR: Simulation results demonstrate that EDGR exhibits higher energy efficiency, and has moderate performance improvements on network lifetime, packet delivery ratio, and delivery delay, compared to other geographic routing protocols in WSNs over a variety of communication scenarios passing through routing holes.
Abstract: Geographic routing has been considered as an attractive approach for resource-constrained wireless sensor networks (WSNs) since it exploits local location information instead of global topology information to route data. However, this routing approach often suffers from the routing hole (i.e., an area free of nodes in the direction closer to destination) in various environments such as buildings and obstacles during data delivery, resulting in route failure. Currently, existing geographic routing protocols tend to walk along only one side of the routing holes to recover the route, thus achieving suboptimal network performance such as longer delivery delay and lower delivery ratio. Furthermore, these protocols cannot guarantee that all packets are delivered in an energy-efficient manner once encountering routing holes. In this paper, we focus on addressing these issues and propose an energy-aware dual-path geographic routing (EDGR) protocol for better route recovery from routing holes. EDGR adaptively utilizes the location information, residual energy, and the characteristics of energy consumption to make routing decisions, and dynamically exploits two node-disjoint anchor lists, passing through two sides of the routing holes, to shift routing path for load balance. Moreover, we extend EDGR into three-dimensional (3D) sensor networks to provide energy-aware routing for routing hole detour. Simulation results demonstrate that EDGR exhibits higher energy efficiency, and has moderate performance improvements on network lifetime, packet delivery ratio, and delivery delay, compared to other geographic routing protocols in WSNs over a variety of communication scenarios passing through routing holes. The proposed EDGR is much applicable to resource-constrained WSNs with routing holes.

73 citations


Journal ArticleDOI
TL;DR: A routing protocol based on genetic algorithm for a middle layer oriented network in which the network consists of several stations that are responsible for receiving data and forwarding the data to the sink and three methods are introduced for effective cope with the expansion of network scale problem.
Abstract: Energy saving and effective utilization are an essential issue for wireless sensor network. Most previous cluster based routing protocols only care the relationship of cluster heads and sensor nodes but ignore the huge difference costs between them. In this paper, we present a routing protocol based on genetic algorithm for a middle layer oriented network in which the network consists of several stations that are responsible for receiving data and forwarding the data to the sink. The amount of stations should be not too many and not too few. Both cases will cause either too much construction cost or extra transmission energy consumption. We implement five methods to compare the performance and test the stability of our presented methods. Experimental results demonstrate that our proposed scheme reduces the amount of stations by 36.8 and 20% compared with FF and HL in 100-node network. Furthermore, three methods are introduced to improve our proposed scheme for effective cope with the expansion of network scale problem.

66 citations


Journal ArticleDOI
TL;DR: A new routing protocol that provides QoS in terms of delay and energy consumption is proposed that incurs less delay and is energy efficient and an evaluation of the approach is performed through simulations.
Abstract: Wireless sensor and actuator networks are composed of sensor and actuator nodes interconnected via wireless links. The actuators are responsible for taking prompt decisions and react accordingly to the data gathered by sensor nodes. In order to ensure efficient actions in such networks, we propose a new routing protocol that provides QoS in terms of delay and energy consumption. The network is organized in clusters supervised by CHs (Cluster-Heads), elected according to important metrics, namely the energy capability, the riches of connectivity, which is used to select the CH with high node density, and the accessibility degree regarding all the actuators. The latter metric is the distance in number of hops of sensor nodes relative to the actuator nodes. This metric enhances more the network reliability by reducing the communication delay when alerting the actuator nodes, and hence, reducing the energy consumption. To reach efficiently the actuator nodes, we design a delay and energy sensitive routing protocol based on-demand routing approach. Our protocol incurs less delay and is energy efficient. We perform an evaluation of our approach through simulations. The obtained results show out performance of our approach while providing effective gain in terms of communication delay and energy consumption.

63 citations


Journal ArticleDOI
TL;DR: A novel QoS aware evolutionary cluster based routing protocol (QERP) has been proposed for UWSN-based applications that improves packet delivery ratio, and reduces average end-to-end delay and overall network energy consumption.
Abstract: Quality-of-service (QoS) aware reliable data delivery is a challenging issue in underwater wireless sensor networks (UWSNs). This is due to impairments of the acoustic transmission caused by excessive noise, extremely long propagation delays, high bit error rate, low bandwidth capacity, multipath effects, and interference. To address these challenges, meet the commonly used UWSN performance indicators, and overcome the inefficiencies of the existing clustering-based routing schemes, a novel QoS aware evolutionary cluster based routing protocol (QERP) has been proposed for UWSN-based applications. The proposed protocol improves packet delivery ratio, and reduces average end-to-end delay and overall network energy consumption. Our comparative performance evaluations demonstrate that QERP is successful in achieving low network delay, high packet delivery ratio, and low energy consumption.

59 citations


Journal ArticleDOI
TL;DR: This paper classify, survey, model and compare the most relevant and recent QoS-based routing protocols proposed in the framework of WBAN, and provides a study of adaptability of the surveyed protocols related to the healthcare sector.
Abstract: Wireless Body Area Network (WBAN) constitutes a set of sensor nodes responsible for monitoring human physiological activities and actions. The increasing demand for real time applications in such networks stimulates many research activities in quality-of-service (QoS) based routing for data delivery. Designing such scheme of critical events while preserving the energy efficiency is a challenging task due to the dynamic of the network topology, severe constraints on power supply and limited in computation power and communication bandwidth. The design of QoS-based routing protocols becomes an essential part of WBANs and plays an important role in the communication stacks and has significant impact on the network performance. In this paper, we classify, survey, model and compare the most relevant and recent QoS-based routing protocols proposed in the framework of WBAN. A novel taxonomy of solutions is proposed, in which the comparison is performed with respect to relevant criteria. An analytical model is proposed in order to compare the performances of all the solutions. Furthermore, we provide a study of adaptability of the surveyed protocols related to the healthcare sector.

Journal ArticleDOI
TL;DR: Large-scale simulation results demonstrate that PRD performs better than the widely used ETX metric as well as other two metrics devised recently in terms of energy consumption and end-to-end delay, while guaranteeing packet delivery ratio.
Abstract: This paper investigates the problem of energy consumption in wireless sensor networks. Wireless sensor nodes deployed in harsh environment where the conditions change drastically suffer from sudden changes in link quality and node status. The end-to-end delay of each sensor node varies due to the variation of link quality and node status. On the other hand, the sensor nodes are supplied with limited energy and it is a great concern to extend the network lifetime. To cope with those problems, this paper proposes a novel and simple routing metric, predicted remaining deliveries (PRD), combining parameters, including the residual energy, link quality, end-to-end delay, and distance together to achieve better network performance. PRD assigns weights to individual links as well as end-to-end delay, so as to reflect the node status in the long run of the network. Large-scale simulation results demonstrate that PRD performs better than the widely used ETX metric as well as other two metrics devised recently in terms of energy consumption and end-to-end delay, while guaranteeing packet delivery ratio.

Journal ArticleDOI
TL;DR: This paper proposes an enhanced framework for ACO protocol based on fuzzy logic for VANETs, and demonstrates that the proposed protocol achieves high data packet delivery ratio and low end-to-end delay compared to traditional routing algorithms such as ACO and ad hoc on-demand distance vector.
Abstract: Vehicular ad hoc networks (VANETs) are a subset of mobile ad hoc networks that provide communication services between nearby vehicles and also between vehicles and roadside infrastructure. These networks improve road safety and accident prevention and provide entertainment for passengers of vehicles. Due to the characteristics of VANET such as self-organization, dynamic nature and fast-moving vehicles, routing in this network is a considerable challenge. Swarm intelligence algorithms (nature-inspired) such as ant colony optimization (ACO) have been proposed for developing routing protocols in VANETs. In this paper, we propose an enhanced framework for ACO protocol based on fuzzy logic for VANETs. To indicate the effectiveness and performance of our proposed protocol, the network simulator NS-2 is used for simulation. The simulation results demonstrate that our proposed protocol achieves high data packet delivery ratio and low end-to-end delay compared to traditional routing algorithms such as ACO and ad hoc on-demand distance vector (AODV).

Journal ArticleDOI
01 Mar 2018
TL;DR: A biogeography-based energy saving routing architecture (BERA) is proposed for CH selection and routing with an efficient encoding scheme of a habitat and by formulating a novel fitness function that uses residual energy and distance as its metrics.
Abstract: Biogeography-based optimization (BBO) is a relatively new paradigm for optimization which is yet to be explored to solve complex optimization problems to prove its full potential. In wireless sensor networks (WSNs), optimal cluster head selection and routing are two well-known optimization problems. Researchers often use hierarchal cluster-based routing, in which power consumption of cluster heads (CHs) is very high due to its extra functionalities such as receiving and aggregating the data from its member sensor nodes and transmitting the aggregated data to the base station (BS). Therefore, proper care should be taken while selecting the CHs to enhance the life of the network. After formation of the clusters, data to be routed to the BS in inter-cluster fashion for further enhancing the life of WSNs. In this paper, a biogeography-based energy saving routing architecture (BERA) is proposed for CH selection and routing. The biogeography-based CH selection algorithm is proposed with an efficient encoding scheme of a habitat and by formulating a novel fitness function that uses residual energy and distance as its metrics. The BBO-based routing algorithm is also proposed. The efficient encoding scheme of a habitat is developed, and its fitness function considers the node degree in addition to residual energy and distance. To exhibit the performance of BERA, it is extensively tested with some existing routing algorithms such as DHCR, Hybrid routing, EADC and some bio-inspired algorithms, namely GA and PSO. Simulation results confirm the superiority/competitiveness of the proposed algorithm over existing techniques.

Journal ArticleDOI
TL;DR: The proposed unicast routing protocol based on attractor selecting (URAS) is an opportunistic routing protocol, which is able to change itself adaptively to the complex and dynamic environment by routing feedback packets, and employs a multiattribute decision-making strategy to reduce the number of redundant candidates for next-hop selection.
Abstract: We present a bio-inspired unicast routing protocol for vehicular ad hoc networks which uses the cellular attractor selection mechanism to select next hops. The proposed unicast routing protocol based on attractor selecting (URAS) is an opportunistic routing protocol, which is able to change itself adaptively to the complex and dynamic environment by routing feedback packets. We further employ a multiattribute decision-making strategy, the technique for order preference by similarity to an ideal solution, to reduce the number of redundant candidates for next-hop selection, so as to enhance the performance of attractor selection mechanism. Once the routing path is found, URAS maintains the current path or finds another better path adaptively based on the performance of current path, that is, it can self-evolution until the best routing path is found. Our simulation study compares the proposed solution with the state-of-the-art schemes, and shows the robustness and effectiveness of the proposed routing protocol and the significant performance improvement, in terms of packet delivery, end-to-end delay, and congestion, over the conventional method.

Journal ArticleDOI
TL;DR: This paper analyzed the performance of Ad hoc On-Demand Distance Vector routing protocol, Optimized Link State Routing (OLSR) and Zone Routing Protocol (ZRP) in IEEE 802.15.4 based Wireless Sensor Network (WSN) in the presence of wormhole attacks.

Journal ArticleDOI
TL;DR: This work proposes a novel routing protocol inspired by the cuckoo search method that compares with the routing protocol ad hoc on-demand distance vector, destination sequence distance vector and the bio-inspired routing protocol AntHocNet in terms of the quality of service parameters.
Abstract: Mobile ad hoc networks (MANETs) are becoming an emerging technology that offer several advantages to users in terms of cost and ease of use. A MANET is a collection of mobile nodes connected by wireless links that form a temporary network topology that operates without a base station and centralized administration. Routing is a method through which information is forwarded from a transmitter to a specific recipient. Routing is a strategy that guarantees, at any time, the connection between any two nodes in a network. In this work, we propose a novel routing protocol inspired by the cuckoo search method. Our routing protocol is implemented using Network simulator 2. We chose Random WayPoint model as our mobility model. To validate our work, we opted for the comparison with the routing protocol ad hoc on-demand distance vector, destination sequence distance vector and the bio-inspired routing protocol AntHocNet in terms of the quality of service parameters: packet delivery ratio and end-to-end delay (E2ED).

Journal ArticleDOI
TL;DR: A small comparison study of some state-of-the-art algorithms on a real Internet topology to help the reader appreciate how the different strategies compare against one another, and demonstrates that it is hard to pick a winner among existing policies.
Abstract: With the exponential growth of content in recent years, users are primarily interested in obtaining particular content and are not concerned with the host housing the content. By treating content as a first class citizen, information- centric networks (ICN) seek to transform the Internet from a host-to-host communication model to a content-centric model. A key component of ICN is to cache content at storage-enabled routers. By caching content at in-network routers, network performance can be improved by delivering content from routers closer to the user and not from the origin servers (content custodians). In this article, we provide an overview of the state-of-the-art cache management and routing policies in ICN. We present a small comparison study of some state-of-the-art algorithms on a real Internet topology to help the reader appreciate how the different strategies compare against one another. Our simulation results demonstrate that it is hard to pick a winner among existing policies. We conclude the article with a discussion of open research questions.

Journal ArticleDOI
TL;DR: A fuzzy logic-based reliable routing protocol (FRRP) is proposed for MANETs which selects stable routes using fuzzy logic and is able to optimize system efficiency.
Abstract: MANET (mobile ad-hoc network) includes a set of wireless mobile nodes which communicate with one another without any central controls or infrastructures and they can be quickly implemented in the operational environment. One of the most significant issues in MANETs is concerned with finding a secure, safe and short route so that data can be transmitted through it. Although several routing protocols have been introduced for the network, the majority of them just consider the shortest path with the fewest number of hops. Hop criterion is considered for simple implementation and it is reliable in dynamic environments; however, queuing delay and connection delay in the intermediate nodes are not taken into consideration for selecting route in this criterion. In this paper, a fuzzy logic-based reliable routing protocol (FRRP) is proposed for MANETs which selects stable routes using fuzzy logic. It is able to optimize system efficiency. The score allocated to routes are based on four criteria: accessible bandwidth, the amount of energy of battery, the number of hops and the degree of dynamicity of nodes. The simulation results obtained from OPNET simulator version 10.5 indicate that the proposed protocol, in comparison with ad hoc on-demand distance vector (AODV) and fuzzy-based on-demand routing protocol (FBORP), was able to better improve packet delivery rate, average end-to-end delay and throughput.

Journal ArticleDOI
TL;DR: This paper proposed a new hierarchical clustering algorithm (HCAL) and a corresponded protocol for hierarchical routing in LMANET and extensive performance comparisons are carried out with some state‐of‐the‐art routing algorithms, namely, Dynamic Doppler Velocity Clustering, Signal Characteristic‐Based Clustered, Dynamic Link Duration ClUSTering, and mobility‐based clustering algorithms.
Abstract: Summary The hierarchical routing algorithm is categorized as a kind of routing method using node clustering to create a hierarchical structure in large-scale mobile ad hoc network (LMANET). In this paper, we proposed a new hierarchical clustering algorithm (HCAL) and a corresponded protocol for hierarchical routing in LMANET. The HCAL is designed based on a cost metric in the form of the link expiration time and node's relative degree. Correspondingly, the routing protocol for HCAL adopts a reactive protocol to control the existing cluster head (CH) nodes and handle proactive nodes to be considered as a cluster in LMANET. Hierarchical clustering algorithm jointly utilizes table-driven and on-demand routing by using a combined weight metric to search dominant set of nodes. This set is composed by link expiration time and node's relative degree to establish the intra/intercommunication paths in LMANET. The performance of the proposed algorithm and protocol is numerically evaluated in average end-to-end delay, number of CH per round, iteration count between the CHs, average CH keeping time, normalized routing overhead, and packet delivery ratio over a number of randomly generated benchmark scenarios. Furthermore, to corroborate the actual effectiveness of the HCAL algorithm, extensive performance comparisons are carried out with some state-of-the-art routing algorithms, namely, Dynamic Doppler Velocity Clustering, Signal Characteristic-Based Clustering, Dynamic Link Duration Clustering, and mobility-based clustering algorithms.

Journal ArticleDOI
01 Jan 2018
TL;DR: A Balanced and Energy Efficient MH (BEEMH) algorithm that is developed based on Dijkstra algorithm, which gives great interest to the residual energy of nodes is proposed and higher energy nodes are exclusively elected to work as relays.
Abstract: In Wireless Sensor Networks, the power resources of the nodes are significantly restricted. Hence, a special treatment for their available energy is deeply required. In long distance transmission, Multi-Hop (MH) techniques are preferred. Although MH minimizes the amount of energy cost consumed by each node along the path but finding the optimal routing path between nodes is still very interesting issues. This paper proposes a Balanced and Energy Efficient MH (BEEMH) algorithm that is developed based on Dijkstra algorithm. It gives great interest to the residual energy of nodes; hence higher energy nodes are exclusively elected to work as relays. Moreover, the total energy consumption at both TX and RX has been merged to model the weight of links between nodes. Finally, Dijkstra algorithm is employed to efficiently search for the minimum cost path. Furthermore, two proposed MH protocols are introduced. Both are mainly based on the BEEMH algorithm. MATLAB simulator has been used to evaluate BEEMH in comparison with other conventional algorithms such as; minimum transmission energy (MTE), energy saving oriented least-hop routing algorithm (ESLHA), and energy saving-oriented routing algorithm based on Dijkstra (ESRAD) under various scenarios of network models. Then the performance of our proposed protocols is compared with the related MH protocols.

Journal ArticleDOI
TL;DR: A new RPL-based routing protocol, termed as directional mutation ant colony optimization-based cognitive RPL (DMACO-RPL), for CR-enabled AMI networks, which utilizes a global optimization algorithm to select the best route from the whole network.
Abstract: Advanced metering infrastructure (AMI) networks, which are an integral component of the smart grid ecosystem, are practically deployed as a static multihop wireless mesh network. Recently, routing solutions for AMI networks have attracted a lot of attention in the literature. On the other hand, it is expected that the use of cognitive radio (CR) technology for AMI networks will be indispensable in near future. This paper investigates a global optimization-based routing protocol for enhancing quality of service in CR-enabled AMI networks. In accordance with practical requirements of smart grid applications, we propose a new RPL-based routing protocol, termed as directional mutation ant colony optimization-based cognitive RPL (DMACO-RPL), for CR-enabled AMI networks. This protocol utilizes a global optimization algorithm to select the best route from the whole network. In addition, DMACO-RPL explicitly protects primary (licensed) users while meeting the utility requirements of the secondary network. System-level simulations demonstrate that the proposed protocol enhances the performance of existing RPL-based routing protocols for CR-enabled AMI networks.

Journal ArticleDOI
TL;DR: The proposed energy-efficient data sensing and routing scheme (EEDSRS) in unreliable energy-harvesting wireless sensor network is developed and the experimental results demonstrate that the proposed EEDSRS is very promising and efficient.
Abstract: Energy-harvesting wireless sensor network (WSN) is composed of unreliable wireless channels and resource-constrained nodes which are powered by solar panels and solar cells. Energy-harvesting WSNs can provide perpetual data service by harvesting energy from surrounding environments. Due to the random characteristics of harvested energy and unreliability of wireless channel, energy efficiency is one of the main challenging issues. In this paper, we are concerned with how to decide the energy used for data sensing and transmission adaptively to maximize network utility, and how to route all the collected data to the sink along energy-efficient paths to maximize the residual battery energy of nodes. To solve this problem, we first formulate a heuristic energy-efficient data sensing and routing problem. Then, unlike the most existing work that focuses on energy-efficient data sensing and energy-efficient routing respectively, energy-efficient data sensing and routing scheme (EEDSRS) in unreliable energy-harvesting wireless sensor network is developed. EEDSRS takes account of not only the energy-efficient data sensing but also the energy-efficient routing. EEDSRS is divided into three steps: (1) an adaptive exponentially weighted moving average algorithm to estimate link quality. (2) an distributed energetic-sustainable data sensing rate allocation algorithm to allocate the energy for data sensing and routing. According to the allocated energy, the optimal data sensing rate to maximize the network utility is obtained. (3) a geographic routing with unreliable link protocol to route all the collected data to the sink along energy-efficient paths. Finally, extensive simulations to evaluate the performance of the proposed EEDSRS are performed. The experimental results demonstrate that the proposed EEDSRS is very promising and efficient.

Journal ArticleDOI
TL;DR: The data deliverability of greedy routing is characterized by the ratio of successful data transmissions from sensors to the base station and the effect of network congestion, link collision, and holes is provided.
Abstract: As a popular routing protocol in wireless sensor networks (WSNs), greedy routing has received great attention. The previous works characterize its data deliverability in WSNs by the probability of all nodes successfully sending their data to the base station. Their analysis, however, neither provides the information of the quantitative relation between successful data delivery ratio and transmission power of sensor nodes nor considers the impact of the network congestion or link collision on the data deliverability. To address these problems, in this paper, we characterize the data deliverability of greedy routing by the ratio of successful data transmissions from sensors to the base station. We introduce $\eta$ -guaranteed delivery which means that the ratio of successful data deliveries is not less than $\eta$ , and study the relationship between the transmission power of sensors and the probability of achieving $\eta$ -guaranteed delivery. Furthermore, with considering the effect of network congestion, link collision, and holes (e.g., those caused by physical obstacles such as a lake), we provide a more precise and full characterization for the deliverability of greedy routing. Extensive simulation and real-world experimental results show the correctness and tightness of the upper bound of the smallest transmission power for achieving $\eta$ -guaranteed delivery.

Journal ArticleDOI
TL;DR: A new energy-efficient clustering protocol for WSNs, which can minimize total network energy dissipation while maximizing network lifetime and increase the data delivery at the BS, when compared to other well-known clustering-based routing protocols.
Abstract: In the development of cluster-based energy-efficient protocols for wireless sensor networks (WSNs), a particularly challenging problem is the dynamic organization of sensors into a wireless communication network and the routing of sensed information from the field sensors to a remote base station (BS) in a manner that prolongs the lifetime of WSNs. This paper presents a new energy-efficient clustering protocol for WSNs, which can minimize total network energy dissipation while maximizing network lifetime. The protocol is divided into two parts. The first deals with constructing an infrastructure for the given WSN. A newly developed algorithm, based on a harmony search (HS), automatically determines the optimal number of clusters and allocates sensors into these clusters. This algorithm also eliminates the need to set the number of clusters a priori. The second part is concerned with the process of sending sensed data from nodes to their cluster head and then to the BS. A decentralized fuzzy clustering algorithm is proposed, where the selection of cluster heads in each round is locally made in each cluster during the network lifetime. Simulation results demonstrate that the proposed protocol can achieve an optimal number of clusters, prolong the network lifetime and increase the data delivery at the BS, when compared to other well-known clustering-based routing protocols.

Book ChapterDOI
01 Jan 2018
TL;DR: Some of the issues and research challenges in VANET that had not yet been addressed are conceptualized so that industry can opt for widespread adoption of scalable, reliable, secure and robust VANet protocols, architectures services and technologies and enable the ubiquitous deployment of it.
Abstract: The vehicular ad hoc network (VANET) is an ad hoc network system based on the concept of mobile ad hoc network (MANET) in which nodes (vehicle) that are being connected with each other by wireless technologies. But due to the non deterministic mobility behavior and high velocity of automobiles, the topology is unpredictable. Such types of system can work independently and can also be interconnected through internet with in its infrastructure. The system characteristics such as multi-hop paths, node mobility, huge network, device heterogeneity, congestion and bandwidth are the constraints in designing the routing protocols for VANET. The present routing protocols that have been deployed for MANET are used to test the VANET accuracy and performance. Present research efforts are strongly emphasized on designing a novel routing algorithm and its implementations. Recent VANET research are majorly focused on predefined areas such as broadcasting and routing, security, quality of service (QoS) and infotainment with information dissemination during emergencies. In this paper authors present a detailed review of wireless standards used in VANET with a number of trials in VANET and its deployment in many of the developed countries. As a conclusion we conceptualized some of the issues and research challenges in VANET that had not yet addressed so that industry can opt for widespread adoption of scalable, reliable, secure and robust VANET protocols, architectures services and technologies and enable the ubiquitous deployment of it.

Journal ArticleDOI
TL;DR: Optimal multimodal routing (OMR) as mentioned in this paper makes distributed decisions about the flow in each link and over each technology, at any given time, in order to advance a packet toward its destination.
Abstract: While acoustic communications are still considered the most prominent technology to communicate under water, other technologies are being developed based, e.g., on optical and radio-frequency electromagnetic waves. Each technology has its own advantages and drawbacks: for example, acoustic signals achieve long communication ranges at order-of-kbit/s rates, whereas optical signals offer order-of-Mbit/s transmission rates, but only over short ranges. Such diversity can be leveraged by multimodal systems, which integrate different technologies and provide the intelligence required to decide which one should be used at any given time. In this paper, we address a fundamental part of this intelligence by proposing optimal multimodal routing (OMR), a novel routing protocol for underwater networks of multimodal nodes. OMR makes distributed decisions about the flow in each link and over each technology, at any given time, in order to advance a packet toward its destination; in doing so, it prevents bottlenecks and allocates resources fairly to different nodes. We analyze the performance of OMR via simulations and in a field experiment. The results show that OMR successfully leverages all technologies to deliver data, even in the presence of imperfect topology information. To permit the reproduction of our results, we share our simulation code.

Book ChapterDOI
01 Jan 2018
TL;DR: The main purpose is to create a new set of routing protocols optimized various factors from the major differences in the underwater wireless sensor network and terrestrial network.
Abstract: The underwater wireless sensor networks is a rapidly growing area of research as it monitors and collects data for environmental studies of seismic monitoring, flocks of underwater robots, equipment monitoring and control, pollution monitoring applications. The main purpose is to create a new set of routing protocols optimized various factors from the major differences in the underwater wireless sensor network and terrestrial network. Energy efficiency plays an important role in underwater wireless communication as underwater sensor nodes are powered by batteries which are difficult to replace or charge once the node is deployed. This paper surveys various routing techniques. Modern research trends focus to improve the performance on various issues like propagation delay, mobility, limited link capacity and limited battery power on the sea ground and sea surface.

Journal ArticleDOI
TL;DR: An adaptive distributed routing method with cooperative transmission to effectively solve the problem presented above, in which the transmitters only use local information to transmit packets with help from their cooperative nodes, and can improve network performance in terms of energy efficiency, throughput and end-to-end delay.

Journal ArticleDOI
TL;DR: This paper studies the problem of spectrum-aware routing in a multi-hop, multi-channel cognitive radio network when malicious nodes in the secondary network attempt to block the path with mixed attacks, and decomposes the stochastic routing game into a series of stage games.
Abstract: This paper studies the problem of spectrum-aware routing in a multi-hop, multi-channel cognitive radio network when malicious nodes in the secondary network attempt to block the path with mixed attacks. Based on the location and time-variant path delay information, we model the path discovery process as a non-cooperative stochastic game. By exploiting the structure of the underlying Markov Decision Process, we decompose the stochastic routing game into a series of stage games. For each stage game, we propose a distributed strategy learning mechanism based on stochastic fictitious play to learn the equilibrium strategies of joint relay-channel selection in the condition of both limited information exchange and potential routing-toward-primary attacks. We also introduce a trustworthiness evaluation mechanism based on a multi-arm bandit process for normal users to avoid relaying to the sink-hole attackers. Simulation results show that without the need of information flooding, the proposed algorithm is efficient in bypassing the malicious nodes with mixed attacks.