This paper addresses the scatternet formation for large scale multi-hop Bluetooth networks. We first describe an efficient method to build a Connected Dominating Set (CDS) as the backbone of multi-hop Bluetooth network, then propose new algorithms to form the dBBlue scatternets (Song et al., 2005) in each cluster. The final scatternet, M-dBBlue, guarantees the connectivity. Our experiment shows...

. Let G be a connected graph. A set S ⊆ V (G) is an outer-connected 2-resolving hop dominating of if and = or the subgraph ⟨V (G)\S⟩ induced by (G)\S connected. The domination number G, denoted γ^c2Rh(G) smallest cardinality G. This study aims to combine concept with sets graphs. main results generated in this include characterization join, corona, edge corona lexicographic product graphs, as w...

A set of vertices is a dominating set in a graph if every vertex not in the dominating set is adjacent to one or more vertices in the dominating set. A dominating clique is a dominating set that induces a complete subgraph. Forbidden subgraph conditions sufficient to imply the existence of a dominating clique are given. For certain classes of graphs, a polynomial algorithm is given for finding ...

Constructing a connected dominating set as the virtual backbone plays an important role in wireless networks. In this paper, we propose two novel approximate algorithms for dominating set and connected dominating set in wireless networks, respectively. Both of the algorithms are based on edge dominating capability which is a novel notion proposed in this paper. Simulations show that each of pro...

Multipoint relays o er an optimized way of ooding packets in a radio network. However, this technique requires the last hop knowledge: to decide wether or not a ooding packet is retransmitted, a node needs to know from which node the packet was received. When considering broadcasting at IP level, this information may be di cult to obtain. We thus propose a scheme for computing an optimized conn...

Many signaling or data forwarding operations involve the broadcasting of packets, which incurs considerable collisions in ad hoc networks based on a contention-based channel access protocol. We propose the Threehop Horizon Pruning (THP) algorithm to compute two-hop connected dominating set (TCDS) using only local topology information (i.e., two-hop neighborhood). Because every node has the two-...