BibTeX
@MISC{Roosta_advisor,
author = {Tanya Roosta and Professor Shankar and S. Sastry},
title = {Advisor},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Wireless Ad-hoc networks are self-organizing networks without any preexisting infrastructure to communicate. A key characteristic of these networks is the lack of centralized administration and existence of a dynamic topology. In such a dynamically changing topology, we need all the nodes to have the ability of routing. In the wireless medium, due to the radio transmission range limitations, communication among nodes has to be established through a multi-hop path. To accomplish this task, various routing protocols have been proposed that are capable of adapting to the changes in the network topology. However, in order to understand the functions of the routing protocols and their performance in a wireless network, we need to have a good understanding of the structural properties of the underlying network. In the first part of this study, we look at the problem of message delivery in small-world networks, and validate the related theory using a modified, but more realistic for wireless network, model. In the second part of the study, we propose a probabilistic geographic routing protocol for wireless ad-hoc networks. We present the simulation results for the routing algorithm along with the
Keyphrases
wireless network wireless ad-hoc network second part first part good understanding dynamic topology key characteristic structural property underlying network multi-hop path network topology wireless medium radio transmission range limitation centralized administration self-organizing network preexisting infrastructure routing algorithm routing protocol related theory simulation result small-world network message delivery
