A PROTOCOL SUITE FOR WIRELESS PERSONAL AREA NETWORKS

A Wireless Personal Area Network (WPAN) is an ad hoc network that consists of devices that surround an individual or an object. Bluetooth® technology is especially suitable for formation of WPANs due to the pervasiveness of devices with Bluetooth® chipsets, its operation in the unlicensed Industrial, Scientific, Medical (ISM) frequency band, and its interference resilience. Bluetooth® technology has great potential to become the de facto standard for communication between heterogeneous devices in WPANs. The piconet, which is the basic Bluetooth® networking unit, utilizes a Master/Slave (MS) configuration that permits only a single master and up to seven active slave devices. This structure limitation prevents Bluetooth® devices from directly participating in larger Mobile Ad Hoc Networks (MANETs) and Wireless Personal Area Networks (WPANs). In order to build larger Bluetooth® topologies, called scatternets, individual piconets must be interconnected. Since each piconet has a unique frequency hopping sequence, piconet interconnections are done by allowing some nodes, called bridges, to participate in more than one piconet. These bridge nodes divide their time between piconets by switching between Frequency Hopping (FH) channels and synchronizing to the piconet\u27s master. In this dissertation we address scatternet formation, routing, and security to make Bluetooth® scatternet communication feasible. We define criteria for efficient scatternet topologies, describe characteristics of different scatternet topology models as well as compare and contrast their properties, classify existing scatternet formation approaches based on the aforementioned models, and propose a distributed scatternet formation algorithm that efficiently forms a scatternet topology and is resilient to node failures. We propose a hybrid routing algorithm, using a bridge link agnostic approach, that provides on-demand discovery of destination devices by their address or by the services that devices provide to their peers, by extending the Service Discovery Protocol (SDP) to scatternets. We also propose a link level security scheme that provides secure communication between adjacent piconet masters, within what we call an Extended Scatternet Neighborhood (ESN)

A survey on Bluetooth multi-hop networks

Bluetooth was firstly announced in 1998. Originally designed as cable replacement connecting devices in a point-to-point fashion its high penetration arouses interest in its ad-hoc networking potential. This ad-hoc networking potential of Bluetooth is advertised for years - but until recently no actual products were available and less than a handful of real Bluetooth multi-hop network deployments were reported. The turnaround was triggered by the release of the Bluetooth Low Energy Mesh Profile which is unquestionable a great achievement but not well suited for all use cases of multi-hop networks. This paper surveys the tremendous work done on Bluetooth multi-hop networks during the last 20 years. All aspects are discussed with demands for a real world Bluetooth multi-hop operation in mind. Relationships and side effects of different topics for a real world implementation are explained. This unique focus distinguishes this survey from existing ones. Furthermore, to the best of the authors’ knowledge this is the first survey consolidating the work on Bluetooth multi-hop networks for classic Bluetooth technology as well as for Bluetooth Low Energy. Another individual characteristic of this survey is a synopsis of real world Bluetooth multi-hop network deployment efforts. In fact, there are only four reports of a successful establishment of a Bluetooth multi-hop network with more than 30 nodes and only one of them was integrated in a real world application - namely a photovoltaic power plant. © 2019 The Author

Improving forwarding mechanisms for mobile personal area networks

This thesis presents novel methods for improving forwarding mechanisms for personal area networks. Personal area networks are formed by interconnecting personal devices such as personal digital assistants, portable multimedia devices, digital cameras and laptop computers, in an ad hoc fashion. These devices are typically characterised by low complexity hardware, low memory and are usually batterypowered. Protocols and mechanisms developed for general ad hoc networking cannot be directly applied to personal area networks as they are not optimised to suit their specific constraints. The work presented herein proposes solutions for improving error control and routing over personal area networks, which are very important ingredients to the good functioning of the network. The proposed Packet Error Correction (PEC) technique resends only a subset of the transmitted packets, thereby reducing the overhead, while ensuring improved error rates. PEC adapts the number of re-transmissible packets to the conditions of the channel so that unnecessary retransmissions are avoided. It is shown by means of computer simulation that PEC behaves better, in terms of error reduction and overhead, than traditional error control mechanisms, which means that it is adequate for low-power personal devices. The proposed C2HR routing protocol, on the other hand, is designed such that the network lifetime is maximised. This is achieved by forwarding packets through the most energy efficient paths. C2HR is a hybrid routing protocol in the sense that it employs table-driven (proactive) as well as on-demand (reactive) components. Proactive routes are the primary routes, i.e., packets are forwarded through those paths when the network is stable; however, in case of failures, the protocol searches for alternative routes on-demand, through which data is routed temporarily. The advantage of C2HR is that data can still be forwarded even when routing is re-converging, thereby increasing the throughput. Simulation results show that the proposed routing method is more energy efficient than traditional least hops routing, and results in higher data throughput. C2HR relies on a network leader for collecting and distributing topology information, which in turn requires an estimate of the underlying topology. Thus, this thesis also proposes a new cooperative leader election algorithm and techniques for estimating network characteristics in mobile environments. The proposed solutions are simulated under various conditions and demonstrate appreciable behaviour

