albert- ludwigs- universität freiburg peer -to – peer networks luetooth scatternet based on cube...
TRANSCRIPT
![Page 1: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/1.jpg)
Albert- Ludwigs- Universität Freiburg
Peer -To – Peer NetworksPeer -To – Peer Networks
luetooth Scatternet Based on Cube Connected Cycle
luetooth Scatternet Based on Cube Connected Cycle
H. K. Al-HasaniH. K. Al-HasaniH. K. Al-HasaniH. K. Al-Hasani
![Page 2: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/2.jpg)
luetooth Scatternet Based on Cube Connected Cycle
• What is ....?– Piconet– Scatternet
• Other approaches :– TSF and BlueRings– Chains and Loops– Stars– BlueCubes
• CCC• CCC and Scatternet• CCC and iCCC• What makes CCC
different...?• Conclusion
![Page 3: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/3.jpg)
luetooth Scatternet Based on CCC
What is ....?
Piconet
Scatternet
http://Tux.crystalxp.nethttp://Tux.crystalxp.net
![Page 4: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/4.jpg)
Bluetooth
M
P
S
4/16
Piconet: One Master, seven SlavesMaster determines Hopping- frequency.Active Slaves : can communicate.Parked Salves : listen
Piconet: One Master, seven SlavesMaster determines Hopping- frequency.Active Slaves : can communicate.Parked Salves : listen
![Page 5: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/5.jpg)
Bluetooth
Scatternet: Two or more Piconets are connected through a bridge.
Slave- Slave bridgeSlave- Slave bridge
Scatternet: Two or more Piconets are connected through a bridge.
Slave- Slave bridgeSlave- Slave bridge
M
P
S
B
4/16
Piconet: One Master, seven SlavesMaster determines Hopping- frequency.Active Slaves : can communicate.Parked Salves : listen
Piconet: One Master, seven SlavesMaster determines Hopping- frequency.Active Slaves : can communicate.Parked Salves : listen
![Page 6: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/6.jpg)
Bluetooth
M
P
S
4/16
Scatternet: Two or more Piconets are connected through a bridge.
Master- Slave bridgeMaster- Slave bridge
Scatternet: Two or more Piconets are connected through a bridge.
Master- Slave bridgeMaster- Slave bridge
Piconet: One Master, seven SlavesMaster determines Hopping- frequency.Active Slaves : can communicate.Parked Salves : listen
Piconet: One Master, seven SlavesMaster determines Hopping- frequency.Active Slaves : can communicate.Parked Salves : listen
![Page 7: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/7.jpg)
Bluetooth
M
P
S
4/16
Master-Master bridge is forbiddenMaster-Master bridge is forbidden
Scatternet: Two or more Piconets are connected through a bridge.
Master- Slave bridgeMaster- Slave bridge
Scatternet: Two or more Piconets are connected through a bridge.
Master- Slave bridgeMaster- Slave bridge
Piconet: One Master, seven SlavesMaster determines Hopping- frequency.Active Slaves : can communicate.Parked Salves : listen
Piconet: One Master, seven SlavesMaster determines Hopping- frequency.Active Slaves : can communicate.Parked Salves : listen
![Page 8: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/8.jpg)
luetooth Scatternet Based on CCC
Other approaches :TSF and BlueRings
Chains and Loops
Stars
BlueCubes
![Page 9: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/9.jpg)
Other approaches :
6/16
S
M
TSF : Roles assignment; unique path. Nodes in the middle are Master-Slave.Extending the tree = Extending
Routing lengthTime complexity: n-1Time complexity: n-1
TSF : Roles assignment; unique path. Nodes in the middle are Master-Slave.Extending the tree = Extending
Routing lengthTime complexity: n-1Time complexity: n-1
![Page 10: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/10.jpg)
Other approaches :
BlueRings : Multi path; fault tolerance; no Roles assignmentTime complexity: nTime complexity: n
BlueRings : Multi path; fault tolerance; no Roles assignmentTime complexity: nTime complexity: n
6/16
S
M
TSF : Roles assignment; unique path. Nodes in the middle are Master-Slave.Extending the tree = Extending
Routing lengthTime complexity: n-1Time complexity: n-1
TSF : Roles assignment; unique path. Nodes in the middle are Master-Slave.Extending the tree = Extending
Routing lengthTime complexity: n-1Time complexity: n-1
![Page 11: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/11.jpg)
Other approaches :
Chains and Loops: No Master-Slave bridge, Parked in one and active in another;Time delay.
Chains and Loops: No Master-Slave bridge, Parked in one and active in another;Time delay.
BM
M
B
S
M
7/16
![Page 12: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/12.jpg)
Other approaches :
Star:Node in the middle is bottleneck.Time complexity: n-1Time complexity: n-1
Star:Node in the middle is bottleneck.Time complexity: n-1Time complexity: n-1
M
S
7/16
BM
M
B
S
MChains and Loops: No Master-Slave bridge, Parked in one and active in another;Time delay.
Chains and Loops: No Master-Slave bridge, Parked in one and active in another;Time delay.
![Page 13: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/13.jpg)
Other approaches :
Star:Node in the middle is bottleneck.Time complexity: n-1Time complexity: n-1
Star:Node in the middle is bottleneck.Time complexity: n-1Time complexity: n-1
M
S
7/16
BM
M
B
S
M
Collisions = Retransmission = Power consumingCollisions = Retransmission = Power consuming
Chains and Loops: No Master-Slave bridge, Parked in one and active in another;Time delay.
Chains and Loops: No Master-Slave bridge, Parked in one and active in another;Time delay.
![Page 14: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/14.jpg)
Other approaches :
BlueCubes: start with ring and end up with cube
- # Piconets is controlled- Roles assignment- No Master- Slave link- Multi disjoint path- Scatternet of the same degree (dimension) can connect.
Time complexity: logTime complexity: log22 n n
BlueCubes: start with ring and end up with cube
- # Piconets is controlled- Roles assignment- No Master- Slave link- Multi disjoint path- Scatternet of the same degree (dimension) can connect.
Time complexity: logTime complexity: log22 n n
M
S
M
M
B
M
8/16
![Page 15: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/15.jpg)
luetooth Scatternet Based on Cube Connected Cycle
CCC
CCC and Scatternet
CCC and iCCC
What makes CCC different...?
http://wikimedia.orghttp://wikimedia.org
![Page 16: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/16.jpg)
Cube Connected Cycle
CCC: • n-dimensional cube• Vertex are replaced by cycles• Each cycle has n nodes• CCC has n.2n node• X is cyclic index
(integer n-1>=X>=0)• Y is cubic index
(binary Y<= 2n-1)
CCC: • n-dimensional cube• Vertex are replaced by cycles• Each cycle has n nodes• CCC has n.2n node• X is cyclic index
(integer n-1>=X>=0)• Y is cubic index
(binary Y<= 2n-1)
☻node (x ,y)
☻ ☻ cyclic neighbors (x ±1,y)
☻ Cubic neighbors (x, y⊕2x)
10/16
![Page 17: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/17.jpg)
Cube Connected Cycle
CCC: • Cyclic index and cubic index • Local cycles and primary nodes• Outside and Inside leaf sets
CCC: • Cyclic index and cubic index • Local cycles and primary nodes• Outside and Inside leaf sets
00
33
2255
11
44 11/16
![Page 18: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/18.jpg)
Cube Connected Cycle
33
55
0044
11
22
Node ID(1,011)Node ID(1,011)
Routing table
cubical neighbour: (0,---)
cyclic neighbour: (0,101)
cyclic neighbour: (0, 001)
half smaller, half larger
Inside Leaf Set
(0,011) (2,011)
Outside Leaf Set
(1,100) (2,010)
12/16
![Page 19: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/19.jpg)
CCC and Scatternet
13/16
CCC: • CCC has n.2n Piconets• Every node is a Master• Master communicate through bridges
min CCC = 5 . n .2n-1 n >=3 , max CCC = 13. n. 2n-1 n >=3
CCC: • CCC has n.2n Piconets• Every node is a Master• Master communicate through bridges
min CCC = 5 . n .2n-1 n >=3 , max CCC = 13. n. 2n-1 n >=3
![Page 20: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/20.jpg)
CCC and Scatternet
13/16
4-dimentional cube **
CCC: • CCC has n.2n Piconets• Every node is a Master• Master communicate through bridges
min CCC = 5 . n .2n-1 n >=3 , max CCC = 13. n. 2n-1 n >=3
CCC: • CCC has n.2n Piconets• Every node is a Master• Master communicate through bridges
min CCC = 5 . n .2n-1 n >=3 , max CCC = 13. n. 2n-1 n >=3
![Page 21: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/21.jpg)
CCC and Scatternet
13/16
4-dimentional cube **
CCC: • CCC has n.2n Piconets• Every node is a Master• Master communicate through bridges
min CCC = 5 . n .2n-1 n >=3 , max CCC = 13. n. 2n-1 n >=3
CCC: • CCC has n.2n Piconets• Every node is a Master• Master communicate through bridges
min CCC = 5 . n .2n-1 n >=3 , max CCC = 13. n. 2n-1 n >=3
![Page 22: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/22.jpg)
CCC and iCCC
Extending CCC is expensiveExtending CCC is expensiveExtending CCC is expensiveExtending CCC is expensive
iCCC: • Intermediate CCC• Reconstructed CCC has (n+1).2n Piconets instead of (n+1).2n+1 • Local transmission
iCCC: • Intermediate CCC• Reconstructed CCC has (n+1).2n Piconets instead of (n+1).2n+1 • Local transmission
14/16
New Master (x,y)
x=n
![Page 23: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/23.jpg)
What makes CCC different...?
If CCC with iCCC are combined:If CCC with iCCC are combined:If CCC with iCCC are combined:If CCC with iCCC are combined:
• Efficient communication• Fast lookup O(n)• Broadcast and unicast• Dynamic system• Fixed routing table• Bounded number of reconstruction• Roles assignment
• Efficient communication• Fast lookup O(n)• Broadcast and unicast• Dynamic system• Fixed routing table• Bounded number of reconstruction• Roles assignment
15/16
![Page 24: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/24.jpg)
luetooth Scatternet Based on CCC
Conclusion
Expensive and complicated to reality.
Thank you16/16
S
M
Routing length
B
M
M
B
S
M
Time delay
M
S
Bottleneck
M
S
M
M
B
M
Multicasting Expensive
![Page 25: Albert- Ludwigs- Universität Freiburg Peer -To – Peer Networks luetooth Scatternet Based on Cube Connected Cycle H. K. Al-Hasani](https://reader036.vdocuments.mx/reader036/viewer/2022062417/551776485503463e368b4e24/html5/thumbnails/25.jpg)
ReferencesCycloid: A constant-degree and lookup-efficient P2P overlay network
Haiying Shen, Cheng-Zhong Xu, and Guihai ChenCube Connected Cycles Based Bluetooth Scatternet Formation
Marcin Bienkowski1,, Andr´e Brinkmann2, Miroslaw Korzeniowski1,, and Orhan Orhan1Routing Strategy for Bluetooth ScatternetChristophe Lafon, and Tariq S. Durrani
Bluetooth scatternet formationSøren Debois, IT University of Copenhagen
Energy-Efficient Bluetooth Scatternet Formation Based on Device and Link CharacteristicsCanan PAMUK
On Efficient topologies for Bluetooth ScatternetsDepartment of Information Engineering University of Padova, ITALY
Daniele Miorandi, Arianna Trainito, Andrea Zanella BlueCube: Constructing a hypercube parallel computing and communication environment over Bluetooth
radio systems Chao-Tsun ChangIntroduction to Bluetooth Technology
Lecture notes by Jeffrey Lai , http://www.ensc.sfu.ca Introduction to Wireless and Mobile Systems
Dharma Parkash Agrawal, Qing – An Zeng Ad Hok Wireless Networks , architecture and protocols
** Cayley DHTs —A Group-Theoretic Framework for Analyzing DHTs Based on Cayley GraphsChangtao Qu, Wolfgang Nejdl, Matthias Kriesell
Wireless ad hoc networking—The art of networking without networkingMagnus Frodigh, Per Johansson and Peter Larsson
http://bluetooth.com/bluetooth/http://www.palowireless.com/bluetooth/