scholarly journals An Extended Growing Self-Organizing Map for Selection of Clusters in Sensor Networks

2005 ◽  
Vol 1 (2) ◽  
pp. 227-243 ◽  
Author(s):  
Siddeswara Mayura Guru ◽  
Arthur Hsu ◽  
Saman Halgamuge ◽  
Saman Fernando

Sensor networks consist of wireless enabled sensor nodes with limited energy. As sensors could be deployed in a large area, data transmitting and receiving are energy consuming operations. One of the methods to save energy is to reduce the communication distance of each node by grouping them in to clusters. Each cluster will have a cluster-head (CH), which will communicate with all the other nodes of that cluster and transmit the data to the remote base station. In this paper, we propose an extension to Growing Self-Organizing Map (GSOM) and describe the use of evolutionary computing technique to cluster wireless sensor nodes and to identify the cluster-heads. We compare the proposed method with clustering solutions based on Genetic Algorithm (GA), an extended version of Particle Swarm Optimisation (PSO) and four general purpose clustering algorithms. This could help to discover the clusters to reduce the communication energy used to transmit data when exact locations of all sensors are known and computational resources are centrally available. This method is useful in the applications where sensors are deployed in a controlled environment and are not moving. We have derived an energy minimisation model that is used as a criterion for clustering. The proposed method can also be used as a design tool to study and analyze the cluster formation for a given node placement.

Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).


Author(s):  
C. R. Bharathi ◽  
Alapati Naresh ◽  
Arepalli Peda Gopi ◽  
Lakshman Narayana Vejendla

In wireless sensor networks (WSN), the majority of the inquiries are issued at the base station. WSN applications frequently require collaboration among countless sensor nodes in a network. One precedent is to persistently screen a region and report occasions. A sensor node in a WSN is initially allocated with an energy level, and based on the tasks of that sensor node, energy will be reduced. In this chapter, two proposed methods for secure network cluster formation and authentication are discussed. When a network is established then all the nodes in it must register with cluster head and then authentication is performed. The selection of cluster head is done using a novel selection algorithm and for authenticating the nodes. Also, a novel algorithm for authentication is used in this chapter. The validation and authorization of nodes are carried over by managing the keys in WSN. The results have been analyzed using NS2 simulator with an aid of list of relevant parameters.


2020 ◽  
Vol 10 (21) ◽  
pp. 7886
Author(s):  
Atefeh Rahiminasab ◽  
Peyman Tirandazi ◽  
M. J. Ebadi ◽  
Ali Ahmadian ◽  
Mehdi Salimi

Wireless sensor networks (WSNs) include several sensor nodes that have limited capabilities. The most critical restriction in WSNs is energy resources. Moreover, since each sensor node’s energy resources cannot be recharged or replaced, it is inevitable to propose various methods for managing the energy resources. Furthermore, this procedure increases the network lifetime. In wireless sensor networks, the cluster head has a significant impact on system global scalability, energy efficiency, and lifetime. Furthermore, the cluster head is most important in combining, aggregating, and transferring data that are received from other cluster nodes. One of the substantial challenges in a cluster-based network is to choose a suitable cluster head. In this paper, to select an appropriate cluster head, we first model this problem by using multi-factor decision-making according to the four factors, including energy, mobility, distance to centre, and the length of data queues. Then, we use the Cluster Splitting Process (CSP) algorithm and the Analytical Hierarchy Process (AHP) method in order to provide a new method to solve this problem. These four factors are examined in our proposed approach, and our method is compared with the Base station Controlled Dynamic Clustering Protocol (BCDCP) algorithm. The simulation results show the proposed method in improving the network lifetime has better performance than the base station controlled dynamic clustering protocol algorithm. In our proposed method, the energy reduction is almost 5% more than the BCDCP method, and the packet loss rate in our proposed method is almost 25% lower than in the BCDCP method.


