scholarly journals A Hierarchical Matrix Decomposition-Based Signcryption without Key-Recovery in Large-Scale WSN

2018 ◽  
Vol 2018 ◽  
pp. 1-10
Author(s):  
Chi Yuan ◽  
Wenping Chen ◽  
Deying Li
Keyword(s):  
Large Scale ◽  
Cluster Head ◽  
Matrix Decomposition ◽  
Base Station ◽  
Authentication Scheme ◽  
Message Delivery ◽  
Collusion Attack ◽  
Key Recovery ◽  
Identity Based ◽  
Hierarchical Matrix

The sensors in wireless sensor network (WSN) are vulnerable to malicious attacks due to the transmission nature of wireless media. Secure and authenticated message delivery with low energy consumption is one of the major aims in WSN. The identity-based key authentication scheme is more suitable for the WSN. In this paper, the Hierarchical Matrix Decomposition-based Signcryption (HMDS) algorithm was proposed, which is a kind of identity-based authentication scheme. In HMDS scheme, three-layer architecture, base station (BS), cluster head, and intracluster, is employed to adapt to the common structure of WSN. As the key generation center (KGC), the BS adopts matrix decomposition to generate the identification information and public key for cluster head, which not only reduces the cost of calculation and storage but also avoids the collusion attack. Experiments show that the HMDS algorithm has more advantages over other algorithms and is very suitable for the large-scale WSN.

scholarly journals QALPA- An Efficient QoS Aware Hybrid Localization Model Using Particle Swarm Optimization and Ant Colony Optimization for Cognitive Wireless Sensor Networks

2021 ◽  
Vol 14 (1) ◽  
pp. 270-280
Author(s):  
Abhijit Halkai ◽  
◽  
Sujatha Terdal ◽  
Keyword(s):  
Particle Swarm Optimization ◽  
Sensor Networks ◽  
Ant Colony Optimization ◽  
Large Scale ◽  
Cluster Head ◽  
Particle Swarm ◽  
Base Station ◽  
Ant Colony ◽  
Swarm Optimization ◽  
Localization Model

A sensor network operates wirelessly and transmits detected information to the base station. The sensor is a small sized device, it is battery-powered with some electrical components, and the protocols should operate efficiently in such least resource availability. Here, we propose a novel improved framework in large scale applications where the huge numbers of sensors are distributed over an area. The designed protocol will address the issues that arise during its communication and give a consistent seamless communication system. The process of reasoning and learning in cognitive sensors guarantees data delivery in the network. Localization in Scarce and dense sensor networks is achieved by efficient cluster head election and route selection which are indeed based on cognition, improved Particle Swarm Optimization, and improved Ant Colony Optimization algorithms. Factors such as mobility, use of sensor buffer, power management, and defects in channels have been identified and solutions are presented in this research to build an accurate path based on the network context. The achieved results in extensive simulation prove that the proposed scheme outperforms ESNA, NETCRP, and GAECH algorithms in terms of Delay, Network lifetime, Energy consumption.

scholarly journals An Efficient Identity-Based Conditional Privacy-Preserving Authentication Scheme for Secure Communication in a Vehicular Ad Hoc Network

Symmetry ◽  
2020 ◽  
Vol 12 (10) ◽  
pp. 1687 ◽  
Author(s):  
Mahmood A. Al-shareeda ◽  
Mohammed Anbar ◽  
Selvakumar Manickam ◽  
Iznan H. Hasbullah
Keyword(s):  
Secure Communication ◽  
Large Scale ◽  
Ad Hoc ◽  
Privacy Preserving ◽  
Authentication Scheme ◽  
Security And Privacy ◽  
Group Signature ◽  
Side Channel ◽  
Sensitive Information ◽  
Identity Based

The security and privacy issues in vehicular ad hoc networks (VANETs) are often addressed with schemes based on either public key infrastructure, group signature, or identity. However, none of these schemes appropriately address the efficient verification of multiple VANET messages in high-density traffic areas. Attackers could obtain sensitive information kept in a tamper-proof device (TPD) by using a side-channel attack. In this paper, we propose an identity-based conditional privacy-preserving authentication scheme that supports a batch verification process for the simultaneous verification of multiple messages by each node. Furthermore, to thwart side-channel attacks, vehicle information in the TPD is periodically and frequently updated. Finally, since the proposed scheme does not utilize the bilinear pairing operation or the Map-To-Point hash function, its performance outperforms other schemes, making it viable for large-scale VANETs deployment.

