In the past five years Bluetooth scatternets were one of the most promising wireless networking technologies for ad hoc networking. In such networks, mobility together with the fact that wireless network nodes may change their communication peers in time, generate permanently changing traffic flows. Thus, forming an optimal scatternet for a given traffic pattern may be not enough, rather a scatternet that best supports traffic flows as they vary in time is required. In this thesis, we propose a novel heuristic algorithm suite capable of dynamically adapting the network topology to the existing traffic connections between scatternet nodes. The periodic adaptation of the scatternet topology to the traffic connections enables the routing algorithms to identify shorter paths between communication in terms of throughput and power consumption. Secondly, we also present a performance analysis and optimization of delay-tolerant networks (DTNs), i.e. ad hoc networks (e.g. scatternets) with no end-to-end path between the communicating nodes. In DTNs heavy buffer usage and long message delivery delays may render the communication inefficient. In this work we present our heuristic routing algorithm for location-aware message delivery, called K2, based on the k-nearest-neighbors technique. K2 uses location information for interlocking the region where the destination of a packet is supposed to be reachable. Simulations show that K2 reduces buffer requirements, while maintaining routing delays approximately unchanged when compared to a flooding-based routing algorithm.
展开▼
