Scheduling schemes for throughput optimization in wireless adhoc networks using directional antennas

MOspace/Manakin Repository

Breadcrumbs Navigation

Scheduling schemes for throughput optimization in wireless adhoc networks using directional antennas

Please use this identifier to cite or link to this item: http://hdl.handle.net/10355/10902

[+] show full item record


Title: Scheduling schemes for throughput optimization in wireless adhoc networks using directional antennas
Author: Guttikonda, Srikanth, 1987-
Date: 2011-06-09
Publisher: University of Missouri--Kansas City
Abstract: This thesis presents a scheme for scheduling of wireless adhoc networks by using directional antennas using the concept of frequency reuse. The idea of wireless adhoc network communication is taken one step further by adding directional antennas for both wider coverage and can also be used for maximizing the throughput by using the concept of frequency reuse. This system can be applied to any adhoc network and can be scaled for dense networks. Most wireless adhoc networks use the same channel and try to send information by using an old protocol of CSMA/CA. Throughput remains a major hindrance in the case of adhoc networks which have to compete for the same channel. This thesis modeled an adhoc network in which there is traffic to be sent in pairs from every node to every other node and the advantages of using the frequency reuse scheduling scheme is observed. A routing scheme in which the node which sends data first is given precedence and also a shortest first routing scheme where all the data transfers which are closest are sent first so that they do not interfere with others and provide maximum throughput are also analyzed. This thesis seeks to extend the benefits of mesh networks by taking advantage of the directional antennas to allow simultaneous conversations to happen at the same time. We show how much the capacity can be increased and then develop scheduling schemes to balance capacity and fairness. Those connections which are lower priority might not be given fair access otherwise.
URI: http://hdl.handle.net/10355/10902

This item appears in the following Collection(s)

[+] show full item record