A Utility-based Framework for Assessing Fairness Schemes in Ad-Hoc Networks

Fairness in multihop ad hoc networks has received considerable attention in the literature. A plethora of protocols have been proposed, which compute the ``optimal'' bit rates of the transmitting mobile nodes over short time-scales so that a certain fairness criterion is met. However, there has been limited research on the impact of the varying short-term allocations of these protocols due to nodes mobility on the user-perceived QoS (and social welfare) for services of long duration. In this paper, we introduce a utility-based framework, based on {\em QoS-aware history-dependent} utility functions. These functions quantify the satisfaction that the users of the MANETs obtain from the way their long-lived service sessions are allocated bandwidth, due to the behavior of the fairness protocols proposed for ad hoc networks. Finally, we demonstrate the framework's usefulness, by performing a comparative assessment of the fairness protocol of our previous work with the standard IEEE 802.11

Adaptive fair channel allocation for QoS enhancement in IEEE 802.11 wireless LANs

The emerging widespread use of real-time multimedia applications over wireless networks makes the support of quality of service (QoS) a key problem. In this paper, we focus on QoS support mechanisms for IEEE 802.11 wireless ad-hoc networks. First, we review limitations of the upcoming IEEE 802.11e enhanced DCF (EDCF) and other enhanced MAC schemes that have been proposed to support QoS for 802.11 ad-hoc networks. Then, we describe a new scheme called adaptive fair EDCF that extends EDCF, by increasing the contention window during deferring periods when the channel is busy, and by using an adaptive fast backoff mechanism when the channel is idle. Our scheme computes an adaptive backoff threshold for each priority level by taking into account the channel load. The new scheme significantly improves the quality of multimedia applications. Moreover, it increases the overall throughput obtained both in medium and high load cases. Simulution results show that our new scheme outperforms EDCF and other enhanced schemes. Finally, we show that the adaptive fair EDCF scheme achieves a high degree of fairness among applications of the same priority level

Distributed scheduling with end-to-end compensation in multihop ad hoc networks

In this paper, we investigate the problem of providing QoS to end-to-end flows in multihop ad hoc networks with channel errors through packet scheduling. Each flow is associated with some QoS requirement, which is requested and granted in the form of a desired service rate. The achieved rate is estimated at the destination and fed back to the source periodically. Both the desired rate and achieved rate of a multihop flow are piggybacked on the packets of the flow and propagated from the source node to all its downstream relaying nodes. With such information, a compensation-capable scheduling algorithm originally designed for infrastructured wireless networks can be adapted to each ad hoc node for compensating a lagging flow, i.e., a flow with the achieved rate smaller than the desired rate. We propose the feedback and propagation mechanism as an end-to-end compensation framework, which is the key contribution of this work. We use BGFS-EBA, a scheduling algorithm for infrastructured wireless networks, as an example to demonstrate how such an algorithm is adapted to ad hoc networks within the proposed framework. Our simulation results show that the proposed mechanism maintains outcome fairness and compensate flows that suffer sporadic bursty channel errors effectively. © 2008 IEEE.published_or_final_versionThe 19th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, Cannes, France, 15-18 September 2008. In Proceedings of 19th IEEE PIMRC, 2008, p. 1-

Hop-Based dynamic fair scheduler for wireless Ad-Hoc networks

In a typical multihop Ad-Hoc network, interference and contention increase when flows transit each node towards destination, particularly in the presence of cross-traffic. This paper observes the relationship between throughput and path length, self-contention and interference and it investigates the effect of multiple data rates over multiple data flows in the network. Drawing from the limitations of the 802.11 specification, the paper proposes a scheduler named Hop Based Multi Queue (HBMQ), which is designed to prioritise traffic based on the hop count of packets in order to provide fairness across different data flows. The simulation results demonstrate that HBMQ performs better than a Single Drop Tail Queue (SDTQ) scheduler in terms of providing fairness. Finally, the paper concludes with a number of possible directions for further research, focusing on cross-layer implementation to ensure the fairness is also provided at the MAC layer. © 2013 IEEE

ANALYSIS OF MULTI-CHANNEL TWO-DIMENSIONAL PROBABILITY CSMA AD HOC NETWORK PROTOCOL BASED THREE-WAY HANDSHAKE MECHANISM

In wireless Ad Hoc networks, large number and flexible mobility of terminals lead to the rarity of wireless channel resources. Also the hidden and exposed terminal problem exists in the Ad Hoc network which is the major factors restricting its development and applying. Considering these factors, this paper proposes a new CSMA protocol: multi-channel two-dimensional probability CSMA for wireless Ad Hoc network protocol based on three-way handshake mechanism, and analyzes the system throughput, delay of information packet, energy consumption and other properties under the control of the proposed protocol. By using the cycle analysis method, computer simulation results not only verify the theoretical analysis, but also show that the protocol has the optimum performance. The proposed protocol can not only reduce the collision probability of information packets to some extent, improving the channel utilization, reducing the waste of channel resources, but also achieve the balancing of load in a variety of wireless Ad Hoc network services, meeting the needs by different priorities with different QoS, and ensuring the systematic efficiency and fairness

ANALISIS ALGORITMA PENJADWALAN DEFICIT ROUND ROBIN (DRR) DAN SMOOTHED ROUND ROBIN (SRR) PADA JARINGAN MOBILE AD HOC (MANET) UNTUK LAYANAN TRIPLE PLAY

