2,031 research outputs found

    Securing Cluster Formation and Cluster Head Elections in Wireless Sensor Networks

    Get PDF
    In wireless sensor networks, clustering plays a very important role for energy savings at each node because it reduces the number of transmissions through TDMA based communication. For secure clustering, it is very crucial to find compromised nodes and remove them during the initial cluster formation process. If some nodes are compromised and survive from the exclusion process of normal nodes, they can make some nodes have a different membership view in the same cluster and consequently separate a cluster into multiple clusters. To resolve these problems, we propose a robust scheme against such attacks in this paper. First, our scheme generates large sized clusters to improve the quality of clusters. Second, our scheme exploits the verification of two hop distant nodes to maintain the quality of the large sized clusters and avoids the separation of the clusters. In addition, our scheme prefers broadcast transmissions to reduce the energy consumption of nodes. We prove that our scheme generates fewer clusters and is more secure and energy-efficient than its rival scheme through security analysis and simulation results. With regard to CH election, we also propose a scheme which securely elects CHs by recognizing the compromised nodes and depriving them of their CH candidacy. To this aim, each node in a cluster calculates reputation values of other CH candidates according to their behavior and distributes them through a broadcast. Then each node extracts substantial reputation values of CH candidates using the distributed reputation values. Next, each node evaluates the substantial reputation values of other CH candidates and excludes some disreputable nodes from CH candidates. The scheme greatly improves non-manipulability and agreement property of CH election results in comparison with other rival schemes. Moreover, the scheme guarantees higher non-manipulability and agreement property than other rival schemes, even in a loss-prone environment

    CENTRALIZED SECURITY PROTOCOL FOR WIRELESS SENSOR NETWORKS

    Get PDF
    Wireless Sensor Networks (WSN) is an exciting new technology with applications in military, industry, and healthcare. These applications manage sensitive information in potentially hostile environments. Security is a necessity, but building a WSN protocol is difficult. Nodes are energy and memory constrained devices intended to last months. Attackers are physically able to compromise nodes and attack the network from within. The solution is Centralized Secure Low Energy Adaptive Clustering Hierarchy (CSLEACH). CSLEACH provides security, energy efficiency, and memory efficiency. CSLEACH takes a centralized approach by leveraging the gateways resources to extend the life of a network as well as provide trust management. Using a custom event based simulator, I am able to show CSLEACH\u27s trust protocol is more energy efficient and requires less memory per node than Trust-based LEACH (TLEACH). In terms of security, CSLEACH is able to protect against a wide range of attacks from spoofed messages to compromised node attacks and it provides confidentiality, authentication, integrity and freshness

    PAWN: a payload-based mutual authentication scheme for wireless sensor networks

    Full text link
    Copyright © 2016 John Wiley & Sons, Ltd. Wireless sensor networks (WSNs) consist of resource-starving miniature sensor nodes deployed in a remote and hostile environment. These networks operate on small batteries for days, months, and even years depending on the requirements of monitored applications. The battery-powered operation and inaccessible human terrains make it practically infeasible to recharge the nodes unless some energy-scavenging techniques are used. These networks experience threats at various layers and, as such, are vulnerable to a wide range of attacks. The resource-constrained nature of sensor nodes, inaccessible human terrains, and error-prone communication links make it obligatory to design lightweight but robust and secured schemes for these networks. In view of these limitations, we aim to design an extremely lightweight payload-based mutual authentication scheme for a cluster-based hierarchical WSN. The proposed scheme, also known as payload-based mutual authentication for WSNs, operates in 2 steps. First, an optimal percentage of cluster heads is elected, authenticated, and allowed to communicate with neighboring nodes. Second, each cluster head, in a role of server, authenticates the nearby nodes for cluster formation. We validate our proposed scheme using various simulation metrics that outperform the existing schemes

    Dynamic cluster head election protocol for mobile wireless sensor networks

    Get PDF
    A dynamic cluster head election protocol (DCHEP) is proposed in this work to improve network availability and energy efficiency for mobile wireless sensor networks (WSNs) under the beacon-enabled IEEE 802.15.4 standard. The proposed protocol (DCHEP) is developed and simulated using CASTALIA/OMNET++ with a realistic radio model and node behaviour. DCHEP improves the network availability and lifetime and maintains clusters hierarchy in a proactive manner even in a mobile WSN where all the nodes including cluster heads (CHs) are mobile, this is done by dynamically switching CHs allowing nodes to act as multiple backup cluster heads (BCHs) with different priorities based on their residual energy and connectivity to other clusters. DCHEP is a flexible and scalable solution targeted for dense WSNs with random mobility. The proposed protocol achieves an average of 33% and 26% improvement to the availability and energy efficiency respectively compared with the original standard
    corecore