An Energy-Efficient Distributed Algorithm for k-Coverage Problem in Wireless Sensor Networks

Wireless sensor networks (WSNs) have recently achieved a great deal of attention due to its numerous attractive applications in many different fields. Sensors and WSNs possesses a number of special characteristics that make them very promising in many applications, but also put on them lots of constraints that make issues in sensor network particularly difficult. These issues may include topology control, routing, coverage, security, and data management. In this thesis, we focus our attention on the coverage problem. Firstly, we define the Sensor Energy-efficient Scheduling for k-coverage (SESK) problem. We then solve it by proposing a novel, completely localized and distributed scheduling approach, naming Distributed Energy-efficient Scheduling for k-coverage (DESK) such that the energy consumption among all the sensors is balanced, and the network lifetime is maximized while still satisfying the k-coverage requirement. Finally, in related work section we conduct an extensive survey of the existing work in literature that focuses on with the coverage problem

Perimeter coverage scheduling in wireless sensor networks using sensors with a single continuous cover range

In target monitoring problem, it is generally assumed that the whole target object can be monitored by a single sensor if the target falls within its sensing range. Unfortunately, this assumption becomes invalid when the target object is very large that a sensor can only monitor part of it. In this paper, we study the perimeter coverage problem where the perimeter of a big object needs to be monitored, but each sensor can only cover a single continuous portion of the perimeter. We describe how to schedule the sensors so as to maximize the network lifetime in this problem. We formally prove that the perimeter coverage scheduling problem is NP-hard in general. However, polynomial time solution exists in some special cases. We further identify the sufficient conditions for a scheduling algorithm to be a 2-approximation solution to the general problem, and propose a simple distributed 2-approximation solution with a small message overhead. Copyright © 2010 K.-S. Hung and K.-S. Lui.published_or_final_versio

Energy efficient scheme to Jointly Optimize Coverage and Connectivity in Large Scale Wireless Sensor Network

Efficient coverage and connectivity are two important factors that ensures better service quality especially during tracking targets or monitoring events in wireless sensor network. Although massive amount of studies has been carried out in the past to enhance coverage and connectivity issues, till date very few studies have witnessed a significant and standard outcomes that can opt further. Hence, this paper introduces a computationally efficient technique for jointly addressing both coverage and connectivity problems in large-scale wireless sensor network that ensures optimal network lifetime too. The proposed system has been empirically designed, and algorithms formulated to ensure energy efficient monitoring of event. The outcomes of the study are compared with standard energy efficient hierarchical protocol to benchmark the results

Self-Organizing and Scalable Routing Protocol (SOSRP) for Underwater Acoustic Sensor Networks

Las redes de sensores acústicas submarinas (UASN) han ganado mucha importancia en los últimos años: el 71% de la superficie de la Tierra está cubierta por océanos. La mayoría de ellos, aún no han sido explorados. Aplicaciones como prospección de yacimientos, prevención de desastres o recopilación de datos para estudios de biología marina se han convertido en el campo de interés para muchos investigadores. Sin embargo, las redes UASN tienen dos limitaciones: un medio muy agresivo (marino) y el uso de señales acústicas. Ello hace que las técnicas para redes de sensores inalámbricas (WSN) terrestres no sean aplicables. Tras realizar un recorrido por el estado del arte en protocolos para redes UASN, se propone en este TFM un protocolo de enrutamiento denominado "SOSRP", descentralizado y basado en tablas en cada nodo. Se usa como criterio para crear rutas una combinación del valor de saltos hasta el nodo recolector y la distancia. Las funciones previstas del protocolo abarcan: autoorganización de las rutas, tolerancia a fallos y detección de nodos aislados. Mediante la implementación en MATLAB de SOSRP así como de un modelo de propagación y energía apropiados para entorno marino, se obtienen resultados de rendimiento en distintos escenarios (variando nºextremo de paquetes, consumo de energía o longitud de rutas creadas (con y sin fallo). Los resultados obtenidos muestran una operación estable, fiable y adecuada para el despliegue y operación de los nodos en redes UASN

Resilient Wireless Sensor Networks Using Topology Control: A Review

Wireless sensor networks (WSNs) may be deployed in failure-prone environments, and WSNs nodes easily fail due to unreliable wireless connections, malicious attacks and resource-constrained features. Nevertheless, if WSNs can tolerate at most losing k − 1 nodes while the rest of nodes remain connected, the network is called k − connected. k is one of the most important indicators for WSNs’ self-healing capability. Following a WSN design flow, this paper surveys resilience issues from the topology control and multi-path routing point of view. This paper provides a discussion on transmission and failure models, which have an important impact on research results. Afterwards, this paper reviews theoretical results and representative topology control approaches to guarantee WSNs to be k − connected at three different network deployment stages: pre-deployment, post-deployment and re-deployment. Multi-path routing protocols are discussed, and many NP-complete or NP-hard problems regarding topology control are identified. The challenging open issues are discussed at the end. This paper can serve as a guideline to design resilient WSNs

From MANET to people-centric networking: Milestones and open research challenges

In this paper, we discuss the state of the art of (mobile) multi-hop ad hoc networking with the aim to present the current status of the research activities and identify the consolidated research areas, with limited research opportunities, and the hot and emerging research areas for which further research is required. We start by briefly discussing the MANET paradigm, and why the research on MANET protocols is now a cold research topic. Then we analyze the active research areas. Specifically, after discussing the wireless-network technologies, we analyze four successful ad hoc networking paradigms, mesh networks, opportunistic networks, vehicular networks, and sensor networks that emerged from the MANET world. We also present an emerging research direction in the multi-hop ad hoc networking field: people centric networking, triggered by the increasing penetration of the smartphones in everyday life, which is generating a people-centric revolution in computing and communications

Navigating the IoT landscape: Unraveling forensics, security issues, applications, research challenges, and future

Given the exponential expansion of the internet, the possibilities of security attacks and cybercrimes have increased accordingly. However, poorly implemented security mechanisms in the Internet of Things (IoT) devices make them susceptible to cyberattacks, which can directly affect users. IoT forensics is thus needed for investigating and mitigating such attacks. While many works have examined IoT applications and challenges, only a few have focused on both the forensic and security issues in IoT. Therefore, this paper reviews forensic and security issues associated with IoT in different fields. Future prospects and challenges in IoT research and development are also highlighted. As demonstrated in the literature, most IoT devices are vulnerable to attacks due to a lack of standardized security measures. Unauthorized users could get access, compromise data, and even benefit from control of critical infrastructure. To fulfil the security-conscious needs of consumers, IoT can be used to develop a smart home system by designing a FLIP-based system that is highly scalable and adaptable. Utilizing a blockchain-based authentication mechanism with a multi-chain structure can provide additional security protection between different trust domains. Deep learning can be utilized to develop a network forensics framework with a high-performing system for detecting and tracking cyberattack incidents. Moreover, researchers should consider limiting the amount of data created and delivered when using big data to develop IoT-based smart systems. The findings of this review will stimulate academics to seek potential solutions for the identified issues, thereby advancing the IoT field.Comment: 77 pages, 5 figures, 5 table