A distributed delay-efficient data aggregation scheduling for duty-cycled WSNs

With the growing interest in wireless sensor networks (WSNs), minimizing network delay and maximizing sensor (node) lifetime are important challenges. Since the sensor battery is one of the most precious resources in a WSN, efficient utilization of the energy to prolong the network lifetime has been the focus of much of the research on WSNs. For that reason, many previous research efforts have tried to achieve tradeoffs in terms of network delay and energy cost for such data aggregation tasks. Recently, duty-cycling technique, i.e., periodically switching ON and OFF communication and sensing capabilities, has been considered to significantly reduce the active time of sensor nodes and thus extend network lifetime. However, this technique causes challenges for data aggregation. In this paper, we present a distributed approach, named distributed delay efficient data aggregation scheduling (DEDAS-D) to solve the aggregation-scheduling problem in duty-cycled WSNs. The analysis indicates that our solution is a better approach to solve this problem. We conduct extensive simulations to corroborate our analysis and show that DEDAS-D outperforms other distributed schemes and achieves an asymptotic performance compared with centralized scheme in terms of data aggregation delay.N/

Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey

Wireless sensor networks (WSNs) consist of autonomous and resource-limited devices. The devices cooperate to monitor one or more physical phenomena within an area of interest. WSNs operate as stochastic systems because of randomness in the monitored environments. For long service time and low maintenance cost, WSNs require adaptive and robust methods to address data exchange, topology formulation, resource and power optimization, sensing coverage and object detection, and security challenges. In these problems, sensor nodes are to make optimized decisions from a set of accessible strategies to achieve design goals. This survey reviews numerous applications of the Markov decision process (MDP) framework, a powerful decision-making tool to develop adaptive algorithms and protocols for WSNs. Furthermore, various solution methods are discussed and compared to serve as a guide for using MDPs in WSNs

Hierarchical routing protocols for wireless sensor network: a compressive survey

Wireless Sensor Networks (WSNs) are one of the key enabling technologies for the Internet of Things (IoT). WSNs play a major role in data communications in applications such as home, health care, environmental monitoring, smart grids, and transportation. WSNs are used in IoT applications and should be secured and energy efficient in order to provide highly reliable data communications. Because of the constraints of energy, memory and computational power of the WSN nodes, clustering algorithms are considered as energy efficient approaches for resource-constrained WSNs. In this paper, we present a survey of the state-of-the-art routing techniques in WSNs. We first present the most relevant previous work in routing protocols surveys then highlight our contribution. Next, we outline the background, robustness criteria, and constraints of WSNs. This is followed by a survey of different WSN routing techniques. Routing techniques are generally classified as flat, hierarchical, and location-based routing. This survey focuses on the deep analysis of WSN hierarchical routing protocols. We further classify hierarchical protocols based on their routing techniques. We carefully choose the most relevant state-of-the-art protocols in order to compare and highlight the advantages, disadvantage and performance issues of each routing technique. Finally, we conclude this survey by presenting a comprehensive survey of the recent improvements of Low-Energy Adaptive Clustering Hierarchy (LEACH) routing protocols and a comparison of the different versions presented in the literature

Survey: energy efficient protocols using radio scheduling in wireless sensor network

An efficient energy management scheme is crucial factor for design and implementation of any sensor network. Almost all sensor networks are structured with numerous small sized, low cost sensor devices which are scattered over the large area. To improvise the network performance by high throughput with minimum energy consumption, an energy efficient radio scheduling MAC protocol is effective solution, since MAC layer has the capability to collaborate with distributed wireless networks. The present survey study provides relevant research work towards radio scheduling mechanism in the design of energy efficient wireless sensor networks (WSNs). The various radio scheduling protocols are exist in the literature, which has some limitations. Therefore, it is require developing a new energy efficient radio scheduling protocol to perform multi tasks with minimum energy consumption (e.g. data transmission). The most of research studies paying more attention towards to enhance the overall network lifetime with the aim of using energy efficient scheduling protocol. In that context, this survey study overviews the different categories of MAC based radio scheduling protocols and those protocols are measured by evaluating their data transmission capability, energy efficiency, and network performance. With the extensive analysis of existing works, many research challenges are stated. Also provides future directions for new WSN design at the end of this survey

Multi-dimensional data indexing and range query processing via Voronoi diagram for internet of things

In a typical Internet of Things (IoT) deployment such as smart cities and Industry 4.0, the amount of sensory data collected from physical world is significant and wide-ranging. Processing large amount of real-time data from the diverse IoT devices is challenging. For example, in IoT environment, wireless sensor networks (WSN) are typically used for the monitoring and collecting of data in some geographic area. Spatial range queries with location constraints to facilitate data indexing are traditionally employed in such applications, which allows the querying and managing the data based on SQL structure. One particular challenge is to minimize communication cost and storage requirements in multi-dimensional data indexing approaches. In this paper, we present an energy- and time-efficient multidimensional data indexing scheme, which is designed to answer range query. Specifically, we propose data indexing methods which utilize hierarchical indexing structures, using binary space partitioning (BSP), such as kd-tree, quad-tree, k-means clustering, and Voronoi-based methods to provide more efficient routing with less latency. Simulation results demonstrate that the Voronoi Diagram-based algorithm minimizes the average energy consumption and query response time

A Survey on Scheduling Schemes with Security in Wireless Sensor Networks

AbstractWireless Sensor Network (WSN) is highly distributed network of small and light weight node. The node has the limited battery lifetime. Packet scheduling is important in WSN to maintain fairness based on priority of the data and to reduce the end to end delay. Existing packet scheduling algorithm used were First Come First Served (FCFS), Preemptive, Non-Preemptive.In this paper Dynamic Multilevel Priority (DMP) Packet Scheduling Scheme with the Bit Rate classification is proposed. The threshold value check mechanism is also proposed to prevent the deadlock situation. To provide security we will be implementing the RC6 security algorithm

Long-Term Stable Communication in Centrally Scheduled Low-Power Wireless Networks

With the emergence of the Internet of Things (IoT), more devices are connected than ever before. Most of these communicate wirelessly, forming Wireless Sensor Networks. In recent years, there has been a shift from personal networks, like Smart Home, to industrial networks. Industrial networks monitor pipelines or handle the communication between robots in factories. These new applications form the Industrial Internet of Things (IIoT). Many industrial applications have high requirements for communication, higher than the requirements of common IoT networks. Communications must stick to hard deadlines to avoid harm, and they must be highly reliable as skipping information is not a viable option when communicating critical information. Moreover, communication has to remain reliable over longer periods of time. As many sensor locations do not offer a power source, the devices have to run on battery and thus have to be power efficient. Current systems offer solutions for some of these requirements. However, they especially lack long-term stable communication that can dynamically adapt to changes in the wireless medium.In this thesis, we study the problem of stable and reliable communication in centrally scheduled low-power wireless networks. This communication ought to be stable when it can dynamically adapt to changes in the wireless medium while keeping latency at a minimum. We design and investigate approaches to solve the problem of low to high degrees of interference in the wireless medium. We propose three solutions to overcome interference: MASTER with Sliding Windows brings dynamic numbers of retransmissions to centrally scheduled low-power wireless networks, OVERTAKE allows to skip nodes affected by interference along the path, and AUTOBAHN combines opportunistic routing and synchronous transmissions with the Time-Slotted Channel Hopping (TSCH) MAC protocol to overcome local wide-band interference with the lowest possible latency. We evaluate our approaches in detail on testbed deployments and provide open-source implementations of the protocols to enable others to build their work upon them