scholarly journals S-CDCA: a semi-cluster directive-congestion protocol for priority-based data in WSNs

Author(s):  
Marwan Ihsan Shukur

The internet of things (IoT) protocols and regulations are being developed forvarious applications includes: habitat monitoring, machinery control, general health-care, smart-homes and more. A great part of I0T comprised of sensors nodes in connected networks (i.e. sensor networks.). A sensor network is a group of nodes with sensory module and computational elements connected through network interfaces. The most interesting type of sensor networks are wireless sensor networks. The nodes here are connected through wirless interfaces. The shared medium between these nodes, creates different challenges. Congestion in such network is ineavitable. Different models andmethods were proposed to alleviate congestion in wireless sensor networks.This paper presents a semi-cluster directive congestion method that allivatenetwork congestion forpriority-baseddata transmission. The method simprove the network performance by implementing temporary cluster forlow level priority data packets while providing a clear link between highpriority data source node and the network base station. Simulation resultsshow that. The proposed method outperformes ad hocOn-demand distance vector (AODV) reactive procotol approach and priority-based congestion control dynamic clustering (PCCDC) a cluster-based methodin network energy consumption and control packets overhead during network operation.The proposed method also shows comparative improvments in end-to-enddelays versus PCCDC.

Author(s):  
Naveen Chilamkurti ◽  
Sohail Jabbar ◽  
Abid Ali Minhas

Network layer functionalists are of core importance in the communication process and so the routing with energy aware trait is indispensable for improved network performance and increased network lifetime. Designing of protocol at this under discussion layer must consider the aforementioned factors especially for energy aware routing process. In wireless sensor networks there may be hundreds or thousands of sensor nodes communicating with each other and with the base station, which consumes more energy in exchanging data and information with the additive issues of unbalanced load and intolerable faults. Two main types of network architectures for sensed data dissemination from source to destination exist in the literature; Flat network architecture, clustered network architecture. In flat architecture based networks, uniformity can be seen since all the network nodes work in a same mode and generally do not have any distinguished role.


2020 ◽  
pp. 372-399
Author(s):  
Naveen Chilamkurti ◽  
Sohail Jabbar ◽  
Abid Ali Minhas

Network layer functionalists are of core importance in the communication process and so the routing with energy aware trait is indispensable for improved network performance and increased network lifetime. Designing of protocol at this under discussion layer must consider the aforementioned factors especially for energy aware routing process. In wireless sensor networks there may be hundreds or thousands of sensor nodes communicating with each other and with the base station, which consumes more energy in exchanging data and information with the additive issues of unbalanced load and intolerable faults. Two main types of network architectures for sensed data dissemination from source to destination exist in the literature; Flat network architecture, clustered network architecture. In flat architecture based networks, uniformity can be seen since all the network nodes work in a same mode and generally do not have any distinguished role.


Author(s):  
Sirasani Srinivasa Rao ◽  
K. Butchi Raju ◽  
Sunanda Nalajala ◽  
Ramesh Vatambeti

Wireless sensor networks (WSNs) have as of late been created as a stage for various significant observation and control applications. WSNs are continuously utilized in different applications, for example, therapeutic, military, and mechanical segments. Since the WSN is helpless against assaults, refined security administrations are required for verifying the information correspondence between hubs. Because of the asset limitations, the symmetric key foundation is considered as the ideal worldview for verifying the key trade in WSN. The sensor hubs in the WSN course gathered data to the base station. Despite the fact that the specially appointed system is adaptable with the variable foundation, they are exposed to different security dangers. Grouping is a successful way to deal with vitality productivity in the system. In bunching, information accumulation is utilized to diminish the measure of information that streams in the system.


2018 ◽  
Vol 2018 ◽  
pp. 1-15 ◽  
Author(s):  
Qinbao Xu ◽  
Rizwan Akhtar ◽  
Xing Zhang ◽  
Changda Wang

