Smart Acknowledgement Distributed Channel Access Scheme for TCP in MANETs

TCP upon wireless networks is most challenging issue because of random losses and ACK interference. Also, TCP suffers from performance declination in terms of creating delay and overhead in network because of poor characteristics of wireless channel. In order to overcome these issues, we proposed a Smart Acknowledgement Distributed Channel Access (SADCA) scheme for TCP in MANETs. In the proposed scheme, first a separate Access Category (AC) for data less TCP acknowledgement packets is used and then it is assigned with highest priority. In this way, delay during transmission of packet can be reduced and also packet can be acknowledged immediately. Also, to increase the performance, delay window size can be adjusted by considering the parameters such as transmission rate, number of hops, and channel occupied ratio (COR). Hence the proposed scheme helps to avoid any kind of delay and overhead for sending TCP acknowledgemen

Detection of selfish manipulation of carrier sensing in 802.11 networks

Recently, tuning the clear channel assessment (CCA) threshold in conjunction with power control has been considered for improving the performance of WLANs. However, we show that, CCA tuning can be exploited by selfish nodes to obtain an unfair share of the available bandwidth. Specifically, a selfish entity can manipulate the CCA threshold to ignore ongoing transmissions; this increases the probability of accessing the medium and provides the entity a higher, unfair share of the bandwidth. We experiment on our 802.11 testbed to characterize the effects of CCA tuning on both isolated links and in 802.11 WLAN configurations. We focus on AP-client(s) configurations, proposing a novel approach to detect this misbehavior. A misbehaving client is unlikely to recognize low power receptions as legitimate packets; by intelligently sending low power probe messages, an AP can efficiently detect a misbehaving node. Our key contributions are: 1) We are the first to quantify the impact of selfish CCA tuning via extensive experimentation on various 802.11 configurations. 2) We propose a lightweight scheme for detecting selfish nodes that inappropriately increase their CCAs. 3) We extensively evaluate our system on our testbed; its accuracy is 95 percent while the false positive rate is less than 5 percent. © 2012 IEEE

Enhancing TCP Performance In Wired-Cum-Wireless Networks

Increasing popularity for mobile devices has prompted industrial and academic research towards improving the performance of wireless applications. Transmission Control Protocol (TCP) plays an important role in defining a network’s performance, and its use in wireless networks has exposed several inadequacies in its operation. Tight coupling of TCP’s error and congestion control mechanisms has proven to be incompatible with the unique characteristics of wireless channels. TCP, designed for wired networks, assumes any loss of packet to be an indication of congestion in the network. Wireless networks exhibit a higher bit error rate, low and varying bandwidth, and disconnections of hosts due to mobility. All of the aforementioned reasons can result in random packet loss which is misinterpreted as a sign of congestion by TCP. Such erroneous triggering of congestion control measures can unnecessarily reduce TCP throughput. In this report, we will delve deeper into TCP’s operation, and discuss its performance issues in wired-cum-wireless networks. We also present a survey of existing schemes that tackle these issues, and introduce a new scheme called TCP-ECN to enhance TCP performance in wireless networks. The essence of the new scheme is to use Explicit Congestion Notification to enable the wireless host to distinguish between wired and wireless losses. Another facet of our scheme is to allow the base station to “freeze” the sender when it notices an imminent disconnection of the mobile host. The objective of TCP-ECN is to insulate the TCP sender from the idiosyncrasies of the wireless channel. We have both simulated and implemented the new scheme. This report details the new scheme in depth, and analyzes the test results obtained

TCP performance enhancement in wireless networks via adaptive congestion control and active queue management

