• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.183-186
• /
• 2003

기존의 스캐터넷 형성 알고리즘은 스캐터넷의 초기 형성에 있어서는 알고리즘을 제공하고 있으나, 다중 스캐터넷 환경에서 기기가 다른 스캐터넷으로 이동하거나 탈퇴 할 경우 의도하지 않은 기기들의 연결 종료에 대한 재구성 알고리즘으로는 비교적 많은 시간이 소모되어 효과적이지 못하다. 본 논문에서는 블루투스 기기들의 이동이나 탈퇴로 인한 스캐터넷의 변화에 대해 효과적으로 재구성하는 알고리즘을 제안한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.9 s.339
• /
• pp.57-64
• /
• 2005

A Piconet consists of Master device and several Slave devices. Master and Slave devices are transmitted using TDD (Time Duplex Oivision) in a Piconet. A Scattemet constructed by several Piconets communicates by a Piconet. Bluetooth Specification defines the meaning of a Scatternet. But the formation and scheduling method is not defined. For the efficient formation of a Scatternet, the preceding research proposes a tree-shape topology Scatternet. But this research passes over the characteristic of Bluetooth transmission carried out by a Piconet in the Scattemet. So this Paper proposes a efficient throughput tree formation Scatternet algorithm To improve the throughput of a Scatternet, this paper proposes a tree tolopology that guarantees the efficient throughput of a Piconet

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.314-326
• /
• 2004

Bluetooth has been reputed as a wireless ad-hoc networking technology supplying scalable and extensible networks between digital devices. For that kind of networks, scatternet is a most essential part in bluetooth. But past researches on bluetooth scatternet has proposed only possibilities of scatternet algorithm based on simulation results. And many of the researches failed in guaranteeing extensibility and flexibility and had many difficulties in real hardware implementation. In this paper, we proposed node ring scatternet(NRS) algorithm guaranteeing extensible and flexible networks. NRS algorithm is designed for hardware implementation using real commercial bluetooth module. That algorithm is divided into initial formation and reformation. For initial formation, we proposed limited SEEK/SCAN algorithm. For reformation, we proposed DIAC algorithm and Reserved Recovery Node algorithm. And we proposed SFMP(Scatternet Formation ＆ Management Protocol) in protocol stack for real implementation. NRS algorithm is operated in SFMP. Finally, we performed real hardware experiments and evaluated the proposed algorithm. In that experiments, we succeeded in forming scatternet up to 20 nodes. In comparison with other similar algorithm, proposed algorithm have the improvement in scatternet formation delay and success rate.

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

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10A
• /
• pp.838-846
• /
• 2003

In Bluetooth networks, the scatternet is defined as the internetworking of multiple piconets. Currently, Bluetooth standardization does not include the formation issue of scatternet by piconets. The existing formation algorithms of scatternet do not support the features of ad-hoc networks, which cause the performance degradation of systems when the nodes have certain degree of mobility. Therefore, as the formation of scatternet gets complicated, the throughput is lowered and the delay increases due to the inefficient architectural problems. In this paper, we propose the distributed formation scheme for bluetooth in scatternet, in which the nodes are spread out to form scatternet. Simulation results show that the proposed algorithm outperforms the conventional schemes.

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

블루투스는 저렴한 칩 가격과 간섭에 강한 특성을 바탕으로 휴대폰, PDA, 노트북 등 모바일 디바이스를 주요 대상으로 하는 좁은 범위의(short-range) 무선 ad-hoc 네트워크를 구성하기 위한 유력한 기술로 떠오르고 있다. 블루투스는 대부분의 무선 ad-hoc 네트워크 기술들이 단일 채널의 방송 기반 (broadcast based) 방식에 바탕을 두고 있는 것과는 달리, 주파수 호핑(frequency-hopping)을 기반으로 하는 다중 채널 방식에 바탕을 두고 있다. 그러므로 각각의 채널을 서로 연결하여 스캐터넷 (scatternet)이라고 하는 하나의 네트워크를 형성하게 되는데, 이 때 각 채널을 연결하는 방법에 따라 다양한 형태의 스캐터넷을 형성할 수 있다. 현재 발표되어 있는 스캐터넷 형성 정책들은 모바일 환경에 대한 고려가 부족하여, 노드들의 이동이 빈번한 모바일 환경을 효과적으로 지원하지 못하고 있다. 본 논문에서는 각 노드들이 빈번하게 스캐터넷에 추가되고 삭제되는 모바일 환경에서 정화하고 효과적으로 스캐터넷을 형성할 수 있는 정책을 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4A
• /
• pp.411-417
• /
• 2008

This paper proposes BSFP (Bluetooth Scatternet Formation Protocol), which establishes a multi-hop bluetooth scatternet. BSFP independently operates on each bluetooth device, does not require any information on neighbor devices at the very beginning, and can establish a scatternet even though all the devices are spreaded beyond the bluetooth transmission range. BSFP is composed of the following three stages; 1) Init stage to investigate neighbor nodes, 2) Ready stage to establish a scatternet using gathered local information at each node, and 3) Complete stage to use the determined scatternet links. In BSFP, the scatternet formation time does not significantly affected by the number of bluetooth devices and a robust mobile ad hoc network is formed because BSFP formulates a scatternet with many adjacent links to neighbor devices.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.07a
• /
• pp.65-66
• /
• 2014

본 논문에서는 어떤 주제에 대해 한 공간에 모인 사람들의 의견을 조사하기 위해 실시될 수 있는 모바일 즉석투표 시스템의 개발내용에 대해 기술한다. 이 시스템은 블루투스 스캐터넷 형성을 통해 특정 서버가 갖춰지지 않은 상태에서, 사전 관계가 지어있지 않은 모집단을 대상으로 투표를 실시 할 수 있다.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.110-122
• /
• 2005

Bluetooth has been reputed as a wireless networking technology supplying ad-hoc networks between digital devices. In particular, bluetooth scatternet is a most essential part for dynamic ad-hoc networks. But past researches on bluetooth scatternet has hardly treated dynamic scatternet environment. In this paper, we proposed a scatternet reformation algorithm for the case that some nodes escape from the scatternet. The proposed algorithm is a general algorithm which can be applied to many types of bluetooth scatternet regardless of the topology. The proposed algorithm has short reformation time delay because the process has only page process (not including inquiry process ). The algorithm is operated based on Recovery Node Vector which is composed of Recovery Master and Recovery Slave. In this paper, we performed the real hardware experiments for evaluating the performance of the proposed algorithm. In that experiments, we measured the reformation time and reformation probability. In comparison with the case including inquiry process, the proposed algorithm had the improvement in reformation time delay and we obtained high success rate over 97%.

• 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.