Simplified bluetooth scatternet formation using maximal independent sets

Zaguia, Nejib; Daadaa, Yassine

doi:10.3233/ica-2008-15303

Cited by 7 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Position-unaware topology control has also been a major focus of research on Bluetooth scatternet formation [11] with several proposed algorithms such as BlueStars [36], BlueMesh [37], BlueMIS [38], and BSF-UED [39]. Some of these algorithms can provide degree-bounded topologies, but the degree bound holds for only the master nodes of the network and not for all the nodes of the network.…”

Section: B Related Workmentioning

confidence: 99%

“…Some of these algorithms can provide degree-bounded topologies, but the degree bound holds for only the master nodes of the network and not for all the nodes of the network. In this context, construction of network topologies with a constant degree bound at every node and without position information at nodes has been described [38] as "an interesting and major open problem in the area." In fact, in this paper, we solve the very same problem.…”

Section: B Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Asynchronous Local Construction of Bounded-Degree Network Topologies Using Only Neighborhood Information

Koyuncu

Jafarkhani

2019

IEEE Trans. Commun.

View full text Add to dashboard Cite

We consider ad-hoc networks consisting of n wireless nodes that are located on the plane. Any two given nodes are called neighbors if they are located within a certain distance (communication range) from one another. A given node can be directly connected to any one of its neighbors and picks its connections according to a unique topology control algorithm that is available at every node. Given that each node knows only the indices (unique identification numbers) of its one-and two-hop neighbors, we identify an algorithm that preserves connectivity and can operate without the need of any synchronization among nodes. Moreover, the algorithm results in a sparse graph with at most 5n edges and a maximum node degree of 10. Existing algorithms with the same promises further require neighbor distance and/or direction information at each node. We also evaluate the performance of our algorithm for random networks. In this case, our algorithm provides an asymptotically connected network with n(1 + o(1)) edges with a degree less than or equal to 6 for 1 − o(1) fraction of the nodes. We also introduce another asynchronous connectivity-preserving algorithm that can provide an upper bound as well as a lower bound on node degrees.

show abstract