Resilient Wireless Sensor Networks Research Articles

Design and implementation of duty cycle-based futuristic clustering technique in WSN

In recent times, wireless sensor networks (WSNs) and their applications have exhibited a remarkable surge. These networks strive to devise and implement strategies that optimize network energy utilization, thereby extending their operational lifespan. An energy efficient network can be achieved using renewable source of energy and by controlling the duty cycle of nodes. The pivotal role of duty cycle in curtailing energy consumption in WSNs cannot be overstated. In this work, we introduce a novel duty cycle based futuristic clustering technique (DCBFCT) employing a nearest neighbor approach. This technique selectively induces sleep and awake modes in nodes, effectively minimizing the network’s overall energy consumption and, consequently, prolonging its lifespan. It calculates optimal node duty cycle values based on distance. Results demonstrate a substantial reduction in energy consumption, exhibiting an improved network lifetime. Empirical results presented in this study not only affirm the effectiveness of DCBFCT but also contribute valuable insights toward the development of sustainable and resilient WSNs in the era of burgeoning sensor network applications. The experimentation is conducted using the MATLAB/Simulink tool, considering diverse cases. The scalability and versatility of DCBFCT make it suitable for deployment in real-world applications, ranging from environmental monitoring to industrial automation.

Quantum walks-based simple authenticated quantum cryptography protocols for secure wireless sensor networks

Wireless sensor networks (WSNs) play a crucial role in various applications, ranging from environmental monitoring to industrial automation that require high levels of security. With the development of quantum technologies, many security mechanisms may be hacked due to the promising capabilities of quantum computation. To address this challenge, quantum protocols have emerged as a promising solution for enhancing the security of wireless sensor communications. One of the common types of quantum protocols is quantum key distribution (QKD) protocols, which are investigated to allow two participants with fully quantum capabilities to share a random secret key, while semi-quantum key distribution (SQKD) protocols are designed to perform the same task using fewer quantum resources to make quantum communications more realizable and practical. Quantum walk (QW) plays an essential role in quantum computing, which is a universal quantum computational paradigm. In this work, we utilize the advantages of QW to design three authenticated quantum cryptographic protocols to establish secure channels for data transmission between sensor nodes: the first one is authenticated quantum key distribution (AQKD), the second one is authenticated semi-quantum key distribution (ASQKD) with one of the two participants having limited quantum capabilities, and the last one is ASQKD but both legitimate users possess limited quantum resources. The advantages of the proposed protocols are that the partners can exchange several different keys with the same exchanged qubits, and the presented protocols depend on a one-way quantum communication channel. In contrast, all previously designed SQKD protocols rely on two-way quantum communication. Security analyses prove that the presented protocols are secure against various well-known attacks and highly efficient. The utilization of the presented protocols in wireless sensor communications opens up new avenues for secure and trustworthy data transmission, enabling the deployment of resilient WSNs in critical applications. This work also paves the way for future exploration of quantum-based security protocols and their integration into WSNs for enhanced data protection.

Toward Resilient Wireless Sensor Networks: A Virtualized Perspective.

The Internet of Things (IoT) has been one of the main focus areas of the research community in recent years, the requirements of which help network administrators to design and ensure the functionalities and resources of each device. Generally, two types of devices—constrained and unconstrained devices—are typical in the IoT environment. Devices with limited resources—for example, sensors and actuators—are known as constrained devices. Unconstrained devices includes gateways or border routers. Such devices are challenging in terms of their deployment because of their connectivity, channel selection, multiple interfaces, local and global address assignment, address resolution, remote access, mobility, routing, border router scope and security. To deal with these services, the availability of the IoT system ensures that the desired network services are available even in the presence of denial-of-service attacks, and the use of the system has become a difficult but mandatory task for network designers. To this end, we present a novel design for wireless sensor networks (WSNs) to address these challenges by shifting mandatory functionalities from unreliable to reliable and stable domains. The main contribution of our work consists in addressing the core network requirements for IoT systems and pointing out several guidelines for the design of standard virtualized protocols and functions. In addition, we propose a novel architecture which improves IoT systems, lending them more resilience and robustness, together with highlighting and some important open research topics.

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.

The Influence of Communication Range on Connectivity for Resilient Wireless Sensor Networks Using a Probabilistic Approach

Wireless sensor networks (WSNs) consist of thousands of nodes that need to communicate with each other. However, it is possible that some nodes are isolated from other nodes due to limited communication range. This paper focuses on the influence of communication range on the probability that all nodes are connected under two conditions, respectively: (1) all nodes have the same communication range, and (2) communication range of each node is a random variable. In the former case, this work proves that, for [Formula: see text], if the probability of the network being connected is [Formula: see text], by means of increasing communication range by constant [Formula: see text], the probability of network being connected is at least [Formula: see text]. Explicit function [Formula: see text] is given. It turns out that, once the network is connected, it also makes the WSNs resilient against nodes failure. In the latter case, this paper proposes that the network connection probability is modeled as Cox process. The change of network connection probability with respect to distribution parameters and resilience performance is presented. Finally, a method to decide the distribution parameters of node communication range in order to satisfy a given network connection probability is developed.