Directional routing protocols for ad-hoc networks

A directional routing approach for multihop ad-hoc networks, is presented which has been applied to two on-demand routing protocols: namely dynamic source routing (DSR) and ad-hoc on-demand distance vector routing (AODV). Both DSR-based and AODV-based directional routing protocols are designed to balance the tradeoff between co-channel interferences from nodes hops away and the total power consumed by all the nodes. In order to select the best route, three metrics are considered in the route discovery process. They consist of hop count, power budget and overlaps between adjacent beams. By exploiting the direction of directional antennas, both routing protocols are capable of reducing overlaps between beams of the nodes along the route, thus eliminating interference. Arbitrary networks and random networks are considered in the simulations. The results show considerable performance gains for transmission of real-time traffic over ad hoc networks.     

EAMTR: energy aware multi-tree routing for wireless sensor networks

IEEE 802.15.4 is the prevailing standard for low-rate wireless personal area networks. It specifies the physical layer and medium access control sub-layer. Some emerging standards such as ZigBee define the network layer on top of these lower levels to support routing and multi-hop communication. Tree routing is a favourable basis for ZigBee routing because of its simplicity and limited use of resources. However, in data collection systems that are based on spanning trees rooted at a sink node, non-optimal route selection, congestion and uneven distribution of traffic in tree routing can adversely contribute to network performance and lifetime. The imbalance in workload can result in hotspot problems and early energy depletion of specific nodes that are normally the crucial routers of the network. The authors propose a novel light-weight routing protocol, energy aware multi-tree routing (EAMTR) protocol, to balance the workload of data gathering and alleviate the hotspot and single points of failure problems for high-density sink-type networks. In this scheme, multiple trees are formed in the initialisation phase and according to network traffic, each node selects the least congested route to the root node. The results of simulation and performance evaluation of EAMTR show significant improvement in network lifetime and traffic distribution.     

Distributed microflow sensor arrays and networks: design of architectures and communication protocols

Distributed microflow sensor arrays and networks are built from collections of spatially scattered, intelligent microflow sensor nodes. They can enhance the reliability and fault tolerance of the system. A new cluster network architecture and two original alternatives of fault-tolerant time-out communication protocol are described. Teamwork integration evaluator/micro-electromechanical system, a micro-electromechanical system sensor network simulation tool, was developed to evaluate the effectiveness of the network architectures and communication protocols.     

一种改进的传感器网络分簇分层路由协议

在分析了无线传感器网络中传统的LEACH和LEACH-C路由协议基础上,结合MTE路由协议思想,提出了一种新的改进型分簇分层路由协议(improved clustering hierarchical routing protocol,ICH).文中簇首节点可以采用多跳方式传输数据包,且在选择中继节点时考虑节点剩余能量,对进入下一轮的条件进行了限制.实验表明,改进后的ICH协议的节点存活率比LEACH-C好.     

REEP: data-centric, energy-efficient and reliable routing protocol for wireless sensor networks

