scholarly journals A Data Clustering Algorithm for Detecting Selective Forwarding Attack in Cluster-Based Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 20 (1) ◽  
pp. 23 ◽  
Author(s):  
Hao Fu ◽  
Yinghong Liu ◽  
Zhe Dong ◽  
Yuanming Wu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Clustering ◽  
Detection Rate ◽  
Clustering Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Data Packets ◽  
Selective Forwarding ◽  
Balance Energy

In cluster-based wireless sensor networks, cluster heads (CHs) gather and fuse data packets from sensor nodes; then, they forward fused packets to the sink node (SN). This helps wireless sensor networks balance energy effectively and efficiently to prolong their lifetime. However, cluster-based WSNs are vulnerable to selective forwarding attacks. Compromised CHs would become malicious and launch selective forwarding attacks in which they drop part of or all the packets from other nodes. In this paper, a data clustering algorithm (DCA) for detecting a selective forwarding attack (DCA-SF) is proposed. It can capture and isolate malicious CHs that have launched selective forwarding attacks by clustering their cumulative forwarding rates (CFRs). The DCA-SF algorithm has been strengthened by changing the DCA parameters (Eps, Minpts) adaptively. The simulation results show that the DCA-SF has a low missed detection rate of 1.04% and a false detection rate of 0.42% respectively with low energy consumption.

scholarly journals Improving the Quality of Service and Privacy by Integrating Dijkstra‟s, SafeQ and Extended Watchdog Algorithm in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 5409-5414
Keyword(s):  
Wireless Sensor Networks ◽  
Quality Of Service ◽  
Sensor Networks ◽  
Shortest Path ◽  
Clustering Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Destination Node ◽  
Hop Count

The fundamental issue is framing the sensor nodes and steering the information from sender node to receiver node in wireless sensor networks (WSN). To resolve this major difficulty, clustering algorithm is one of the accessible methods employed in wireless sensor networks. Still, clustering concept also faces some hurdles while transmitting the data from source to destination node. The sensor node is used to sense the data and the source node helps to convey the information and the intended recipient receives the sensed information. The clustering proposal will choose the cluster head depending on the residual energy and the sensor utility to its cluster members. The cluster heads will have equal cluster number of nodes. The complexity is generated in computing the shortest path and this can be optimized by Dijkstra’s algorithm. The optimization is executed by Dijkstra’s shortest path algorithm that eliminates the delay in packet delivery, energy consumption, lifetime of the packet and hop count while handling the difficulties. The shortest path calculation will improve the quality of service (QoS). QoS is the crucial problem due to loss of energy and resource computation as well as the privacy in wireless sensor networks. The security can be improvised in this projected work. The preventive metrics are discussed to upgrade the QoS facility by civilizing the privacy parameter called as Safe and Efficient Query Processing (SAFEQ) and integrating the extended watchdog algorithm in wireless sensor networks.

An Energy-Efficient Multilevel Clustering Algorithm for Heterogeneous Wireless Sensor Networks

2011 ◽  
Vol 3 (3) ◽  
pp. 62-79
Author(s):  
Surender Soni ◽  
Vivek Katiyar ◽  
Narottam Chand
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Large Area ◽  
Topology Management ◽  
Clustering Protocol ◽  
Heterogeneous Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are generally believed to be homogeneous, but some sensor nodes of higher energy can be used to prolong the lifetime and reliability of WSNs. This gives birth to the concept of Heterogeneous Wireless Sensor Networks (HWSNs). Clustering is an important technique to prolong the lifetime of WSNs and to reduce energy consumption as well, by topology management and routing. HWSNs are popular in real deployments (Corchado et al., 2010), and have a large area of coverage. In such scenarios, for better connectivity, the need for multilevel clustering protocols arises. In this paper, the authors propose an energy-efficient protocol called heterogeneous multilevel clustering and aggregation (HMCA) for HWSNs. HMCA is simulated and compared with existing multilevel clustering protocol EEMC (Jin et al., 2008) for homogeneous WSN. Simulation results demonstrate that the proposed protocol performs better.

A Cluster Algorithm for Wireless Sensor Networks Based on Energy Efficiency

2015 ◽  
Vol 785 ◽  
pp. 744-750
Author(s):  
Lei Gao ◽  
Qun Chen
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Selection Criterion ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Head Node

