A Comparative Study of Wireless Sensor Networks and Their Routing Protocols

Recent developments in the area of micro-sensor devices have accelerated advances in the sensor networks field leading to many new protocols specifically designed for wireless sensor networks (WSNs). Wireless sensor networks with hundreds to thousands of sensor nodes can gather information from an unattended location and transmit the gathered data to a particular user, depending on the application. These sensor nodes have some constraints due to their limited energy, storage capacity and computing power. Data are routed from one node to other using different routing protocols. There are a number of routing protocols for wireless sensor networks. In this review article, we discuss the architecture of wireless sensor networks. Further, we categorize the routing protocols according to some key factors and summarize their mode of operation. Finally, we provide a comparative study on these various protocols

Novel Approach using Robust Routing Protocol in Underwater Acoustic Wireless Sensor Network with Network Simulator 2: A Review

In recent year wireless sensor network has been an emerging technology and promising technology in unveiling the riddle of the marine life and other underwater applications. As it is a permutation of computation, sensing and communication. In the 70% of the earth a huge amount of unexploited resources lies covered by oceans. To coordinate interact and share information among themselves to carry out sensing and monitoring function underwater sensor network consists number of various sensors and autonomous underwater vehicles deployed underwater. The two most fundamental problems in underwater sensor network are sensing coverage and network connectivity. The coverage problem reflects how well a sensor network is tracked or monitored by sensors. An underwater wireless sensor networks is the emerging field that is having the challenges in each field such as the deployment of nodes, routing, floating movement of sensors etc. This paper is concerned about the underwater acoustic wireless sensor network of routing protocol applications and UW-ASNs deployments for monitoring and control of underwater domains

Cross-layer network lifetime optimization considering transmit and signal processing power in WSNs

Maintaining high energy efficiency is essential for increasing the lifetime of wireless sensor networks (WSNs), where the battery of the sensor nodes cannot be routinely replaced. Nevertheless, the energy budget of the WSN strictly relies on the communication parameters, where the choice of both the transmit power as well as of the modulation and coding schemes (MCSs) plays a significant role in maximizing the network lifetime (NL). In this paper, we optimize the NL of WNSs by analysing the impact of the physical layer parameters as well as of the signal processing power (SPP) P_sp on the NL. We characterize the underlying trade-offs between the NL and bit error ratio (BER) performance for a predetermined set of target signal-to-interference-plus-noise ratio (SINR) values and for different MCSs using periodic transmit-time slot (TS) scheduling in interference-limited WSNs. For a per-link target BER requirement (PLBR) of 10^?3, our results demonstrate that a ’continuous-time’ NL in the range of 0.58?4.99 years is achieved depending on the MCSs, channel configurations, and SPP

Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

A Combined Dual Leader and Relay Node Selection for Markov Cluster Based WSN Routing Protocol

The major challenge in Wireless Sensor Networks (WSNs) is to increase the node’s lifespan and decrease energy utilization. To avoid this issue, many Clustering Routing Protocols (CRPs) have been developed, where Cluster Head (CH) in each cluster accumulates the data from each other node and transfers it to the sink through Relay Nodes (RNs). But both CHs and RNs dissipate more energy to aggregate and transfer data. As a result, it is vital to choose the appropriate CHs and RNs concurrently to reduce energy utilization. Hence, this article proposes a Weighted Markov Clustering with Dual Leader and Relay node Selection based CRP (WMCL-DLRS-CRP) in WSNs. This protocol aims to lessen energy dissipation during inter- and intra-cluster communication. Initially, a Markov Clustering (MCL) algorithm is applied by the sink to create nodes into clusters based on a threshold distance. Then, a dual leader selection scheme is proposed to elect dual CHs in each cluster according to the node weighting factor that considers the node’s remaining energy, the distance between CHs and sink, the distance among all nodes, and abundance. Also, an RN selection scheme is proposed to choose the appropriate RNs based on a new Predicted Transmission Rate (PTR) factor. Moreover, the elected RNs transfer the data from the CHs to the sink, resulting in a tradeoff between the node’s energy utilization and lifetime. At last, extensive simulations illustrate that the WMCL-DLRS-CRP achieves better network performance compared to the existing protocols

Clustering objectives in wireless sensor networks: A survey and research direction analysis

