Quality Value based Routing protocol for Energy Optimization in Wireless Sensor Networks

(1)

ISSN: 2005-4238 IJAST 83

Quality Value based Routing protocol for Energy Optimization in Wireless Sensor Networks

1Dasari Naga Raju, ²T. Sunil Kumar Reddy, ³N. V. Raja Sekhar Reddy

1

Associate Professor, Dept. of CSE, Sreenivasa Institute of Technology and Management Studies, Chithoor, Andhra Pradesh, India

2

Professor, Dept. of CSE, Sri Venkateswara College of Engineering and Technology, Chithoor, Andhra Pradesh, India

3

Professor, Dept. of CSE, MLR Institute of Technology, Hyderabad, Telangana, India

Abstract:

From the past decade, wireless sensor networks (WSNs) raised their importance in the communication networks. Though WSNs are having the many advantages, they are lacking in efficient routing protocols. This paper considers the objective of optimizing the energy of WSNs. The proposed method considers the quality value of each node to forward the packers. The quality value is depends on the residual energy and cost. The cluster head selection is also done by the quality value of the node. The simulation analysis is performed with different parameters. The results proved the efficiency of the proposed protocol.

Keywords: Quality factor, Sensor nodes, Network lifetime, Energy consumption.

1. Introduction

Wireless sensor networks are applied in many fields such as military, home automation, health care and many more [1-2]. WSNs are having thousands of sensor nodes which are deployed in remote regions. The limitations of sensor nodes are battery power, computation capacity. Therefore, preserving of energy for the sensor nodes is very crucial in WSNs. Many routing protocols are proposed to address the issue of energy consumption, but they are not sufficient to overcome the energy issue. In [3], the authors developed hierarchical based routing protocols which are more efficient in preserving the energy over the WSNs. In these protocols, the network is partitioned in to number of clusters which are handled by the cluster heads. In some protocols [4-5], the CH is selected first and the member nodes are selected by the CH. The member nodes selection is based on the node distance from the base station and residual energy.

This paper concentrated on developing the new protocol where the member nodes are selected first, and then the cluster head is elected by the member nodes. The performance of the network is completely depends on the cluster head selection. The rest of the paper is organized as follows.

Section 2 describes about the related work regarding the energy consumption and collisions avoidance of the WSNs. Section 3 explains about the proposed method regarding the calculation of battery life and cost of the sensor nodes. Section 4 deals with the experimental evaluation of the proposed protocol with other existing protocols. Section 5 concludes the research work.

2. Literature Survey

There is a huge research is going on in the field of developing the routing protocols for WSNs.

Moreover there are some considerations factors while designing the routing mechanisms. The major research factor in WSNs is the reduction of energy consumption which directs impacts the performance of the network. In [10], the authors proposed a method which is called as random coordination algorithm for sleep and wake of sensor nodes to conserve the energy. Here, the direct communication among the nodes is considered instead of hop to hop communication. The direct communication increases the network lifetime and decreases the energy consumption. The sensor nodes which are in active state are act as coordinators. In [11], the authors proposed the GAF scheme for WSNs, the sensor nodes with in the WSNs are divided into grid regions based on their geographical regions. The mechanism manages decisions for sleep or wake states. But, one node must be always in awake state for the data routing process.

In [12], an algorithm was proposed for collision avoidance in WSNs. The algorithm is named as PCAP which follows the MAC protocol. The CSMA in the algorithms uses the RTS and CTS

(2)

ISSN: 2005-4238 IJAST 84

messages for handshaking process. The drawback of the proposed protocol is delay in the network due to the introduction of RTS and CTS messages. In [13], a cross layer communication is proposed for sharing of information. This method is not fitted for the avoidance of congestion in the network.

The main reason for packet dropping is hop to hop communication in the network.

3. Proposed algorithm

In the WSNs, the clustering is the process of grouping the nodes in to the several regions. The network contains several clusters, each cluster contains one cluster head and this CH is responsible for collecting the data from the remaining nodes and sends to the base station. If the CH node fails, it leads to the additional overhead to the network. Therefore, selection of CH node in the hierarchical protocols is very crucial.