In order to solve the energy limited problem of sensor nodes in the wireless sensor networks (WSN), a fast clustering algorithm based on energy efficiency for wire1ess sensor networks is presented in this paper. In the system initialization phase, the deployment region is divided into several clusters rapidly. The energy consumption ratio and degree of the node are chosen as the selection criterion for the cluster head. Re-election of the cluster head node at this time became a local trigger behavior. Because of the range of the re-election is within the cluster, which greatly reduces the complexity and computational load to re-elect the cluster head node. Theoretical analysis indicates that the timing complexity of the clustering algorithm is O(1), which shows that the algorithm overhead is small and has nothing to do with the network size n. Simulation results show that clustering algorithm based on energy efficiency can provide better load balancing of cluster heads and less protocol overhead. Clustering algorithm based on energy efficiency can reduce energy consumption and prolong the network lifetime compared with LEACH protocol.

scholarly journals Enhancing Clustering in Wireless Sensor Networks with Energy Heterogeneity

2013 ◽  
pp. 259-273
Author(s):  
Femi A. Aderohunmu ◽  
Jeremiah D. Deng ◽  
Martin Purvis
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Research Question ◽  
Energy Levels ◽  
Life Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Complex Functions

While wireless sensor networks (WSN) are increasingly equipped to handle more complex functions, in-network processing still requires the battery-powered sensors to judiciously use their constrained energy so as to prolong the elective network life time. There are a few protocols using sensor clusters to coordinate the energy consumption in a WSN, but how to deal with energy heterogeneity remains a research question. The authors propose a modified clustering algorithm with a three-tier energy setting, where energy consumption among sensor nodes is adaptive to their energy levels. A theoretical analysis shows that the proposed modifications result in an extended network stability period. Simulation has been conducted to evaluate the new clustering algorithm against some existing algorithms under different energy heterogeneity settings, and favourable results are obtained especially when the energy levels are significantly imbalanced.

An Energy-Efficient Layered Clustering Algorithm for Routing in Wireless Sensor Networks

2017 ◽  
Vol 8 (3) ◽  
pp. 43-66 ◽  
Author(s):  
Alphonse PJA ◽  
Sivaraj C ◽  
Janakiraman T N.
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Conservation ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Transmission Rate ◽  
Clustering Algorithms ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Simulation Experiments

Efficient energy management is a key issue in battery equipped wireless sensor networks (WSNs). The cluster based routing in WSNs is a prominent approach for energy conservation of the network which provides a hierarchical data collection mechanism. In order to maximize the energy conservation of sensor nodes, this paper proposes an Energy-efficient Layered Clustering Algorithm (ELCA) for routing in wireless sensor networks. ELCA constructs two layers of clusters to reduce the transmission rate and to balance the energy consumption of sensors. As early energy depletion of clusterheads (CHs) is a major limitation in clustering, this algorithm provides local remedy for energy suffering CHs through efficient CH substitution scheme. The performance of the proposed algorithm is analysed through extensive simulation experiments and verified by compared results with existing clustering algorithms.

scholarly journals End to End Delay and Energy Consumption in a Two Tier Cluster Hierarchical Wireless Sensor Networks

Information ◽  
2019 ◽  
Vol 10 (4) ◽  
pp. 135 ◽  
Author(s):  
Vicente Casares-Giner ◽  
Tatiana Inés Navas ◽  
Dolly Smith Flórez ◽  
Tito R. Vargas H.
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Radial Distance ◽  
Energy Performance ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Data Packets ◽  
Transfer Delay ◽  
End To End

In this work it is considered a circular Wireless Sensor Networks (WSN) in a planar structure with uniform distribution of the sensors and with a two-level hierarchical topology. At the lower level, a cluster configuration is adopted in which the sensed information is transferred from sensor nodes to a cluster head (CH) using a random access protocol (RAP). At CH level, CHs transfer information, hop-by-hop, ring-by-ring, towards to the sink located at the center of the sensed area using TDMA as MAC protocol. A Markovian model to evaluate the end-to-end (E2E) transfer delay is formulated. In addition to other results such as the well know energy hole problem, the model reveals that for a given radial distance between the CH and the sink, the transfer delay depends on the angular orientation between them. For instance, when two rings of CHs are deployed in the WSN area, the E2E delay of data packets generated at ring 2 and at the “west” side of the sink, is 20% higher than the corresponding E2E delay of data packets generated at ring 2 and at the “east” side of the sink. This asymmetry can be alleviated by rotating from time to time the allocation of temporary slots to CHs in the TDMA communication. Also, the energy consumption is evaluated and the numerical results show that for a WSN with a small coverage area, say a radio of 100 m, the energy saving is more significant when a small number of rings are deployed, perhaps none (a single cluster in which the sink acts as a CH). Conversely, topologies with a large number of rings, say 4 or 5, offer a better energy performance when the service WSN covers a large area, say radial distances greater than 400 m.

