|
||||||
|
||||||
| Undergraduate Honours Projects | ||||||
|
Carleton University - School of Computer Science Undergraduate Honours Project Winter 2010 Using WSPD in a Wireless Setting Vafa Khoshaein 
ABSTRACT Wireless networks are becoming more popular and because of their nature, they are hard models to implement and maintain. There has been a tremendous number of studies covering different areas related to Wireless networks such as collision avoidance routing or security, however, most of these studies concentrate on a wireless network as a whole but there has been less attention paid to networking models that have been studied in wired networks such as token-ring or Ethernet. In this report, we will look at wireless networks and we combine some of their protocols with a geometric model and we will introduce a flat routing model that can be adopted and implemented because of the nature of this combination. Our basic goal is to reduce the number of links of general wireless networks from O(n^2) to O(n) where n is the number of nodes in the network. We will test our model using a simulator and we design and show some of the known wireless protocols such as NDP and IARP. |
||||||
|
