Design and Simulation of Throughput based QoS MANET Routing for K-color Multiple Packet Reception Devices

Abstract: Adhoc network is a self configuring mutually cooperated network of autonomous nodes. We consider the case of a Mobile Ad-Hoc Network (MANET), with nodes that have multiple packet reception (MPR) capability.MPR is achieved by properly encoding the input signal into phases or segments to obtain better reception. such a segmentation of the incoming signal can be either a series of time-overlapping windows or a non time overlapping window, each to be processed by an algorithm that separates each transmitter signal. In this work we focus on the effect of varying the overlapping length. In this work we addressed the impact caused on the network throughput and on the relative computational complexity when the overlapping-length between consecutive analysis windows is varied, which has not been previously studied. Further considering Network Throughput obtained through network coding in MPR as a QoS parameter for route discovery, we obtain the best path which is proved to provide better result in termns of throughput, Packet delivery ratio and control overhead

Topology-Transparent Scheduling in Mobile Ad Hoc Networks With Multiple Packet Reception Capability

Recent advances in the physical layer have enabled wireless devices to have multiple packet reception (MPR) capability, which is the capability of decoding more than one packet, simultaneously, when concurrent transmissions occur. In this paper, we focus on the interaction between the MPR physical layer and the medium access control (MAC) layer. Some random access MAC protocols have been proposed to improve the network performance by exploiting the powerful MPR capability. However, there are very few investigations on the schedule-based MAC protocols. We propose a novel m-MPR-l-code topology-transparent scheduling ((m, l)-TTS) algorithm for mobile ad hoc networks with MPR, where m indicates the maximum number of concurrent transmissions being decoded, and l is the number of codes assigned to each user. Our algorithm can take full advantage of the MPR capability to improve the network performance. The minimum guaranteed throughput and average throughput of our algorithm are studied analytically. The improvement of our (m, l)-TTS algorithm over the conventional topology-transparent scheduling algorithms with the collision-based reception model is linear with m. The simulation results show that our proposed algorithm performs better than slotted ALOHA as well.published_or_final_versio

Advanced PHY/MAC Design for Infrastructure-less Wireless Networks

Wireless networks play a key role in providing information exchange among distributed mobile devices. Nowadays, Infrastructure-Less Wireless Networks (ILWNs), which include ad hoc and sensor networks, are gaining increasing popularity as they do not need a fixed infrastructure. Simultaneously, multiple research initiatives have led to different findings at the physical (PHY) layer of the wireless communication systems, which can effectively be adopted in ILWNs. However, the distributed nature of ILWNs demand for different network control policies that should have into account the most recent findings to increase the network performance. This thesis investigates the adoption of Multi-Packet Reception (MPR) techniques at the PHY layer of distributed wireless networks, which is itself a challenging task due to the lack of a central coordinator and the spatial distribution of the nodes. The work starts with the derivation of an MPR system performance model that allows to determine optimal points of operation for different radio conditions. The model developed and validated in this thesis is then used to study the performance of ILWNs in high density of transmitters and when the spectrum can be sensed a priori (i.e. before each transmission). Based on the theoretical analysis developed in the thesis, we show that depending on the propagation conditions the spectrum sensing can reduce the network throughput to a level where its use should be avoided. At the final stage, we propose a crosslayered architecture that improves the capacity of an ILWN. Different Medium Access Control (MAC) schemes for ILWNs adopting MPR communications are proposed and their performance is theoretically characterized. We propose a cross-layer optimization methodology that considers the features of the MPR communication scheme together with the MAC performance. The proposed cross-layer optimization methodology improves the throughput of ILWNs, which is validated through theoretical analysis and multiple simulation results

Timing estimation and resynchronization for amplify-and-forward communication systems

This paper proposes a general framework to effectively estimate the unknown timing and channel parameters, as well as design efficient timing resynchronization algorithms for asynchronous amplify-and-forward (AF) cooperative communication systems. In order to obtain reliable timing and channel parameters, a least squares (LS) estimator is proposed for initial estimation and an iterative maximum-likelihood (ML) estimator is derived to refine the LS estimates. Furthermore, a timing and channel uncertainty analysis based on the CramrRao bounds (CRB) is presented to provide insights into the system uncertainties resulted from estimation. Using the parameter estimates and uncertainty information in our analysis, timing resynchronization algorithms that are robust to estimation errors are designed jointly at the relays and the destination. The proposed framework is developed for different AF systems with varying degrees of timing misalignment and channel uncertainties and is numerically shown to provide excellent performances that approach the synchronized case with perfect channel information. © 2006 IEEE.published_or_final_versio

Root-MUSIC-based methods for blind network-assisted diversity multiple access