Owing to the growing demand for low-cost 'networkable' sensors in conjunction with recent developments of micro-electro mechanical system (MEMS) and radio frequency (RF) technology, new sensors come with advanced functionalities for processing and communication. Since these nodes are normally very small and powered with irreplaceable batteries, efficient use of energy is paramount and one of the most challenging tasks in designing wireless sensor networks (WSN). A new energy-aware WSN routing protocol, reliable and energy efficient protocol (REEP), which is proposed, makes sensor nodes establish more reliable and energy-efficient paths for data transmission. The performance of REEP has been evaluated under different scenarios, and has been found to be superior to the popular data-centric routing protocol, directed-diffusion (DD) (discussed by Intanagonwiwat et al. in `Directed diffusion for wireless sensor networking? IEEE/ACM Trans. Netw., 2003, 11(1), pp. 2?16), used as the benchmark.     

ECO-BAT: A New Routing Protocol for Energy Consumption Optimization Based on BAT Algorithm in WSN

Wireless sensor network (WSN) has been widely used due to its vast range of applications. The energy problem is one of the important problems influencing the complete application. Sensor nodes use very small batteries as a power source and replacing them is not an easy task. With this restriction, the sensor nodes must conserve their energy and extend the network lifetime as long as possible. Also, these limits motivate much of the research to suggest solutions in all layers of the protocol stack to save energy. So, energy management efficiency becomes a key requirement in WSN design. The efficiency of these networks is highly dependent on routing protocols directly affecting the network lifetime. Clustering is one of the most popular techniques preferred in routing operations. In this work we propose a novel energy-efficient protocol for WSN based on a bat algorithm called ECO-BAT (Energy Consumption Optimization with BAT algorithm for WSN) to prolong the network lifetime. We use an objective function that generates an optimal number of sensor clusters with cluster heads (CH) to minimize energy consumption. The performance of the proposed approach is compared with Low-Energy Adaptive Clustering Hierarchy (LEACH) and Energy Efficient cluster formation in wireless sensor networks based on the Multi-Objective Bat algorithm (EEMOB) protocols. The results obtained are interesting in terms of energy-saving and prolongation of the network lifetime.     

Robust mobility adaptive clustering scheme with support for geographic routing for vehicular ad hoc networks

There are a number of critical problems related to road safety in intelligent transportation systems (ITS) caused by increased vehicle usage, urbanisation, population growth and density, and faster rates of movements of goods and people. It is envisaged that vehicular ad hoc networks (VANETs) will bring about a substantial change to the way our road transport operates to improving road safety and traffic congestion. A major challenge in VANETs is to provide real-time transfer of information between vehicles within a highly mobile environment. The authors propose a new clustering scheme named robust mobility adaptive clustering (RMAC) to strategically enable and manage highly dynamic VANETs for future ITS. It employs a novel node precedence algorithm to adaptively identify the nearby 1-hop neighbours and select optimal clusterheads based on relative node mobility metrics of speed, locations and direction of travel. Furthermore, the zone of interest concept is introduced for optimised approach to the network structure such that each vehicular node maintains a neighbour table of nodes, beyond its communications range, that reflects the frequent changes on the network and provides prior knowledge of neighbours as they travel into new neighbourhoods. RMAC predominantly employs more reliable unicast control packets and supports geographic routing by providing accurate neighbour information crucial when making routing decisions in multi-hop geographic routing. It is shown by simulations that RMAC on IEEE802.11 ad hoc WLAN protocol is very effective in a highly dynamic VANETs environment, being robust on link failures, and having very high cluster residence times compared to the well known distributed mobility clustering scheme.     

Efficient power-consumption-based load-sharing topology control protocol for harsh environments in wireless sensor networks

Energy conservation and network performance are critical issues in wireless sensor networks.The authors present a novel efficient communication topology control protocol, called quorum-based load-sharing control protocol (QLSCP). QLSCP is a quorum-based communication protocol, which chooses appropriate communication nodes, adjusts the service loads of critical nodes and performs adaptive sleep management. QLSCP is suitable for harsh environments without a central control server calculating the locations of sensors, using the factor of the remaining power to build the system topology. The proposed protocol divides the topology operation into topology formation, adjustment and execution phases. The topology formation phase builds the backbone of an enhanced tree. In the topology adjustment phase, the enhanced tree is adjusted by an optimal balance of critical nodes in the backbone. In the topology execution phase, the efficient surplus-energy consuming (ESC) mechanism is proposed to efficiently exhaust the energy of each node. The ESC mechanism is designed to efficiently exhaust the latest remaining electronic power of sensor nodes. Simulation results of QLSCP demonstrate that it efficiently achieves to prolong system lifetime in harsh environments.     

基于DSP的智能家居无线网络节点的设计

 将无线传感器网络技术融入智能家居系统中,设计合理的网络节点成为智能家居系统的核心问题．在分析无线传感器网络节点结构基础上,提出以DSP 芯片TMS320F206为处理器、AT86RF230为无线通信芯片的无线传感器网络节点．充分考虑节能和扩展性的需求,采用节点定时打开与关闭的协议且打开与关闭的时间比为1∶99．试验表明该无线网络节点能满足低功耗、长传输距离、准确定位、抗干扰的要求．     

E2-SCAN: an extended credit strategy-based energy-efficient security scheme for wireless ad hoc networks

Utilising the battery life and the limited bandwidth available in mobile ad hoc networks (MANETs) in the most efficient manner is an important issue, along with providing security at the network layer. The authors propose, design and describe E2-SCAN, an energy-efficient network layered security solution for MANETs, which protects both routing and packet forwarding functionalities in the context of the on demand distance vector protocol. E2-SCAN is an advanced approach that builds on and improves upon some of the state-of-the-art results available in the literature. The proposed E2-SCAN algorithm protects the routing and data forwarding operations through the same reactive approach, as is provided by the SCAN algorithm. It also enhances the security of the network by detecting and reacting to the malicious nodes. In E2-SCAN, the immediate one-hop neighbour nodes collaboratively monitor. E2-SCAN adopts a modified novel credit strategy to decrease its overhead as the time evolves. Through both analysis and simulation results, the authors demonstrate the effectiveness of E2-SCAN over SCAN in a hostile environment.     

Cross-layer binding update for TCP performance enhancement over Mobile IPv6 networks

Mobility support in Internet Protocol version 6 (IPv6) is a de facto standard for allowing nodes to remain connected while moving around in the IPv6 networks. To provide better handoff latency and performance, numerous optimisation techniques were developed. Some of them are single-layer optimisation such as the hierarchical mobile IPv6 architecture, which aims at reducing the registration time in network layer. Others are cross-layer optimisation such as the fast handover mechanism, which tries to reduce the address resolution time in network layer based on the data-link layer detection. Most of these techniques are focused on data-link and network layer optimisation. The authors propose a cross-layer mechanism, which uses the standard binding update packet in mobile IPv6 handoff to enhance the overall transmission control protocol performance in transmission. The theoretical analysis and simulations show promising performance enhancements.     

Providing scalable location service in wireless sensor networks with mobile sinks

Location-based routing has been considered as an efficient routing paradigm for wireless sensor networks (WSNs). The performance of location-based routing highly depends on the way the position information of mobile sinks are updated and managed, which is the typical function of location service. Frequent location updating can improve the location accuracy at the expense of additional communication overhead. In this study, the authors propose a scalable location service for supporting efficient location-based routing in WSNs with mobile sinks. The proposed location service enables each sensor node to locate its closest (mobile) sink with low overhead. Analytical and simulation results show that it can significantly reduce the communication overhead for providing location service while maintaining high routing performance.     

Lifetime improvement in wireless sensor networks via collaborative beamforming and cooperative transmission

Collaborative beamforming (CB) and cooperative transmission (CT) have recently emerged as communication techniques that can make effective use of collaborative/cooperative nodes to create a virtual multiple-input/multiple-output system. Extending the lifetime of networks composed of battery-operated nodes is a key issue in the design and operation of wireless sensor networks. The effects on network lifetime of allowing closely located nodes to use CB/CT to reduce the load or even to avoid packet-forwarding requests to nodes that have critical battery life are considered. First, the effectiveness of CB/CT in improving the signal strength at a faraway destination using energy in nearby nodes is studied. Then, the performance improvement obtained by this technique is analysed for a special 2D disc case. Further, for general networks in which information-generation rates are fixed, a new routing problem is formulated as a linear- programming problem, whereas for other general networks, the cost for routing is dynamically adjusted according to the amount of energy remaining and the effectiveness of CB/CT. From the analysis and the simulation results, it is seen that the proposed method can reduce the payloads of energy-depleting nodes by about 90% in the special case network considered and improve the lifetimes of general networks by about 10%, compared with existing techniques.     

An Energy Based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks

In recent years, with the rapid development of the Internet and wireless communication technology, wireless Ad hoc networks have received more attention. Due to the limited transmission range and energy of nodes in Ad hoc networks, it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks. This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol, which has the following two aspects of improvement: (1) In the route discovery process, a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a “Mark” bit that representing remaining energy of a node. (2) Based on (1), a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively. Simulation results demonstrate that compared with AODV and other existing routing protocols, proposed algorithm can reduce network energy consumption and balance node energy, thus extending the network lifetime.     

Maximum Data Generation Rate Routing Protocol Based on Data Flow Controlling Technology for Rechargeable Wireless Sensor Networks

For rechargeable wireless sensor networks, limited energy storage capacity, dynamic energy supply, low and dynamic duty cycles cause that it is unpractical to maintain a fixed routing path for packets delivery permanently from a source to destination in a distributed scenario. Therefore, before data delivery, a sensor has to update its waking schedule continuously and share them to its neighbors, which lead to high energy expenditure for reestablishing path links frequently and low efficiency of energy utilization for collecting packets. In this work, we propose the maximum data generation rate routing protocol based on data flow controlling technology. For a sensor, it does not share its waking schedule to its neighbors and cache any waking schedules of other sensors. Hence, the energy consumption for time synchronization, location information and waking schedule shared will be reduced significantly. The saving energy can be used for improving data collection rate. Simulation shows our scheme is efficient to improve packets generation rate in rechargeable wireless sensor networks.     

Geometric algorithms for sensor networks

This paper surveys the use of geometric methods for wireless sensor networks. The close relationship of sensor nodes with their embedded physical space imposes a unique geometric character on such systems. The physical locations of the sensor nodes greatly impact on system design in all aspects, from low-level networking and organization to high-level information processing and applications. This paper reviews work in the past 10 years on topics such as network localization, geometric routing, information discovery, data-centric routing and topology discovery.     

CNR: A Cluster-Based Solution for Connectivity Restoration for Mobile WSNs

Wireless Sensor Networks (WSNs) are an integral part of the Internet of Things (IoT) and are widely used in a plethora of applications. Typically, sensor networks operate in harsh environments where human intervention is often restricted, which makes battery replacement for sensor nodes impractical. Node failure due to battery drainage or harsh environmental conditions poses serious challenges to the connectivity of the network. Without a connectivity restoration mechanism, node failures ultimately lead to a network partition, which affects the basic function of the sensor network. Therefore, the research community actively concentrates on addressing and solving the challenges associated with connectivity restoration in sensor networks. Since energy is a scarce resource in sensor networks, it becomes the focus of research, and researchers strive to propose new solutions that are energy efficient. The common issue that is well studied and considered is how to increase the network’s life span by solving the node failure problem and achieving efficient energy utilization. This paper introduces a Cluster-based Node Recovery (CNR) connectivity restoration mechanism based on the concept of clustering. Clustering is a well-known mechanism in sensor networks, and it is known for its energy-efficient operation and scalability. The proposed technique utilizes a distributed cluster-based approach to identify the failed nodes, while Cluster Heads (CHs) play a significant role in the restoration of connectivity. Extensive simulations were conducted to evaluate the performance of the proposed technique and compare it with the existing techniques. The simulation results show that the proposed technique efficiently addresses node failure and restores connectivity by moving fewer nodes than other existing connectivity restoration mechanisms. The proposed mechanism also yields an improved field coverage as well as a lesser number of packets exchanged as compared to existing state-of-the-art mechanisms.     

Energy Efficient Ambience Awake Routing with OpenFlow Approach

A major problem in networking has always been energy consumption. Battery life is one parameter which could help improve Energy Efficiency. Existing research on wireless networking stresses on reducing signaling messages or time required for data transfer for addressing energy consumption issues. Routing or Forwarding packets in a network between the network elements like routers, switches, wireless access points, etc., is complex in conventional networks. With the advent of Software Defined Networking (SDN) for 5G network architectures, the distributed networking has embarked onto centralized networking, wherein the SDN Controller is responsible for decision making. The controller pushes its decision onto the network elements with the help of a control plane protocol termed OpenFlow. Decentralized networks have been largely in use because of their ease in physical and logically setting the administrative hierarchies. The centralized controller deals with the policy funding and the protocols used for routing procedures are designated by the decentralized controller. Ambience Awake is a location centered routing protocol deployed in the 5G network architecture with OpenFlow model. The Ambience Awake mechanism relies on the power consumption of the network elements during the packet transmission for unicast and multicast scenarios. The signalling load and the routing overhead witnessed an improvement of 30% during the routing procedure. The proposed routing mechanism run on the top of the decentralized SDN controller proves to be 19.59% more efficient than the existing routing solutions.     

Photovoltaics in the assessment of wireless sensor network reliability with changing environmental conditions

This paper presents a reliability assessment of a wireless sensor network (WSN) equipped with mini photovoltaic cells (PV‐WSN) under natural environmental conditions while accounting for different types of system failures. In particular, our assessment considers the hardware specifications of the sensors, photovoltaic (PV) specifications, the use of rechargeable batteries, communication protocols, and various elements required for efficient detection of environmental conditions. We accomplished this by developing a simulator that generated data for 2 broad WSN conditions: (1) WSN without PV and (2) WSN with PV. The dynamic source routing protocol was employed for these simulations, and the following variables were assessed for both conditions: WSN reliability, the impact of energy consumption on the network, and the types of failures that lead to sensor unavailability. The following assumptions were made to run the simulation: the distribution of WSN nodes is random, with 1 sink node per rectangular cluster, the sensor nodes are structurally and functionally identical, environmental interference and suboptimal orientation impair PV cell recharge capacity randomly, and no communication loss occurs. Our reliability assessment assumed extreme environmental conditions and further made assessments of component reliability that included the following parameters: sensor and PV cell hardware specifications, the rechargeable nature of PV cell batteries for different sensor activity states, the availability of sunlight for powering PV cells, and the energy efficiency of PV cells. We found that network lifetime was prolonged for the PV‐WSN condition over the WSN without PV condition, introducing a role for PV cells as potential energy sources for WSNs.     

Energy-Efficient Transmission Range Optimization Model for WSN-Based Internet of Things

With the explosive advancements in wireless communications and digital electronics, some tiny devices, sensors, became a part of our daily life in numerous fields. Wireless sensor networks (WSNs) is composed of tiny sensor devices. WSNs have emerged as a key technology enabling the realization of the Internet of Things (IoT). In particular, the sensor-based revolution of WSN-based IoT has led to considerable technological growth in nearly all circles of our life such as smart cities, smart homes, smart healthcare, security applications, environmental monitoring, etc. However, the limitations of energy, communication range, and computational resources are bottlenecks to the widespread applications of this technology. In order to tackle these issues, in this paper, we propose an Energy-efficient Transmission Range Optimized Model for IoT (ETROMI), which can optimize the transmission range of the sensor nodes to curb the hot-spot problem occurring in multi-hop communication. In particular, we maximize the transmission range by employing linear programming to alleviate the sensor nodes’ energy consumption and considerably enhance the network longevity compared to that achievable using state-of-the-art algorithms. Through extensive simulation results, we demonstrate the superiority of the proposed model. ETROMI is expected to be extensively used for various smart city, smart home, and smart healthcare applications in which the transmission range of the sensor nodes is a key concern.