The effect of node selfishness on the performance of WSN cluster-based routing algorithms

Gemeda, Ketema Adere; Gianini, G.; Libsie, Mulugeta

doi:10.1109/afrcon.2015.7331864

Cited by 8 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also in WSNs the performance of cluster routing algorithms can be highly affected by selfish nodes, as we demonstrated in a previous study [12]: the network lifetime and packet throughput decrease, the Quality of Service (QoS) deteriorates, and so on. Also in the design of WSN cluster routing protocols Game Theory has been extensively used [7,19,32,33,34].…”

Section: Related Workmentioning

confidence: 97%

“…In that case, sensor nodes can be viewed as selfish players: their primary goal is to maximize the benefits to their agency and save their own resources, such as power, even at the expenses of the other nodes. In such conditions, guaranteeing fair spatial dispersion, rotating CHs, and having balanced cluster formation becomes a challenge [12]. In such settings, a different method for determining CHs is required.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An evolutionary cluster-game approach for Wireless Sensor Networks in non-collaborative settings

Gemeda

Gianini

Libsie

2017

Pervasive and Mobile Computing

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 97%

Section: Introductionmentioning

confidence: 99%

An evolutionary cluster-game approach for Wireless Sensor Networks in non-collaborative settings

Gemeda

Gianini

Libsie

2017

Pervasive and Mobile Computing

View full text Add to dashboard Cite

“…Other works study the problem of clustering and energy efficiency from a game theory perspective [21,22]. Indeed, game theory is routinely used as a framework for the modeling and analysis of performance and security networked systems [23][24][25][26][27][28][29].…”

Section: Related Workmentioning

confidence: 99%

MHSEER: A Meta-Heuristic Secure and Energy-Efficient Routing Protocol for Wireless Sensor Network-Based Industrial IoT

et al. 2023

Self Cite

View full text Add to dashboard Cite

Several industries use wireless sensor networks (WSN) for various tasks such as monitoring, data transmission, and data gathering. They find applications in the industrial internet of things (IIoT). WSNs are utilized to track and monitor changes in the environment. Since they include multiple small sensor nodes (SN), they are severely constrained, so resource management geared toward energy efficiency is crucial in this kind of network. Minimizing the power to interpret, transmit, and store data between various sensors poses important challenges. Experts have considered various ways to address these issues that unavoidably affect the network’s performance: reducing energy usage while maintaining system throughput remains the primary research issue. Another important concern relates to network security. Specifically, intrusion detection and avoidance are major concerns. In this work, we introduce the meta-heuristic-based secure and energy-efficient routing (MHSEER) protocol for WSN-IIoT. The protocol learns the forwarding decisions using the number of hops, connection integrity characteristics, and accumulated remaining energy. To make the method more secure, the protocol also employs counter-encryption mode (CEM) to encrypt the data. A meta-heuristics study designed to achieve reliable learning is used in the suggested protocol. The protocol consists of two stages. The first stage uses a heuristics method to improve the option for dependable data routing. Security based on a computationally simple and random CEM is accomplished in the second stage. The proposed MHSEER protocol has been compared to the secure trust routing protocol for low power (Sectrust-RPL), heuristic-based energy-efficient routing (HBEER), secure and energy-aware heuristic-based routing (SEHR), and secure energy-aware meta-heuristic routing (SEAMHR) in terms of packet drop ratio, throughput, network delay, energy usage, and faulty pathways. The proposed protocol increases throughput to 95.81% and decreases the packet drop ratio, packet delay, energy consumption, and faulty pathways to 5.12%, 0.10 ms, 0.0102 mJ, and 6.51%, respectively.

show abstract

“…In a clustered network, if the misbehaving nodes that invoke a selfishness or a pollution attack are the CH nodes, then the network will be more disordered and the consequences more serious. The CHs have a critical role in forwarding the cluster data to the BS [14]. DoS and pollution attacks are challenging issues that aim to disable the service that a WSN is supposed to provide, and create routing failure.…”

Section: Introductionmentioning

confidence: 99%

A Secure Protocol against Selfish and Pollution Attacker Misbehavior in Clustered WSNs

et al. 2021

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) have been widely used for applications in numerous fields. One of the main challenges is the limited energy resources when designing secure routing in such networks. Hierarchical organization of nodes in the network can make efficient use of their resources. In this case, a subset of nodes, the cluster heads (CHs), is entrusted with transmitting messages from cluster nodes to the base station (BS). However, the existence of selfish or pollution attacker nodes in the network causes data transmission failure and damages the network availability and integrity. Mainly, when critical nodes like CH nodes misbehave by refusing to forward data to the BS, by modifying data in transit or by injecting polluted data, the whole network becomes defective. This paper presents a secure protocol against selfish and pollution attacker misbehavior in clustered WSNs, known as (SSP). It aims to thwart both selfish and pollution attacker misbehaviors, the former being a form of a Denial of Service (DoS) attack. In addition, it maintains a level of confidentiality against eavesdroppers. Based on a random linear network coding (NC) technique, the protocol uses pre-loaded matrices within sensor nodes to conceive a larger number of new packets from a set of initial data packets, thus creating data redundancy. Then, it transmits them through separate paths to the BS. Furthermore, it detects misbehaving nodes among CHs and executes a punishment mechanism using a control counter. The security analysis and simulation results demonstrate that the proposed solution is not only capable of preventing and detecting DoS attacks as well as pollution attacks, but can also maintain scalable and stable routing for large networks. The protocol means 100% of messages are successfully recovered and received at the BS when the percentage of lost packets is around 20%. Moreover, when the number of misbehaving nodes executing pollution attacks reaches a certain threshold, SSP scores a reception rate of correctly reconstructed messages equal to 100%. If the SSP protocol is not applied, the rate of reception of correctly reconstructed messages is reduced by 90% at the same case.

show abstract

The effect of node selfishness on the performance of WSN cluster-based routing algorithms

Cited by 8 publications

References 9 publications

An evolutionary cluster-game approach for Wireless Sensor Networks in non-collaborative settings

An evolutionary cluster-game approach for Wireless Sensor Networks in non-collaborative settings

MHSEER: A Meta-Heuristic Secure and Energy-Efficient Routing Protocol for Wireless Sensor Network-Based Industrial IoT

A Secure Protocol against Selfish and Pollution Attacker Misbehavior in Clustered WSNs

Contact Info

Product

Resources

About