2007 ◽  
Vol 04 (03) ◽  
pp. 273-280
Author(s):  
BYUNG HEE KIM ◽  
HAE YOUNG LEE ◽  
TAE HO CHO

A secure mechanism is needed to use sensor nodes in real world, since we cannot anticipate attack types. Yu and Guan proposed the dynamic en-route filtering scheme (DEF) to detect and drop false reports as soon as possible in wireless sensor networks. In this scheme, the choice of a threshold value to diffuse keys is important since it represents a trade-off between detection power and overhead. A large threshold value can increase the probability of detecting false reports but it consumes too much energy during the key dissemination phase. Thus, we should choose a threshold value to optimize between the detection power and energy consumption. In this paper we propose a key dissemination limiting method to diffuse keys efficiently. The threshold value in the proposed method is determined by a fuzzy rule-based system by considering the energy level of the network, the number of secret keys in a cluster, and the distance from the base station (BS) to a cluster head. The simulation results show that the proposed method can conserve energy, while it provides sufficient detection power.


Author(s):  
Adarsh Sagar ◽  
T. G. Basavaraju ◽  
K. B. Surekha

In the most of the real world scenarios, wireless sensor networks are used. Some of the major tasks of these types of networks is to sense some information and sending it to monitoring system or tracking some activity etc. In such applications, the sensor nodes are deployed in large area and in considerably large numbers [1]-[3]. Each of these node will be having constrained resources whether it might be energy, memory or processing capability. Energy is the major resource constraint in these types of networks. Hence enough care to be taken in all aspects such that energy can be used very efficiently. Different Activities which will be taking place in a sensor node are sensing, radio operations and receiving and computing. Among all these operations, radio consumes maximum power. Hence there is a need of reducing the power consumption in such radio operations. In the proposed work a software module is developed which will reduce the number of transmissions done to the base station. The work compares the consecutively sensed data and if these data are same then the old data then the old data will be retained. In other case the newly sensed data will be sent to the sink node. This technique reduces the number of data transmissions in a significant way. With the reduced number of transmissions, the energy saved in each node will be more, which will increase the lifetime of the entire network.


21st century is considered as the era of communication, and Wireless Sensor Networks (WSN) have assumed an extremely essential job in the correspondence period. A wireless sensor network is defined as a homogeneous or heterogeneous system contains a large number of sensors, namely called nodes used to monitor different environments in cooperatives. WSN is composed of sensor nodes (S.N.), base stations (B.S.), and cluster head (C.H.). The popularity of wireless sensor networks has been increased day by day exponentially because of its wide scope of utilizations. The applications of wireless sensor networks are air traffic control, healthcare systems, home services, military services, industrial & building automation, network communications, VAN, etc. Thus the wide range of applications attracts attackers. To secure from different types of attacks, mainly intruder, intrusion detection based on dynamic state context and hierarchical trust in WSNs (IDSHT) is proposed. The trust evaluation is carried out in hierarchical way. The trust of sensor nodes is evaluated by cluster head (C.H.), whereas the trust of the cluster head is evaluated by a neighbor cluster head or base station. Hence the content trust, honest trust, and interactive trust are put forward by combining direct evaluation and feedback based evaluation in the fixed hop range. In this way, the complexity of trust management is carried in a hierarchical manner, and trust evaluation overhead is minimized.


Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 403 ◽  
Author(s):  
Goran Popovic ◽  
Goran Djukanovic ◽  
Dimitris Kanellopoulos

Clustering achieves energy efficiency and scalable performance in wireless sensor networks (WSNs). A cluster is formed of several sensor nodes, one of them selected as the cluster head (CH). A CH collects information from the cluster members and sends aggregated data to the base station or another CH. In such a hierarchical WSN, some nodes are possibly moveable or nomadic (relocated periodically), while others are static. The mobility of sensor nodes can improve network performance and prolong network lifetime. This paper presents the idea of mobile, solar-powered CHs that relocate themselves inside clusters in such a way that the total energy consumption in the network is reduced and the network lifetime is extended. The positioning of CHs is made in each round based on a selfish herd hypothesis, where the leader retreats to the center of gravity. Based on this idea, the CH-active algorithm is proposed in this study. Simulation results show that this algorithm has benefits in terms of network lifetime and in the prolongation of the duration of network stability period.


