Energy Efficient Error Control Technique for Wireless Sensor Networks

M.R.Ebenezar Jebarani, Research scholar, Sathyabama University Chennai, Tamilnadu

Email: jebaranimalgam_2007@rediff.com Abstract: Wireless sensor network plays a vital role in the wireless communication. The energy consumption is very important parameter, as the sensor node senses the signal round the clock. In wireless communication as there are many factors where the errors are introduced. In this paper the energy consumption of the network is analyzed by implementing a proper error correcting technique that is applied to data link layer, so it is proved that by performing the node to node error correction the overall energy consumption is less. The error control technique is compared with the ARQ error control technique and it is proved that the hadamard code is best with respect to the parameters throughput, BER and Energy consumption. Keywords: WSN, ARQ, BER, Energy I INTRODUCTION Wireless sensor networks are the networks which are used to collect the information, where there is a need of unmanned operation [1]. Wireless nodes are densely deployed in the area, where the information is to be collected. The nodes collect the information and it will inform that to the base station, where the necessary action is taken. The base station as it can be chargeable it can increase the signal strength to transfer the information to the nodes, but in case of wireless sensor nodes as they are charged using battery power, the energy constraint is very important, the nodes senses the information round the clock and they recharge through the solar energy, the energy consumptions is very important in case of wireless sensor networks. When the data transmitted it should reach the destination without error, if there is error that data will be retransmitted or it should be corrected with the help of redundant information[2]. The former technique is ARQ, and the latter is Forward error correction. In ARQ technique, the erroneous data are intimated by NAK frames, and when the source receives the NAK frames, it Automatic repeat request (ARQ) or Automatic Repeat Query is an error control technique for data transmission which uses acknowledgements and time outs, where acknowledgement is the messages sent by the receiver that indicates that the data are received by the receiver correctly. Time outs are the indication that after a period of time that was allowed before an acknowledgement packets are received, that is if the sender does not receive the acknowledgement before timeouts, sender retransmits the data packet till the acknowledgement packet is received. There are three types of ARQ, Stop and Wait ARQ Go Back N ARQ Selective Repeat ARQ

T.Jayanthy, Principal, Panimalar Institute of Technology, Chennai, Tamilnadu.

Email:jayanthymd@rediff.com retransmits the data. In this paper we are implementing a error control technique in which the data are transmitted by encoding the message and in the receiver side the decoding technique is applied to detect and correct the errors. The technique says that if there is retransmission the energy consumption will be more, but if we are correcting the errors without retransmissions, the energy consumption will be less, so that it is to be proved that error control code works better than the ARQ where the data are retransmitted in case of errors. The paper briefs about ARQ and the hadamard code, it proofs that hadamard code is better than that of ARQ in terms of error correction. The analysis proves that, the parameters BER, throughput and energy consumption of hadamard code behaves better than that of ARQ [3]. II AUTOMATIC REPEAT REQUEST

In stop and wait ARQ the sender transmits the information and it ensures that whether the information is received in order or any packet is lost during transit. It is the simple one, it sends on frame, wait for ACK or time outs and transmit the next frame, if the acknowledgement

frame was not received at the right time, after timeout sender will retransmit the frame again. In Go-Back-N ARQ, the transmitting process send a number of frames specified by the window size without receiving the acknowledgement packet from the receiver. It transmits the frame with window size N and receives the frame with window size 1. The receiver process checks the sequence number of the next frame it expects to receive, and sends that number with every ACK the receiver sends. The receiver will not accept the frame that does not have the sequence number actually it needed. If any frame is received with error, from that frame the sender have to retransmit. Go back N ARQ is better than Stop and wait ARQ , in this algorithm if there is any frame received with error, all the frames from the erroneous frames have to be retransmitted, eventhough the other frames are received without error. In Selective Repeat ARQ, the receiver keeps track of the sequence number of the frame which was not received properly and sends that number with the acknowledgement frame it transmits. Once the transmission over, the sender retransmit the frame that was specified by the acknowledgement frame. In this the size of both the sender and receiver window should be same. In this a searching logic is needed in the transmitting side and a sorting logic is needed at the receiver side.The sender window shrinks when it transmits the packets and the sender window expands when the acknowledgement packet is received. The receiver window shrinks when it receives the data and it expands when the acknowledgement packet is sent. III FORWARD ERROR CORRECTION FEC is a technique which controls the errors in data transmission over unreliable or noisy channels. In this the sender encodes the message in a redundant method by using an error correcting code. With the help of redundant information, it allows the receiver to detect and correct a limited number of errors that occur in any part of the message without retransmission. FEC is implemented where the retransmission cost is more. FEC coders generate a bit error rate signal which can be used as a feedback to fine tune the receiving device. The maximum number of errors or of missing bits can be corrected is determined by the design of FEC code, so there are different forward error correction codes for different situations [4].

In FEC technique, the errors are corrected using the redundant information transmitted with the data. In this technique the data plus redundant information which are useful for correcting the errors are transmitted and the transmission over head increases, but while compared to ARQ where the entire data are transmitted, this is better to save the energy. The main disadvantage of FEC technique is that if there is no error the bandwidth is wasted, as there are redundant information that are transmitted with the data. As wireless environment are subjected to errors, this technique is well suited for wireless environment [5,6]. IV ENERGY EFFICIENT ERROR CORRECTING CODE In wireless sensor networks, the data are generated by the transmitting device and it passes on from hop to hop till it reaches the destination, there are two layer which correct the errors, the data link layer performs error correction from node to node. The transport layer takes care of end to end error correction. In node to node error correction the errors are corrected in each node, so that they are not accumulated and increase till it reaches the receiver. In end to end error correction, the transport takes care of error correction, as the name implies the error is corrected only in the destination node, as it is wireless environment the error probability is more compared to wired environment, instead of accumulating error till destination, in this paper we are implementing an error control code which performs node to node error correction [7]. If m is the message and k is the length of the message, the generator matrix is constructed by forming

