Wireless sensor networking is most popular fields in todayâ€™s world. In this paper, we have discussed the different energy optimization protocols of WSN. We have forwarded a new protocol â€œDouble Stage Chain Routing Protocolâ€ from WSN. Our main focus is on extending the residual energy and networkâ€™s life time at least more than LEACH, CCM and TSCP. The result of our protocol is represented with the help of graph with comparison with TSCP and it is found that DSCRP gives better network lifetime than LEACH. The proposed algorithm is acceptable in the network lifetime of DSCRP as well as in network life time

Barman, Utpal

Bhowmick, Pranoy

Sarmah, Animesh

Sharma, Uzzal

English

Assam Don Bosco University Journals

 ADBU-Journal of Engineering Technology   Barman, AJET, ISSN:2348-7305, Volume 8, Issue 1, June, 2019, 008010606 (6PP) 1  Double Stage chain routing Protocal in WSN  Utpal Barman1*, Uzzal Sharma2, Animesh Sarmah3, Pranoy Bhowmick4  1Department of Computer Science and Engineering, GIMT, Guwahati utpalbelsor@gmail.com  2Department of Computer Application, SoT, ADBU, Azara, Guwahati uzzalsharma@dbuniversitL.ac.in 3Department of Computer Science and Engineering, GIMT, Guwahati sarmahanimesh@gmail.com 4(Article history: Received: 23th March 2019 and accepted 20th May 2019)Department of Computer Science and Engineering, GIMT, Guwahati pranoL.bhowmick12@gmail.com Abstract: Wireless sensor networking is most popular fields in today’s world. In this paper, we have discussed the different energy optimization protocols of WSN. We have forwarded a new protocol “Double Stage Chain Routing Protocol” from WSN. Our main focus is on extending the residual energy and network’s life time at least more than LEACH, CCM and TSCP. The result of our protocol is represented with the help of graph with comparison with TSCP and it is found that DSCRP gives better network lifetime than LEACH. The proposed algorithm is acceptable in the network lifetime of DSCRP as well as in network life time.  Keywords: WSN, SCRP, LEACH, PEGASIS, DSCRP  I. INTRODUCTION Wireless sensor network consist of different sensors. These sensors are temperature sensor, humidity sensor, pressure sensor etc. Temperature sensor is used to sense the temperature of the environment and humidity sensor is used to sense the humidity of the environment. The sensors communicate to each other through the wireless medium in a distributed environment. But energy source is the main challenging task of the of the sensor node. A sensor node consumes energy for media listening, data transmission and data receiving. An inefficient routing protocol always decreases the network lifetime of the wireless sensor network. So it is important to design an efficient protocol for WSN. The sensors which are small, lightweight and portable are specially designed for` collecting a group of information at diverse location. For example the weather sensors have the ability to sense the factors like temperature, humidity, atmospheric pressure, and wind speed, direction etc. The soil sensors can sense the soil parameters such as temperature, moisture, conductivity, salinity, soil PH values etc. Similarly a plant sensor can sense temperature, moisture, carbon di-oxide, hydrogen, photosynthesis etc. The major issues relating to WSNs are the energy efficiency. The sensors usually depend on batteries for power. While the data travels over the network, every node consumes some amount of energy in gathering data, fusing the gathered information with the own information, and forward the fused information to the next immediate node in WSN. Thus, the network lifetime of WSN depends on the energy consumption of the sensor nodes in the transmission. Various algorithms have been designed in this respect, whose aim is to provide more and more efficiently with respect to energy that increases the lifetime of a network. The protocols proposed for WSNs are classified into various classes. In this paper, review of different protocols are presented and proposed a new routing protocol for WSN. We also give the overview of the protocol proposed by us which is “Double Stage Chain Routing Protocol” [6]. Our main focus is on extending residual energy and the network’s life time at least more than LEACH, CCM and TSCP. The result of our work is a new protocol, namely Double Stage Chain Routing Protocol (DSCRP) in WSN, which we could term as advancement of TSCP [9]. II. RELATED WORK A. Low Energy Adaptive Cluster Hierarchy (LEACH) It is a hierarchical WSN routing protocol which is self organized and self adaptive. In order to save energy, clusters are formed and cluster head is selected where the data of all the other nodes are aggregated. The cluster head transmitted the aggregated data to the sink. The cluster heads are changed randomly in the network to balance the residual energy [1, 6, 10]. B. Power Energy Gathering in Sensor Information System (PEGASIS) PEGASIS is a powerful routing protocol in WSN which is based on chain routing protocal.  Each node in the sensor sends the information to its immediate neighbor sensor node and also receives the information from the neighbor node. The chain head of the node is selected randomly and it’s sends the information to the base station [2,4].  ADBU-Journal of Engineering TechnologL   Barman, AJET, ISSN:2348-7305, Volume 8, Issue 1, June, 2019, 008010606 (6PP) 2  C. Chain Cluster Based Mixed Routing Protocol (CCM) Chain Cluster Based Mixed Routing Protocol is more powerful than PEGASIS and LEACH. It combines all the basic properties of PEGASIS and CCM. It means that it a chain based cluster routing protocol where low energy consumption, and short transmission delay is maintained [5]. D.  Two Stage Chain Routing Protocol (4) In this protocol, the nodes are taken in a grid form and consider each row as a chain. This protocol is divided in two steps. In first step, all the chain nodes send their data to their nearest neighbors and finally to the chain head. In second step, the chain heads forms a vertical chain and select a main head randomly. All the nodes in the vertical chain send their data to the chain head and send the aggregated data to the BS. In first step, the chain head is selected in a sequential manner and all the head nodes are in the same column. The sensor node used greedy algorithm to send the information to the chain head [3, 4]. E. Single stage chain routing protocol (SCRP) In this protocol the network is divided into different numbers of chains with a fixed number of nodes. At first, a chain head is selected from one end of the chain and then chain heads are selected sequentially within the chain in different rounds. Data is transmitted from one node to neighboring node and gets fused. When the fused data reaches the chain head, it is sent to base station [7].  III. METHODOLOGY In DSCRP, data fusion is performed at each step. Each row of nodes form a chain where the nodes transmit data to the nearest neighboring node only when the absolute difference between the data sensed by the node in the current round and the previous round exceeds the threshold value. The data of the two nodes then gets fused and is transmitted again to the next nearest neighboring node. This process continues until the data reaches the chain head which is chosen using the chain head selection method of CCM. The nodes in a chain become chain head in turns. The chain heads of all the chains collectively form a cluster. The data is transmitted from one node to another until it reaches the cluster head. The cluster head in the cluster of chain heads is the one with the maximum residual energy and minimum distance from the base station. Once all the data reaches the cluster head, it is sent to the base station. The algorithm is given below. A.  Algorithm for DSCRP (horizontal chains) The algorithm is explained below for horizontal chains:  Let the S(a,b) chose as assigned chain head for mthB. Algorithm for DSCRP (Vertical chains)  round // for horizontal chains STEP 1: S(a,b) will generate two parameter and send them to S(a,1) and S(a,b) STEP 2: Let the index for the nodes with the token be K=1 and L=n  STEP 3: The node takes the input from the sensors and stores it in variable cur  STEP 4: // horizontal chains             If (K<b) { If (  abs(cur1-prev1)>th  )  //cur1 = data sensed by the node in this round //prev 1= data sensed by the node during previous transmission //th = pre-determined threshold value which is used   To determine if there is sufficient change in sensed data { Fuse data received from S (a, K-1) where K>1;  S (a,K) will transmit the fused data along with its parameter to the neighbor nodes S(a,K+1);  K=K+1; } Else  { It will send the token and data excluding its own data to its neighboring nodes S (i, K+1) K=K+1; } } If(L>b) { If (abs (cur2-prev2)>th)  To determine if there is sufficient change in sensed data { Fuse data received from S (i, L+1) where L<n; S (i,L) will transmit the fused data along with its parameter to its neighbor nodes S(a,L-1);  L=L-1;  } Else { It will send the token and data excluding its own data to its neighbor nodes S(a,L-1) L=L-1; } } STEP 6: repeat step 5 until both K and L is equal to j //for vertical chain STEP 1:  A cluster head S(v,j) is selected among the chain heads for the jth round STEP 2: S (v,j) will generate two tokens and send them to S(1,j) and S(n1,j) STEP 3: let the index for the nodes with the token for S be K=1 and L=n1; STEP 4: if(K<v) { Fuse data received from S(K-1,j) where K>1 S(K,j) will transmit the fused data along with its parameter to its neighbor node S(K+1,j) K=K+1; }  ADBU-Journal of Engineering TechnologL   Barman, AJET, ISSN:2348-7305, Volume 8, Issue 1, June, 2019, 008010606 (6PP) 3  if(L>v) { Fuse data received from S(L+1,j) where L<n S(L,j) will transmit the fused data along with its token to its neighboring node S(L-1,j) L=L-1; }     STEP 5: repeat step 4 until both K and L is equal to v STEP 6: The cluster head sends the collected data to the Base Station C. Working Principle and Model of DSCRP Our protocol works in two stages. In the first stage a horizontal chain is formed and a chain head is selected sequentially. All the chain heads send token to both the ends of the chain and all the other nodes when receive the token sends their sensed data only if their values crosses a threshold value, which is given manually as per conditions. In this manner the data from the nodes are fused and reach the chain head. The chain head then forms a cluster and a cluster head is selected based on minimum distance from the base station (BS) and remaining residual energy. The cluster head then fused all the data and sends to the base station (BS). A square area is taken for the model of our routing protocol. Details of the network model are specified below TABLE I.   SYSTEM DETAILS AND PARAMETERS IN DSCRP Area of the model 10 × 10 square units   Number of sensors deployed 100 Distance between each sensor node and its adjacent neighbours 1 unit Packet length (k) 200 bit Number of rounds 600 rounds Threshold value given manually as per conditions  Specification of a single sensor node:  1. All the sensor nodes are capable of transferring data to the base station.  2. Data is transferred from each sensor node to the closest neighbor in the first stage till the data reaches the chain head.  3. All the sensor nodes are identical having the same energy (= 0.5 J).   IV. RESULTS AND DISCUSSION The network model is implemented using ns2. It is strong tool to analysis the network model [8,9,11]. The network model constitutes a 10 K 10 matrix i.e, there are a total of 100 sensor nodes in the model. Each node is placed at a unit distance from one another. A chain is formed in each row of the matrix. Thus, we have 10 chains altogether where 10 sensor nodes are present in each chain. Chain head selection starts from one end of the chain and proceeds from one sensor node to the next sensor node. Two tokens are generated from the chain head which propagates the two ends of the chain. These tokens help to attain mutual exclusion during the transmission of data. If a sensor node at one of the ends of a chain is the current chain head then the token received by the chain head is not accepted. The sensor nodes which hold the token is allowed to transmit data to the nearest neighbor within the chain only if the difference between the currently sensed value and previously sensed value exceeds the threshold value. The nearest neighbor fuses the data received to its own data and the process of propagation of data and token continues till all the data reaches the chain head.        The 10 chains heads from all the chains in the network model forms a cluster. The chain head with the maximum residual energy and minimum distance from base station is selected as the cluster head. The data propagates from one sensor node to the nearest neighboring sensor node and gets fused. This process continues until all the fused data is received by the cluster head. Finally, all the fused data received by the cluster head is sent to the base station. For calculating the transmitting energy of a packet the equation is: Et(k,d)=Ec*k+Ea*k*d2                                (i) For calculating the receiving energy of a packet the equation is: Er(k)=Ec*k                                                   (ii) Where; Et=energy consumed during the transmission K=size of the data packet D=distance between the node and the closest neighbor Ec=energy needed to run the transmitter or the receiver Ea=Energy consumed to run the amplifier Er=Energy consumed during the receiving The values assumed are as follows: Ec=50 nJ/bit Ea=100pJ/bit/m2 K=200bits The value for distance between two nodes is 1 unit, while the distance between the chain head and the base station is given bL:   d=sqrt((KLoc-K)2+(LLoc-L)2)      (iii) Where: KLoc= K coordinate of transmitting node LLoc= L coordinate of transmitting node K= K coordinate of base node L= L coordinate of base node Taking the same number of rounds, residual energy was found to be 3.6378 J (approx 7% of the total energy) in LEACH. Thus, consumption of energy is far less in DSCRP compared to LEACH making it significantly more energy efficient. The figure below shows the Network Architecture of the proposed system.   ADBU-Journal of Engineering TechnologL   Barman, AJET, ISSN:2348-7305, Volume 8, Issue 1, June, 2019, 008010606 (6PP) 4   Fig. 1. Network architecture of DSCRP TABLE II.  ROUND AND DEAD NODE IN DSCR Round Dead Node After 100 rounds 0 After 200 rounds 0 After 400 rounds 0 After 600 rounds 0 Total number of nodes died 0 Node death started at round NIL The details of network from the start round in DSCRP are given in Fig. 2.  Fig. 2. Network deatils of DSCRP ( First 34 rounds) The details of network in the middle of rounds in DSCRP are given in Fig. 3.  Fig. 3. Network deatils of DSCRP ( Middle rounds) The details of network at the last rounds DSCRP is given in Fig. 4.   Fig. 4. Network deatils of DSCRP ( Last  rounds)   ADBU-Journal of Engineering TechnologL   Barman, AJET, ISSN:2348-7305, Volume 8, Issue 1, June, 2019, 008010606 (6PP) 5  The Fig. 5 shows the number of dead nodes and number of rounds.  Fig. 5. Number of dead nodes and rounds The Fig. 6 shows the sum of energy of nodes and number of rounds.  Fig. 6. EnergL of nodes with rounds. V. CONCLUSION  We compared DSCRP with LEACH and TSCP for 600 rounds. After comparison we found that the total energy of the network in DSCRP has reduced to 46.75 J from the originally 50 J. The total energy of the LEACH network has reduced to 3.6378 J from the originally 50 J. After 600 rounds the total network energy for TSCP was 45 J and that in SCRP is 44.6J. It is clear from these data that DSCRP saves more energy in comparison to LEACH, TSCP and SCRP. From it is also observed that the nodes in DSCRP give better network lifetime than LEACH. Thus, the algorithm is successful in increasing the network lifetime. REFERENCES  [1] Prabhdeep Singh, MaK Bhatia, and Ravneet Kaur, “Energy-Efficient Cluster Based Routing Techniques: A Review”, International Journal of Engineering Trends and Technology- Volume4, Issue3- 2013. [2] Stephanie Lindsey and Cauligi S. Raghavendra, “PEGASIS: Power-Efficient Gathering in Sensor Information Systems” Stephanie Lindsey. work. 2001;310:336–1686. [3] Husam Kareem, S.J. Hashim, ShamalaSuberamaniam, and AduwatiSali, “Energy Efficient Two Stage Chain Routing Protocol (TSCP) for Wireless Sensor Network. Journal of Theoretical and Applied Information Technology. Pp.442-450 . Vol. 59 No.2. 20th January 2014 [4] Jigish Rana, Sangeeta Vhatkar, and MohommadAtique, “Comparative Study of PEGASIS and PDCH Protocols in Wireless Sensor Network”, International Journal of Computer Applications (0975 – 8887) International Conference and Workshop on Emerging Trends in Technology (ICWET 2015). [5] Feilong Tang, Ilsun Lou, Song Guo, MinxiGuo, Xonggong Ma, “A chain-cluster based routing algorithm for wireless sensor networks”. J Intell Manuf (2012) 23: 1305. https://doi.org/10.1007/s10845-010-0413-4 [6] Utpal Barman, Amit Mundra, Kunal Gunjan Talukdar, Mrinal Goswami, and PranoL Bhowmick, "Energy efficient WSN Protocols: A Survey", International Journal of Computer Sciences and Engineering, Vol.04, Issue.07, pp.24-29, 2016 [7] Utpal Barman, PranoL Bhowmick, Kunal Gunjan Talukdar, Mrinal Goswami, and Amit Mundra, "Single Stage Chain Routing Protocol (SCRP) For Wireless Sensor Networks", International Journal of Computer Sciences and Engineering, Vol.04, Issue.07, pp.85-88, 2016. [8] Utpal barman, Neelpawan Kalita “ Performance analysis of AODV routing protocol in MANET (A Review) ”- IJARCCE, vol 5- Issue 1, January 2016 [9] Utpal Barman, and Diganta Sahu “Performace analLsis of DSDV “ IJARCCE, vol 5- Issue 1, JANUARy 2016 [10] Kangka ChakravartL and Utpal Barman, "An Energy Balanced Algorithm of PEGASIS Protocol in WSN", International Journal of Computer Sciences and Engineering, Vol.04, Issue.07, pp.53-57, 2016. [11] Neelpawan Kalita and Utpal Barman. “Performance Analysis of Dynamic Source Routing Protocol in TCP and UDP Environment in MANET Varying Number of Nodes”, International Journal of Computer Applications 144(11):30-34, June 2016.      Utpal Barman Mr. Barman is working as an Assistant Professsor, Department of CSE, GIMT, Guwahati. He has published many papers and currently handling two major sponsored research projects of AICTE and CDB. His area of specialization is computer network and Image processing.    Uzzal Sharma The author has obtained his MCA from IGNOU and completed PhD from Gauhati University. He has over 15 years of experience in the field of academics and in industry. His research area includes Speech Signal Processing and Software Engineering and Data Engineering. He has produced one PhD scholar and currently guiding 4 research scholars for their PhD degree. He has also guided many MTech, BTech and MCA students for their projects in different areas. He has published more than 25 research papers in journals (International and National) and conference proceedings (International and National). He also has 11 book chapters to his credit in edited book. He has also published five books as a sole author. Currently he is an Assistant Professor - Stage 2 at Assam Don Bosco University, Guwahati, India.   ADBU-Journal of Engineering TechnologL   Barman, AJET, ISSN:2348-7305, Volume 8, Issue 1, June, 2019, 008010606 (6PP) 6      Animesh Sarmah Mr. Sarmah is a Student of GIMT, Guwahati in M.Tech Programme. His area of interest is Computer Network.            PronoL Bhowmick Mr. Bhowmick is a Student of GIMT, Guwahati in M.Tech Programme. His area of interest is Computer Network                           

Double Stage chain routing Protocal in WSN

https://journals.dbuniversity.ac.in/ojs/index.php/AJET/article/download/650/610

Double Stage chain routing Protocal in WSN

Abstract

Similar works

Full text

Available Versions

Assam Don Bosco University Journals