Improved energy aware cluster based data routing scheme for WSN

Wireless sensor network (WSN) consists of several tiny devices that are dispersed randomly for gathering network field. Clustering mechanism divides the WSN into different sub-regions called clusters. Individual cluster is consisting of cluster head (CH) and member nodes. The main research challenges behind clustering mechanism are to optimize network overheads with efficient data delivery. Sensor nodes are operated by batteries and practically it is not feasible to replace them during sensing the environment so energy should be effectively utilized among sensors for improving overall network performance. This research paper presents an improved energy aware cluster based data routing (i-ECBR) scheme, by dividing the network regions into uniform sized square partitions and localized CH election mechanism. In addition, consistent end-to-end data routing is performed for improving data dissemination. Simulation results illustrate that our proposed scheme outperforms than existing work in terms of different performance metrics

Improved Energy Aware Cluster based Data Routing Scheme for WSN

Wireless sensor network (WSN) consists of several tiny devices that are dispersed randomly for gathering network field. Clustering mechanism divides the WSN into different sub-regions called clusters. Individual cluster is consisting of cluster head (CH) and member nodes. The main research challenges behind clustering mechanism are to optimize network overheads with efficient data delivery. Sensor nodes are operated by batteries and practically it is not feasible to replace them during sensing the environment so energy should be effectively utilized among sensors for improving overall network performance. This research paper presents an improved energy aware cluster based data routing (i-ECBR) scheme, by dividing the network regions into uniform sized square partitions and localized CH election mechanism. In addition, consistent end-to-end data routing is performed for improving data dissemination. Simulation results illustrate that our proposed scheme outperforms than existing work in terms of different performance metrics

MCBT: Multi-Hop Cluster Based Stable Backbone Trees for Data Collection and Dissemination in WSNs

We propose a stable backbone tree construction algorithm using multi-hop clusters for wireless sensor networks (WSNs). The hierarchical cluster structure has advantages in data fusion and aggregation. Energy consumption can be decreased by managing nodes with cluster heads. Backbone nodes, which are responsible for performing and managing multi-hop communication, can reduce the communication overhead such as control traffic and minimize the number of active nodes. Previous backbone construction algorithms, such as Hierarchical Cluster-based Data Dissemination (HCDD) and Multicluster, Mobile, Multimedia radio network (MMM), consume energy quickly. They are designed without regard to appropriate factors such as residual energy and degree (the number of connections or edges to other nodes) of a node for WSNs. Thus, the network is quickly disconnected or has to reconstruct a backbone. We propose a distributed algorithm to create a stable backbone by selecting the nodes with higher energy or degree as the cluster heads. This increases the overall network lifetime. Moreover, the proposed method balances energy consumption by distributing the traffic load among nodes around the cluster head. In the simulation, the proposed scheme outperforms previous clustering schemes in terms of the average and the standard deviation of residual energy or degree of backbone nodes, the average residual energy of backbone nodes after disseminating the sensed data, and the network lifetime

Energy-efficient mobile sink routing scheme for clustered corona-based wireless sensor networks

Wireless Sensor Networks (WSNs) are generally composed of several tiny, inexpensive and self-configured sensor nodes, which are able to communicate with each other via wireless communication devices. The main duty of the nodes is to sense data and transmit to a sink via multi- or single-hop data transmission manners. Since the sensor nodes generally are limited in power resources, they deplete their energy rapidly. In addition, sensor nodes are usually distributed in places, where may be too harsh to be accessible for human. Consequently, exchanging or recharging the power supplies of the sensor nodes is difficult. Therefore, energy efficiency is the most critical issue in design of WSN, which affects the lifetime and performance of the network. Several cluster-based schemes are proposed to enhance the energy efficiency; however, most of them generate sub-optimal clusters without considering both coverage and energy issues simultaneously. Furthermore, several mobility-based schemes are proposed in order to achieve balanced energy consumption through optimizing the sojourn time and sojourn location of Mobile Sinks (MS). Nevertheless, most of them adjust the sojourn time of MS under predictable mobility pattern. Moreover, in most of existing mobility based schemes, time limitation is not considered for optimizing the sojourn location of MS. The aim behind this research is to develop an Energy-efficient Mobile Sink Routing (EMSR) Scheme, which improves the energy efficiency. The EMSR is the incorporation of three schemes: Energyefficient based Unequal-sized Clustering (EUC) mechanism aims to construct the optimal sized clusters, which ensures the energy conservation and coverage preservation. Collaborative Mobile Sink-based Inter-Cluster Routing (CMSICR) mechanism aims to optimize the sojourn time of MS to balance the energy consumption among Cluster Heads (CH). An Energy-efficient Intra-cluster Movement of Mobile Sink (EIM2S) mechanism, which identifies the optimal sojourn locations of the MS within clusters in order to balance the energy consumption among Member Nodes (MN). The EMSR partitions the network field into optimal clusters and employs MSs in order to balance the energy consumption among CHs and MNs. Simulation results show that EMSR achieved improved performance in terms of network lifetime by 51%, total energy consumption by 28% wasted energy by 36% compared to existing schemes. In conclusion, the proposed routing scheme proves to be a viable solution for multi hop cluster based WSN

A Survey and Future Directions on Clustering: From WSNs to IoT and Modern Networking Paradigms

