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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.100-103
• /
• 2002

Bluetooth is consisted of piconet that have 1 master and slave of maximum 7 in Ad-hoc environment, and many piconet gathers and compose one scatternet. Wish to embody performance estimation for effective scatternet's formation and mechanism by node number through Bluehoc simulator of NS base in this treatise and present scatternet formation policy of most suitable.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.3
• /
• pp.208-212
• /
• 2008

This paper proposes a model of a voice communication using bluetooth and a mobile, and implements a hands-free for this model. A Proposed model uses bluetooth for a voice network, and is possible to share a voice with a great number of people using preemptive algorithm proposed in this paper. There are two types of models. One is a model only using a hands-free, the other is a model using a mobile. Second model uses a scatternet and a call forwarding service for a call on a voice communication. In case of using a scatternet, scatternet is composed of a piconet of a voice communication and a piconet of a call. In case of using a call forwarding service, the mobiles share information of each others before formation of a network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7A
• /
• pp.467-476
• /
• 2003

In this paper, we propose an efficient MAC scheduling algorithm for supporting Bluetooth scatternet operations. Our proposed algorithm improves overall performances of scatter mode［2, 3] and considers QoS requirements of each link of the bridge node of a scatternet. Scatter mode is based on time division scheduling and provides every links of a scatternet with fair service opportunities. However, since each Bluetooth devices has various traffic characteristics. fair allocation of service opportunities is not efficient and may cause extravagance of wireless resources. Therefore, we propose a new efficient inter-piconet scheduling algorithm compliant with the current Bluetooth specification［1］, and demonstrate its improved performances via computer simulations.

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

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.401-408
• /
• 2004

The Bluetooth Scatternet based on tree structure has several merits such as small numb of links and simple routing method. This paper proposes an algorithm which satisfies the constraints of Bluetooth Specification and forms the topology of scatternet as close as the tree structure that has the shortest average inter-node distance among trees. Also we show that the proposed method reduces the average hop count between any two devices compared to early works without higher formation delay by a simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.613-619
• /
• 2003

Bluetooth is a communication technology enabling short-range devices to be wirelessly connected. A master and one or more slave devices are connected to form a piconet, and piconets are joined to form a scatternet. The units participating in two or more piconets in a scatternet, is called bridge or gateway nodes. In order to operate the scatternet efficiently, both piconet scheduling for the master and slaves of a piconet, and scatternet scheduling for the bridge nodes are playing important roles. In this paper, we propose a traffic-adaptive dynamic scatternet scheduling algorithm based on rendezvous points and rendezvous windows. The performance of the proposed algorithm is compared and analyzed with that of a static scheduling algorithm via simulations. Simulation results show that our algorithm can distribute wireless resources efficiently to bridge nodes depending on the traffic characteristics.

• The Journal of Korean Association of Computer Education
• /
• v.5 no.3
• /
• pp.19-25
• /
• 2002

Bluetooth, in radio network environment, is a small local radio communication that is available with low expense and little power use. It is specified for the wireless connect in a small area between Network Excess Point, portable devices such as mobile phones. PDAs and portable PCs, and other per peripheral equipment. Bluetooth is consisted of a master and a piconet having seven slaves in a maximum and finally has a scatternet gathering lot of piconet. The thesis tries to design the most effective structure of a scatternet by the number of nodes and the type of scatternet such as linear and ring for its mechanism. then the performance evaluation is realized through the Bluehoc simulator based on the NS. Finally the most appropriate radio network environment is made by the comparison and analysis of the characteristics of liner and ring scatternets.

• Journal of Information Processing Systems
• /
• v.5 no.4
• /
• pp.167-174
• /
• 2009

Nowadays, it has become common to equip a device with Bluetooth. As such devices become pervasive in the world; much work has been done on forming them into a network, however, almost all the Bluetooth Scatternet Formation Algorithms assume devices are homogeneous. Even the exceptional algorithms barely mentioned a little about the different characteristics of devices like computational abilities, traffic loads for special nodes like bridge nodes or super nodes, which are usually the bottleneck in the scatternet. In this paper, we treat the devices differently not only based on the hardware characteristics, but also considering other conditions like different classes, different groups and so on. We use a two-phase Scatternet Formation Algorithm here: in the first phase, construct scatternets for a specified kind of devices; in the second phase, connect these scatternets by using least other kinds of devices as bridge nodes. Finally, we give some applications to show the benefit of classification.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.17-29
• /
• 2007

This paper addresses a RNG based scatternet topology formation, self-healing, and routing path optimization for small-scale distributed environment, which is called RNG-FHR(Scatternet Formation, self-Healing and self-Routing path optimization) algorithm. We evaluated the algorithm using ns-2 and extensible Bluetoothsimulator called blueware to show that RNG-FHR does not have superior performance, but is simpler and more practical than any other distributed algorithms from the point of depolying the network in the small-scale distributed dynamic environment due to the exchange of fewer messages and local control. As a result, we realized that even though RNG-FHR is unlikely to be possible for deploying in large-scale environment, it surely can be deployed for performance and practical implementation in small-scale environment.