• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.8
• /
• pp.3-11
• /
• 2017

Research and development are being conducted to apply low-power Bluetooth (BLE) technology to IoT (Internet of Things) applications. The characteristic of this application environment is that many piconets can operate in the same space. Therefore, interference between homogeneous networks is likely to occur. In the BLE data channel, adaptive frequency hopping (AFH) scheme is used among the 37 frequency channels, and the master and the slave communicate while changing the carrier frequency. If there are multiple BLE piconets in the same space, there is a risk of frequency collision and packet errors will occur. In this paper, we analyze the packet collision probability due to cochannel interference in multiple asynchronous BLE piconet environments. Specifically, we analyzed packet collision probability according to the number of concurrently operating BLE piconets with the ratio of connection interval to connection event length as the main parameters. The analysis result can be used to set connection event related parameters for a desired packet collision probability according to the number of users having BLE devices in a given space.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.2
• /
• pp.201-207
• /
• 2003

A multi-hop ad-hoc network can be formed out of Bluetooth capable devices through the use of scatternets. Many topologies can be deployed for scatternet; the most commonly proposed topology in the literature are tree structure and ring structure. We analyze the performance between tree formation algorithm and ring formation algorithm. We then present quantative result that compare the expected traffic performance between Blutooth ring scatternet and Bluetooth tree scatternet. The simulation results showes that Ring structure of scatterent have good performance than Tree structure over mobile environments.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.271-273
• /
• 2001

최근들어 블루투스 기술은 정보 기기간의 케이블 통신을 대체하는 저가격의 무선 통신 기술로서 많은 관심을 끌고 있으며 블루투스 칩, 프로토콜 스택 및 응용 제품 개발이 활발히 진행되고 있다. 특히 블루투스는 1개의 마스터와 최대 7개의 슬레이브로 구성되는 피코넷과 다수의 피코넷으로 구성되는 스캐터넷의 형성이 가능하여 이를 이용한 ad hoc PAN 네트워킹에 대한 연구가 시작되고 있다. 블루투스 ad hoc PAN 연구를 위해서는 시뮬레이터의 이용이 필수적이다. 본 논문은 블루투스 피코넷에서의 ad hoc 네트워킹을 위한 Glomosim 기반 시뮬레이터의 설계 및 구현에 관한 내용이다. 이 시뮬레이터는 Glomosim 시뮬레이터의 MAC 계층 모듈에 블루투스 baseband 및 LM 래이어를 추가하여 ad hoc IP 라우팅이 가능하도록 설계되어 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.117-128
• /
• 2006

For the legacy IEEE 802.15.3 WPAN protocol, an unpredictable piconet coordinator(PNC) leaving from a piconet without a proper handoff procedure causes an absence of PNC, and thus the piconet gets collapsed. In addition, several beacons from PNCs in adjacent piconets may be collided on a device(DEV) located between those piconets. This beacon collision eventually makes the DEV leave from the piconet. To remedy these two problems, we here propose an Active Seamless Coordinator Switching(ASCS) scheme and a PNC HB based Beacon Alignment(PHBA) one. In the ASCS scheme, a PNC assigns a number of DEVs as next possible PNCs in sequence for provisioning against the abrupt breakdown of the current active PNC. Each nominated DEV proactively sends a probe frame to confirm the operation status of the active PNC. For the case of no response from the PNC, the nominated DEV tries to become a new PNC immediately. In the second PHBA scheme, each PNC is allow to broadcast a special Heart Beat(HB) frame randomly during a superframe period. When a DEV receives a HB frame from other PNC, it promptly sends the related PNCs a special Hiccup Beat(HCB) frame with the superframe information of its associated PNC. As a result, the HCB frame makes both PNCs align their superframe beginning time in order to yield no more beacon collisions. For these two proposed schemes, we show the performance by simulations. We can confirm the enhancement of throughput for each superframe and average frame transfer delay, since each scheme can reduce the duration of piconet collapse. Finally, it is worth while to note that the proposed schemes can be operated with frames those are permitted in the legacy WPAN standard.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10B
• /
• pp.639-647
• /
• 2005

