scholarly journals Autonomous, Distributed Parking Lot Vacancy Management Using Intervehicle Communication

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Shohei Yamashita ◽  
Kazumasa Takami
Keyword(s):  
Simulation Model ◽  
Cluster Head ◽  
Tree Structure ◽  
Cluster Heads ◽  
Parking Lot ◽  
Communication Traffic ◽  
Path Topology ◽  
Communication Path ◽  
Cluster Vacancy ◽  
Intervehicle Communication

We have developed a method of managing vacancy information of a large parking lot in a distributed manner using only intervehicle communication. A group of parking spaces is defined as a cluster. Vacancy information of a cluster is managed by a vehicle in it. This vehicle is called a cluster head. The proposed method generates a communication path topology between cluster heads. The topology is a tree structure with the cluster head of the cluster nearest to the parking lot entrance as the root node. Cluster heads are ranked in order of the number of vacant spaces and the distance to the shop entrance. The vehicle entering the parking lot collects vacancy information of clusters. This information is transmitted along the tree structure from the lowest ranking cluster head. We have developed a simulation model for a parking lot that can accommodate nearly 1,000 vehicles and used it to evaluate the proposed method. We have confirmed that the proposed method generates less communication traffic and enables the vehicle entering a parking lot to collect vacancy information about the area near the shop entrance with a higher probability and in a shorter time.

Energy Efficiency Analysis in ERA using NFL-BA Algorithm

2020 ◽  
pp. 340-348
Author(s):  
Palky Mehta ◽  
H. L. Sharma
Keyword(s):  
Cluster Head ◽  
Vital Role ◽  
Wireless Sensor ◽  
Energy Usage ◽  
Cluster Heads ◽  
Comparison Results ◽  
Current Scenario ◽  
Energy Efficiency Analysis ◽  
Selection Of

In the current scenario of Wireless Sensor Network (WSN), power consumption is the major issue associated with nodes in WSN. LEACH technique plays a vital role of clustering in WSN and reduces the energy usage effectively. But LEACH has its own limitation in order to search cluster head nodes which are randomly distributed over the network. In this paper, ERA-NFL- BA algorithm is being proposed for selects the cluster heads in WSN. This algorithm help in selection of cluster heads can freely transform from global search to local search. At the end, a comparison has been done with earlier researcher using protocol ERA-NFL, which clearly shown that proposed Algorithm is best suited and from comparison results that ERA-NFL-BA has given better performance.

scholarly journals An Enhanced Clustering Method for Extending Sensing Lifetime of Wireless Sensor Network

2021 ◽  
pp. 67-82
Author(s):  
Yakubu Abdul-Wahab Nawusu ◽  
Alhassan Abdul-Barik ◽  
Salifu Abdul-Mumin
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Performance ◽  
Rank Order ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Heterogeneous Wireless Sensor Network

Extending the lifetime of a wireless sensor network is vital in ensuring continuous monitoring functions in a target environment. Many techniques have appeared that seek to achieve such prolonged sensing gains. Clustering and improved selection of cluster heads play essential roles in the performance of sensor network functions. Cluster head in a hierarchical arrangement is responsible for transmitting aggregated data from member nodes to a base station for further user-specific data processing and analysis. Minimising the quick dissipation of cluster heads energy requires a careful choice of network factors when selecting a cluster head to prolong the lifetime of a wireless sensor network. In this work, we propose a multi-criteria cluster head selection technique to extend the sensing lifetime of a heterogeneous wireless sensor network. The proposed protocol incorporates residual energy, distance, and node density in selecting a cluster head. Each factor is assigned a weight using the Rank Order Centroid based on its relative importance. Several simulation tests using MATLAB 7.5.0 (R2007b) reveal improved network lifetime and other network performance indicators, including stability and throughput, compared with popular protocols such as LEACH and the SEP. The proposed scheme will be beneficial in applications requiring reliable and stable data sensing and transmission functions.

scholarly journals A Novel Framework to Secure CBWSNS Against the Selfishness Problem

2019 ◽  
Vol 7 (2) ◽  
pp. 7-16
Author(s):  
Poonam Mittal ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Defense Mechanism ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Security Level ◽  
Stochastic Algorithm ◽  
Worst Case ◽  
Cluster Heads

Dynamic and cooperative nature of sensor nodes in Wireless Sensor Networks raises question on security. Various researchers work in this direction to spot malicious, selfish and compromised nodes. Various mechanisms followed are uniqueness of clustering, reputation system and an operation at specific nodes. LEACH is a hierarchical protocol in which most nodes transmit to cluster heads, and the cluster heads aggregate and compress the data and forward it to the base station (sink). Each node uses a stochastic algorithm at each round to determine whether it will become a cluster head in this round. Clustering process carried out in two stages takes the role of the reputation scheme and reveals specific operation at CH, IN and MNs beside their usual activities in cluster based wireless sensor networks. This paper mentioned the final structure of the security framework, corresponding attacks and defense mechanism of the model. It also discusses various security level processes of wireless sensor networks. Results implies that in a cluster-based protocol such as LEACH in which optimally 5% of the nodes are cluster heads it is likely that a significant portion of the network can be paralyzed or the entire network disabled, in the worst-case scenario, if these cluster heads are compromised. Our main contribution in this paper is our novel approach in maintaining trusted clusters through a trust-based decision-making cluster head election algorithm.

scholarly journals Fault Location Measurement of Sensor Nodes based on Fuzzy Control Algorithm

