.png){kind=icon}
.png){kind=icon}
Return
Optimal Landmark Placement in Cluster-Based Networks
.png){kind=icon}
OA
AI
A
M
DOI：10.1016/j.jpdc.2026.105254.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Exact metric dimension of Fm□Kn for all m,n (all parameter regimes). • O(m+n)-time constructive algorithms for optimal landmark (metric bases). • Backbone rollout uses ≤3(n−1) backbone messages and ≤2|W|+n local messages. • Enables routing, localization, and fault diagnosis in clustered sensor networks. • Links graph theory with optimization, extremal set theory, and distributed protocols.
Keywords:
Parallel and distributed systems
Wireless sensor networks
Network localization
Landmark (resolving-set) placement
Metric dimension
Interconnection networks
05C12
05C40
05C69
05C76
05C90
68R10
68M14
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
Cited Papers