A Kind of Security Certification Schema of Hierarchical Distributed Sensor Network Based on Certificate Reconstruction

2011 ◽  
Vol 474-476 ◽  
pp. 522-526
Author(s):  
Hai Feng Chang
Keyword(s):  
Sensor Network ◽  
Network Architecture ◽  
Sensor Node ◽  
Base Station ◽  
Sensor Nodes ◽  
Application Layer ◽  
Distributed Sensor ◽  
Source Authentication ◽  
Distributed Sensor Network ◽  
Data Source

The characteristics of Wireless Sensor Network (WSN) determine that traditional security certification mechanism can not meet its security needs. Based on introduction of a distributed hierarchical WSN model, the paper divided WSN network architecture into application layer, base station layer and sensor node layer according to difference of computation speed, power energy, communication capability and storage space of sensor nodes. A kind of security certification schema of hierarchical distributed sensor network based on certificate reconstruction was presented. In the schema, application layer and base station layer used common digital certification of PKI model to construct trust relationship. The sensor node achieved identification authentication and data source authentication through certification reconstruction.

scholarly journals A Novel Secret Location Sharing Scheme for Wireless Sensor Network

2021 ◽  
Vol 19 (3) ◽  
Author(s):  
Monjul Saikia
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Sensor Node ◽  
Implementation Process ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Target Area ◽  
Location Sharing ◽  
Sharing Scheme

The wireless sensor network is a collection of sensor nodes that operate collectively to gather sensitive data from a target area. In the process of data collection the location of sensor nodes from where data is originated matters for taking any decision at the base station. Location i.e. the coordinates of a sensor node need to be shared among other nodes in many circumstances such as in key distribution phase, during routing of packets and many more. Secrecy of the location of every sensor node is important in any such cases. Therefore, there must be a location sharing scheme that facilitates the sharing of location among sensor nodes securely. In this paper, we have proposed a novel secure and robust mechanism for location sharing scheme using 2-threshold secret sharing scheme. The implementation process of the proposed model is shown here along with results and analysis.

scholarly journals Comparison of Residual Energy-Based Clustering Algorithms for Wireless Sensor Network

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Asis Kumar Tripathy ◽  
Suchismita Chinara
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Architecture ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Awareness

Wireless sensor network swears an exceptional fine-grained interface between the virtual and physical worlds. The clustering algorithm is a kind of key technique used to reduce energy consumption. Many clustering, power management, and data dissemination protocols have been specifically designed for wireless sensor network (WSN) where energy awareness is an essential design issue. Each clustering algorithm is composed of three phases cluster head (CH) selection, the setup phase, and steady state phase. The hot point in these algorithms is the cluster head selection. The focus, however, has been given to the residual energy-based clustering protocols which might differ depending on the application and network architecture. In this paper, a survey of the state-of-the-art clustering techniques in WSNs has been compared to find the merits and demerits among themselves. It has been assumed that the sensor nodes are randomly distributed and are not mobile, the coordinates of the base station (BS) and the dimensions of the sensor field are known.

Distributed Parameter Estimation Using Incremental and Diffusion Differential Evolution

2017 ◽  
pp. 58-79
Author(s):  
Usha Manasi Mohapatra ◽  
Babita Majhi
Keyword(s):  
Parameter Estimation ◽  
Differential Evolution ◽  
Sensor Network ◽  
Population Based ◽  
Fir Filter ◽  
Sensor Nodes ◽  
Distributed Sensor ◽  
Distributed Sensor Network ◽  
Evolutionary Technique ◽  
And Diffusion

Recently the distributed sensor network has achieved more attention than its centralized counterpart. There are a number of literature that used different evolutionary computing techniques in a distributed way for the task of optimization in several problems of wireless sensor network. Particularly, parameter estimation of FIR filter is carried out using numerous sensor nodes through distributed particle swarm optimization. Differential Evolution (DE) is an evolutionary technique and has been applied in various fields due to its simplicity and faster convergence property in comparison to other algorithms. In this chapter differential evolution is used in two different approaches, namely Incremental DE (IDE) and Diffusion DE (DDE) to estimate the parameters of FIR filter in a distributed manner. The performance is compared with other population based algorithms.