2020 ◽  
Vol 2020 ◽  
pp. 1-19 ◽  
Author(s):  
Kashif Naseer Qureshi ◽  
Muhammad Umair Bashir ◽  
Jaime Lloret ◽  
Antonio Leon

Wireless sensor networks (WSNs) are becoming one of the demanding platforms, where sensor nodes are sensing and monitoring the physical or environmental conditions and transmit the data to the base station via multihop routing. Agriculture sector also adopted these networks to promote innovations for environmental friendly farming methods, lower the management cost, and achieve scientific cultivation. Due to limited capabilities, the sensor nodes have suffered with energy issues and complex routing processes and lead to data transmission failure and delay in the sensor-based agriculture fields. Due to these limitations, the sensor nodes near the base station are always relaying on it and cause extra burden on base station or going into useless state. To address these issues, this study proposes a Gateway Clustering Energy-Efficient Centroid- (GCEEC-) based routing protocol where cluster head is selected from the centroid position and gateway nodes are selected from each cluster. Gateway node reduces the data load from cluster head nodes and forwards the data towards the base station. Simulation has performed to evaluate the proposed protocol with state-of-the-art protocols. The experimental results indicated the better performance of proposed protocol and provide more feasible WSN-based monitoring for temperature, humidity, and illumination in agriculture sector.


Author(s):  
Gaurav Kumar Nigam ◽  
Chetna Dabas

Background & Objective: Wireless sensor networks are made up of huge amount of less powered small sensor nodes that can audit the surroundings, collect meaningful data, and send it base station. Various energy management plans that pursue to lengthen the endurance of overall network has been proposed over the years, but energy conservation remains the major challenge as the sensor nodes have finite battery and low computational capabilities. Cluster based routing is the most fitting system to help for burden adjusting, adaptation to internal failure, and solid correspondence to draw out execution parameters of wireless sensor network. Low energy adaptive clustering hierarchy is an efficient clustering based hierarchical protocol that is used to enhance the lifetime of sensor nodes in wireless sensor network. It has some basic flaws that need to be overwhelmed in order to reduce the energy utilization and inflating the nodes lifetime. Methods : In this paper, an effective auxiliary cluster head selection is used to propose a new enhanced GC-LEACH algorithm in order to minimize the energy utilization and prolonged the lifespan of wireless sensor network. Results & Conclusion: Simulation is performed in NS-2 and the outcomes show that the GC-LEACH outperforms conventional LEACH and its existing versions in the context of frequent cluster head rotation in various rounds, number of data packets collected at base station, as well as reduces the energy consumption 14% - 19% and prolongs the system lifetime 8% - 15%.


2012 ◽  
Vol 433-440 ◽  
pp. 5228-5232
Author(s):  
Mohammad Ahmadi ◽  
Hamid Faraji ◽  
Hossien Zohrevand

A sensor network has many sensor nodes with limited energy. One of the important issues in these networks is the increase of the life time of the network. In this article, a clustering algorithm is introduced for wireless sensor networks that considering the parameters of distance and remaining energy of each node in the process of cluster head selection. The introduced algorithm is able to reduce the amount of consumed energy in the network. In this algorithm, the nodes that have more energy and less distance from the base station more probably will become cluster heads. Also, we use algorithm for finding the shortest path between cluster heads and base station. The results of simulation with the help of Matlab software show that the proposed algorithm increase the life time of the network compared with LEACH algorithm.


Sign in / Sign up

Export Citation Format

Share Document