scholarly journals REGION BASED CLUSTERING FOR DATA COLLECTION IN WSN

2017 ◽  
Vol 16 (5) ◽  
pp. 6913-6919
Author(s):  
Ramandeep Kaur ◽  
Dinesh Kumar
Keyword(s):  
Energy Efficient ◽  
Large Scale ◽  
Smart Cities ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Cluster Head Selection ◽  
Clustering Methods ◽  
Mobile Nodes ◽  
Improved Performance

The lower cost and easier installation of the WSNs than the wired counterpart pushes industry and academia to pay more attention to this promising technology. Large scale networks of small energy-constrained sensor nodes require techniques and protocols which are scalable, robust, and energy-efficient. The most efficient approach provided by clustering the nodes is hierarchy. The one node will send the data to another node and the another node will send to its neightbouring node. In smart cities, wireless sensor networks (WSNs) act as a type of core infrastructure that collects data from the city to implement smart services. Our thesis work included the region based clustering, cluster head selection and energy efficient communication using static base station and movable mobile nodes. Since it was earlier proposed that clustering improves the network lifetime. We modified the region based clustering by dividing the network area into n regions with cluster head chosen for each region and proposed a new method for cluster head selection having less computational complexity. It was also found that the modified approach has improved performance to that of the other clustering approaches. We have used the mobile nodes for each section with controlled trajectory path as a reference to compare the performance of each of the clustering methods.

scholarly journals Routing Protocol berbasis Cluster Segitiga

2015 ◽  
Vol 4 (2) ◽  
Author(s):  
Nurhayati Nurhayati
Keyword(s):  
Routing Protocol ◽  
Large Scale ◽  
Cluster Head ◽  
Network Routing ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Small Scale ◽  
Long Distance ◽  
Scale Network

Wireless sensor networks users are increasing drastically in communication and technology. They consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. However, the smaller of a device the better it is. The development of device should be user friendly. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. In BCDCP, all sensors send data from CH (Cluster Head) and then to BS (Base Station).  BCDCP works well in small-scale network but in large scale network it is not appropriated since it uses much energy for long distance wireless communication. We propose a routing protocol  -  Triangular Clustering  Routing Protocol  (TCRP)  -  to prolong network life time through the balanced energy consumption.  RPTC selects cluster head of triangular shape. The sensor field is divided into energy level and in every level we choose one node as a gate node. This gate node collects data and sends it to the leader node. Finally the leader node sends the aggregated data to the BS. We show TCRP outperforms BCDCP with several experiments. Key words: Wireless Sensor Network, Routing Protocol, Clustering

Security Authentication Scheme Research for Wireless Sensor Networks

2014 ◽  
Vol 687-691 ◽  
pp. 1802-1805
Author(s):  
Yuan Chen ◽  
Qing Ye
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Cluster Head ◽  
Base Station ◽  
Authentication Scheme ◽  
Wireless Sensor ◽  
Security Authentication ◽  
Head Node ◽  
Authentication Schemes

Existing security authentication schemes are mostly concentrated on the key management and cryptographic algorithms. However, there are few authentication schemes designed according to the application needs. To solve this problem, considering the limited resource of wireless sensor networks and the practical application, a partially distributed authentication scheme is proposed. We use hierarchical network structure. Centralized authentication is used between the base station and cluster head nodes, while cluster head node and ordinary nodes use a distributed authentication. Analysis shows that this method has some advantages in the overhead of the storage, computing and communication, while network security can be guaranteed.

scholarly journals Improved energy efficient hierarchical cluster tree based routing to prolong network lifetime

2021 ◽  
Vol 9 (2) ◽  
pp. 694-706
Author(s):  
Venkatesh Prasad B S , Et. al.
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Large Scale ◽  
Cluster Head ◽  
Hierarchical Cluster ◽  
Base Station ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Cluster Tree

