On the Smoothing Factor for Rate Adaptation in IEEE 802.11b/g Mobile Multi-Hop Networks

Date

2009-01-01

Author

Zhou, Jinglong
Onur, Ertan
Jacobsson, Martin
Niemegeers, Ignas

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

163
views

0
downloads

IEEE 802.11b/g networks support multiple rates and rate adaptation mechanisms provide the ability to select the adequate rate intelligently. Prior work on the rate-adaptation focuses on stationary scenarios, such as mesh networks. The effect of the smoothing of the rate adaptation is not a well-studied topic in the mobile scenarios such as IEEE 802.11 multi-hop networks. In this paper, we use an experimental method to evaluate the one-hop performance and the routing decisions of a well-known rate adaptation mechanism referred as the SampleRate algorithm. In the experiments, the impact of the smoothing factor on the rate adaptation is analyzed based on throughput comparison. Smaller smoothing factors lead to larger throughput improvement and faster response when the channel is dynamic.

Subject Keywords

Computer science, Hardware & architecture, Engineering, Telecommunications, IEEE 802.11b/g mobile multi-hop networks

URI

https://hdl.handle.net/11511/38946

DOI

https://doi.org/10.1109/siu.2009.5136376

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Improving performance of network intrusion detection systems through concurrent mechanisms Atakan, Mustafa; Şener, Cevat; Department of Computer Engineering (2003) As the bandwidth of present networks gets larger than the past, the demand of Network Intrusion Detection Systems (NIDS) that function in real time becomes the major requirement for high-speed networks. If these systems are not fast enough to process all network traffic passing, some malicious security violations may take role using this drawback. In order to make that kind of applications schedulable, some concurrency mechanism is introduced to the general flowchart of their algorithm. The principal aim is...
A Novel Link Quality Assessment Method for Mobile Multi-Rate Multi-Hop Wireless Networks Zhou, Jinglong; Jacobsson, Martin; Onur, Ertan; Niemegeers, Ignas (2009-01-01) Accurate and fast wireless link quality assessment (LQA) for wireless channels would bring huge benefits for mobile multi-hop and multi-rate wireless ad hoc and sensor networks in the form of improved end-to-end performance. In this paper, we propose a novel LQA method based on cross-layer information. The method is implemented in a real test-bed, which is based on IEEE 802.11b/g, and achieved a significant LQA improvement up to 50% in mobile scenarios without introducing overhead. The effectiveness of accu...
A new approach for the scalable intrusion detection in high-speed networks Şahin, Ümit Burak; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2007) As the networks become faster and faster, the emerging requirement is to improve the performance of the Intrusion Detection and Prevention Systems (IDPS) to keep up with the increased network throughput. In high speed networks, it is very difficult for the IDPS to process all the packets. Since the throughput of IDPS is not improved as fast as the throughput of the switches and routers, it is necessary to develop new detection techniques other than traditional techniques. In this thesis we propose a rule-ba...
A comparative study of evolutionary network design Kalkan, Sinan; Şehitoğlu, Onur Tolga; Üçoluk, Göktürk; Department of Computer Engineering (2003) In network design, a communication network is optimized for a given set of parameters like cost, reliability and delay. This study analyzes network design problem using Genetic Algorithms in detail and makes comparison of different approaches and representations. Encoding of a problem is one of the most crucial design choices in Genetic Algorithms. For network design problem, this study compares adjacency matrix representation with list of edges representation. Also, another problem is defining a fair fitne...
A simulation study of scheduling algorithms for packet switching networks Babur, Özgür; Baykal, Buyurman; Department of Electrical and Electronics Engineering (2003) A scheduling algorithm has the primary role in implementing the quality of service guaranteed to each flow by managing buffer space and selecting which packet to send next with a fair share of network. In this thesis, some scheduling algorithms for packet switching networks are studied. For evaluating their delay, jitter and throughput performances, a discrete event simulator has been developed. It has been seen that fair scheduling provides, fair allocation of bandwidth, lower delay for sources using less ...

Citation Formats

J. Zhou, E. Onur, M. Jacobsson, and I. Niemegeers, “On the Smoothing Factor for Rate Adaptation in IEEE 802.11b/g Mobile Multi-Hop Networks,” 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38946.