Lab Home | Phone | Search | ||||||||
|
||||||||
Nodes in ad hoc wireless networks are typically low-memory, low-powered; and they cannot maintain routing tables large enough for well-known proactive routing protocols. Therefore, stateless and greedy forwarding at intermediate nodes is desirable in ad-hoc networks. Also, for end-to-end traffic engineering, multi-path capabilities and flexibility in routing are necessary building blocks. So, it is desirable to define routes at the source like in Source Routing (SR) while performing greedy forwarding at intermediate nodes. To address these issues, we present our research on Trajectory-Based Routing (TBR) which is a middle-ground between SR and greedy forwarding techniques. We address various issues regarding implementation of TBR. In particular, we (1) develop a trajectory encoding technique that uses the well-known Bezier parametric curves, (2) develop an optimal forwarding strategy and show its superior performance in comparison to other greedy forwarding techniques, and (3) propose architecture to implement long and/or complex trajectories that cannot be encoded in a small size packet header. In addition to routing difficulties caused by lack of resources, communication environment presents significant challenges to high-speed wireless networking. Legacy RF signals provide omni-directional connectivity, but they consume large transmission power and are limited in communication bandwidth. In comparison, free-space-optical (FSO) communication devices have enormous bandwidth, but line-of-sight (LOS) and alignment issues make them hard to deploy. We present inexpensive FSO node designs that solve the LOS and alignment problems for multi-hop wireless communication. We will also show that our FSO designs can significantly enhance the higher-layer networking operations such as routing. Host: Hasan Guclu |