For example consider k=4, Then to construct generator matrix G using the above formula,

(1) Substituting in Equation (1), we obtain

The generator matrix G is composed of 3 rows and 8 columns. Hence to the generator matrix we add a row with all the elements as 1 at the top of the matrix.

V SIMULATION AND RESULTS The error correcting code is implemented using Network Simulator-2 tool. There are 50 nodes taken for simulation. The sensor nodes are deployed in 1000x 1000 areas. The ARQ and hadamard codes are compared and it proved that the hadamard code is better than the ARQ error control technique in terms of the parameters Bit error rate, throughput and energy consumption

Encoding When transmitting the message from one hop to another hop, the encoded message Z can be obtained by the equation Z=XG The message X is multiplied with the generator matrix G and transmitted in the networks by the Channel. Decoding Steps for Decoding the message 1.Receive the code word. 2.Transform it to a + v by changing all 0s to -1. 3.The maximum absolute value in the corresponding row is taken as the code word. If it is +ve the code word from H. If it is ve the code word from H. 4.If there were no errors the product (v HT) would

Fig 1: Sample Nam Screen Shot for ARQ technique In Fig.1 it shows the sample Nam screen shot for ARQ technique, as there are more number of retransmission there are more number of packets in the network.

be a vector consisting of 0s except for one entry of magnitude n.

5. For each error in v, with row of H changes by 2. The maximum boundary of errors are 2t=n/2 2. The minimum boundary of errors are n-2t=n/2+2. If the size of hadamard matrix is n, the code has parameters ( n, 2n, n/2 ) 2 , actually it does not mean that linear binary code with 2n code words of block length n and minimum distance n/2. The code has minimum distance of n/2 and it can correct up to t= n / 4-1 errors. The code can correct t errors and it can detect t+1 errors.

Fig 2: Sample Nam screen shot for Hadamard technique In Fig.2 Sample Nam screen shot for hadamard technique is shown as there are node to node transmission, the message transmission will be with less interference during transmission.

Fig 5: No of nodes vs BER Fig 3: No of nodes vs Energy consumption In Fig.3 the nodes are varied and the energy consumption is analyzed and it is compared with the ARQ technique and proved that the hadamard code is 40% better than ARQ error control technique. As the number of retransmission traffic is more in ARQ the energy consumption will be more, but in hadamard the error correction is performed by decoding the message and hence the energy consumption is less for the hadamard code. CONCLUSION In this paper we had analyzed an energy efficient error correcting code for wireless sensor networks and it is proved that the hadamard code energy consumption is 40% better than that of ARQ and it is an efficient error correcting code, where the BER is less, throughput is more. Hadamard code works well for short distances, hence we are using the hadamard code for node to node error correction. In future a new error control algorithm will be developed and the results will be compared with the hadamard code. REFERENCES

[1] [2] [3]

I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, Wireless Sensor Networks: A Survey, Computer Networks (Elsevier) Journal,Vol. 38, No. 4, pp. 393-422, March 2002. Edoardo Biagioni and Galen Sasaki. Wireless sensor placement for reliable and efficient datacollection. In Proceedings of the Hawaiii International Conference on Systems Sciences,January 2003. Joseph Polastre, Robert Szewczyk, and David Culler, Telos: Enabling ultra-low power wireless research,in The Fourth International Conference onInformation Processing in Sensor Networks: Specialtrack on Platform Tools and Design Methods forNetwork Embedded Sensors (IPSN/SPOTS), LosAngeles, California, Apr. 2 M. Busse, T. Haenselmann, T. King and W. Effelsberg: The Impactof Forward Error Correction on Wireless Sensor Network Performance,Proc. of ACM Workshop on Real-World Wireless Sensor Networks, 2006. R. Agarwal, E. M. Popovici, C. OKeeffe, B. OFlynn and S. J. Bellis:Low Power Computing for Secure and Reliable Sensor Networks, Proc.,IEEE Intl. Conf. on Microelectronics, 2006, pp. 630633. J. C. Chuang, Improvement of data throughput in wireless packet systems with link adaptation and efficient frequency reuse, in Proc. IEEE Vehicular Technology Conf., Houston, TX, May 1999, pp. 821825. B. L. Luke and P. E. Pace, RSNS-to-binary conversion," IEEE Trans.Circuits Syst. I, vol. 542, pp. 2030-2043, Sept. 2007. M. Chiani, Throughput Evaluation for ARQ Protocols in FiniteInterleaved Slow-Frequency Hopping Mobile Radio

Fig 4: No of nodes vs Throughput In Fig .4, it is clear that the throughput is improved with the hadamard code than the ARQ technique. Throughput is the ratio of number of packets transmitted to the number of packet received successfully [8]. In the above graph it is clear that the throughput is 28% improved in hadamard code than the ARQ code. Hence the hadamard code is better than the ARQ. In Fig.5 the graph shows that the BER is 15% less with the hadamard code than that of ARQ. The nodes are varied it can be seen the bit error rate is less in hadamard code than ARQ.

[4] [5] [6] [7] [8]

Systems,IEEE Transactions on Vehicular Technology, vol. 49, pp. 576581, March 2000.