Scholarlink

<p>Optimal sensor placement in Integrated Sensing and Communication (ISC) networks is essential for sustainable smart city infrastructure, supporting efficient resource allocation and reducing environmental impact through minimized energy consumption. Achieving optimal configurations requires solving multiple NP-complete optimization problems simultaneously. This paper studies a specific class of graphs called arbitrary super subdivisions of corona products with connected unit disk graphs that model hierarchical sensor networks in urban environments. We prove that for this graph class, the parameters domination number, vertex cover number and maximum matching number are all equal. Additionally, we demonstrate the practical utility of these results using a 20-intersection traffic network with geometric sensor deployment modelled on Chennai’s Anna Nagar district. Compared to standard approaches, our method reduces the number of required sensors by 64.3% while maintaining complete coverage, achieved through provably exact optimality with O(1) computational complexity. The edge cover formula enables similar optimization of communication infrastructure by providing closed-form expressions for the minimum number of communication links required. Our work provides the first systematic study of this graph family and establishes a theoretical foundation for optimizing sustainable, geometrically structured sensor networks that align with the goals of sustainable cities and communities.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Optimization of sustainable sensor networks using graph parameter equivalence on unit disk graph corona products for smart cities

  • 期刊论文

  • 发表日期：

    2026年8月3日

查看全文
  • D. Angel

摘要

Optimal sensor placement in Integrated Sensing and Communication (ISC) networks is essential for sustainable smart city infrastructure, supporting efficient resource allocation and reducing environmental impact through minimized energy consumption. Achieving optimal configurations requires solving multiple NP-complete optimization problems simultaneously. This paper studies a specific class of graphs called arbitrary super subdivisions of corona products with connected unit disk graphs that model hierarchical sensor networks in urban environments. We prove that for this graph class, the parameters domination number, vertex cover number and maximum matching number are all equal. Additionally, we demonstrate the practical utility of these results using a 20-intersection traffic network with geometric sensor deployment modelled on Chennai’s Anna Nagar district. Compared to standard approaches, our method reduces the number of required sensors by 64.3% while maintaining complete coverage, achieved through provably exact optimality with O(1) computational complexity. The edge cover formula enables similar optimization of communication infrastructure by providing closed-form expressions for the minimum number of communication links required. Our work provides the first systematic study of this graph family and establishes a theoretical foundation for optimizing sustainable, geometrically structured sensor networks that align with the goals of sustainable cities and communities.