Packet collisions in wireless networks degrade the throughput and impede the system performance. The collided packets are typically corrupted and get discarded. Channelization methods avoid collisions through fixed assignment of communication resources to the system users, but they do not take into account the randomness of packet arrivals. Statistical multiplexing optimally adapts the allocation of resources to the instantaneous traffic demands of the users. However, it is only possible in the downlink wherein the data streams are managed by one station. Random-access methods mimic statistical multiplexing by dynamically assigning resources to users. A slot is wasted if the channel incurs a collision, and the collided packets have to be retransmitted. First, we present a cross-layer design for providing multiple access to a shared wireless link. While retransmissions are controlled by the medium access control (MAC) layer, this creates sufficient diversity to recover the collided packets in the physical (PHY) layer. Both the number and identities of the involved transmitters in a collision are unknown to the receiver. The signal separation is done blindly using root-MUSIC-like algorithms. We solve the collision resolution problem in four network-operation modes: synchronous blocking mode, synchronous non-blocking mode, asynchronous blocking mode and asynchronous non-blocking mode. Second, we evaluate the decoding performance of the algorithms in block-fading channels with additive white Gaussian noise. We analytically demonstrate the effect of signal-to-noise ratio and the number of retransmissions on the signal separation capability of the proposed methods for a given number of collided packets. Third, we evaluate the network throughput and mean packet queueing delay for the proposed collision resolution algorithms analytically and numerically. We derive conditions for stability of the queueing network as function of the mean packet arrival rates.Electrical and Computer Engineerin

A Cross Layer Routing Protocol for OFDMA Based Mobile Ad Hoc Networks.

PhDMobile ad hoc networks are of growing interest because of their unique characteristics and advantages in many practical applications. QoS provision acts as a major challenge in the routing protocol design in the real-world mobile ad hoc networks, especially for the real-time services. OFDM is a new technology which has many advantages over the other modulation schemes. Because of its prominent features, many popular wireless standards have adopted it as physical layer modulation, such as IEEE 802.11 series, WiMAX, 3GPP LTE etc, and it is extended to multiuser environment known as OFDMA. So far none of the existing ad hoc routing protocols fully account for the OFDMA based mobile ad hoc networks. In this thesis, a QoS routing protocol is proposed for OFDMA based mobile ad hoc networks. A signal strength-based sub-channel allocation scheme is proposed in the routing protocol aiming to reduce the signalling overhead and cochannel interference. The performance of the proposed routing protocol is compared with other alternative proposals through simulations using OPNET simulator. Moreover, a partial time synchronization and a null subcarrier based frequency synchronization algorithms are also proposed for OFDMA based ad hoc network to further support and facilitate the proposed sub-channel allocation scheme and routing protocol

Security primitives for ultra-low power sensor nodes in wireless sensor networks

The concept of wireless sensor network (WSN) is where tiny devices (sensor nodes), positioned fairly close to each other, are used for sensing and gathering data from its environment and exchange information through wireless connections between these nodes (e.g. sensor nodes distributed through out a bridge for monitoring the mechanical stress level of the bridge continuously). In order to easily deploy a relatively large quantity of sensor nodes, the sensor nodes are typically designed for low price and small size, thereby causing them to have very limited resources available (e.g. energy, processing power). Over the years, different security (cryptographic) primitives have been proposed and refined aiming at utilizing modern processor’s power e.g. 32-bit or 64-bit operation, architecture such as MMX (Multi Media Extension) and etc. In other words, security primitives have targeted at high-end systems (e.g. desktop or server) in software implementations. Some hardware-oriented security primitives have also been proposed. However, most of them have been designed aiming only at large message and high speed hashing, with no power consumption or other resources (such as memory space) taken into considerations. As a result, security mechanisms for ultra-low power (<500µW) devices such as the wireless sensor nodes must be carefully selected or designed with their limited resources in mind. The objective of this project is to provide implementations of security primitives (i.e. encryption and authentication) suitable to the WSN environment, where resources are extremely limited. The goal of the project is to provide an efficient building block on which the design of WSN secure routing protocols can be based on, so it can relieve the protocol designers from having to design everything from scratch. This project has provided three main contributions to the WSN field. Provides analysis of different tradeoffs between cryptographic security strength and performances, which then provide security primitives suitable for the needs in a WSN environment. Security primitives form the link layer security and act as building blocks for higher layer protocols i.e. secure routing protocol. Implements and optimizes several security primitives in a low-power microcontroller (TI MSP430F1232) with very limited resources (256 bytes RAM, 8KB flash program memory). The different security primitives are compared according to the number of CPU cycles required per byte processed, specific architectures required (e.g. multiplier, large bit shift) and resources (RAM, ROM/flash) required. These comparisons assist in the evaluation of its corresponding energy consumption, and thus the applicability to wireless sensor nodes. Apart from investigating security primitives, research on various security protocols designed for WSN have also been conducted in order to optimize the security primitives for the security protocols design trend. Further, a new link layer security protocol using optimized security primitives is also proposed. This new protocol shows an improvement over the existing link layer security protocols. Security primitives with confidentiality and authenticity functions are implemented in the TinyMote sensor nodes from the Technical University of Vienna in a wireless sensor network. This is to demonstrate the practicality of the designs of this thesis in a real-world WSN environment. This research has achieved ultra-low power security primitives in wireless sensor network with average power consumption less than 3.5 µW (at 2 second packet transmission interval) and 700 nW (at 5 second packet transmission interval). The proposed link layer security protocol has also shown improvements over existing protocols in both security and power consumption.Dissertation (MEng (Computer Engineering))--University of Pretoria, 2008.Electrical, Electronic and Computer Engineeringunrestricte