The search functionality is under construction.
The search functionality is under construction.

Author Search Result

[Author] Chih-Min YU(4hit)

1-4hit
  • On the Architecture Design and Performance Evaluation of a Configurable Blueweb Network

    Chih-Min YU  Chia-Chi HUANG  

     
    PAPER-Network

      Vol:
    E90-B No:5
      Page(s):
    1104-1111

    Blueweb is a self-organizing Bluetooth-based multihop network equipped with a scatternet formation algorithm and a modified source routing protocol. In this paper, we first review the basic Blueweb network. Then we focus on a heuristic automatic configuration algorithm which can be used to partition a large-scale Blueweb network. This algorithm contains three main functional blocks including route master selection, node assignment, and subnet number decision. The route master selection block selects new route masters at a low computation cost. The node assignment block assigns nodes to each newly configured subnet in order to minimize the average route query cost. The subnet number decision block determines the optimal number of subnet which achieves the largest system performance improvement ratio at minimum operation cost. With these three functional blocks, optimal network configuration for Blueweb routing protocol can be determined. Computer simulations show that a configured Blueweb achieves higher network capacity than an unconfigured Blueweb.

  • HMT: A Hybrid Mesh Tree Algorithm in Forming Bluetooth Networks

    Chih-Min YU  

     
    LETTER

      Vol:
    E94-D No:6
      Page(s):
    1178-1180

    In this letter, a new scatternet formation algorithm called hybrid mesh tree for Bluetooth ad hoc networks was proposed. The hybrid mesh tree constructs a mesh-shaped topology in one dense area that is extended by tree-shaped topology to the other areas. First, the hybrid mesh tree uses a designated root to construct a tree-shaped subnet, and then propagates a constant k in its downstream direction to determine new roots. Each new root then asks its upstream master to start a return connection procedure to convert the first tree-shaped subnet into a mesh-shaped subnet. At the same time, each new root repeats the same procedure as the designated root to build its own tree-shaped subnet until the whole scatternet is formed. Simulation results showed that the hybrid mesh tree achieved better network performance than Bluetree and generated an efficient scatternet configuration for various sizes of Bluetooth scatternets.

  • Introduction to Blueweb: A Decentralized Scatternet Formation Algorithm for Bluetooth Ad Hoc Networks

    Chih-Min YU  Chia-Chi HUANG  

     
    LETTER

      Vol:
    E91-B No:9
      Page(s):
    2873-2875

    In this letter, a decentralized scatternet formation algorithm called Bluelayer is proposed. First, Bluelayer uses a designated root to construct a tree-shaped subnet and propagates an integer variable k1 called counter limit as well as a constant k in its downstream direction to determine new roots. Then each new root asks its upstream master to start a return connection procedure to convert the tree-shaped subnet into a web-shaped subnet for its immediate upstream root. At the same time, each new root repeats the same procedure as the root to build its own subnet until the whole scatternet is formed. Simulation results show that Bluelayer achieves good network scalability and generates an efficient scatternet configuration for various sizes of Bluetooth ad hoc network.

  • On the Architecture and Performance of Blueweb: A Bluetooth-Based Multihop Ad Hoc Network

    Chih-Min YU  Shiang-Jiun LIN  Chia-Chi HUANG  

     
    PAPER-Network

      Vol:
    E89-B No:2
      Page(s):
    482-489

    In this paper, we present Blueweb, a new Bluetooth-based multihop network with an efficient scatternet formation algorithm and a hybrid routing protocol. The Blueweb is designed from the original idea of Bluetree. Blueweb's scatternet formation uses two mechanisms. One is the role exchange mechanism in which only slave nodes serve as the role of relay through the whole scatternet. The other one is the return connection mechanism in which we convert the scatternet from a tree-shaped to a web-shaped topology. Meanwhile, a modified source routing protocol is designed for Blueweb in which we combine the proactive method with the reactive method to discover the optimal path for packet transmission. Furthermore, using computer simulations we compared the system performance of Blueweb and Bluetree with both a static model and a uniform traffic model. With the static model we evaluate the scatternet performance and with the uniform traffic model we evaluate the transmission performance. Our simulation results show that Blueweb achieves superior system performance than Bluetree on both scatternet performance and transmission performance.