The main goal of this paper is reduce the energy consumption of the nodes and decrease the network overhead and increase the reliability. In the network, the cluster contains the CH node and the selection of CH is based on the learning process. The learning process is carried by using the reinforcement techniques. It contains agents, actions, positive and negative reward. In the WSNs, the agents are the sensor nodes; actions are the neighbouring nodes which can route the data to the base station. The reduction of energy consumption in the sensor nodes leads to the positive reward otherwise it leads to the negative reward.

To find the CH node, Q-learning approach [6] is used and it is given in Equation 1.

) ( ) ( )

( i i i

QVal    

₍₁₎

Where α(i) represents the node distance from the base station, β(i) represents the residual energy of the sensor node. Figure 1 shows the computing cost of the neighbouring node.

i B S

i C B S n D

C  ( ) (1 (1/ ( 1) ) )1/ ,

i is the number of nodes C is the cost of each node

Dk,l is the distance between node k and node l

1. C(BS) represents the cost of Base Station which is equal to i 2.for each node in the range of base station the cost is calculated as (2)

Base station (BS) sends the value of Ci to node i

3. The neighbours of node i receive the Ci value and calculate the new C value to the each neighbouring node by using step 4.

4. (3) 5. Repeat step 3 until all the nodes receives the C value.

i B S

i C B S n D

C  ( ) (1 (1/ ( 1) ) )1 / ,

i k k

i C n D

C   (1 (1/ ( 1) ) )1/ ,

Figure 1: Quality Value calculation for neighbouring nodes

Algorithm 1: Q-Value based Routing Begin

1) Calculate the cost of node i and sends the information to each node in the network.

2) When a node fails, i.e. it runs out of battery then their cost C will be zero 3) If node i wants to send the packet to the neighbouring nodes then

a) Compare the cost of the neighbouring node with its cost b) Compare the Q-value of the neighbouring node

c) Select the neighbouring node with the highest Q-value

(3)

ISSN: 2005-4238 IJAST 85

d) Send the packet to the selected neighbouring node 4) Else

Goto step 3

5) If nodes i wants to send the packet to the neighbouring node in the another cluster a) Compare the cost of the neighbouring node with its cost

b) Compare the Q-value of the neighbouring node c) Select the neighbouring node with the highest Q-value d) Send the packet to the selected neighbouring node 6) Else

Choose the neighbouring node randomly End

4. Simulation Environment

The proposed protocol is simulated using the NS2 simulator [2]. The performance analysis of the proposed protocol is compared with the three existing algorithms such as Aweya et al.[9], Cheng et al.

[4] and Martins et al. [7]. Table 1 shows the parameters used for the simulation of the proposed algorithm.

Table 2: parameters for the proposed algorithm

Parameter Value

Packet size 250 bytes

Area size 1000 * 1000 m

Energy consumption 40 nJ/bit

Initial energy 1 J/bit

Process cost 15 nJ/bit

Sender Buffer size 10000 bytes

Receiver buffer size 10000 bytes

In figures 2, 3 and 4 it is observed that the proposed protocol had better network lifetime, high packet delivery ratio and minimal energy consumption compared to the other existing protocols. This is due to the selection of CH node with in the cluster and provides the flexibility to increase the node lifetime as well as reducing the energy consumption without utilizing the additional nodes

40 60 80 100 120 140 160 180 200

4 6 8 10 12 14 16 18 20 22 24 26 28 30 32

Network Lifetime (sec)

Number of Nodes Aweya et al. [9]

Cheng et al. [4]

Martins et al [7]

Proposed

Figure 2: Network Lifetime Vs Number of Nodes

40 60 80 100 120 140 160 180 200

4 6 8 10 12 14 16 18 20 22 24 26 28 30 32

Network Lifetime (sec)

Number of Nodes Aweya et al. [9]

Cheng et al. [4]

Martins et al [7]

Proposed

Figure 3: Packet delivery Vs Number of Nodes

(4)

ISSN: 2005-4238 IJAST 86

25 50 75 100 125 150 175 200