When a DEV associates with an existing WPAN, the PNC checks the capabilities of the new DEV to see if it is more capable to be the PNC of the piconet based on the criteria defined in the IEEE Std 802.15. If the new DEV is more capable and the current security policies allow it, then the PNC has the option of handing over control of the piconet to the DEV that has just joined. And, If the PNC is shutting down or wants to leave the WPAN, it also uses the handover process to give control to another DEV in the piconet. However, IEEE 802.15.3 checks only DEV capability information for more PNC capable. For PNC selection, it should consider the radio coverage of new PNC capable DEVs. So, we propose the method of PNC selection with accessibility check. This method manages PNC candidate list in the current piconet. In this paper, we analyze accessibility problems for PNC selection in section 2. In section 3, we explain CI(Configuration Inquiry) process which is proposed by Sony Corporation and propose PCI(PNC Candidate Inquiry) process. Also, we perform numerical analysis to compare PCI process with CI process in section 4. Finally, we conclude in section 5.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.535-537
• /
• 2002

본 논문에서는 볼루투스-무선랜 통합 애드혹 망에서의 효율적인 IP 기반 데이터 통신을 위해 기존의 애드혹 라우팅 프로토콜을 수정하여 성능을 향상시킨 새로운 라우팅 프로토콜을 소개한다. 제안된 라우팅 프로토콜은 블루투스 피코넷의 통신방식을 고려하여 피코넷 내에서 제어 패킷의 브로드캐스팅을 제한한다 이를 위해 블루투스-무선랜 듀얼 모드 디바이스를 위한 적응계층을 설계하고 동작을 정의하였다 시뮬레이션을 이용한 제안된 라우팅프로토콜과 기존의 라우팅 프로토콜의 성능 비교를 통하여 제안된 라우팅 프로토콜의 성능이 우수함을 보인다

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.169-171
• /
• 2001

불루투스는 10m 반경 내에서 1mbps 정도의 속도를 제공해 주는 무선 통신 시스템이다. 블루투스는 피코넷(piconet)을 형성하며 Master/Slave라는 비대칭 구조를 가지며 한 피코넷 당 최대 7개의 Active Mode 노드를 가질 수 있다. 그 이상의 노드를 서비스하기 위해서는 Park Mode를 이용하도록 규정되어 있다. 이 논문에서는 블루투스의 Park Mode에 대해 살펴보고 이를 사용한 3가지 시나리오(경마장, 시나리오, fast Food Restaurant 시나리오, 도서관 시나리오)를 상정하고 각 시나리오에 대해 블루투스 시스템이 실제로 얼마만큼의 성능을 제공할 수 있는지를 시뮬레이션 결과를 통해 알아본다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.238-241
• /
• 2003

최근 단거리 무선통신 중의 하나인 블루투스(bluetooth)의 기술이 첨가된 전자결재시스템 등의 출현으로 블루투스의 보안 문제가 대두되었다. 기존의 블루투스 보안 모델(bluetooth security model)은 하나의 피코넷(piconet)에서만 적용되어지며, 다수의 피코넷으로 구성된 스캐터넷(scatternet)에서는 적용될 수 없다. 본 논문에서는 스캐터넷상에서 서로 다른 보안 정책을 갖고 있는 다수의 어플리케이션을 지원하는 보안 모델을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.848-849
• /
• 2012

IEEE 802.15.3c 는 IEEE 802.15.3 WPAN 에 mmWave(millimeter wave) 기반 물리 계층의 표준화를 하는 것을 목적으로 하며, 사용 대역의 특성상 지향성(directional) 안테나를 이용해서 통신을 한다. 또한 하나의 노드를 중심으로 피코넷을 형성하고 그 피코넷 내에서 peer 노드들 간 직접 통신을 위해서 peer 노드를 발견하는 효율적인 기법이 요구된다. 본 논문에서는 지향성 안테나를 사용하는 IEEE 802.15.3c 의 특성을 고려한 효율적인 이웃 발견 기법을 제안한다.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.38-47
• /
• 2003

Communication between Bluetooth devices is based on TDD by a master unit. In this discipline, the transmission of slave packets can be made only when the master transmits a packet to the slave. Thus, some slots may be wasted when there is no user data in the master's or slave's queue due to the transmission of a POLL or NULL packet. Therefore a scheduling scheme which can minimize the slot waste is required in Bluetooth intra-piconet communication. However, since the master is responsible for the intra-piconet scheduling, it must be provided with an information on each slave's queue length to apply traditional scheduling schemes. which is impossible in Bluetooth. This paper presents a new Bluetooth intra-piconet scheduling scheme that is efficient and does not require the information on each slave's queue length. The scheduling is done based on the information about the existence of data in the master and slave queues which is derived by the master identifying the type of packets transmitted. The master schedules to communicate with the slaves according to the priorities determined based on this information. We Presents simulation results which indicate a significant improvement in the performance when our proposed scheme is used.