Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Performance evaluation of routing protocols in wireless ad hoc networks with service differentiation
Download
index.pdf
Date
2003
Author
Yılmaz, Semra
Metadata
Show full item record
Item Usage Stats
239
views
86
downloads
Cite This
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. Due to the limitations in the wireless environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing protocols is to establish routes between node pairs so that messages may be delivered reliably and in a timely manner. The basic access method in IEEE 802.11 ad hoc networks is the Distributed Coordination Function (DCF), which provides a fair medium access. Enhanced Distributed Coordination Function (EDCF) has been developed to provide service differentiation among different traffic flows. In this thesis, we investigate the performance of the EDCF with routing protocols; Direct Sequenced Distance Vector (DSDV) and Dynamic Source Routing (DSR) by simulations.
Subject Keywords
Computer engineering
URI
http://etd.lib.metu.edu.tr/upload/1208909/index.pdf
https://hdl.handle.net/11511/13232
Collections
Graduate School of Informatics, Thesis
Suggestions
OpenMETU
Core
Software implementations of QoS scheduling algorithms for high speed networks /
Pehlivanlı, Aydın; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2015)
The end to end Quality of Service (QoS) support for the dominating multimedia traffic in the contemporary computer networks is achieved by implementing schedulers in the routers and deploying traffic shapers. To this end, realistic modeling and simulation of these components is essential for network performance evaluation. The first contribution of this thesis is the design and implementation of a C++ simulator QueST (Quality of Service simulaTor) for this task. QueST is a modular cycle accurate simulator w...
Energy- aware task scheduling over mobile ad hoc networks
Bokar, Ali; Bozyiğit, Müslim; Department of Computer Engineering (2009)
Mobile ad hoc networks (MANETs) can be formed dynamically without the support of any existing infrastructure or any centralized administration. They consist of heterogeneous mobile nodes which are powered by batteries, move arbitrarily and are connected by wireless links. Battery energy limitation is one of the main challenges in the MANETs. Several hardware and software based techniques have been proposed in this field. Most of the previous studies have considered only the energy minimization of individual...
Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies
Vazifehdan, Javad; Prasad, R. Venkatesha; Onur, Ertan; Niemegeers, Ignas (Elsevier BV, 2011-10-27)
Although many energy-aware routing schemes have been proposed for wireless ad hoc networks, they are not optimized for networks with heterogeneous power supplies, where nodes may run on battery or be connected to the mains (grid network). In this paper, we propose several energy-aware routing algorithms for such ad hoc networks. The proposed algorithms feature directing the traffic load dynamically towards mains-powered devices keeping the hop count of selected routes minimal. We unify these algorithms into...
Performance analysis of a power aware routing protocol for ad hoc networks
Yazıcı, Mehmet Akif; Bilgen, Semih; Department of Electrical and Electronics Engineering (2006)
In this thesis, performance of the Contribution Reward Routing Protocol with Shapley Value (CAP-SV), a power-aware routing protocol for ad hoc networking is analyzed. Literature study on ad hoc network routing and ower-awareness is given. The overhead induced by the extra packets of the redirection mechanism of CAP-SV is formulized and the factors affecting this overhead are discussed. Then, the power consumption of CAP-SV is analytically analized using a linear power consumption model. It is shown that CAP...
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...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Yılmaz, “Performance evaluation of routing protocols in wireless ad hoc networks with service differentiation,” M.S. - Master of Science, Middle East Technical University, 2003.