Wireless sensor networks (WSN) play a key role in enabling wireless communication technology among several nodes to remotely communicate and exchange information. WSN consists of tiny sensor nodes equipped with battery, scattered in an area to gather information around an environment and send to data collection node known as sink or base station (BS). WSN have been widely used in various applications like agriculture, fire detection, health care and military and has become imperative necessity for future revolutionary area like UAV (unmanned aerial vehicles), IoT (Internet of things) and smart cities which employs large scale sensor nodes. However sensor nodes are limited to battery, memory, low computational power, resource and bandwidth. Continues sensing of events, makes node to drain its battery faster and goes dead fast. For resource constrained WSN, hierarchical cluster based approaches are considered as energy efficient and improves network performance for large scale WSN. Minimizing energy consumption and extending network lifetime are major challenging issues of WSN, clustering methods with optimized routing have offered solution to optimize energy utilization. To balance energy consumption and improve network lifetime many existing hierarchical clustering approaches have been proposed, however existing method does not consider rotation of cluster head (CH) and considers cluster head selection based on residual energy and distance parameter. In this paper we propose an improved energy efficient cluster tree (IEECT) based routing to improve energy efficiency of hierarchical cluster. IEECT considers modification of existing LEACH (Low energy adaptive clustering hierarchy) protocol to improved energy efficient LEACH by considering energy parameters like residual node energy and average network energy. IEECT accounts optimal number of cluster head (CH) and selection of CH is done using threshold value among sensor nodes. Proposed IEECT combines tree based routing and data aggregation scheme to maintain desirable quality of service. Simulation experiments are carried out by using network simulator. Performance of IEECT is evaluated in terms of PDR, delay, energy consumption, network lifetime and overhead.        

Performance Analysis of RNC Clustering Protocol in Wireless Sensor Network

2019 ◽  
Vol 10 ◽  
Author(s):  
Piyush Rawat ◽  
Siddhartha Chauhan
Keyword(s):  
Energy Consumption ◽  
Network Performance ◽  
Energy Levels ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Threshold Function ◽  
Efficient Manner ◽  
Clustering Protocol

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.

A Split Network based Routing Approach in Wireless Sensor Network to Enhance Network Stability

2019 ◽  
Vol 9 (4) ◽  
pp. 480-487 ◽  
Author(s):  
Hardeep S. Saini ◽  
Dinesh Arora
Keyword(s):  
Energy Consumption ◽  
Sensor Network ◽  
Energy Efficient ◽  
Cluster Head ◽  
Base Station ◽  
Operating Efficiency ◽  
Network Stability ◽  
Major Factors ◽  
Ch Selection

Background & Objective: The operating efficiency of a sensor network totally relies upon the energy that is consumed by the nodes to perform various tasks like data transmission etc. Thus, it becomes mandatory to consume the energy in an intelligent way so that the network can run for a long period. This paper proposed an energy efficient Cluster Head (CH) selection mechanism by considering the distance to Base Station (BS), distance to node and energy as major factors. The concept of volunteer node is also introduced with an objective to reduce the energy consumption of the CH to transmit data from source to BS. The role of the volunteer node is to transmit the data successfully from source to destination or BS. Conclusion: The results are observed with respect to the Alive nodes, dead nodes and energy consumption of the network. The outcome of the proposed work proves that it outperforms the traditional mechanisms.

scholarly journals E-FUCA: enhancement in fuzzy unequal clustering and routing for sustainable wireless sensor network

2021 ◽  
Author(s):  
Pawan Singh Mehra
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Cluster Head ◽  
Average Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Energy Hole ◽  
Intelligent Decision ◽  
Improved Performance

AbstractWith huge cheap micro-sensing devices deployed, wireless sensor network (WSN) gathers information from the region and delivers it to the base station (BS) for further decision. The hotspot problem occurs when cluster head (CH) nearer to BS may die prematurely due to uneven energy depletion resulting in partitioning the network. To overcome the issue of hotspot or energy hole, unequal clustering is used where variable size clusters are formed. Motivated from the aforesaid discussion, we propose an enhanced fuzzy unequal clustering and routing protocol (E-FUCA) where vital parameters are considered during CH candidate selection, and intelligent decision using fuzzy logic (FL) is taken by non-CH nodes during the selection of their CH for the formation of clusters. To further extend the lifetime, we have used FL for the next-hop choice for efficient routing. We have conducted the simulation experiments for four scenarios and compared the propound protocol’s performance with recent similar protocols. The experimental results validate the improved performance of E-FUCA with its comparative in respect of better lifetime, protracted stability period, and enhanced average energy.

Sign in / Sign up

Export Citation Format

Share Document