On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
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
Wireless access to internet via Bluetooth: performance evaluation of the EDC scheduling algorithm
WMI '01 Proceedings of the first workshop on Wireless mobile internet
Performance of a new Bluetooth scatternet formation protocol
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Journal of High Speed Networks
RNG and internal node based broadcasting algorithms for wireless one-to-one networks
ACM SIGMOBILE Mobile Computing and Communications Review
Sparse Power Efficient Topology for Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
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
Methods for Scalable Self-Assembly of Ad Hoc Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Bottom-Up Construction of Bluetooth Topology under a Traffic-Aware Scheduling Scheme
IEEE Transactions on Mobile Computing
Hop count based optimization of Bluetooth scatternets
Ad Hoc Networks
Peer to peer video streaming in Bluetooth overlays
Multimedia Tools and Applications
Simplified bluetooth scatternet formation using maximal independent sets
Integrated Computer-Aided Engineering
Bluetooth scatternet formation: A survey
Ad Hoc Networks
Bluetooth scatternets: criteria, models and classification
Ad Hoc Networks
SF-DeviL: an algorithm for energy-efficient Bluetooth scatternet formation and maintenance
Computer Communications
Cube connected cycles based bluetooth scatternet formation
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
A simple and fast algorithm for bluetooth network formation
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Hi-index | 0.00 |
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each node is assumed to know its position and position of all its neighbours. The proposed formation algorithms have three phases. In the first phase the unit graph is constructed (each node establishes connection with all its neighbors that are located within its transmission radius, which is equal for all nodes), and, if planar structure is desirable, localized sparse subgraph (such as relative neighbourhood or Gabriel graph) is extracted. In the second phase, the degree of each node is limited to 7 by applying Yao subgraph construct simultaneously on all nodes with excessive degree, followed by either elimination of directed edges or the application of reverse Yao construct. In the last phase, master-slave relations are created by applying higher degree priority (with dominating set membership as the primary key). The creation and maintenance requires minimal overhead in addition to maintaining accurate location information for one-hop neighbours. The proposed schemes have localized maintenance property (scatternet maintenance due to movement or activity change of a single node is limited to the locality of that node), which is not the case with the existing clustering based Bluetooth scatternet formation schemes.