In wireless sensor networks (WSNs), data provenance records the data source and the forwarding and the aggregating information of a packet on its way to the base station (BS). To conserve the energy and wireless communication bandwidth, the provenances are compressed at each node along the packet path. To perform the provenances compression in resource-tightened WSNs, we present a cluster-based arithmetic coding method which not only has a higher compression rate but also can encode and decode the provenance in an incremental manner; i.e., the provenance can be zoomed in and out like Google Maps. Such a decoding method raises the efficiencies of the provenance decoding and the data trust assessment. Furthermore, the relationship between the clustering size and the provenance size is formally analyzed, and then the optimal clustering size is derived as a mathematical function of the WSN’s size. Both the simulation and the test-bed experimental results show that our scheme outperforms the known arithmetic coding based provenance compression schemes with respect to the average provenance size, the energy consumption, and the communication bandwidth consumption.


2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Mohammed Al-Shalabi ◽  
Jafar Ababneh ◽  
Waled Abdulraheem

Wireless Sensor Networks are widely used nowadays to support the decision-makers in different applications by monitoring and collecting the environmental parameters in specific areas. Sensors are deployed in such areas either randomly or formally. In a high-density Wireless Sensor Network, several sensors are randomly deployed in a small area. This will make the adjacent sensors collect same data and send them to the sink, which will increase the power consumption in those sensors. Adjacent sensors are considered critical because of their effect on the network performance. In this paper, the effect of the adjacent sensors is minimized because of the above-mentioned criticality and performance influence of these sensors. The proposed mechanism is evaluated by using MATLAB simulator and is then compared with the low-energy adaptive clustering hierarchy (LEACH) protocol. Results prove that the proposed mechanism outperforms the LEACH protocol by 21% in terms of the network lifetime and by 18% in terms of the number of the transmitted packets to the cluster heads and reduces the number of the transmitted packets to the base station by approximately 3% by avoiding the duplicated packets.


Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 403 ◽  
Author(s):  
Goran Popovic ◽  
Goran Djukanovic ◽  
Dimitris Kanellopoulos

Clustering achieves energy efficiency and scalable performance in wireless sensor networks (WSNs). A cluster is formed of several sensor nodes, one of them selected as the cluster head (CH). A CH collects information from the cluster members and sends aggregated data to the base station or another CH. In such a hierarchical WSN, some nodes are possibly moveable or nomadic (relocated periodically), while others are static. The mobility of sensor nodes can improve network performance and prolong network lifetime. This paper presents the idea of mobile, solar-powered CHs that relocate themselves inside clusters in such a way that the total energy consumption in the network is reduced and the network lifetime is extended. The positioning of CHs is made in each round based on a selfish herd hypothesis, where the leader retreats to the center of gravity. Based on this idea, the CH-active algorithm is proposed in this study. Simulation results show that this algorithm has benefits in terms of network lifetime and in the prolongation of the duration of network stability period.


2020 ◽  
Vol 13 (3) ◽  
pp. 353-361
Author(s):  
Veervrat Singh Chandrawanshi ◽  
Rajiv Kumar Tripathi ◽  
Rahul Pachauri ◽  
Nafis Uddin Khan

Background:Wireless Sensor Networks (WSNs) refer to a group of sensors used for sensing and monitoring the physical data of the environment and organizing the collected data at a central location. These networks enjoy several benefits because of their lower cost, smaller size and smarter sensors. However, a limited source of energy and lifetime of the sensors have emerged as the major setbacks for these networks.Methods:In this work, an energy-aware algorithm has been proposed for the transmission of variable data packets from sensor nodes to the base station according to the balanced energy consumption by all the nodes of a WSN.Results:Obtained simulation results verify that the lifetime of the sensor network is significantly enhanced in comparison to other existing clustering based routing algorithm.Conclusion:The proposed algorithm is comparatively easy to implement and achieves a higher gain in the lifetime of a WSN while keeping the throughput nearly same as LEACH protocol.


Author(s):  
Mahendra Sharma ◽  
Santhosh Kumar Singh