Many Internet of Things (IoT) networks are created as an overlay over traditional ad-hoc networks such as Zigbee. Moreover, IoT networks can resemble ad-hoc networks over networks that support device-to-device (D2D) communication, e.g., D2D-enabled cellular networks and WiFi-Direct. In these ad-hoc types of IoT networks, efficient topology management is a crucial requirement, and in particular in massive scale deployments. Traditionally, clustering has been recognized as a common approach for topology management in ad-hoc networks, e.g., in Wireless Sensor Networks (WSNs). Topology management in WSNs and ad-hoc IoT networks has many design commonalities as both need to transfer data to the destination hop by hop. Thus, WSN clustering techniques can presumably be applied for topology management in ad-hoc IoT networks. This requires a comprehensive study on WSN clustering techniques and investigating their applicability to ad-hoc IoT networks. In this article, we conduct a survey of this field based on the objectives for clustering, such as reducing energy consumption and load balancing, as well as the network properties relevant for efficient clustering in IoT, such as network heterogeneity and mobility. Beyond that, we investigate the advantages and challenges of clustering when IoT is integrated with modern computing and communication technologies such as Blockchain, Fog/Edge computing, and 5G. This survey provides useful insights into research on IoT clustering, allows broader understanding of its design challenges for IoT networks, and sheds light on its future applications in modern technologies integrated with IoT.acceptedVersio

On demand multicast routing in wireless sensor networks

The wireless networking environment presents imposing challenges to the study of broadcasting and multicasting problems. Developing an algorithm to optimize communication amongst a group of spatially distributed sensor nodes in a WSN (Wireless Sensor Network) has been met with a number challenges due to the characterization of the sensor node device. These challenges include, but are not limited to: energy, memory, and throughput constraints. The traditional approach to overcome these challenges have emphasised the development of low power electronics, efficient modulation, coding, antenna design etc., it has been recognised that networking techniques can also have a strong impact on the energy efficiency of such systems. A variety of networking based approaches to energy efficiency are possible. One of the well-known approaches is to apply clustering techniques to effectively establish an ordered connection of sensor nodes whilst improving the overall network lifetime. This paper proposes an improved clustering based multicast approach that allows any cluster head to be a multicast source with an unlimited number of subscribers, to optimize group communication in WSNs whilst ensuring sensor nodes do not deprecate rapidly in energy levels. We review several clustering approaches and examine multicast versus broadcast communication in WSNs

Overlapping layers for prolonging network life time in multi-hop wireless sensor networks

Wireless sensor networks have been proposed as a practical solution for a wide range of applications due to their benefits of low cost, rapid deployment, self-organization capability, and cooperative data-processing. Many applications, such as military surveillance and habitat monitoring, require the deployment of large-scale sensor networks. A highly scalable and fault-tolerant network architecture, the Progressive Multi-hop Rotational Clustered (PMRC) structure has been proposed, which is suitable for constructing large-scale wireless sensor networks. However, similar to other multi-hop structures, the PMRC structure also suffers from the bottleneck problem; This thesis is focused on solving the bottleneck problem existing in the PMRC structure. First, the Overlapping Neighbor Layers (ONL) scheme is proposed to balance the energy consumption among cluster heads at different layers. Further, the Minimum Overlapping Neighbor Layers (MONL) scheme is proposed wherein the overlapped area between neighbor layers is gradually increased through network life time to achieve load balance and energy efficiency in the whole network area. Simulation results show that the MONL scheme significantly prolongs network life time and demonstrates steady performance on sensor networks with uniformly distributed sensor nodes. To further prolong the network life time, traffic-similar sensor nodes distribution combined with the MONL scheme is studied; The proposed overlapped layers schemes are proven to be effective in solving the bottleneck problem and prolonging network life time for PMRC-based networks. They can also be applied for other multi-hop cluster-based sensor networks. The traffic-similar nodes distribution concept can be applied in optimizing sensor network deployment to achieve desired network life time

On demand multicast routing in wireless sensor networks

The wireless networking environment presents imposing challenges to the study of broadcasting and multicasting problems. Developing an algorithm to optimize communication amongst a group of spatially distributed sensor nodes in a WSN (Wireless Sensor Network) has been met with a number challenges due to the characterization of the sensor node device. These challenges include, but are not limited to: energy, memory, and throughput constraints. The traditional approach to overcome these challenges have emphasised the development of low power electronics, efficient modulation, coding, antenna design etc., it has been recognised that networking techniques can also have a strong impact on the energy efficiency of such systems. A variety of networking based approaches to energy efficiency are possible. One of the well-known approaches is to apply clustering techniques to effectively establish an ordered connection of sensor nodes whilst improving the overall network lifetime. This paper proposes an improved clustering based multicast approach that allows any cluster head to be a multicast source with an unlimited number of subscribers, to optimize group communication in WSNs whilst ensuring sensor nodes do not deprecate rapidly in energy levels. We review several clustering approaches and examine multicast versus broadcast communication in WSNs

Dynamic Multi-hop Routing Protocol Based on Fuzzy-Firefly Algorithm for Data Similarity Aware Node Clustering in WSNs

In multi-hop routing, cluster heads close to the base station functionaries as intermediate nodes for father cluster heads to relay the data packet from regular nodes to base station. The cluster heads that act as relays will experience energy depletion quicker that causes hot spot problem. This paper proposes a dynamic multihop routing algorithm named Data Similarity Aware for Dynamic Multi-hop Routing Protocol (DSA-DMRP) to improve the network lifetime, and satisfy the requirement of multi-hop routing protocol for the dynamic node clustering that consider the data similarity of adjacent nodes. The DSA-DMRP uses fuzzy aggregation technique to measure their data similarity degree in order to partition the network into unequal size clusters. In this mechanism, each node can recognize and note its similar neighbor nodes. Next, K-hop Clustering Algorithm (KHOPCA) that is modified by adding a priority factor that considers residual energy and distance to the base station is used to select cluster heads and create the best routes for intra-cluster and inter-cluster transmission. The DSA-DMRP was compared against the KHOPCA to justify the performance. Simulation results show that, the DSA DMRP can improve the network lifetime longer than the KHOPCA and can satisfy the requirement of the dynamic multi-hop routing protocol