A Convex-Hull Based Algorithm to Connect the Maximal Independent Set in Unit-Disk Graphs

Chen, Dechang; Mao, Xilong; Xia, Fei; Xing, Kai; Liu, Fang; Song, Min

doi:10.1007/11814856_35

Cited by 6 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…∀u ∈ V ∩C u form the set C. It is worth pointing out that C ∪ I is proved to be a backbone in [32]. In the following the word backbone refers to the expanded backbone.…”

Section: A Backbone Expansion With Convex-hullmentioning

confidence: 97%

“…The convex hull can be easily calculated by Graham's Scan algorithm. Note that the number of nodes on the boundary of convex hull H u is limited by a constant number 18[32], the execution of Graham's Scan algorithm costs a constant time for the computation of convex hull H u .Let node u ∈ V compute the shortest path to connect u and the nodes of N(I) u on the boundary of convex-hull H u . All the intermediate nodes that connect u and the nodes of N (I) u…”

mentioning

confidence: 99%

See 1 more Smart Citation

A localized backbone renovating algorithm for wireless ad hoc and sensor networks

Xing

Zhang

Shi

et al. 2013

2013 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

In this paper we propose and analyze a localized backbone renovating algorithm (LBR) to renovate a broken backbone in the network. This research is motivated by the problem of virtual backbone maintenance in wireless ad hoc and sensor networks, where the coverage area of nodes are disks with identical radii. According to our theoretical analysis, the proposed algorithm has the ability to renovate the backbone in a purely localized manner with a guaranteed connectivity of the network, while keeping the backbone size within a constant factor from that of the minimum CDS. Both the communication overhead and computation overhead of the LBR algorithm are O(k), where k is the number of nodes broken or added. We also conduct extensive simulation study on connectivity, backbone size, and the communicaiton/computation overhead. The simulation results show that the proposed algorithm can always keep the renovated backbone being connected at low communication/computation overhead with a relatively small backbone, compared with other existing schemes. Furthermore, the LBR algorithm has the ability to deal with arbitrary number of node failures and additions in the network.

show abstract

“…∀u ∈ V ∩C u form the set C. It is worth pointing out that C ∪ I is proved to be a backbone in [32]. In the following the word backbone refers to the expanded backbone.…”

Section: A Backbone Expansion With Convex-hullmentioning

confidence: 97%

mentioning

confidence: 99%

A localized backbone renovating algorithm for wireless ad hoc and sensor networks

Xing

Zhang

Shi

et al. 2013

2013 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

show abstract

“…The first set of techniques form a maximal independent set and connect these nodes through some connectors [23] [24]. Some techniques use Steiner tree to connect the maximal independent set nodes [25] [26]. In [26], a CDS is considered and the nodes are removed recursively to discover an MCDS.…”

Section: Related Workmentioning

confidence: 99%

A Power Aware Minimum Connected Dominating Set for Wireless Sensor Networks

Rai¹,

Verma²,

Tapaswi³

2009

JNW

View full text Add to dashboard Cite

Connected Dominating Set (CDS) problem in unit disk graph has a significant impact on an efficient design of routing protocols in wireless sensor networks. In this paper, an algorithm is proposed for finding Minimum Connected Dominating Set (MCDS) using Dominating Set. Dominating Sets are connected by using Steiner tree. The algorithm goes through three phases. In first phase Dominating Sets are found, in second phase connectors are identified, connected through Steiner tree. In third phase the CDS obtained in second phase is pruned to obtain a MCDS. MCDS so constructed needs to adapt to the continual topology changes due to deactivation of a node due to exhaustion of battery power. These topological changes due to power constraints are taken care by a local repair algorithm that reconstructs the MCDS i.e. Power Aware MCDS, using only neighbourhood information. Simulation results indicate both the heuristics are very efficient and result in near optimal MCDS.

show abstract

Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks

Islam

Akl

Meijer

2009

Distributed Computing in Sensor Systems

View full text Add to dashboard Cite

A Convex-Hull Based Algorithm to Connect the Maximal Independent Set in Unit-Disk Graphs

Cited by 6 publications

References 11 publications

A localized backbone renovating algorithm for wireless ad hoc and sensor networks

A localized backbone renovating algorithm for wireless ad hoc and sensor networks

A Power Aware Minimum Connected Dominating Set for Wireless Sensor Networks

Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks

Contact Info

Product

Resources

About