Wireless Sensor Networks (WSNs) typically include thousands of resource-constrained sensors to monitor their surroundings, collect data, and transfer it to remote servers for further processing. Although WSNs are considered highly flexible ad-hoc networks, network management has been a fundamental challenge in these types of net- works given the deployment size and the associated quality concerns such as resource management, scalability, and reliability. Topology management is considered a viable technique to address these concerns. Clustering is the most well-known topology management method in WSNs, grouping nodes to manage them and/or executing various tasks in a distributed manner, such as resource management. Although clustering techniques are mainly known to improve energy consumption, there are various quality-driven objectives that can be realized through clustering. In this paper, we review comprehensively existing WSN clustering techniques, their objectives and the network properties supported by those techniques. After refining more than 500 clustering techniques, we extract about 215 of them as the most important ones, which we further review, catergorize and classify based on clustering objectives and also the network properties such as mobility and heterogeneity. In addition, statistics are provided based on the chosen metrics, providing highly useful insights into the design of clustering techniques in WSNs.publishedVersio

Clustered wireless sensor networks

The study of topology in randomly deployed wireless sensor networks (WSNs) is important in addressing the fundamental issue of stochastic coverage resulting from randomness in the deployment procedure and power management algorithms. This dissertation defines and studies clustered WSNs, WSNs whose topology due to the deployment procedure and the application requirements results in the phenomenon of clustering or clumping of nodes. The first part of this dissertation analyzes a range of topologies of clustered WSNs and their impact on the primary sensing objectives of coverage and connectivity. By exploiting the inherent advantages of clustered topologies of nodes, this dissertation presents techniques for optimizing the primary performance metrics of power consumption and network capacity. It analyzes clustering in the presence of obstacles, and studies varying levels of redundancy to determine the probability of coverage in the network. The proposed models for clustered WSNs embrace the domain of a wide range of topologies that are prevalent in actual real-world deployment scenarios, and call for clustering-specific protocols to enhance network performance. It has been shown that power management algorithms tailored to various clustering scenarios optimize the level of active coverage and maximize the network lifetime. The second part of this dissertation addresses the problem of edge effects and heavy traffic on queuing in clustered WSNs. In particular, an admission control model called directed ignoring model has been developed that aims to minimize the impact of edge effects in queuing by improving queuing metrics such as packet loss and wait time

NCHR: A Nonthreshold-Based Cluster-Head Rotation Scheme for IEEE 802.15.4 Cluster-Tree Networks

[EN] The IEEE 802.15.4 standard specifies two network topologies: 1) star and 2) cluster tree. A cluster-tree network comprises of multiple clusters that allow the network to scale by connecting devices over multiple wireless hops. The role of a cluster head (CH) is to aggregate data from all devices in the cluster and then transmit it to the overall personal area network (PAN) coordinator. This specific role of CH needs to be rotated among multiple coordinators in the cluster to prevent it from energy drain out. Prior works on CH rotation are either based on threshold energy levels or rely on periodic rotation. Both approaches have their respective limitations and, at times, result in unnecessary CH rotations or nonoptimal selection of CH. To address this, we propose a nonthreshold CH rotation scheme (NCHR), which incurs minimal rotation overhead. It supports topological changes, node heterogeneity, and can also handle CH failures. Through simulations and hardware implementation, the performance of the proposed NCHR scheme is analyzed in terms of network lifetime, CH rotation overhead, and the number of CH rotations. It is shown that the proposed scheme boosts network lifetime, incurs less rotation overhead, and needs fewer CH rotations compared to other related schemes.This work was supported in part by the Science and Engineering Research Board, Department of Science and Technology, Government of India through ECR, 2016 under Grant 2016/001651; in part by the "Ministerio de Economia y Competitividad" in the "Programa Estatal de Fomento de la Investigacion Cientifica y Tecnica de Excelencia, Subprograma Estatal de Generacion de Conocimiento" within the Project under Grant TIN2017-84802-C2-1-P; and in part by the European Union through the ERANETMED (Euromediterranean Cooperation through ERANET Joint Activities and Beyond) Project ERANETMED3-227 SMARTWATIR.Choudhury, N.; Matam, R.; Mukherjee, M.; Lloret, J.; Kalaimannan, E. (2021). NCHR: A Nonthreshold-Based Cluster-Head Rotation Scheme for IEEE 802.15.4 Cluster-Tree Networks. IEEE Internet of Things. 8(1):168-178. https://doi.org/10.1109/JIOT.2020.30033201681788