Partial Delaunay triangulation and degree limited localized Bluetooth scatternet formation

Abstract

This paper addresses the problem of localized scatternet formation for multihop Bluetooth-based personal area ad hoc networks. Nodes are assumed to know their positions and are able to establish connections with any of their neighboring nodes, located within their transmission radius, in the neighbor discovery phase. The next phase of the proposed formation algorithm is optional and can be applied to construct a sparse geometric structure in a localized manner. We propose here a new sparse planar structure, namely, partial Delaunay triangulation (PDT), which can be constructed locally and is denser than other known localized planar structures. In the next mandatory phase, the degree of each node is limited to seven by applying the Yao structure, and the master-slave relations in piconets are formed in created subgraphs. This phase consists of several iterations. In each iteration, undecided nodes with higher keys than any of their undecided neighbors apply the Yao structure to bound the degrees, decide masterslave relations on the remaining edges, and inform all neighbors about either deleting edges or master-slave decisions. To the best of our knowledge, our schemes are the first schemes that construct degree limited (a node has at most seven slaves) and connected piconets in multihop networks, without parking any node. The creation and maintenance require small overhead in addition to maintaining accurate location information for one-hop neighbors. The experiments confirm good functionality of created Bluetooth networks in addition to their fast creation and straightforward maintenance.

Bluetooth Information Exchange Network

“…Another study [29] made a comparison between Bluetree [13], Bluestar [17,18], Bluenet [19] scatternet formation protocols and another proposed protocol [30].…”

A novel family of geometric planar graphs for wireless ad hoc networks

“…A connected planar was proposed for UDG on the basis of Del and under the assumption of no four co-circular vertices in [16]. The graph is a subset of Del and thus named Partial Delaunay triangulation (PDel).…”

“…There are a few strictly localized planar graphs such as GG, RNG [7] and PDel [16] and a few non-strictly localized planar graphs such as LMST [15] and LDel [5], [13]. The degree ∆(G) of a graph G is the maximum node degree in the graph.…”

“…However, the modification requires each vertex to be associated a unique identifier (ID), which does not necessarily exist in, e.g., sensor networks. Li et al [16] showed that degree can be limited to a constant with connectivity and planarity preservation by applying Yao structure [19].…”

Energy-aware On-demand Scatternet Formation and Routing

“…In [4] the authors use location information in order to produce a planar subgraph, which can improve the performance of routing algorithms. This optional step is followed by assigning roles to the bluetooth nodes, a process that takes several iterations.…”