Wireless Sensor Networks (WSNs) assume a crucial part in the field of mechanization and control where detecting of data is the initial step before any automated job could be performed. So as to encourage such perpetual assignments with less vitality utilization proportion, clustering is consolidated everywhere to upgrade the system lifetime. Unequal Cluster-based Routing (UCR) [7] is a standout amongst the most productive answers for draw out the system lifetime and to take care of the hotspot issue that is generally found in equivalent clustering method. In this paper, we propose Tentative Route (TRS) Selection approach for irregular Clustered Wireless Sensor Networks that facilitates in decision an efficient next relay to send the data cumulative by Cluster Heads to the Base Station. Simulation analysis is achieved using the network simulator to demonstrate the effectiveness of the TRS method.


2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Javed Iqbal Bangash ◽  
Abdul Waheed Khan ◽  
Asfandyar Khan ◽  
Atif Khan ◽  
M. Irfan Uddin ◽  
...  

The merger of wireless sensor technologies, pervasive computing, and biomedical engineering has resulted in the emergence of wireless body sensor network (WBSN). WBSNs assist human beings in various monitoring applications such as health-care, entertainment, rehabilitation systems, and sports. Life-critical health-care applications of WBSNs consider both reliability and delay as major Quality of Service (QoS) parameters. In addition to the common limitations and challenges of wireless sensor networks (WSNs), WBSNs pose distinct constraints due to the behavior and chemistry of the human body. The biomedical sensor nodes (BMSNs) adopt multihop communication while reporting the heterogeneous natured physiological parameters to the nearby base station also called local coordinator. Routing in WBSNs becomes a challenging job due to the necessary QoS considerations, overheated in-body BMSNs, and high and dynamic path loss. To the best of our knowledge, none of the existing routing protocols integrate the aforementioned issues in their designs. In this research work, a multiconstraint-aware routing mechanism (modular-based) is proposed which considers the QoS parameters, dynamic and high path loss, and the overheated nodes issue. Two types of network frameworks, with and without relay/forwarder nodes, are being used. The data packets containing physiological parameters of the human body are categorized into delay-constrained, reliability-constrained, critical (both delay- and reliability-constrained), and nonconstrained data packets. NS-2 is being used to carry out the simulations of the proposed mechanism. The simulation results reveal that the proposed mechanism has improved the QoS-aware routing for WBSNs by adopting the proposed multiconstraint-aware strategy.


Author(s):  
Piyush Rawat ◽  
Siddhartha Chauhan

Background and Objective: The functionalities of wireless sensor networks (WSN) are growing in various areas, so to handle the energy consumption of network in an efficient manner is a challenging task. The sensor nodes in the WSN are equipped with limited battery power, so there is a need to utilize the sensor power in an efficient way. The clustering of nodes in the network is one of the ways to handle the limited energy of nodes to enhance the lifetime of the network for its longer working without failure. Methods: The proposed approach is based on forming a cluster of various sensor nodes and then selecting a sensor as cluster head (CH). The heterogeneous sensor nodes are used in the proposed approach in which sensors are provided with different energy levels. The selection of an efficient node as CH can help in enhancing the network lifetime. The threshold function and random function are used for selecting the cluster head among various sensors for selecting the efficient node as CH. Various performance parameters such as network lifespan, packets transferred to the base station (BS) and energy consumption are used to perform the comparison between the proposed technique and previous approaches. Results and Discussion: To validate the working of the proposed technique the simulation is performed in MATLAB simulator. The proposed approach has enhanced the lifetime of the network as compared to the existing approaches. The proposed algorithm is compared with various existing techniques to measure its performance and effectiveness. The sensor nodes are randomly deployed in a 100m*100m area. Conclusion: The simulation results showed that the proposed technique has enhanced the lifespan of the network by utilizing the node’s energy in an efficient manner and reduced the consumption of energy for better network performance.


Sign in / Sign up

Export Citation Format

Share Document