Exploring Connected Dominating Sets in Energy Harvest Networks

Shi, Tuo; Cheng, Siyao; Cai, Zhipeng; Li, Yingshu; Li, Jianzhong

doi:10.1109/tnet.2017.2657688

Cited by 43 publications

(17 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Shi et a. [45] proposed a new problem for energy harvest networks (EHNs) including rechargeable nodes named Energy Harvest CDS and they proved that this problem in NP hard. The authors present centralized and decentralized algorithms to solve this problem and some variants where mobile nodes can replace nodes with lower battery level.…”

Section: Mobile Networkmentioning

confidence: 99%

DACYCLEM: A decentralized algorithm for maximizing coverage and lifetime in a mobile wireless sensor network

et al. 2019

View full text Add to dashboard Cite

Section: Mobile Networkmentioning

confidence: 99%

DACYCLEM: A decentralized algorithm for maximizing coverage and lifetime in a mobile wireless sensor network

et al. 2019

View full text Add to dashboard Cite

“…The MCDS has many applications in the special network models, such as ad hoc networks [24,25], energy harvest networks [26], battery-free networks [27], cognitive ratio networks [28], and others [29][30][31].…”

Section: Centralized Algorithmsmentioning

confidence: 99%

A novel centralized algorithm for constructing virtual backbones in wireless sensor networks

Luo

Chen

et al. 2018

J Wireless Com Network

View full text Add to dashboard Cite

Finding the minimum connected dominating set (MCDS) is a key problem in wireless sensor networks, which is crucial for efficient routing and broadcasting. However, the MCDS problem is NP-hard. In this paper, a new approximation algorithm with approximation ratio H( ) + 3 in time O n 2 is proposed to approach the MCDS problem. The key idea is to divide the sensors in CDS into core sensors and supporting sensors. The core sensors dominate the supporting sensors in CDS, while the supporting sensors dominate other sensors that are not in CDS. To minimize the number of both the cores and the supporters, a three-phased algorithm is proposed. (1) Finding the base-core sensors by constructing independent set (denoted as S 1 ), in which the sensors who have the largest(number of two-hop neighbors over the number of one-hop neighbors) will be selected greedily into S 1 ; (2) Connecting all base-core sensors in S 1 to form a connected subgraph, the sensors in the subgraph are called cores; (3) Adding the one-hop neighbors of the core sensors to the supporter set S 2 . This guarantees a small number of sensors can be added into CDS, which is a novel scheme for MCDS construction. Extensive simulation results are shown to validate the performance of our algorithm.

show abstract

“…This technology can realize the reuse of energy resources. An SU with EH technology can harvest energy from the ambient environment [11,12], e.g., solar energy, thermal energy, and sound energy. Additionally, it can also harvest energy from the surrounding electromagnetic field generated by other communication nodes, which is defined as the wireless powered communication (WPC) technology [13].…”

Section: Introductionmentioning

confidence: 99%

A novel secure relay selection strategy for energy-harvesting-enabled Internet of things

Huo

Fan

Jing

2018

J Wireless Com Network

View full text Add to dashboard Cite

In this article, we focus on the problem of relay selection for the cooperative cognitive radio-based Internet of things. In such systems, a pair of primary user devices (PUs) can only communicate with each other through a relay. The relay is selected from a set of multi-slot energy-harvesting (EH)-enabled secondary user devices (SUs). The charging and discharging process of an SD's battery is formulated as a finite state Markov chain, and we can derive the corresponding analytical expression of steady-state distribution. Consider the non-authority of SUs, we analyze the outage performance when SUs are trusted and untrusted. When SUs are trusted, we provide the theoretical analysis expression and the lower bound expression for the outage probability. On the contrary, we propose a destination-assisted jamming strategy to secure primary communication if SUs are untrusted. In addition, we propose a Vickrey auction-based EH-enabled relay selection strategy which can be applied to the secondary system. For this auction strategy, SUs without direct links can transmit signals by selecting an EH-enabled SU as a relay. The winning SU in the process of auction can earn reward. Finally, the simulation results verify that the EH-based transmission can obtain excellent system performance without consuming excess energy, and we also study the effect of different parameters on system outage performance.

show abstract

Exploring Connected Dominating Sets in Energy Harvest Networks

Cited by 43 publications

References 24 publications

DACYCLEM: A decentralized algorithm for maximizing coverage and lifetime in a mobile wireless sensor network

DACYCLEM: A decentralized algorithm for maximizing coverage and lifetime in a mobile wireless sensor network

A novel centralized algorithm for constructing virtual backbones in wireless sensor networks

A novel secure relay selection strategy for energy-harvesting-enabled Internet of things

Contact Info

Product

Resources

About