ABSTRAKSI: Mobile Ad Hoc Network atau MANET adalah jaringan wireless yang terdiri dari kumpulan mobile node (mobile station) yang bersifat dinamik dan spontan, dapat diaplikasikan di mana pun tanpa menggunakan jaringan infrastruktur (seluler ataupun PSTN) yang telah ada dan untuk jaringan yang sifatnya temporer. Mobilitas dari node-nodenya dan kecenderungan error pada media wirelessnya menjadi permasalahan yang terjadi pada jaringan mobile ad hoc, permasalahan-permasalahan tersebut dapat meningkatkan jumlah delay, packet loss dan mengurangi throughput. Maka dari itu untuk menganalisis paramter-parameter performansi jaringan tersebut diperlukan algoritma penjadwalan paket.Dalam Tugas Akhir ini dilakukan penelitian performansi jaringan mobile ad hoc dalam mendukung layanan triple play dengan cara menganalisis nilai parameter-parameter QoS seperti delay, Packet Loss, throughput, fairness index dan jitter. Untuk mengukur parameter-parameter QoS tersebut dilakukan simulasi scheduling Deficit Round Robin (DRR) dan Smoothed Round Robin (SRR) pada layanan file transfer (data), video streaming (video) dan VOIP (suara).Pada penelitian ini didapatkan hasil masing-masing algoritma scheduling memberikan performansi yang berbeda-beda dalam hal nilai throughput, packet loss, delay dan jitter. Sedangkan untuk fairness index, semua algoritma memberikan performansi yang baik karena masih dibawah nilai maksimal FI yaitu. Untuk kecepatan node 5.6 m/s atau setara dengan kecepatan user berkendaraan 20 km/jam, baik DRR maupun SRR memberikan performansi yang buruk untuk layanan video dan suara. Dari hasil tersebut dapat disimpulkan bahwa untuk jaringan mobile ad hoc tidak disarankan untuk kecepatan user berkendaraan mengakses video streaming dan VOIP. Dari skenario fairness index, hasil FI di node 20 untuk semua layanan memberikan nilai hampir mencapai nilai 1, yang artinya kedua algoritma tersebut sudah adil dalam melayani paket terutama pada paket layanan yang sifatnya real time.Kata Kunci : Mobile Ad Hoc Network (MANET), scheduling, QOS, DRR, SRRABSTRACT: Mobile Ad hoc Network or MANET is a wireless network that consists of some mobile nodes (mobile station) which are dynamic and spontaneous, can be applied anywhere without using the network infrastructure (cellular or PSTN) that already exist and for the temporary network. The problems that occurred in mobile ad hoc are mobility of the nodes and inclination error in media, these problems can increase the amount of delay, packet loss and reduce throughput. Therefore, to analyze the parameters network performance with packet scheduling algorithms.In this Final Project is studied mobile ad hoc network performance to support of triple play services by analyzing the value of QoS parameters such as delay, packet loss, throughput, fairness index and jitter. To measure that can be simulated by scheduling Deficit Round Robin (DRR) and smoothed Round Robin (SRR) with the type of services are file transfer (data), video streaming (video) and VOIP (voice).In this study, the results are every scheduling algorithm give the difference perform like throughput, packet loss, delay and jitter. Beside that for the fairness index, all of scheduling algorithm give the best perform because the value of FI still at under maximal. For node with speed 5.6 m / s or like a speed of user driving, both DRR and SRR give a bad performance for video and voice services. From these results it can be concluded that for mobile ad hoc networks are not recommended for speed driving users to access video streaming and VOIP. From of the scenario fairness index, the results of FI at node 20 for all services give the value almost reaches 1, which means that the two algorithms has been sent packet with fair, especially on real time services.Keyword: Mobile Ad Hoc Network (MANET), scheduling, QOS, DRR, SR

Queue utilization with hop based enhanced arbitrary inter frame spacing MAC for saturated ad HOC networks

© 2015 IEEE. Path length of a multi hop Ad Hoc networks has an adverse impact on the end-to-end throughput especially during network saturation. The success rate of forwarding packets towards destination is limited due to interference, contention, limited buffer space, and bandwidth. Real time applications streaming data fill the buffer space at a faster rate at the source and its nearby forwarding nodes since the channel is shared. The aim of this paper is to increase the success rate of forwarding the packets to yield a higher end-to-end throughput. In order to reduce loss of packets due to buffer overflow and enhance the performance of the network for a saturated network, a novel MAC protocol named Queue Utilization with Hop Based Enhanced Arbitrary Inter Frame Spacing based (QU-EAIFS) MAC is proposed for alleviating the problems in saturated Ad Hoc networks. The protocol prioritises the nodes based on its queue utilization and hops travelled by the packet and it helps achieving higher end-toend performance by forwarding the packets with higher rate towards the destination during network saturation. The proposed MAC enhances the end-to-end performance by approximately 40% and 34% for a 5hop and 6hop communication respectively in a chain topology as compared to the standard IEEE802.11b. The performance of the new MAC also outperforms the performance of IEEE 802.11e MAC. In order to validate the protocol, it is also tested with short hops and varying packet sizes and more realistic random topologies

Adaptive Resource Control in 2-hop Ad-Hoc Networks

This paper presents a simple resource control\ud mechanism with traffic scheduling for 2-hop ad-hoc networks, in\ud which the Request-To-Send (RTS) packet is utilized to deliver\ud feedback information. With this feedback information, the\ud Transmission Opportunity (TXOP) limit of the sources can be\ud controlled to balance the traffic. Furthermore, a bottleneck\ud transmission scheduling scheme is introduced to provide fairness\ud between local and forwarding flows. The proposed mechanism is\ud modeled and evaluated using the well-known 20-sim dynamic\ud system simulator. Experimental results show that a fairer and\ud more efficient bandwidth utilization can be achieved than\ud without the feedback mechanism. The use of the structured and\ud formalized control-theoretical modeling framework has as\ud advantage that results can be obtained in a fast and efficient way