1 / 17

Cube Connected Cycles Based Bluetooth Scatternet Formation

Cube Connected Cycles Based Bluetooth Scatternet Formation. Marcin Bienkowski, Andre Brinkmann Miroslaw Korzeniowski and Orhan Orhan. Outline. Bluetooth Networks Building and Maintaining Large Scale Bluetooth Scatternets Cube Connected Cycles Based Scatternet Formation Topology

parker
Download Presentation

Cube Connected Cycles Based Bluetooth Scatternet Formation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Cube Connected Cycles Based Bluetooth Scatternet Formation Marcin Bienkowski, Andre Brinkmann Miroslaw Korzeniowski and Orhan Orhan

  2. Outline • Bluetooth Networks • Building and Maintaining Large Scale Bluetooth Scatternets • Cube Connected Cycles Based Scatternet Formation Topology • A Smooth Way to Maintain the CCC Topology • Analysis • Future Work

  3. Bluetooth Networks 2 1 M 3 7 8 slave 4 6 master 5 master shared slave slave • Piconet: A simple network form with • maximum one master and seven • active slaves. • Scatternet: A connected Bluetooth • network consisting several piconets. First ad-hoc networking mass product in market Typical range:10m Transmission speed: 3 Mbps (ver. 2.0)

  4. Building Large Scale Bluetooth Scatternets • We tried to find a topology satisfying two aspects: • Graph theoretical point of view: • degree • dilation • bisection width • scalability • 2. Bluetooth technology: • Each master can have maximum 7 active slaves (degree limitation) • One slave should not participate more than 2 piconets

  5. CCC Topology CCC has n = d · 2d nodes, degree of each node ≤ 3 Nodes are represented by two indices (i,j) 0 ≤ i < d and 0 ≤ j < 2d The connectivity is: first set of connections are cube edges the second set of connections are cycle edges Total number of edges are m = 3· n/2 = 3 · d · 2 (d−1)

  6. CCC Based Scatternet Formation • Simulating d dimensional CCC we need to have at least 5 · d · 2 (d−1) nodes where 2 · d · 2 (d−1) masters and 3 · d · 2 (d−1) slaves. • Each master can have 4 additional slaves, upper limit is 13 · d · 2 (d−1) • Nodes in the CCC network are represented by masters, Each link from the CCC will be implemented by a slave. • For number of devices larger than upper bound 13 · d · 2 (d−1), the easiest way is just to increase d by 1. • - However, this solution would not work due to the lower bound on the required number of nodes in a d + 1 -dimensional CCC network

  7. Intermediate CCC • We introduce an intermediate network topology (iCCC) between the d dimensional CCC and the (d + 1)-dimensional CCC • The d-dimensional iCCC network has (d + 1) · 2d nodes • Number of edges is m = (3d + 2) · 2d−1 • For any two nodes a and b; there is a path which is at most 4 · d • For iCCC scatternet network • Minimum number of nodes for degree d: (5 · d + 4) · 2d−1, • Maximumnumber of nodes for degree d: (13 · d + 14) · 2d−1

  8. Maintenance of CCC Topology • Smooth transition: • First each cycle extended by an additional master numbered d and transform • into iCCC network. • After each ring has been increased by one, each master acts as two nodes of • the d+1 dimensional CCC but still has degree of 3.

  9. Maintenance of CCC Topology Each master wants all its connections to be doubled. This can be done when new nodes come and join the network as loose slaves.

  10. Maintenance of CCC Topology A master splits itself as soon as it has two loose slaves and both of its edges are doubled. After all the masters have split, we increase dimension d by one.

  11. Analysis • CCC with smooth maintenance is in comparison to best possible strategy: • 6 competitive for the insertion • 20 competitive for removal of the nodes • CCC with stepping maintenance algorithm • 12 competitive for insertion and removal

  12. Further Work • Distributed algorithm for CCC based scaternet formation • Distributed maintenance algorithm including merge of scatternets with preserving existing links

  13. Thank you for your attention! Heinz Nixdorf Institute University of Paderborn System and Circuit Technology Prof. Dr.-Ing. Ulrich Rückert Fürstenallee 11 33102 Paderborn Germany Orhan Orhan Phone: +49 52 51/60 6396 Fax: +49 52 51/60 6351 Email: orhan@hni.upb.de http://wwwhni.upb.de/sct

  14. High Throughput via EDR • Bluetooth EDR achieves its higher data rates by using a phase shift keying (PSK) modulation scheme in place of the Gaussian frequency shift keying (GFSK) of basic rate. This allows more bits to be transmitted in each symbol of the packet’s payload when it is sent over the radio link. • However, the symbol rate is still 1 megasymbol per second; the packet timing and structure are the same; the spectral characteristics of transmissions are virtually unchanged; and support for both modulation schemes is mandatory for all EDR capable products.

  15. Array and Ring

  16. Tree and Mesh Tree index (k)

  17. Hypercube, Cube Connected Cycles d = Dimension

More Related