Abstract
Communication in large area wireless sensor networks that consists of more than 1000 nodes should be reliable in real-time event detection system. All nodes are active and transmit event information to the base station. Due to large number of packet transmission, network gets congested. This causes large number of packet loss. Missing of single packet of information can cause a big event. This paper presents a reliable and fast data transmission protocol for WSN. There are two improvements in this mechanism over previous mechanisms. First is the utilization of packet transmission waiting time and second is adjustment of sending window size according to packet drop ratio. The network capacity is measured according to packet loss ratio. The implementation of proposed technique is done in QualNet 5.0. Results are described in the paper.
Access provided by CONRICYT-eBooks. Download conference paper PDF
Similar content being viewed by others
Keywords
1 Introduction
Wireless sensor networks [1] can be described in terms of thousands of small devices responsible of computation, communication, and sensing. These small devices are called MOTE [2]. The MOTEs are deployable in real-time application to protect large area. The sensor attached with the MOTE senses the environmental signals, processor/microcontroller perform computing to identify the events. The communication devices are transceivers, which receive and transmit event information to the base station through multihoping [3]. The packets of event information transmitted in network required certain protocols to reach the destination. There are several routing protocols that exist for WSN. Static routing [4] is preferable in the case of multihop transmission.
The other required protocol is MAC [5] protocol. Energy of MOTE to sense and transmit the information in WSN is a major issue. Various protocols exist for MAC, but till now none of the MAC protocols is suitable for WSN. Still development and research are going on. Other than energy saving protocol, few media access protocol with collision detection and avoidance are used for WSN.
After MAC protocol, the most important protocol is TCP [6], which is required for reliable packet transmission. The successful packet transmission to the base station is very essential. Any serious event can take place, if packet transmission fails. There are many nodes which can transmit event information at the same time. It may cause congestion in network. There are various variants that have been proposed to reduce congestion effects, TCP Tahoe [7–9], TCP Reno [8], TCP Reno with Selective Acknowledgement (SACK) [7, 8], TCP NewReno [10, 11], TCP Westwood [11] TCP Vegas [12], and TCP FACK [13] are examples of proposed end-to-end solutions. These variants are proposed to improve network performance, but still we are facing problems of packet drop and packet loss.
This paper presents a new variant of TCP for wireless sensor network to reduce the effect of congestion in network. The proposed technique is based on utilizing waiting time for packet transmission and adjustment of sending window size according to the packet drop ratio.
There are various researches going on to reduce the effect of congestion and to make reliable communication by implementing transmission control protocol. Few of the research are as follows.
Kumar et al. [14] has proposed a congestion control mechanism for MANET. The author has calculated various parameters to monitor the congestion status and developed routing protocol. The proposed routing protocol with conventional TCP has been implemented and compared by the author. As results shows proposed technique is better.
Sharma et al. [15] has implemented various parameters to identify the non-congestion losses of TCP in MANET. Author has implemented parameters in NS-3 simulator, simulate the communication, and then observe the performance of MANET in different scenarios.
Above literatures shows development of TCP variants for various purposes. This paper presents implementation of protocol to reduce the packet drops in congested network.
Organization of paper: Sect. 2 transmission control protocol, Sect. 3 presents the proposed mechanism, and Sect. 4 presents results of simulation.
2 Transmission Control Protocol
Transmission control protocol (TCP) is known for reliable communication. It is a protocol of transport layer in TCP/IP layers [16]. The size of congestion window either increases or decreases according to the network capacity.
Slow Start: The first step in TCP is slow start. The size of congestion window starts from either 4380 byte or maximum of segment size. The congestion window grows exponentially. After a certain period network get congested and at that time size of congestion window becomes half. At the same time congestion avoidance phase starts.
Congestion avoidance phase: In this phase size of congestion window becomes half and congestion avoidance algorithm executes.
Fast retransmission: In this phase TCP transmits all those packets which are dropped or not acknowledged. After fast retransmission phase again slow start phase starts.
There are various improvements has been done for better performance. The improvements are based on avoiding the congestion and retransmit the packets. There are two demerits of TCP which are not covered by other variants.
The first demerit is waiting of acknowledgement. TCP does not transmit new packet until it gets acknowledgement of previous packet or timeout occurs. There is wastage of time. The second demerit is calculation of congestion window in congestion avoidance phase.
Proposed mechanism of TCP is trying to solve these both issues, described in next section.
3 Proposed Mechanism
The proposed mechanism is divided into two segments. The first segment is based on calculation of retransmission timeout. Sender has to wait until it gets acknowledgement for sent packet. Sender has no option to send packet even it has to send any important information. TCP start a timeout timer when it transmit a packet, and wait for acknowledgement. In the case of loss of acknowledgement in the network, TCP retransmits the packet and double the timeout timer. Reliability of packet transmission is costing enough time waste during communication. The enhance mechanism for data transmission calculates retransmission timeout, so that it can reduce time wastage during retransmission of packets. The round trip time (RTT) and retransmission timer overtime (RTO) can be calculated with following formula:
The second segment is based on calculation of congestion window according to packet loss in network. Packet loss rate is defined as ratio of total packet sent and total packet received. It can be denoted by P L.
The packet loss rate also can be decided by the bit error rate (BER) of wireless link layer and the length (Length) of data frame:
Avoidable BER (P loss_min) is 0.4. If BER is greater than P loss_min the size of sending window should be decreased otherwise sending window size can increase. The algorithm is as follows.
4 Results
The implementation and simulation had been done in QualNet 5.0 [17] network simulator with variation in number of nodes and pause time. Following graphs show the output of simulation after implementation of proposed protocol. The new algorithm is named as RTCP. The result of RTCP is compared with result of TCP RENO, TCP SACK, and TCP TAHOE.
Figure 1a shows the throughput of TCP variants (y-axis) with variation in number of nodes (x-axis) in network. Number of nodes indicates the traffic in network. It can be observed that throughput of RTCP (proposed routing protocol) is similar to TCP Tahoe, but it is better when number of nodes are 10.
Figure 1b shows the signal received with error by receiver (y-axis) with variation in number of nodes (x-axis) in network. It can be observed that RTCP (proposed routing protocol) is having less number of signals with error than other variants.
Figure 1c shows the total packet loss by receiver (y-axis) with variation in number of nodes (x-axis) in network. It can be observed that RTCP (proposed routing protocol) has lost less number of packets than other TCP variants, even in the case of heavy traffic.
Figure 1d shows the total byte received by receiver (y-axis) with variation in number of nodes (x-axis) in network. It can be observed that RTCP (proposed routing protocol) has received maximum bytes. The performance of RTCP is similar to TCP Tahoe.
Figure 2a shows the throughput analysis (y-axis) with variation in pause time (x-axis) in network. It can be observed that throughput of RTCP (proposed routing protocol) is better than other TCP variants.
Figure 2b shows total byte received by receiver (y-axis) with variation in pause time (x-axis) in network. It can be observed that RTCP (proposed routing protocol) has received more number of bytes than other TCP variants.
Figure 2c shows total packet loss by receiver (y-axis) with variation in pause time (x-axis) in network. It can be observed that RTCP (proposed routing protocol) has dropped less numbers of packets than other TCP variants.
Figure 2d shows total signals received with error by receiver (y-axis) with variation in pause time (x-axis) in network. It can be observed that RTCP (proposed routing protocol) has received less numbers signal with error than other TCP variants.
According to results, it can be observed that in most of the cases either in dense network or variation in pause time, the performance of RTCP is better than other TCP variants. The simulation result shows that RTCP is more reliable and can be used in sensitive networks.
5 Conclusion
Communication in large network is very complex, due to congestion in network. For a reliable and fast packet transmission, this paper presents a transmission algorithm. The proposed algorithm is based on utilizing time of packet retransmission and also on resizing the sending window according to the network capacity. The network capacity has been measured according to the number of packet drops. The mechanism was implemented on QualNet 5.0. According to the simulation results the proposed algorithm (RTCP) is performing better than other TCP variants. RTCP is more reliable, so it can be used in most sensitive places, where real time event monitoring is required.
References
Feng Zhao; Leonidas J. Guibas, “Wireless Sensor Networks: An Information Processing Approach” Morgan Kaufmann, 2004
C.S. Raghavendra; Krishna M. Sivalingam; Taieb Znati, “Wireless Sensor Networks” Springer Science & Business Media, 2005
Nishiyama, H.; Ito, M.; Kato, N., “Relay-by-smartphone: realizing multihop device-to-device communications,” in Communications Magazine, IEEE, vol.52, no.4, pp. 56–65, April 2014
Bhaskar Krishnamachari, “Networking Wireless Sensors” Cambridge University Press, 2005
Ben Nacef, A.; Senouci, S.; Ghamri-Doudane, Y.; Beylot, A.-L., “A Cooperative Low Power Mac Protocol for Wireless Sensor Networks,” in Communications (ICC), 2011 IEEE International Conference on, pp. 1–6, 5–9 June 2011
Zhaojuan Yue; Xiaodan Zhang; Yongmao Ren; Jun Li; Qianli Zhong, “The performance evaluation and comparison of TCP-based high-speed transport protocols,” in Software Engineering and Service Science (ICSESS), 2012 IEEE 3rd International Conference on, pp. 509–512, 22–24 June 2012
Sikdar, B.; Kalyanaraman, S.; Vastola, K.S., “Analytic models and comparative study of the latency and steady-state throughput of TCP Tahoe, Reno and SACK,” in Global Telecommunications Conference, 2001. GLOBECOM ‘01. IEEE, vol. 3, pp. 1781–1787, 2001
Jinwen Zhu; Tianrui Bai, “Performance of Tahoe, Reno, and SACK TCP at Different Scenarios,” in Communication Technology, 2006. ICCT ‘06. International Conference on, pp. 1–4, 27–30 Nov. 2006
Hassani, M.M.; Berangi, Reza; Tavakolaie, H., “An analytical model for evaluating utilization of TCP TAHOE using markovian model,” International Conference on Networking, Architecture, and Storage, 2007. NAS 2007, pp. 257–258, 29–31 July 2007
Parvez, N.; Mahanti, A.; Williamson, C., “An Analytic Throughput Model for TCP NewReno,” in Networking, IEEE/ACM Transactions on, vol. 18, no.2, pp. 448–461, April 2010
Ratna Pavani, K.; Sreenath, N., “Performance evaluation of TCP-Reno, TCP-Newreno and TCP-Westwood on burstification in an OBS network,” 18th Annual International Conference on Advanced Computing and Communications (ADCOM), pp. 19–24, 14–16 Dec. 2012
Srijith, K.N.; Jacob, L.; Ananda, A.L., “TCP Vegas-A: solving the fairness and rerouting issues of TCP Vegas,” in Performance, Computing, and Communications Conference, pp. 309–316, 9–11 April 2003
Raza, I.; Hussain, S.A.; Ali, A.; Hassan Raza, M., “Persistent packet reordering attack in TCP based Ad hoc wireless networks,” International Conference on Information and Emerging Technologies (ICIET), pp. 1–6, 14–16 June 2010
Kumar, H.; Singh, P., “TCP congestion control with delay minimization in MANET,” International Conference on Information Communication and Embedded Systems (ICICES), 2014, pp. 1–6, 27–28 Feb. 2014
Sharma, N.; Chakrawarti, R.K., “Simulation for congestion-less losses control over MANET using TCP scheme,” in Issues and Challenges in Intelligent Computing Techniques (ICICT), 2014 International Conference on, pp. 410–415, 7–8 Feb. 2014
Stefano Basagni; Marco Conti; Silvia Giordano; Ivan Stojmenovic, “Mobile Ad Hoc Networking” John Wiley & Sons, 2004
QualNet 5.0: “http://web.scalable-networks.com/content/qualnet” last accessed on 24/10/2015
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media Singapore
About this paper
Cite this paper
Roshan Jahan, Preetam Suman (2017). Reliable and Fast Data Transmission Mechanism for Congested Wireless Sensor Network. In: Singh, R., Choudhury, S. (eds) Proceeding of International Conference on Intelligent Communication, Control and Devices . Advances in Intelligent Systems and Computing, vol 479. Springer, Singapore. https://doi.org/10.1007/978-981-10-1708-7_19
Download citation
DOI: https://doi.org/10.1007/978-981-10-1708-7_19
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-1707-0
Online ISBN: 978-981-10-1708-7
eBook Packages: EngineeringEngineering (R0)