A Fault-Tolerant Tree Communication Scheme for Hypercube Systems
IEEE Transactions on Computers
Clustering algorithms for wireless ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Proximity awareness and fast connection establishment in Bluetooth
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Performance aspects of Bluetooth scatternet formation
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Randomized Initialization Protocols for Packet Radio Networks
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Optimal Routing Based on Super Topology in Hypercube WDM Networks
LCN '99 Proceedings of the 24th Annual IEEE Conference on Local Computer Networks
Latency Hiding in Dynamic Partitioning and Load Balancing of Grid Computing Applications
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Software Architecture-Based Adaptation for Grid Computing
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
BlueMesh: degree-constrained multi-hop scatternet formation for Bluetooth networks
Mobile Networks and Applications
Configuring BlueStars: multihop scatternet formation for Bluetooth networks
IEEE Transactions on Computers
TARP: A traffic-aware restructuring protocol for Bluetooth radio networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
"Don't trust anyone": Privacy protection for location-based services
Pervasive and Mobile Computing
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
On the mutually independent Hamiltonian cycles in faulty hypercubes
Information Sciences: an International Journal
International Journal of Automation and Computing
Hi-index | 0.00 |
In parallel computing structures, Hypercubes [P. J. Wan, L. W. Liu, Y. Yang, Optimal routing based on the super-topology in Hypercube WDM networks, 1999, pp. 142-149] and [Y. R. Leu, S. Y. Kuo, A fault-tolerant tree communication scheme for hypercube systems, IEEE Trans Comput. 45(6) (1996) 643-650] have many advantages: they support parallel computing, provide disjoint paths, and tolerate faults. If devices with computing capabilities can be linked as a Hypercube by taking advantage of Bluetooth radio's features, then an efficient communication and high-performance computing environment can be established by applying currently used algorithms. A Bluetooth device randomly searches for and connects with other devices, using time-consuming inquiry/inquiry scan and page/page scan operation and hence, results in an uncontrolled scatternet topology and inefficient communications. The present work proposes a three-stage distributed construction protocol for rapidly organizing a Hypercube computing environment that was constructed from Bluetooth devices. The proposed protocol governs the construction of links, the assigning of roles and the formation of the scatternet in order to efficiently construct a Hypercube structure. The constructed scatternet easily enables Bluetooth devices to establish a routing path, tolerate faults and create disjoint paths, and thus, achieves parallel and distributed computing in a Bluetooth wireless environment. Experimental results reveal that the proposed protocol can set up a scatternet that is appropriate for parallel computing and communications.