Packet reordering is generally considered to have negative impact on network performance. In this thesis, the packet reordering is used to assist TCP to recover faster in RED-enabled packet switched networks. The RED queue management prevents networks from congestion by dropping packets with a probability earlier than the time when congestion would actually occur. After a RED router drops a packet, packer reordering is introduced during TCP¡¦s recovery process. A new, simple buffer mechanism, called RED with Recovery Queue or R2Q, is proposed to create this type of packet reordering on behalf of TCP with the objective of accelerating TCP¡¦s recovery and thus improving the overall network performance. In R2Q, the original RED queue is segmented into two sub-queues. The first sub-queue remains the function of the original RED while the second picks up the packets discarded by the first. Then, scheduling of the second-chance transmission of the packets in the secondary sub-queue is the key in achieving our objective. In this thesis, we considered two scheduling schemes: priority and weighted round robin. To evaluate the performance of R2Q with these two scheduling schemes, we implemented and evaluated them in the J-Sim network simulation environment. The well-known dumbbell network topology was adopted and we varied different parameters, such as round-trip time, bottleneck bandwidth, buffer size, WRR weight and so on, in order to understand how R2Q performs under different network configurations. We found that R2Q is more effective in the networks of sufficient buffer and larger product of RTT and bandwidth. With WRR, we may achieve as much as 2% improvement over the original RED. The improvement may be more in networks of even higher speed.

<p>Much work has been done in simulating traditional cellular networks. But with the incoming of ad-hoc network technology, the next generation networks will employ hybrid network architectures using both cellular and ad-hoc networking concepts. </p><p>We investigate how to create a simulator being able to simulate a hybrid wireless network. This involves setting up a cellular network and an ad-hoc network respectively. However, the most important thing is how to integrate them seamlessly. </p><p>Fortunately, there has already been a simulator called SIMRA which simulates a UMTS cellular network. Therefore, this thesis work is greatly simplified as how to extend and improve SIMRA to implement a simulator for hybrid wireless network. We selected J-sim as the developing platform for our simulator and our development was greatly based on the wireless package provided by the latest version of J-sim. </p><p>To evaluate the new simulator, different resource allocation algorithms were run against it and the results were compared to those generated by earlier extensions to SIMRA under the same simulation settings. It showed that the resource allocation algorithms behaved similarly under the hybrid wireless network environment. Nevertheless, there are some discrepancies in behaviors of algorithms used for evaluation that still need to be studied.</p>

Conventional TCP is window based, which exploits the sliding window mechanism to conduct the flow control. It increases the sending window additively and decreases the sending window multiplicatively in response to successful transmission and, packet loss/timeout events respectively. While the mechanism works quite well in normal networks, TCP can hardly reach the ideal bandwidth utilization in long fat networks (LFNs) due to long delay and bursts of packet losses. Besides, as wireless and mobile computing has become popular today, packet loss in such networks may occur due to noise, interference and handoff across different domains. TCP could not react to different situations effectively as it sees all packet losses as an indication of network congestion. In this thesis, we proposed a new transmission control mechanism called Active Rate Anchoring TCP (ARCH-TCP). In ARCH-TCP, we explicitly integrate bandwidth measurement into TCP to solve the aforementioned problem. Specifically, we exploit packet-pair measurement to quickly estimate bandwidth share and then RTT variation is observed to compensate measurement error. We built the model in J-Sim network simulator to evaluate the effectiveness of our proposal. We found that ARCH-TCP can react to network conditions quickly and precisely in both wired and wireless networks and both in the normal networks and LFNs.

Much work has been done in simulating traditional cellular networks. But with the incoming of ad-hoc network technology, the next generation networks will employ hybrid network architectures using both cellular and ad-hoc networking concepts. We investigate how to create a simulator being able to simulate a hybrid wireless network. This involves setting up a cellular network and an ad-hoc network respectively. However, the most important thing is how to integrate them seamlessly. Fortunately, there has already been a simulator called SIMRA which simulates a UMTS cellular network. Therefore, this thesis work is greatly simplified as how to extend and improve SIMRA to implement a simulator for hybrid wireless network. We selected J-sim as the developing platform for our simulator and our development was greatly based on the wireless package provided by the latest version of J-sim. To evaluate the new simulator, different resource allocation algorithms were run against it and the results were compared to those generated by earlier extensions to SIMRA under the same simulation settings. It showed that the resource allocation algorithms behaved similarly under the hybrid wireless network environment. Nevertheless, there are some discrepancies in behaviors of algorithms used for evaluation that still need to be studied.

This thesis deals with the issue of wireless sensor networks and communication protocols. Is explained of what the network is composed, what standards are used and in what sectors are most often used. The main scope of work is to introduce with the localization algorithms using in WSN. Algorithms are clearly divided into groups according to the methods used. In work is describes the structure used simulation tools J-Sim, for creating a wireless sensor network. To create network will be then applied different localization algorithms, which must first be implemented in a simulator using Java code. All generated classes and the algorithms are detailed described in the work. Results from simulations are detailed and graphically displays for individual localization algorithms.