2016
DOI: 10.1109/twc.2016.2523984
|View full text |Cite
|
Sign up to set email alerts
|

Relay Placement in Wireless Networks: Minimizing Communication Cost

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
22
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 21 publications
(22 citation statements)
references
References 30 publications
0
22
0
Order By: Relevance
“…The proposed methods for the deployment of RNs differ first and foremost in their objectives. As such, some of these methods aim to ensure only simple connectivity (1‐connectivity) . Other methods aim to reach k ‐connectivity ( k ≥ 2), which means, in the context of the problem at hand, that each SN has k disjoint paths to route its own data to the CNs, allowing the fault‐tolerance.…”
Section: Overview On the Use Of Rnsmentioning
confidence: 99%
See 2 more Smart Citations
“…The proposed methods for the deployment of RNs differ first and foremost in their objectives. As such, some of these methods aim to ensure only simple connectivity (1‐connectivity) . Other methods aim to reach k ‐connectivity ( k ≥ 2), which means, in the context of the problem at hand, that each SN has k disjoint paths to route its own data to the CNs, allowing the fault‐tolerance.…”
Section: Overview On the Use Of Rnsmentioning
confidence: 99%
“…Other methods aim to reach k ‐connectivity ( k ≥ 2), which means, in the context of the problem at hand, that each SN has k disjoint paths to route its own data to the CNs, allowing the fault‐tolerance. The connectivity objective is supported by two deployment modes: (i) reactive deployment, initiated after the loss of connectivity to re‐establish it, and (ii) proactive deployment, adopted to avoid any loss of connectivity …”
Section: Overview On the Use Of Rnsmentioning
confidence: 99%
See 1 more Smart Citation
“…The time complexity is very high in largescale networks. In [20], it is proven that just listing a set of feasible sites for the relays is already at least APX-hard. Though many heuristic algorithms have been proposed, such as Genetic Algorithm [12,21], Artificial Bee Colony Algorithm [14], and Concentric Fermat Points [31], it is still extraordinarily time-consuming.…”
Section: Related Workmentioning
confidence: 99%
“…Every actor sends a message to notify its backup node to monitor its status and BestPosition. When a node detects a failure of its neighbors, it will trigger the cascading node motion (line [18][19][20][21][22][23][24][25]. The backup node will add BestPosition into its NEIGH_TABLE to tell whether it is critical.…”
mentioning
confidence: 99%