A survey of performance enhancement of transmission control protocol (TCP) in wireless ad hoc networks

This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2011 Springer OpenTransmission control protocol (TCP), which provides reliable end-to-end data delivery, performs well in traditional wired network environments, while in wireless ad hoc networks, it does not perform well. Compared to wired networks, wireless ad hoc networks have some specific characteristics such as node mobility and a shared medium. Owing to these specific characteristics of wireless ad hoc networks, TCP faces particular problems with, for example, route failure, channel contention and high bit error rates. These factors are responsible for the performance degradation of TCP in wireless ad hoc networks. The research community has produced a wide range of proposals to improve the performance of TCP in wireless ad hoc networks. This article presents a survey of these proposals (approaches). A classification of TCP improvement proposals for wireless ad hoc networks is presented, which makes it easy to compare the proposals falling under the same category. Tables which summarize the approaches for quick overview are provided. Possible directions for further improvements in this area are suggested in the conclusions. The aim of the article is to enable the reader to quickly acquire an overview of the state of TCP in wireless ad hoc networks.This study is partly funded by Kohat University of Science & Technology (KUST), Pakistan, and the Higher Education Commission, Pakistan

Resilient networking in wireless sensor networks

This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing functionalities. The cryptography alone is not enough to defend against multiple attacks due to the node compromise. Therefore, we need more algorithmic solutions. In this report, we focus on the behavior of routing protocols to determine which properties make them more resilient to attacks. Our aim is to find some answers to the following questions. Are there any existing protocols, not designed initially for security, but which already contain some inherently resilient properties against attacks under which some portion of the network nodes is compromised? If yes, which specific behaviors are making these protocols more resilient? We propose in this report an overview of security strategies for WSNs in general, including existing attacks and defensive measures. In this report we focus at the network layer in particular, and an analysis of the behavior of four particular routing protocols is provided to determine their inherent resiliency to insider attacks. The protocols considered are: Dynamic Source Routing (DSR), Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing (RWR)

Survey of unified approaches to integrated-service networks

The increasing demand for communication services, coupled with recent technological advances in communication media and switching techniques, has resulted in a proliferation of new and expanded services. Currently, networks are needed which can transmit voice, data, and video services in an application-independent fashion. Unified approaches employ a single switching technique across the entire network bandwidth, thus, allowing services to be switched in an application-independent manner. This paper presents a taxonomy of integrated-service networks including a look at N-ISDN, while focusing on unified approaches to integrated-service networks.The two most promising unified approaches are burst and fast packet switching. Burst switching is a circuit switching-based approach which allocates channel bandwidth to a connection only during the transmission of "bursts" of information. Fast packet switching is a packet switching-based approach which can be characterized by very high transmission rates on network links and simple, hardwired protocols which match the rapid channel speed of the network. Both approaches are being proposed as possible implementations for integrated-service networks. We survey these two approaches, and also examine the key performance issues found in fast packet switching. We then present the results of a simulation study of a fast packet switching network

Examination of the seepage face boundary condition in subsurface and coupled surface/subsurface hydrological models

A seepage face is a nonlinear dynamic boundary that strongly affects pressure head distributions, water table fluctuations, and flow patterns. Its handling in hydrological models, especially under complex conditions such as heterogeneity and coupled surface/subsurface flow, has not been extensively studied. In this paper, we compare the treatment of the seepage face as a static (Dirichlet) versus dynamic boundary condition, we assess its resolution under conditions of layered heterogeneity, we examine its interaction with a catchment outlet boundary, and we investigate the effects of surface/subsurface exchanges on seepage faces forming at the land surface. The analyses are carried out with an integrated catchment hydrological model. Numerical simulations are performed for a synthetic rectangular sloping aquifer and for an experimental hillslope from the Landscape Evolution Observatory. The results show that the static boundary condition is not always an adequate stand-in for a dynamic seepage face boundary condition, especially under conditions of high rainfall, steep slope, or heterogeneity; that hillslopes with layered heterogeneity give rise to multiple seepage faces that can be highly dynamic; that seepage face and outlet boundaries can coexist in an integrated hydrological model and both play an important role; and that seepage faces at the land surface are not always controlled by subsurface flow. The paper also presents a generalized algorithm for resolving seepage face outflow that handles heterogeneity in a simple way, is applicable to unstructured grids, and is shown experimentally to be equivalent to the treatment of atmospheric boundary conditions in subsurface flow models