2021 ◽  
Author(s):  
Nuo Yu
Keyword(s):  
Fuzzy Control ◽  
Measurement Method ◽  
Control Algorithm ◽  
Fault Location ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Cluster Member ◽  
Cluster Heads ◽  
Fuzzy Control Algorithm ◽  
Location Measurement

Abstract Aiming at the problems of the traditional fault location measurement method for sensor nodes, such as more energy consumption and longer measurement time, a fault location measurement method for sensor nodes based on fuzzy control algorithm is designed and proposed. First of all, the fuzzy control algorithm is analyzed; then the clustering based on cluster head diagnosis is carried out for the network, that is, the nodes that meet the cluster head conditions and are set as normal cluster heads are selected as cluster heads. Finally, combined with the fuzzy control algorithm, the fault location of each cluster member node is measured directly by cluster head nodes. The simulation results show that the proposed method has good performance.

Secure-Aware Multipath Routing Using Atom Search Rider Optimization Algorithm in Wireless Sensor Networks

2021 ◽  
Vol 12 (2) ◽  
pp. 36-55
Author(s):  
M. B. Shyjith ◽  
C. P. Maheswaran ◽  
V. K. Reshma
Keyword(s):  
Routing Protocol ◽  
Multipath Routing ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Throughput Rate ◽  
Cluster Heads ◽  
Average Residual ◽  
Maximal Average ◽  
Selection Of

WSN is comprised of sensor nodes that sense the data for various applications. The nodes are employed for transmitting sensed data to BS through intermediate nodes or the cluster heads in multi-hop environment. Erroneous selection of CHs may lead to large energy consumption and thereby degrades system performance. Hence, an effective technique was developed by proposing Rider-ASO for secure-aware multipath routing in the WSN. The proposed routing protocol offers security to the network concerning various trust factors. Initially, cluster head selection is done using RCSO. Then, the trust values of the cluster heads that are selected is computed to ensure security while routing. For the multipath routing, proposed Rider-ASO is developed by combining ASO and ROA. Thus, the proposed algorithm finds multiple secured paths from the source into destination based on selected CHs. The developed Rider-ASO outperformed other methods with minimal delay of 0.009 sec, maximal average residual energy 0.5494 J, maximal PDR of 97.82%, maximal throughput rate of 96.07%, respectively.

(SET) Smart Energy Management and Throughput Maximization

2017 ◽  
pp. 1-28 ◽  
Author(s):  
Hassan El Alami ◽  
Abdellah Najid
Keyword(s):  
Energy Management ◽  
Routing Protocols ◽  
Clustering Algorithm ◽  
Cluster Formation ◽  
Clustering Algorithms ◽  
Cluster Head ◽  
Base Station ◽  
Throughput Maximization ◽  
Cluster Heads ◽  
Smart Energy Management

Energy efficiency and throughput are critical factors in the design routing protocols of WSNs. Many routing protocols based on clustering algorithm have been proposed. Current clustering algorithms often use cluster head selection and cluster formation to reduce energy consumption and maximize throughput in WSNs. In this chapter, the authors present a new routing protocol based on smart energy management and throughput maximization for clustered WSNs. The main objective of this protocol is to solve the constraint of closest sensors to the base station which consume relatively more energy in sensed information traffics, and also decrease workload on CHs. This approach divides network field into free area which contains the closest sensors to the base station that communicate directly with, and clustered area which contains the sensors that transmit data to the base station through cluster head. So due to the sensors that communicate directly to the base station, the load on cluster heads is decreased. Thus, the cluster heads consume less energy causing the increase of network lifetime.

An Improved Clustering Algorithm Based on Coverage Area for Wireless Sensor Networks

2012 ◽  
Vol 542-543 ◽  
pp. 643-646
Author(s):  
Li Jun Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Topology Control ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Control Approach ◽  
Cluster Heads ◽  
Network Scalability

Clustering is an effective topology control approach in wireless sensor networks, which can increase network scalability and lifetime. A clustering algorithm based on the total number of neighbor nodes is proposed to maximize the lifetime of the network. The larger amount of neighbor nodes, the more chance a node has to be selected as a cluster head. Therefore, it can ensure the minimum cluster heads in the whole network. By closing the communication parts of cluster head to avoid selecting as cluster head in next epoch, the energy of the whole system is consumed symmetrically. The simulations demonstrate the effectiveness of the algorithm.

Cluster-Gossip Based Distributed Kalman Consensus Filter Algorithm with Energy Efficiency

2014 ◽  
Vol 667 ◽  
pp. 291-299
Author(s):  
Chun Xi Yang ◽  
Chao Sun ◽  
Sha Fan ◽  
Ning Wu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Matrix Theory ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Consensus Process ◽  
Cluster Heads ◽  
New Energy ◽  
Limited Power ◽  
Neighbor Cluster

According to these constrains that wireless sensor networks are composed of many wireless nodes with limited power, a new energy efficient cluster-based distributed consensus kalman filtering algorithm is proposed in this paper. In this algorithm, each cluster contains a cluster-head and some member nodes where the cluster-head is used to fuse data which come from member nodes and consensus process between neighbor cluster-head. This clustering method divide wireless sensor networks into two classes of networks: cluster units network and cluster-heads network. In this way, numbers of information transmission among nodes are reduced efficiently and communication distances among nodes are also shortened. As a result, node’s energy in wireless sensor network can be saved greatly. Moreover, Gossip algorithm is introduced to deal with the consensus problem between cluster-heads for improving power consumption and the convergence analysis for the algorithm which is given by applying to graph theory and matrix theory. Finally, a simulation example is given to show the effectively of our method.

Sign in / Sign up

Export Citation Format

Share Document