scholarly journals LOCATION AWARE CLUSTER BASED ROUTING IN WIRELESS SENSOR NETWORKS

2015 ◽  
pp. 36-41
Author(s):  
S. JERUSHA ◽  
K. KULOTHUNGAN ◽  
A Kannan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Network ◽  
Network Lifetime ◽  
Minimum Distance ◽  
Sensor Node ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor

Wireless sensor nodes are usually embedded in the physical environment and report sensed data to a central base station. Clustering is one of the most challenging issues in wireless sensor networks. This paper proposes a new cluster scheme for wireless sensor network by modified the K means clustering algorithm. Sensor nodes are deployed in a harsh environment and randomly scattered in the region of interest and are deployed in a flat architecture. The transmission of packet will reduce the network lifetime. Thus, clustering scheme is required to avoid network traffic and increase overall network lifetime. In order to cluster the sensor nodes that are deployed in the sensor network, the location information of each sensor node should be known. By knowing the location of the each sensor node in the wireless sensor network, clustering is formed based on the highest residual energy and minimum distance from the base station. Among the group of nodes, one node is elected as a cluster head using centroid method. The minimum distance between the cluster node’s and the centroid point is elected as a cluster head. Clustering of nodes can minimize the residual energy and maximize the network performance. This improves the overall network lifetime and reduces network traffic.

scholarly journals RANCANG BANGUN WIRELESS SENSOR NETWORK PERINGATAN DINI LONGSOR BERBASIS MIKROKONTROLER

Electrician ◽  
2019 ◽  
Vol 13 (3) ◽  
pp. 70-75
Author(s):  
Denny Nugroho ◽  
Rudi Uswarman
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Sensor Node ◽  
Warning System ◽  
Base Station ◽  
Vibration Sensor ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Landslide Early Warning ◽  
Soil Movements

Intisari — Bencana alam seperti gerakan tanah atau longsor dapat terjadi pada berbagai skala dan kecepatan. Untuk meminimalkan kerugian akibat bencana tersebut maka dilakukan usaha mengenal tanda-tanda yang mengawali gerakan tanah, atau disebut sebagai mitigasi. Penelitian ini dilakukan untuk merancang wireless sensor network yang mampu mengidentifikasi bencana longsor. Node sensor terdiri dari: sensor getaran, sensor kemiringan lahan, sensor pergeseran lahan, kontroler, dan modul transmisi data. Node-node sensor ini ditanam pada daerah yang rawan longsor dan saling berkomunikasi antara node satu dengan lainnya. Data-data berupa getaran, kemiringan lahan, dan status selalu ditransmisikan ke base station sistem peringatan dini longsor secara realtime. Ketika bencana longsor akan segera terjadi node sensor diharapkan mampu mendeteksi dan mengaktifkan alarm yang ada pada node sensor serta mengirimkan tanda bahaya ke base station. Kata Kunci — longsor, wireless sensor network, node sensor, mikrokontroler   Abstrak — Natural disasters such as land movements or landslides can occur at various scales and speeds. To minimize damages due to the disaster, an effort is made to recognize the signs that initiate soil movements or referred to as mitigation. This research was conducted to design a wireless sensor network that can identify landslides. Sensor nodes consist of vibration sensor, slope sensor, land shift sensor, controller, and data transmission module. These sensor nodes are planted in areas inclined to landslides and communicate with each other between nodes. The data vibration, the slope of the land, and status are always transmitted to the base station of the landslide early warning system in real time. When an landslide will occur soon the sensor node is expected to be able to detect and activate the alarm on the sensor node and send an signal to the base station. Keyword — landslides, wireless sensor networks, sensor nodes, microcontrollers

A Decentralized Approach to Sound Source Localization With Sensor Networks

