Level and Cluster Based Routing for Wireless Sensor Network

2013 ◽  
Vol 321-324 ◽  
pp. 515-522 ◽  
Author(s):  
Kou Lin Yuan ◽  
Lin Qiao ◽  
Lei Han

This paper proposes a level and cluster based routing approach for a wireless sensor network. Nodes in the network are divided into several levels according to their hops to sink node. Every sensor node has a level number. Using level information, a sensor node can send messages to a sink node in a more efficient way, and a sink node can easily locate other sensor nodes. To make network more balanced, the paper introduces a cluster method, which splits nodes in the same level into different clusters, and chooses a cluster head for every cluster, to switch nodes in the cluster to work in turn. Unlike all other cluster routing methods, a cluster head node takes schedule jobs of sensor nodes in the cluster according to their energy left, instead of sensing. The paper also presents several algorithms for constructing a wireless sensor network, querying and scheduling. The simulation experiment shows that the scalability of our method is approximately linear.

2019 ◽  
Vol 16 (9) ◽  
pp. 3925-3931
Author(s):  
Bhupesh Gupta ◽  
Sanjeev Rana

For resource constraint network, one uses wireless sensor network in which limited resources are there for sensor nodes. Basic aim of sensor node is to sense something, monitor it and explain it. The issue arises for sensor node is its battery endurance. The battery endurance of sensor node is consuming in communication instead of sensing. In this regard clustering is using now a day’s which reduces endurance consumption. This paper comes with a new clustering protocol MESAEED (Mutual Exclusive Sleep Awake Energy Efficient Distributed clustering), which helps in saving endurance of sensor nodes so that network lifetime will prolong. It is an extension work of previous work MESADC. In previous work cluster head is chooses on the basis of sleep awake mode in mutual exclusive way under communication range and the results were obtained with the help of comparison graph between HEED and MESADC. The proposed MESAEED protocol provides benefit of A* algorithm of heuristic search, HEED and MESADC. MATLAB 8.3 is use for simulation purpose. The comparison graph between HEED, MESADC and proposed MESAEED were shown. Parameters for comparison include alive nodes versus number of rounds taken and number of nodes dead versus number of rounds taken. The graph shows improvement in performance over HEED and MESADC, which results in enhancing lifetime of WSN.


Robust and efficient algorithms for routing and other process for a wireless sensor network are under active development due to technological advancements on wireless transmission systems. Each of the sensor nodes in a wireless sensor network either transmits or forwards the data packets to the base station. The main objective of the majority of the work in the literature is to save the energy consumption efficiently. The cluster based routing mechanism helps to achieve low energy consumption within the network. The network organizes its nodes as a cluster and selects a particular node as cluster head to manage the transmission within and between clusters. The majority of the clustering approach selects the cluster head using a thresholding based approach. Nodes having energy level higher than the threshold are the candidates for the cluster head selection. In the proposed approach the nodes remaining energy and the sum of distance between individual nodes to the cluster head node is considered. Optimal cluster head selection will help to increase the overall life time of the network. The distance between the sensor nodes is estimated using RSSI (Received Signal Strength Indicator) and other parameters measured from the physical layer. Experiments are conducted with simulation environment created with the NS-2 simulator and efficiency of the approach is analyzed in detail.


Wireless sensor network environment based on limited resources technology. Energy is one of the most significant resources in such systems, so ideal utilization of energy is essential. A high energy efficient with trustable routingprotocol for Wireless_Sensor_Networks covered under this_paper. The protocol is trustworthy as far as data conveyance at the Base_Station. We assumed about portability in sensor nodes and in the base station. The proposed protocol depends on the cluster and hierarchical routing protocols. All clusters comprises of unique cluster-head-node and two-deputy-clusterhead-nodes, and several normal sensor-nodes. The cluster-head panel model introduced to optimize the re-clustering time and energy prerequisites. As consider the protocol trustworthiness, it lays finest exertion to guarantee a predetermined level of performance at the base-station. Contingent upon the network topology, transmit data from cluster head node to base station that done either by direct or indirect i.e. multi-hop way. Also, substitute ways are utilized for data transmission between a cluster head node and the base station. Thorough NS2 simulation-results delineate energy-efficiency, throughput, and delayed-lifetime of sensor-nodes affected by the proposedprotocol.