The transmission control protocol (TCP) exhibits poor performance when used in error-prone wireless networks. Remedy to this problem has been an active research area. However, a widely accepted and adopted solution is yet to emerge. Difficulties of an acceptable solution lie in the areas of compatibility, scalability, computational complexity and the involvement of intermediate routers and switches. This dissertation rexriews the current start-of-the-art solutions to TCP performance enhancement, and pursues an end-to-end solution framework to the problem. The most noticeable cause of the performance degradation of TCP in wireless networks is the higher packet loss rate as compared to that in traditional wired networks. Packet loss type differentiation has been the focus of many proposed TCP performance enhancement schemes. Studies conduced by this dissertation research suggest that besides the standard TCP\u27s inability of discriminating congestion packet losses from losses related to wireless link errors, the standard TCP\u27s additive increase and multiplicative decrease (AIMD) congestion control algorithm itself needs to be redesigned to achieve better performance in wireless, and particularly, high-speed wireless networks. This dissertation proposes a simple, efficient, and effective end-to-end solution framework that enhances TCP\u27s performance through techniques of adaptive congestion control and active queue management. By end-to-end, it means a solution with no requirement of routers being wireless-aware or wireless-specific . TCP-Jersey has been introduced as an implementation of the proposed solution framework, and its performance metrics have been evaluated through extensive simulations. TCP-Jersey consists of an adaptive congestion control algorithm at the source by means of the source\u27s achievable rate estimation (ARE) —an adaptive filter of packet inter-arrival times, a congestion indication algorithm at the links (i.e., AQM) by means of packet marking, and a effective loss differentiation algorithm at the source by careful examination of the congestion marks carried by the duplicate acknowledgment packets (DUPACK). Several improvements to the proposed TCP-Jersey have been investigated, including a more robust ARE algorithm, a less computationally intensive threshold marking algorithm as the AQM link algorithm, a more stable congestion indication function based on virtual capacity at the link, and performance results have been presented and analyzed via extensive simulations of various network configurations. Stability analysis of the proposed ARE-based additive increase and adaptive decrease (AJAD) congestion control algorithm has been conducted and the analytical results have been verified by simulations. Performance of TCP-Jersey has been compared to that of a perfect , but not practical, TCP scheme, and encouraging results have been observed. Finally the framework of the TCP-Jersey\u27s source algorithm has been extended and generalized for rate-based congestion control, as opposed to TCP\u27s window-based congestion control, to provide a design platform for applications, such as real-time multimedia, that do not use TCP as transport protocol yet do need to control network congestion as well as combat packet losses in wireless networks. In conclusion, the framework architecture presented in this dissertation that combines the adaptive congestion control and active queue management in solving the TCP performance degradation problem in wireless networks has been shown as a promising answer to the problem due to its simplistic design philosophy complete compatibility with the current TCP/IP and AQM practice, end-to-end architecture for scalability, and the high effectiveness and low computational overhead. The proposed implementation of the solution framework, namely TCP-Jersey is a modification of the standard TCP protocol rather than a completely new design of the transport protocol. It is an end-to-end approach to address the performance degradation problem since it does not require split mode connection establishment and maintenance using special wireless-aware software agents at the routers. The proposed solution also differs from other solutions that rely on the link layer error notifications for packet loss differentiation. The proposed solution is also unique among other proposed end-to-end solutions in that it differentiates packet losses attributed to wireless link errors from congestion induced packet losses directly from the explicit congestion indication marks in the DUPACK packets, rather than inferring the loss type based on packet delay or delay jitter as in many other proposed solutions; nor by undergoing a computationally expensive off-line training of a classification model (e.g., HMM), or a Bayesian estimation/detection process that requires estimations of a priori loss probability distributions of different loss types. The proposed solution is also scalable and fully compatible to the current practice in Internet congestion control and queue management, but with an additional function of loss type differentiation that effectively enhances TCP\u27s performance over error-prone wireless networks. Limitations of the proposed solution architecture and areas for future researches are also addressed

Characterizing and Improving the Reliability of Broadband Internet Access

In this paper, we empirically demonstrate the growing importance of reliability by measuring its effect on user behavior. We present an approach for broadband reliability characterization using data collected by many emerging national initiatives to study broadband and apply it to the data gathered by the Federal Communications Commission's Measuring Broadband America project. Motivated by our findings, we present the design, implementation, and evaluation of a practical approach for improving the reliability of broadband Internet access with multihoming.Comment: 15 pages, 14 figures, 6 table