Cross-layer design of multi-hop wireless networks

MULTI -hop wireless networks are usually defined as a collection of nodes equipped with radio transmitters, which not only have the capability to communicate each other in a multi-hop fashion, but also to route each others’ data packets. The distributed nature of such networks makes them suitable for a variety of applications where there are no assumed reliable central entities, or controllers, and may significantly improve the scalability issues of conventional single-hop wireless networks. This Ph.D. dissertation mainly investigates two aspects of the research issues related to the efficient multi-hop wireless networks design, namely: (a) network protocols and (b) network management, both in cross-layer design paradigms to ensure the notion of service quality, such as quality of service (QoS) in wireless mesh networks (WMNs) for backhaul applications and quality of information (QoI) in wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of this Ph.D. dissertation, different network settings are used as illustrative examples, however the proposed algorithms, methodologies, protocols, and models are not restricted in the considered networks, but rather have wide applicability. First, this dissertation proposes a cross-layer design framework integrating a distributed proportional-fair scheduler and a QoS routing algorithm, while using WMNs as an illustrative example. The proposed approach has significant performance gain compared with other network protocols. Second, this dissertation proposes a generic admission control methodology for any packet network, wired and wireless, by modeling the network as a black box, and using a generic mathematical 0. Abstract 3 function and Taylor expansion to capture the admission impact. Third, this dissertation further enhances the previous designs by proposing a negotiation process, to bridge the applications’ service quality demands and the resource management, while using WSNs as an illustrative example. This approach allows the negotiation among different service classes and WSN resource allocations to reach the optimal operational status. Finally, the guarantees of the service quality are extended to the environment of multiple, disconnected, mobile subnetworks, where the question of how to maintain communications using dynamically controlled, unmanned data ferries is investigated

A Novel Voice Priority Queue (VPQ) Schedule and Algorithm for VoIP over WLAN Network

The VoIP deployment on Wireless Local Area Networks (WLANs), which is based on IEEE 802.11 standards, is increasing. Currently, many schedulers have been introduced such as Weighted Fair Queueing (WFQ), Strict Priority (SP) General processor sharing (GPS), Deficit Round Robin (DRR), and Contention-Aware Temporally fair Scheduling (CATS). Unfortunately, the current scheduling techniques have some drawbacks on real-time applications and therefore will not be able to handle the VoIP packets in a proper way. The objective of this research is to propose a new scheduler system model for the VoIP application named final stage of Voice Priority Queue (VPQ) scheduler. The scheduler system model is to ensure efficiency by producing a higher throughput and fairness for VoIP packets. In this paper, only the final Stage of the VPQ packet scheduler and its algorithm are presented. Simulation topologies for VoIP traffic were implemented and analyzed using the Network Simulator (NS-2). The results show that this method can achieve a better and more accurate VoIP quality throughput and fairness index over WLANs

QoS evaluation of different TCPs congestion control algorithm using NS2

The success of the current Internet relies to a large extent on cooperation between the users and network. The network signals its current state to the users by marking or dropping packets. The user then strives to maximize the sending rate without causing network congestion. To achieve this, the users implement a flow control algorithm that controls the rate at which data packets are sent into the Internet. More specifically, the Transmission Control Protocol (TCP) is used by the users to adjust the sending rate in response to changing network conditions. In this paper, we focus on the degree of fairness provided to TCP connections by comparing two packet-scheduling algorithms at the router. The first one is FIFO (First In First Out, or Drop-Tail), which is widely used in the current Internet routers because of its simplicity. The second is RED (Random Early Detection), which drops incoming packets at a certain probability