An Energy-Efficient Multilevel Clustering Algorithm for Heterogeneous Wireless Sensor Networks

2012 ◽  
pp. 286-305
Author(s):  
Surender Soni ◽  
Vivek Katiyar ◽  
Narottam Chand
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Large Area ◽  
Topology Management ◽  
Clustering Protocol ◽  
Heterogeneous Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are generally believed to be homogeneous, but some sensor nodes of higher energy can be used to prolong the lifetime and reliability of WSNs. This gives birth to the concept of Heterogeneous Wireless Sensor Networks (HWSNs). Clustering is an important technique to prolong the lifetime of WSNs and to reduce energy consumption as well, by topology management and routing. HWSNs are popular in real deployments (Corchado et al., 2010), and have a large area of coverage. In such scenarios, for better connectivity, the need for multilevel clustering protocols arises. In this paper, the authors propose an energy-efficient protocol called heterogeneous multilevel clustering and aggregation (HMCA) for HWSNs. HMCA is simulated and compared with existing multilevel clustering protocol EEMC (Jin et al., 2008) for homogeneous WSN. Simulation results demonstrate that the proposed protocol performs better.

scholarly journals Cooperative, reliable, and stability-aware routing for underwater wireless sensor networks

2019 ◽  
Vol 15 (6) ◽  
pp. 155014771985424 ◽  
Author(s):  
Munsif Ali ◽  
Anwar Khan ◽  
Hasan Mahmood ◽  
Naeeem Bhatti
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Depth Sensor ◽  
Data Packets ◽  
Final Destination ◽  
Cooperative Routing ◽  
Channel Effects

In underwater wireless sensor networks, stability and reliability of the network are of paramount importance. Stability of the network ensures persistent operation of the network that, in consequence, avoids data loss when nodes consume all the battery power and subject to death. Particularly, nodes bearing a low pressure of water die early in the usual routing approach due to being preferred choices for data routing. Reliability ensures minimization of the adverse channel effects on data packets so that the desired information is easily extracted from these packets. This article proposes two routing protocols for underwater wireless sensor networks: reliable and stability-aware routing and cooperative reliable and stability-aware routing. In reliable and stability-aware routing, energy assignment to a node is made on the basis of its depth. Sensor nodes having the lowest depth are assigned the highest amount of energy. This energy assignment is called the energy grade of a node and five energy grades are formed in the proposed network from top to bottom. The energy grade along with energy residing in a node battery and its depth decide its selection as a forwarder node. The reliable and stability-aware routing uses only a single link to forward packets. Such a link may not be reliable always. To overcome this issue, the cooperative reliable and stability-aware routing is proposed which introduces cooperative routing to reliable and stability-aware routing. Cooperative routing involves the reception of multiple copies of data symbols by destination. This minimizes the adverse channel effects on data packets and makes the information extraction convenient and less cumbersome at the final destination. Unlike the conventional approach, the proposed schemes do not take into account the coordinates of nodes for defining the routing trajectories, which is challenging in underwater medium. Simulation results reveal a better behavior of the proposed protocols than some competitive schemes in terms of providing stability to the network, packet transfer to the ultimate destination, and latency.

A Clustering Algorithm for Wireless Sensor Networks Basing on Distance and Distribution

2011 ◽  
Vol 474-476 ◽  
pp. 1221-1227
Author(s):  
Ying Liao ◽  
Wei Xu Hao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Topology ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hierarchical Network ◽  
The Common

Wireless sensor networks (WSNs) detect and monitor the outside physical state by the sensor nodes organizing automatically. Utilizing clustering algorithm to form hierarchical network topology is the common method which implements managing network and aggregating data in WSNs. Different from the previous clustering algorithms, this article proposes a clustering algorithm for WSNs based on distance and distribution to generate clusters considering residual energy of nods in WSNs with inhomogeneous distribution. The simulation result indicates that the algorithm can establish more balanceable clustering structure effectively and enhance the network life cycle obviously.<b></b>

Sign in / Sign up

Export Citation Format

Share Document