2004 ◽  
Author(s):  
Isaac Amundson ◽  
Peter L. Schmidt ◽  
Kenneth D. Frampton
Keyword(s):  
Sensor Network ◽  
Source Localization ◽  
Sound Source ◽  
Sensor Nodes ◽  
Sound Source Localization ◽  
Network Congestion ◽  
Arrival Times ◽  
Distributed Sensor ◽  
Distributed Sensor Network ◽  
System Nodes

A sound source localization system has been developed based on a fully decentralized sensor network. Decentralization permits all nodes in a network to handle their own processing and decision-making, and as a result, reduce network congestion and the need for a centralized processor. The system consists of an array of battery operated COTS Ethernet-ready embedded systems with an attached microphone circuit. The localization solution requires groups of at least four nodes to be active within the array to return an acceptable two-dimensional result. Sensor nodes, positioned randomly over a 10 square meter area, recorded detection times of impulsive sources with microsecond resolution. In order to achieve a scalable system, nodes were organized in groups of from 4 to 10 nodes. Grouping was determined by the selecting the nodes farthest apart from each other. A designated leader of each group analyzed the sound source arrival times and calculated the sound source location based on time-differences of arrival. Experimental results show that this approach to sound source localization can achieve accuracies of about 30 centimeters. Perhaps more importantly though, it is accomplished in a decentralized manner, which can lead to a more flexible, scalable distributed sensor network.

scholarly journals Confidentiality Protecting Hierarchical Concealed Data Aggregation for Wireless Sensor Network using Privacy Homomorphism

2019 ◽  
Vol 8 (2) ◽  
pp. 3366-3371
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Data Aggregation ◽  
Sensor Node ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sense Data ◽  
Save Energy ◽  
Concealed Data Aggregation

A Wireless Sensor Network is a set of sensor nodes that are integrated with a physical environment. This tiny sensor node capable of sensing physical phenomena and it can process the sense data. Sensor nodes radio range is short so they transfer data in a multihop manner to form network which will send network activities to base station. Data transmission consumes much more energy than computation. So to overcome this problem data aggregation technique can be useful. This approach reduces energy consumption by avoiding repeated data. Security in wireless sensor network is also one of the important issues. Some properties of a WSN make it more harmed by certain types of attackers, compared to traditional wired network. Furthermore, constrained devices create their own problems for wireless sensor network. As sensor node is powered by batteries and node required lot of energy to perform some complex computation. So it is important to prevent every node in computation process which will save energy to gain longer network life. The focus of this work is provides confidentiality protecting hierarchical concealed data aggregation for WSN using privacy homomorphism. End to End Homomorphic Paillier cryptoscheme is used to achieve proposed approach.

ROUTING PATH OPTIMIZAION TO MAXIMIZE THE LIFETIME OF WIRELESS SENSOR NETWORK

2009 ◽  
Vol 16 (06) ◽  
pp. 509-520
Author(s):  
P. MANJUNATHA ◽  
A. K. VERMA ◽  
A. SRIVIDYA
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Sensor Node ◽  
Minimum Energy ◽  
Life Time ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing

Wireless sensor network (WSN) consists of a large number of sensor nodes which are able to sense their environment and communicate with each other using wireless interface. However these sensor nodes are constrained in energy capacity. The lifetimes of sensor node and sensor network mainly depends upon these energy resources. To increase the life time of sensor network, many approaches have been proposed to optimize the energy usage. All these proposed protocols mainly use minimum hop or minimum energy path. Continuously using the shortest path will deplete energy of the nodes at a much faster rate and causes network partition. This paper proposes an energy efficient routing protocol to extend the network lifetime for delay constrained network. Each sensor node selects the optimized path for forwarding packets to the base station based on routing metrics. Proposed studies and simulation results shows that the protocol put forward in the paper can achieve higher network lifetime by striking a balance between the delay and power consumption in comparison to other routing protocols.

Sign in / Sign up

Export Citation Format

Share Document