0 5 10 15 20 25 30 35 40

Enenrgy Consumption (J)

Number of nodes Aweya et al. [9]

Cheng et al. [4]

Martins et al [7]

Proposed

Figure 4: Energy Consumption Vs Number of Nodes 5. Conclusion

This paper developed the quality value based routing protocol for reducing energy consumption in the WSNs. The quality value is based on the residual energy of the nodes. The Quality value for each node is calculated for efficient packet forwarding. The simulation results are carried using the NS2 simulator. The results proved that the proposed algorithm had better performance in terms of network lifetime, packet delivery and energy consumption compared to the other existing protocols.

References

[1] RAJU, Dasari Naga, and Vankadara SARITHA. "A Survey on Communication Issues in Mobile Cloud Computing." Walailak Journal of Science and Technology (WJST) 15, no. 1 (2016): 1-17.

[2] B. Das, S. Das, and C. S. Das, “Efficacy of multiband OFDM approach in high data rate ultra wide band WPAN physical layer standard using realistic channel models,” International Journal of Computer Applications, vol. 2, no. 2, pp. 81–87, 2010.

[3] F. Kiyani, H. Tahmasebirad, H. Chalangari, and S. Yari, “DCSE: A dynamic clustering for saving energy in wireless sensor network,” in Proceedings of the 2nd International Conference on Communication Software and Networks (ICCSN ’10), pp. 13–17, Singapore, February 2010.

[4] G. Anastasi, M. Coti,M. Frrancesco, and A. Passarella, “Energy conservation in wireless sensor networks: a survey,” Ad Hoc Networks, vol. 7, no. 3, pp. 537–568, 2009.

[5] Reddy, T. Sunil Kumar, J. Jannet, K. N. Sivabalan, and Dasari Nagaraju. "An Enhanced Routing Mechanism for Energy Reduction in Wireless Sensor Networks." (2016).

[6] A. F¨orster, “Machine learning techniques applied to wireless adhoc networks: Guide and survey,” in Proceedings of the International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP ’07), pp. 365–370, December 2007.

[7] J. Aweya, “Technique for differential timing transfer over packet networks,” IEEE Trans. Ind.

Inf., vol. 9, no. 1, pp. 325–336, Feb. 2013.

[8] C. T. Cheng, C. K. Tse, and F. C. M. Lau, “A clustering algorithm for wireless sensor networks based on social insect colonies,” IEEE Sensors J., vol. 11, no. 3, pp. 711–721, Mar.

2011.

[9] F. V. C. Martins and E. G. Garrano, “A hybrid multi objective evolutionary approach for improving the performance of wireless sensor networks,” IEEE Sensors J., vol. 11, no. 3, pp.

545–554, Mar. 2011.

[10] D. Zorbas and C. Douligeris, “Connected coverage in WSNs based on critical targets,” Computer Networks, vol. 55, no. 6, pp. 1412–1425, 2011.

[11] Y. Xu, J. Hiedemann, and D. Estrin, “Geography informed energy conservation for Ad Hoc routing,” in proceeding of the 7th annual ACM lst IEEE International Conference on Mobile computing and Networking (MobiCom ’01), Rome, Italy, July 2001.

(5)

ISSN: 2005-4238 IJAST 87

[12] X. Guo, M. R. Frater, and M. J. Ryan, “A propagation-delay tolerant collision avoidance protocol for underwater acoustic sensor networks,” in Proceedinsg of the Asia Pacific (OCEANS ’06), May 2007.

[13] Babu, Palamakula Ramesh, Parimala Venkata Krishna, Dasari Naga Raju, Vankadara Saritha, and M. Pounambal. "An enhanced virtual backoff algorithm for wireless sensor networks." International Journal of Wireless and Mobile Computing 13, no. 3 (2017): 179- 187.

[14] Y. Liu, Y. Liu, J. Pu, and Z. Xiong, “A robust routing algorithm with fair congestion control in WSN,” in Proceedings of 17^th International Conference on Digital Object Identifier Computer Communication and Networks (ICCCN ’08), pp. 1–4, 2008.