Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
GPS-free Positioning in Mobile Ad Hoc Networks
Cluster Computing
Dominating Set Based Bluetooth Scatternet Formation with Localized Maintenance
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Device Discovery in Bluetooth Networks: A Scatternet Perspective
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
A Performance Comparison of Scatternet Formation Protocols for Networks of Bluetooth Devices
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
BlueMesh: degree-constrained multi-hop scatternet formation for Bluetooth networks
Mobile Networks and Applications
Partial Delaunay Triangulation and Degree Limited Localized Bluetooth Scatternet Formation
IEEE Transactions on Parallel and Distributed Systems
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Distributed topology construction of Bluetooth wireless personal area networks
IEEE Journal on Selected Areas in Communications
Partial Delaunay Triangulation and Degree Limited Localized Bluetooth Scatternet Formation
IEEE Transactions on Parallel and Distributed Systems
Geographical Cluster-Based Routing in Sensing-Covered Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Mobile Computing
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Bottom-Up Construction of Bluetooth Topology under a Traffic-Aware Scheduling Scheme
IEEE Transactions on Mobile Computing
Constrained Delaunay triangulation for ad hoc networks
Journal of Computer Systems, Networks, and Communications
Multi-hop scatternet formation and routing for large scale Bluetooth networks
International Journal of Ad Hoc and Ubiquitous Computing
Journal of Network and Computer Applications
Single-step creation of localized Delaunay triangulations
Wireless Networks
RNG-based scatternet formation algorithm for small-scale ad-hoc networks
ICOST'07 Proceedings of the 5th international conference on Smart homes and health telematics
IEEE/ACM Transactions on Networking (TON)
Plane spanners of maximum degree six
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Success guaranteed routing in almost Delaunay planar nets for wireless sensor communication
International Journal of Sensor Networks
On the topologies of local minimum spanning trees
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
A scatternet formation algorithm for Bluetooth networks with a non-uniform distribution of devices
Journal of Network and Computer Applications
Fast localized delaunay triangulation
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Fault-tolerant spanners for ad hoc networks
International Journal of Network Management
Hi-index | 0.00 |
Abstract--This paper addresses the problem of localized scatternet formation for multihop Bluetooth-based personal area ad hoc networks. Nodes are assumed to know their positions and are able to establish connections with any of their neighboring nodes, located within their transmission radius, in the neighbor discovery phase. The next phase of the proposed formation algorithm is optional and can be applied to construct a sparse geometric structure in a localized manner. We propose here a new sparse planar structure, namely, partial Delaunay triangulation (PDT), which can be constructed locally and is denser than other known localized planar structures. In the next mandatory phase, the degree of each node is limited to seven by applying the Yao structure, and the master-slave relations in piconets are formed in created subgraphs. This phase consists of several iterations. In each iteration, undecided nodes with higher keys than any of their undecided neighbors apply the Yao structure to bound the degrees, decide master-slave relations on the remaining edges, and inform all neighbors about either deleting edges or master-slave decisions. To the best of our knowledge, our schemes are the first schemes that construct degree limited (a node has at most seven slaves) and connected piconets in multihop networks, without parking any node. The creation and maintenance require small overhead in addition to maintaining accurate location information for one-hop neighbors. The experiments confirm good functionality of created Bluetooth networks in addition to their fast creation and straightforward maintenance.