2013 ◽  
Vol 347-350 ◽  
pp. 1920-1923
Author(s):  
Yu Jia Sun ◽  
Xiao Ming Wang ◽  
Fang Xiu Jia ◽  
Ji Yan Yu

The characteristics and the design factors of wireless sensor network node are talked in this article. According to the design factors of wireless sensor network, this article will mainly point out the design of wireless sensor nodes based a Cortex-M3 Microcontroller STM32F103RE chip. And the wireless communication module is designed with a CC2430 chip. Our wireless sensor node has good performance in our test.


2014 ◽  
Vol 644-650 ◽  
pp. 2366-2369
Author(s):  
Li Zhe Yu ◽  
Tiao Juan Ren ◽  
Zhang Quan Wang ◽  
Ban Teng Liu

Vehicle networking is an important part of intelligent traffic system. It combines wireless sensor network and mobile autonomous network, which is better for drivers to obtain road condition information to ensure driving safety. This paper focuses on the analysis of subtractive clustering and proposed clustering routing algorithm based on subtractive clustering in order to reduce communication of wireless sensor network and redundant flooding and routing expanse. In the algorithm, cluster head selection adopts subtractive clustering to produce cluster node in node intensive place. Cluster forms by adopting current non cluster head node mechanism which reduced energy consumption. Then the maintenance method of cluster is proposed. At last, it introduces routing protocol of cluster which is easier for clustering structure to manage and synchronize network.


Many researches have been proposed for efficiency of data transmission from sensor nodes to sink node for energy efficiency in wireless sensor networks. Among them, cluster-based methods have been preferred In this study, we used the angle formed with the sink node and the distance of the cluster members to calculate the probability of cluster head. Each sensor node sends measurement values to header candidates, and the header candidate node measures the probability value of the header with the value received from its candidate member nodes. To construct the cluster members, the data transfer direction is considered. We consider angle, distance, and direction as cluster header possibility value. Experimental results show that data transmission is proceeding in the direction of going to the sink node. We calculated and displayed the header possibility value of the neighbor nodes of the sensor node and confirmed the candidates of the cluster header for data transfer as the value. In this study, residual energy amount of each sensor node is not considered. In the next study, we calculate the value considering the residual energy amount of the node when measuring the header possibility value of the cluster.


Author(s):  
Monjul Saikia

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.


Author(s):  
Veerabadrappa Veerabadrappa ◽  
Booma Poolan Marikannan

Wireless sensor network (WSN) is a vital form of the underlying technology of the internet of things (IoT); WSN comprises several energy-constrained sensor nodes to monitor various physical parameters. Moreover, due to the energy constraint, load balancing plays a vital role considering the wireless sensor network as battery power. Although several clustering algorithms have been proposed for providing energy efficiency, there are chances of uneven load balancing and this causes the reduction in network lifetime as there exists inequality within the network. These scenarios occur due to the short lifetime of the cluster head. These cluster head (CH) are prime responsible for all the activity as it is also responsible for intra-cluster and inter-cluster communications. In this research work, a mechanism named lifetime centric load balancing mechanism (LCLBM) is developed that focuses on CH-selection, network design, and optimal CH distribution. Furthermore, under LCLBM, assistant cluster head (ACH) for balancing the load is developed. LCLBM is evaluated by considering the important metrics, such as energy consumption, communication overhead, number of failed nodes, and one-way delay. Further, evaluation is carried out by comparing with ES-Leach method, through the comparative analysis it is observed that the proposed model outperforms the existing model.


Sign in / Sign up

Export Citation Format

Share Document