Ad-hoc network construction with bluetooth블루투스에서의 애드혹 망 구성

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 538
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorLee, Joon-Won-
dc.contributor.advisor이준원-
dc.contributor.authorKim, Cheol-Gi-
dc.contributor.author김철기-
dc.date.accessioned2011-12-13T05:21:24Z-
dc.date.available2011-12-13T05:21:24Z-
dc.date.issued2005-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=249499&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/32903-
dc.description학위논문(박사) - 한국과학기술원 : 전산학전공, 2005.8, [ vii, 86 p. ]-
dc.description.abstractBluetooth is a wireless personal area network standard with frequency hopping technology over the 2.4 GHz band. At most 8 devices are synchronized in one piconet, which is sometimes used as a building block for a larger network, called scatternet. A piconet is composed of a master, which is a predetermined central coordinator, and slaves. In spite of the asymmetrical architecture of Bluetooth, some symmetric applications, such as exchanging multi-media name cards between portable devices and on-line games among nodes in sights, are promising, which need a symmetric connection establishment scheme. However, the current Bluetooth specification requires an asymmetrical connection and its connection delay may be intolerably high for the aforementioned applications. In this dissertation, we propose a random inquiry procedure that allows a symmetrical connection between a pair of nodes. Each party flips its state between the master and the slave until a successful match is found. We have adopted several optimizations on Bluetooth inquiry for quick connections between nodes. Moreover, we find the optimal state transition strategy through the analysis. Numerical results show that expected inquiry success time can be as low as about 30 ms with our random inquiry, which is small enough for name card exchange. Based on the above random inquiry scheme, we present an extended random inquiry scheme for multi-party, named Murani, for exchanging materials among several people and wireless on-line gaming among nodes in proximity. Murani makes no connection between nodes until the unique leader election and the neighbor discovery. It speeds up the connection when small number of nodes participate in a transaction. We analyzed the time needed for the procedure with Markovian chain model. With 1.8 s for timeout, 99.9% of inquiries succeed for 40 nodes. The original Murani performs better with up to 30 nodes than the conventional schemes in average, while contention-controlle...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectBluetooth-
dc.subjectwireless networks-
dc.subjectAd-hoc networks-
dc.subjectScatternet formation-
dc.subject스캐터넷 구성-
dc.subject블루투스-
dc.subject적응망-
dc.subject무선통신-
dc.subject애드혹 망-
dc.titleAd-hoc network construction with bluetooth-
dc.title.alternative블루투스에서의 애드혹 망 구성-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN249499/325007 -
dc.description.department한국과학기술원 : 전산학전공, -
dc.identifier.uid000985099-
dc.contributor.localauthorLee, Joon-Won-
dc.contributor.localauthor이준원-
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0