Cluster Head Selection Protocol Which
Improved the Lifetime of Wireless Sensor
Network
Er. Manjeet
1, Mrs. Savita Bishnoi
21
Student at R.I.E.M., Rohtak 2
Associate Professor at R.I.E.M., Rohtak
ABSTRACT
In recent years, with the developments of wireless sensor networks technology, how to prolong the lifetime of WSN and reduce energy consumption by the sensor nodes becomes a hot topic. But the most research going on the prolongation of the lifetime of the WSN and declined the energy consumed by the sensors. There are lots of protocols which are generated for routing in WSN but these have some limitations. In this article analyzes the cluster head selection phase of LEACH protocol and presents the improved approach of LEACH i.e. CSLQ (Cluster-head based on link quality) that improves the lifetime of the network. In CSLQ the cluster –head is selected on the basis of link quality so that number of packet loss is decreased as compared to the LEACH-C protocol. We have evaluated both LEACH-C and CSLQ through extensive simulations using NS2 (Network Simulator 2) which shows that CBLQ protocol performs better than the LEACH-C protocol.
Keywords Wireless Sensor Network, CSLQ, LEACH, Energy efficiency, Routing
1. INTRODUCTION
In this chapter the wireless sensor network is introduce how it is work, implement etc. Wireless sensor network is an emerging technology that promises a wide range of potential applications in both civilian and military areas. A wireless sensor network (WSN) typically consists of a large number of low cost, low power, and multifunctional sensor nodes that are deployed in a region of interest. These sensor nodes are small in size but are equipped with sensors, embedded microprocessors, and radio transceivers. Therefore, they have not only sensing, but also data processing and communicating capabilities. In few words a wireless sensor network, is a network that contain many small sensor nodes and communications capabilities to transmit and receive information.
Figure 1.1 Architecture of WSN
2. REVIEW OF LITERATURE
Hang zhou et al (2006) have proposed E-LEACH protocol improves the CH selection procedure as compared to the original LEACH.
C. Guo et al (2007) have proposed the Analysis and Optimization of Energy Efficient Cluster Forming for Wireless Sensor Networks. In this scheme Wireless Sensor Network should operate without protection for the long time before the replacement of battery.
Fan Xiangning et al (2007) have proposed M-LEACH; Each CH directly communicates with BS the distance between CH and BS doesn’t matter. It consumes lot of its energy if the base station is located as so far from the CH. Rong Ding et al (2010) have proposed A Reactive Geographic Routing Protocol for Wireless Sensor Networks. Geographic routing has been studied as an attractive approach due to its scalability and simplicity properties in WSN.
3. PRESENT WORK
In this chapter, the present work and problem formulation are discussed. How the problem is raised in predefined protocols and how it can be resolved.
3.1 Energy efficiency in routing
Study of energy efficiency routing in WSN brings this two broad classification:-
Clustering technique Tree-based technique
But I can focus on clustering techniques in WSN.
3.1.1 Clustering technique
First of all the large network is divided into small manageable units is called clustering. The main focus for implementation of clustering is to improve the scalability of the network; it is an important point for achieving energy efficient routing of data within WSN. Some of the routing protocol based on clustering is LEACH, HEED, DECA etc.
3.2 Objective of the study
The network that is design has following objectives:
The energy to manage the network is reduced. The lifetime of the network is prolonged.
The numbers of nodes which is select as the CH is reduced by adding re-clustering method.
3.3 Assumptions for the proposed scheme
In this section, the assumptions which has been made for the new scheme:
Nodes are dispersed in a 2-dimensional region and cannot be recharged after deployment because their battery can’t be recharge or replaceable.
There is only one base station that could be inside or outside the sensor network.
The Base station contains the information about the location of each node and the location of CH nodes. Nodes are randomly distributed in network and they are motionless after deployment.
All nodes have the equal processing and communication capabilities. Each node is assigned a unique ID.
All member nodes can send data to cluster head node.
All nodes aggregate information about the link packet loss from all the neighbors. Cluster head nodes have the information of location of BS.
Each Sensor node has same initial energy.
In first round, the cluster head is selected on the basis of link quality of the neighbor’s node which has highest
link quality that node is selected as a cluster head.
In case of two links have same link quality then other parameters are seen i.e. node density, node connectivity,
node id, node residual energy etc.
In case of two nodes has same residual energy than the only node id is considered because each node has unique
id, those have lowest unique id it will be select as a cluster head.
3.4 Proposed protocol
Here we can generate a new protocol for wireless sensor network which is improved version of most popular LEACH protocol. We improve the CH selection phase of the LEACH protocol. We find the new algorithm for selecting the cluster head as named CSLQ (Cluster head Selection on Link Quality) so that the energy which is going waste at time of sending the advertisement message by the CH that can be saved and the lifetime of the network is prolonged.
Threshold value = Remaining energy of the CH after first round Initial energy of the CH
That should be greater that 25% of the initial energy if the energy of the CH less than 25 % than the re-clustering is performed and re-selects the CH.
3.5 Data structure used in CSLQ protocol
Some of the data structure which is used in CSLQ protocol for wireless sensor network that are given below:
Node_id: Each node has its unique id which is distributed at the node deployment time. Node initial energy: Each node has it initial energy 5J. All the sensor node have same initial energy
Link Quality: Each node has some link quality to its neighbors on that basis that node can transmit the data at
the destination.
Source_id, N_node, and Data: Data packet which can be send by sensor nodes that consists of source id,
reference coordinates of next node towards the sink, and data.
Node_id, acknowledgment: It consists of node id where the acknowledgment has been sent and
acknowledgment.
Node_id, TDMA_schedule: The CH distributes the TDMA schedule to its member node to tell them when they start transmission. It consists of node_id and it’s TDMA_schedule for start transmission.
Query message: Location sender id, location destination id and coverage area.
3.6 CSLQ Protocol Network Established Phases
Figure 3.1 CSLQ Protocol Phases
4. SIMULATION RESULT AND DISCUSSION
Simulation builds a prototype of a protocol under consideration and helps in the evaluation of its performance through it. It provides the facility to researchers to check functioning of protocol indifferent scenarios.
4.1 Simulation platform
It is extremely difficult to analytically model the interactions between all the nodes. In order to show effectiveness of the proposed protocol, therefore simulation of proposed protocol has been developed using NS2.35 simulator which works on ubuntu.
4.2 Simulation parameters
Table no.4.1 Simulation parameter
Energy assumptions Symbol Value
Threshold Transmission distance in meters d0 100 meters
Electronics Energy Eelec 50nJ/bit
Amplifier Energy factor for free space model Efs 10pJ/bit/m2
Amplifier Energy factor for two ray model Emp .0013pJ/bit/m4
Initial Battery Level of all the nodes Einitial 0.5J
Aggregation Energy EDA 5 nJ/bit/signal
4.3 Graph plotted
4.3.1 Average energy consumption per node
4.3.2 Throughput
Throughput =no. of transmitted packet
no. of delivered packet
4.3.3 Number of nodes alive
Number of nodes alive = Remaining energy after first round Initial energy of the CH
0 2 4 6 8 10
0 25 50 75 100 125
A
v
er
ga
e
en
er
gy
co
n
sum
pt
io
n
No.of nodes
Proposed protocol LEACH-C 0 0.2 0.4 0.6 0.8 120 40 60 80 100
Throughput
No. of nodes
proposed protocol
LEACH-C
0 20 40 60 80 100 1200 200 400 600 800 1000
CONCLUSION AND FUTURE WORK
The WSN technology permits monitoring of the ambient environment at an economical cost much lower than currently possible. The sensor network provides a robust service in hostile environments where human participation is too dangerous
Conclusion
A new protocol has been proposed in this dissertation based on the energy efficiency of WSN which provide the greater lifetime to the network, scalability, energy efficient, less number of loss packets etc. In the proposed model, sensor nodes are deployed to sense information and send it to the CH and then CH sends that information to the BS. Simulation results have been analyzed to evaluate the performance of the proposed protocol on the basis of factor like average energy consumption, network lifetime, and number of message received, and successful data delivery. In evaluation of the proposed protocol has been compared with the LEACH protocol and shows that the proposed protocol performs better than the LEACH protocol.
Future work
The cost of human life is very important that cannot be compensated by anything. Larger tests on the actual model of the proposed architecture are still required before its actual deployment in the real world. There are still several research challenges that need to be addressed before its use in real deployment. The following points are there for future work:
Better localization techniques are needed since existing techniques does not provide enough accuracy in WSNs. The secure transmission required for preventing the data.
In future, the proposed protocol will be implemented on the large area network.
Last but not least, improves the energy saving process during transmission/receiving of data.
REFERENCES
[1]. Arati Manjeshwar and Dharma P. Agrawal.”TEEN: A Routing Protocol for Enhanced Efficiency in Wireless Sensor Networks”, IEEE, 2001.
[2]. Baiping Li, Xiaoqin Zhang,”Research and Improvement of LEACH Protocol for Wireless Sensor Network”, International Conference on Information Engineering. Vol.25, 48-54, (2012).
[3]. Bhawnesh Kumar, Vinit Kumar Sharma,” Distance based Cluster Head Selection Algorithm for Wireless Sensor Network”, International Journal of Computer Applications (0975 – 8887) Volume 57– No.9, November 2012.
[4]. Bore Gowda S B, Puttamadappa C, Mruthyunjaya H S, Babu N V,” Sector based Multi-hop Clustering Protocol for Wireless Sensor Networks”, International Journal of Computer Applications (0975 – 8887),Volume 43– No.13, April 2012.
[5]. C. Guo, R. Hekmat and Przemyslaw, “Analysis and Optimization of Energy Efficient Cluster Forming for Wireless Sensor Networks”, IEEE Publication, 2007.
[6]. C. Wang, J. Liu, J. Kuang, A.S. Malik, H. Xiang, “An Improved LEACH Protocol for Application-Specific Wireless Sensor Network”.
[7]. Caixia Li,Fang Pu,Aiping Gu,Linlang Liu,Qiying Cao,”A Sink-controlled Energy-efficient and Geographical Routing Protocol in Wireless Sensor Networks”,IEEE, 2011.
[8]. Deepali S. Anarase, Prof. N. P. Kulkarni, “EEHRP: Energy Efficient Hybrid Routing Protocol for Wireless Sensor Networks”, International Journal of Engineering Trends and Technology- Volume4Issue3- 2013.
[9]. Dissertation, Hang Zhou, Zhe Jiang and Mo Xiaoyan, “Study and Design on Cluster Routing Protocols of Wireless Sensor Networks”, 2006.
[10]. Fan Xiangning, Song Yulin. "Improvement on LEACH Protocol of Wireless Sensor Network", 2007.