Direction and Range Assignment for Directional Antennae in Wireless Networks

Please enable javascript in your browser.

Kharrati-Zadeh, Mohammad Mehdi | 2014

612 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 46297 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Zarrabi-Zadeh, Hamid
Abstract:
In recent years, significant interest has been attracted towards using directional antennae in wireless and sensor networks due to it’s decreased energy consumption, increased security and decreased radio wave overlapping. Substituting omni-directional antennae with directional antennae should be performed in a way that not only guarantees connectivity, but also minimizes radius and latency in network nodes. The problem is not polynomially solvable in general and effort has been made in recent years to present approximation algorithms to solve this problem. The approximation algorithms have been made possible using unit disk
graphs, Euclidean minimum spanning trees, grouping of relatively close nodes together, traveling salesman problem and Hamiltonian cycle. In this thesis, we present a solution to 1D symmetric connectivity problem using dynamic programming with O (n) runtime complexity
Keywords:
Wireless Networks ; Sensor Network ; Topology ; Directional Antenna