Self-organizing Bluetooth scatternets

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.Includes bibliographical references (p. 71-73).There is increasing interest in wireless ad hoc networks built from portable devices equipped with short-range wireless network interfaces. This thesis addresses issues related to internetworking such networks to form larger "scatternets." Within the constraints imposed by the emerging standard Bluetooth link layer and MAC protocol, we develop a set of online algorithms to form scatternets and to schedule point-to-point communication links. Our efficient online topology formation algorithm, called TSF (Tree Scatternet Formation), builds scatternets by connecting nodes into a tree structure that simplifies packet routing and scheduling. Unlike earlier works, our design does not restrict the number of nodes in the scatternet, and also allows nodes to arrive and leave at arbitrary times, incrementally building the topology and healing partitions when they occur. We have developed a Bluetooth simulator in ns which includes most aspects of the entire Bluetooth protocol stack. It was used to derive simulation results that show that TSF has low latencies in link establishment, tree formation and partition healing. All of these grow logarithmically with the number of nodes in the scatternet. Furthermore, TSF generates tree topologies where the average path length between any node pair grows logarithmically with the size of the scatternet. Our scheduling algorithm, called TSS (Tree Scatternet Scheduling), takes advantage of the tree structure of the scatternets constructed by TSF. Unlike previous works, TSS coordinates one-hop neighbors effectively to increase the overall performance of the scatternet. In addition, TSS is robust and responsive to network conditions, adapting the inter-piconet link schedule effectively based on varying workload conditions. We demonstrate that TSS has good performance on throughput and latency under various traffic loads.by Godfrey Tan.S.M

Mobile Ad hoc Networking: Imperatives and Challenges

Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, "ad-hoc" network topologies, allowing people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Ad hoc networking concept is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad hoc paradigm. Recently, the introduction of new technologies such as the Bluetooth, IEEE 802.11 and Hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent evolutions have been generating a renewed and growing interest in the research and development of MANET. This paper attempts to provide a comprehensive overview of this dynamic field. It first explains the important role that mobile ad hoc networks play in the evolution of future wireless technologies. Then, it reviews the latest research activities in these areas, including a summary of MANET\u27s characteristics, capabilities, applications, and design constraints. The paper concludes by presenting a set of challenges and problems requiring further research in the future

Distributed Topology Organization and Transmission Scheduling in Wireless Ad Hoc Networks

An ad hoc network is a set of nodes that spontaneously form a multi-hop all-wireless infrastructure without centralized administration. We study two fundamental issues arising in this setting: topology organization and transmission scheduling. In topology organization we consider a system where nodes need to coordinate their transmissions on a non-broadcast frequency hopping channel to discover each other. We devise a symmetric technique where two nodes use a randomized schedule to synchronize and connect in minimum time. This forms the basis for a topology construction protocol where a set of initially unsynchronized nodes are quickly grouped in multiple interconnected communication channels such that the resulting topology is connected subject to channel membership constraints imposed by the physical layer. In the transmission scheduling problem we consider Time Division Multiple Access (TDMA)the network operates with a schedule where at each slot transmissions can be scheduled without conflicts at the intended receivers. TDMA can provide deterministic allocations but typically relies on two restrictive assumptions: network-wide slot synchronization and global knowledge of network topology and traffic requirements. We first introduce an asynchronous TDMA communication model where slot reference for each link is provided locally by the clock of one of the node endpoints. We study the overhead introduced when nodes switch among multiple time references and propose algorithms for its minimization. We then introduce a distributed asynchronous TDMA protocol where nodes dynamically adjust the rates their adjacent links via local slot reassignments to reach a schedule that realizes a set of optimal link rates. We introduce fairness models for both links and multi-hop sessions sharing the network and devise convergent distributed algorithms for computing the optimal rates for each model. These rates are enforced by a distributed algorithm that decides the slots reassigned during each link rate adjustment. For tree topologies we introduce an algorithm that incrementally converges to the optimal schedule in finite time; for arbitrary topologies an efficient heuristic is proposed. Both topology organization and transmission scheduling protocols are implemented over Bluetooth, a technology enabling ad hoc networking applications. Through extensive simulations they demonstrate excellent performance in both static and dynamic scenarios

Device Discovery in Frequency Hopping Wireless Ad Hoc Networks

This research develops a method for efficient discovery of wireless devices for a frequency hopping spread spectrum, synchronous, ad hoc network comprised of clustered sub-networks. The Bluetooth wireless protocol serves as the reference protocol. The development of a discovery, or outreach, method for scatternets requires the characterization of performance metrics of Bluetooth piconets, many of which are unavailable in literature. Precise analytical models characterizing the interference caused to Bluetooth network traffic by inquiring devices, the probability mass function of packet error rates between arbitrary pairs of Bluetooth networks, and Bluetooth discovery time distribution are developed. Based on the characterized performance metrics, three scatternet outreach methods are developed and compared. Outreach methods which actively inquire on a regular basis, as proposed in literature, are shown to produce lower goodput, have greater mean packet delay, require more power, and cause significant delays in discovery. By passively remaining available for outreach, each of these disadvantages is avoided