Topology of a network greatly affects the network performance. Depending on the purpose of a network, a specific topology may perform much better than any other topologies. Since the ad hoc networks are formed for a specific purpose, determining, and constructing the network topology based on the application requirements will enhance system performance. This paper proposes Bluetooth scatternet forming protocol in which the network topology is determined by three parameters. The parameters affecting the topology are the number of maximum slaves in a piconet, the number of maximum piconets that a gateway Bluetooth device can service, and the number of loops needed in the formed scatternet. These parameters can be read from a script file prior to the network formation. This process of reading the important parameters from the file would give users freedom in determining the network topology. The proposed protocol also includes a role negotiation process to accommodate different capabilities of the participating devices. The negotiation process of the protocol allows the resource-limited nodes to participate in the network. Different types of scatternet topologies like star, mesh, ring and line can be formed by specifying the parameters. This paper also discusses theoretical information necessary for calculating network topologies in detail. The protocol is verified with help of simulations, and implementations using commercially available Bluetooth devices. The detailed results are also presented in this paper.

The IEEE 802.11 protocol is one of the most important standards for Wireless Local Area Networks. The primary MAC protocol of 802.11 is the distributed coordination function (DCF), which is Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) with binary slotted exponential backoff scheme. The basic access and the RTS/CTS access mechanisms are the two channel access methods defined in DCF. In real work environments, the common channel access method of 802.11 is the coexistence of the above two mechanisms, i.e., packets longer than a given threshold RTSthreshold are transmitted according to the RTS/CTS mechanism, otherwise, they are transmitted by means of basic mechanism. The common mechanism is called as hybrid access mechanism in this paper. Few analytical models have been proposed to evaluate the hybrid access mechanism up to now. The necessary condition which enables the hybrid mechanism to work is that the packets must be variable. But, almost all analytical models proposed for 802.11 DCF assume that the packet size is fix, so they can not study the hybrid access method. In this paper, we propose a detailed analytical model to evaluate the saturation performance of the hybrid access mechanism, in the assumption that the packet lengthes are sampled from a general distribution function f(x). Both the throughput and the delay performances are concerned. Our model is validated by extensive simulations. By means of the proposed model, we compare the performances of the above three mechanisms, i.e., basic, RTS/CTS and hybrid, under different network scenarios. Numerical results show that the hybrid access mechanism is the best choice in almost all scenarios.

One of the disadvantages of compressed data is their vulnerability, that is, even a single corrupted bit in compressed data may destroy the decompressed data completely. Therefore, Variable-to-Fixed length Arithmetic Coding, or VFAC, with error detecting capability is discussed. However, implementable error recovery method for compressed data has never been proposed. This paper proposes Burst Error Recovery Variable-to-Fixed length Arithmetic Coding, or BERVFAC, as well as Error Detecting Variable-to-Fixed length Arithmetic Coding, or EDVFAC. Both VFAC schemes achieve VF coding by inserting the internal states of the decompressor into compressed data. The internal states consist of width and offset of the sub-interval corresponding to the decompressed symbol and are also used for error detection. Convolutional operations are applied to encoding and decoding in order to propagate errors and improve error control capability. The proposed EDVFAC and BERVFAC are evaluated by theoretical analysis and computer simulations. The simulation results show that more than 99.99% of errors can be detected by EDVFAC. For BERVFAC, over 99.95% of l-burst errors can be corrected for l 32 and greater than 99.99% of other errors can be detected. The simulation results also show that the time-overhead necessary to decode the BERVFAC is about 12% when 10% of the received words are erroneous.

Dly-ACK scheme in IEEE 802.15.3 MAC is designed to reduce the overhead of the ACK frame in MAC layer and improve the channel utilization. However, how to using the Dly-ACK is open for implementation. In this paper, we propose an adaptive Dly-ACK scheme for both TCP and UDP traffic. We first point out the problems of applying fixed Dly-ACK scheme to these two traffic scenarios and show that the system performance is rather poor and the causes of these problems are presented. Based on our observations, two enhancement mechanisms for fixed Dly-ACK are then proposed. The first one is to request the Dly-ACK frame adaptively or change the burst size of Dly-ACK according to the transmitter queue status. The second is a retransmission counter to enable the destination DEV to deliver the MAC data frames to upper layer timely and orderly. Simulation results show that, with our enhancements, the system performance can be improved significantly compared with the conventional Imm-ACK and fixed Dly-ACK. We also investigate the impacts of some important parameters such as the buffer size on the system performance. Some important guidelines for the Dly-ACK design are given. Finally, it is worth to point out that our Dly-ACK enhancements are compatible with the standard and it is transparent to the upper layer protocols, i.e., either UDP or TCP.