Forming connected topologies in bluetooth ad-hoc networks—An algorithmic perspective

Guérin, Roch; Rank, J.; Sarkar, Saswati; Vergetis, Evangelos

doi:10.1016/s1388-3437(03)80250-0

Cited by 10 publications

(9 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the purposes of estimating of the probability of IEEE 802.11b frame transmission success, in the case of co-existence with BT scatternet structure (and with the assumption that signal of every band user is received with the same power and master devices are synchronized) the following relation may be taken into consideration: 11 It is obvious that better results, while considering the only parameter, could be achieved for example with so called naïve algorithm [3], which at the beginning dedicates the first master device, then connects further 7 devices to piconet, and the following device creates next piconet, etc. Nevertheless, the naïve algorithm does not ensure other important limitations in the scatternet (that is the number of functions served by one device).…”

Section: A Methods For Determining Of 80211b Frame Successmentioning

confidence: 99%

See 1 more Smart Citation

An Analysis of Bluetooth Scatternet Impact on 802.11b Network

Klajbor

2007

EUROCON 2007 - The International Conference on "Computer as a Tool"

View full text Add to dashboard Cite

Standard Bluetooth does not precisely determine the rules of forming Bluetooth scatternets. So far many interesting scatternet forming algorithms have been proposed. This publication tries to assess selected Bluetooth networks forming algorithms taking into account a few key parameters. In particular, the aspect of impact of topology created in a given way, has been researched taking into account potential interferences inside the scatternet (interferences between piconets) and on other technologies working in ISM band (that is IEEE 802.11b).

show abstract

Section: A Methods For Determining Of 80211b Frame Successmentioning

confidence: 99%

“…Every device which received a notice (during the inquiring process) that one or more of its neighbours became masters, becomes slave for the first master inquiring it. In accordance with the Source: study on the basis of [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [18].…”

Section: Comparison Of Scatternet Forming Algorithmsmentioning

confidence: 99%

An Analysis of Bluetooth Scatternet Impact on 802.11b Network

Klajbor

2007

EUROCON 2007 - The International Conference on "Computer as a Tool"

View full text Add to dashboard Cite

show abstract

“…The solutions proposed in literature can be divided into single-hop (see [31] for a review, which is not given here due to space constraints), and multihop ( [35], [5], [32], [15], [16], [3], [7], [24]) solutions. In a singlehop topology, all devices are in the radio vicinity of each other, which is not always the case in realistic scenarios.…”

Section: Literature Review On Bluetooth Scatternet Formationmentioning

confidence: 99%

Partial Delaunay triangulation and degree limited localized Bluetooth scatternet formation

Stojmenović²,

Wang

2004

IEEE Trans. Parallel Distrib. Syst.

111

101

View full text Add to dashboard Cite

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.

show abstract

“…In our case, the topology must be a tree at any time. This can be accomplished using existing distributed algorithms for dynamic tree formation and maintenance [14], [15], [23]. According to Proposition 1 and Theorem 1, when the topology is a tree, local conditions can capture the entire set of feasible allocations.…”

Section: Distributed Algorithmmentioning

confidence: 99%

“…The algorithm is self-stabilizing: it may start from any initial TDMA schedule and converge to a new schedule realizing a desired allocation τ . Mobility can also be supported as long as a tree formation and maintenance protocol [14], [15], [23] runs in the network.…”

Section: B a Distributed Link Scheduling Algorithm For Treesmentioning

confidence: 99%

Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks

Salonidis

Tassiulas

2005

Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing

View full text Add to dashboard Cite

Abstract-We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility conditions, multi-hop sessions are dynamically offered allocations, further translated to link demands. Using a distributed TDMA protocol, nodes adapt to the demand changes on their adjacent links by local, conflict-free slot reassignments. As soon as the changes stabilize, the nodes must incrementally converge to a TDMA schedule that realizes the global link (and session) demand allocation.We first identify an inherent trade-off between the degree of topology control and fraction of feasible allocations that can be captured by the local conditions. We show that tree topologies can be maximally utilized in this respect and that a converging distributed link scheduling algorithm exists in this case.Decoupling end-to-end bandwidth allocation from link scheduling allows support of various end-to-end QoS objectives. Focusing on Available Bit Rate (ABR) service, we design an asynchronous distributed algorithm for sharing bandwidth to the sessions in a maxmin fair (MMF) manner.Finally, we present the implementation of this framework over Bluetooth, an existing wireless technology that enables the formation of ad hoc networks. This implementation is free of the usual restrictive assumptions of previous TDMA approaches: it does not require any a-priori knowledge on the number of nodes in the network nor even network-wide slot synchronization.

show abstract

Forming connected topologies in bluetooth ad-hoc networks—An algorithmic perspective

Cited by 10 publications

References 15 publications

An Analysis of Bluetooth Scatternet Impact on 802.11b Network

An Analysis of Bluetooth Scatternet Impact on 802.11b Network

Partial Delaunay triangulation and degree limited localized Bluetooth scatternet formation

Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks

Contact Info

Product

Resources

About