{"publication":"Proceedings of the 4th International Conference on Networking","date_updated":"2022-01-06T06:53:54Z","type":"conference","series_title":" Lecture Notes in Computer Science","language":[{"iso":"eng"}],"citation":{"ieee":"M. Bienkowski, A. Brinkmann, M. Korzeniowski, and O. Orhan, “Cube Connected Cycles Based Bluetooth Scatternet Formation,” in <i>Proceedings of the 4th International Conference on Networking</i>, 2005, vol. 3420, pp. 413–420.","bibtex":"@inproceedings{Bienkowski_Brinkmann_Korzeniowski_Orhan_2005, place={Berlin, Heidelberg}, series={ Lecture Notes in Computer Science}, title={Cube Connected Cycles Based Bluetooth Scatternet Formation}, volume={3420}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">10.1007/978-3-540-31956-6_49</a>}, booktitle={Proceedings of the 4th International Conference on Networking}, publisher={Springer}, author={Bienkowski, Marcin and Brinkmann, André and Korzeniowski, Miroslaw and Orhan, Orhan}, year={2005}, pages={413–420}, collection={ Lecture Notes in Computer Science} }","mla":"Bienkowski, Marcin, et al. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” <i>Proceedings of the 4th International Conference on Networking</i>, vol. 3420, Springer, 2005, pp. 413–20, doi:<a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">10.1007/978-3-540-31956-6_49</a>.","ama":"Bienkowski M, Brinkmann A, Korzeniowski M, Orhan O. Cube Connected Cycles Based Bluetooth Scatternet Formation. In: <i>Proceedings of the 4th International Conference on Networking</i>. Vol 3420.  Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2005:413-420. doi:<a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">10.1007/978-3-540-31956-6_49</a>","apa":"Bienkowski, M., Brinkmann, A., Korzeniowski, M., &#38; Orhan, O. (2005). Cube Connected Cycles Based Bluetooth Scatternet Formation. In <i>Proceedings of the 4th International Conference on Networking</i> (Vol. 3420, pp. 413–420). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">https://doi.org/10.1007/978-3-540-31956-6_49</a>","short":"M. Bienkowski, A. Brinkmann, M. Korzeniowski, O. Orhan, in: Proceedings of the 4th International Conference on Networking, Springer, Berlin, Heidelberg, 2005, pp. 413–420.","chicago":"Bienkowski, Marcin, André Brinkmann, Miroslaw Korzeniowski, and Orhan Orhan. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” In <i>Proceedings of the 4th International Conference on Networking</i>, 3420:413–20.  Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2005. <a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">https://doi.org/10.1007/978-3-540-31956-6_49</a>."},"user_id":"15415","publication_identifier":{"isbn":["9783540253396","9783540319566"],"issn":["0302-9743","1611-3349"]},"department":[{"_id":"63"}],"title":"Cube Connected Cycles Based Bluetooth Scatternet Formation","_id":"18924","volume":3420,"author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"full_name":"Brinkmann, André","last_name":"Brinkmann","first_name":"André"},{"last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw","first_name":"Miroslaw"},{"first_name":"Orhan","full_name":"Orhan, Orhan","last_name":"Orhan"}],"publisher":"Springer","intvolume":"      3420","status":"public","place":"Berlin, Heidelberg","year":"2005","page":"413-420","doi":"10.1007/978-3-540-31956-6_49","publication_status":"published","date_created":"2020-09-03T09:52:33Z","abstract":[{"text":"Bluetooth is a wireless communication standard developed for personal area networks (PAN) that gained popularity in the last years. It was designed to connect a few devices together, however nowadays there is a need to build larger networks. Construction and maintenance algorithms have great effect on performance of the network. We present an algorithm based on Cube Connected Cycles (CCC) topology and show how to maintain the network so that it is easily scalable. Our design guarantees good properties such as constant degree and logarithmic dilation. Besides, the construction costs are proven to be at most constant times larger than any other algorithm would need.","lang":"eng"}]}