Scholarlink

<p>A mobile ad hoc network (MANET) is a decentralized, wireless network dynamically formed by mobile devices that communicate without relying on fixed infrastructure. MANETs are widely used in applications such as video conferencing, distance learning, military operations, and e-commerce, all of which require multicast routing techniques that ensure quality of service (QoS). A fundamental approach to multicast routing in wireless networks is the construction of a Steiner tree, which connects a source node to multiple destination nodes while minimizing total transmission cost. However, the Steiner tree problem (STP) is NP-hard, making it challenging to construct efficient multicast trees that satisfy QoS constraints. Moreover, implementing QoS-aware multicast routing in MANETs is difficult due to their dynamic topology, which changes over time as a result of node mobility or energy conservation. This paper proposes a novel variant of the Simulated Annealing (SA) algorithm that integrates an adaptive mechanism for selecting neighborhood structures, to solve both static and dynamic instances of the multicast routing problem (MRP) in MANETs under QoS constraints. To evaluate the performance of our adaptive simulated annealing (ASA), we compare it with other metaheuristics using various datasets. We describe how ASA adapts to the dynamic topology of MANETs and assess its effectiveness under varying network conditions. Experimental results demonstrate that ASA significantly outperforms existing algorithms in static scenarios. In dynamic scenarios, it exhibits strong adaptability to topological changes, consistently producing high-quality solutions after each network update.</p>

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

Solving the constrained steiner tree problem in MANETs using an adaptive simulated annealing optimization approach

  • 期刊论文

  • 发表日期：

    2026年4月19日

查看全文
  • Sabrina Tadjine,
  • Ali Lemouari,
  • Messaoud Kara

摘要

A mobile ad hoc network (MANET) is a decentralized, wireless network dynamically formed by mobile devices that communicate without relying on fixed infrastructure. MANETs are widely used in applications such as video conferencing, distance learning, military operations, and e-commerce, all of which require multicast routing techniques that ensure quality of service (QoS). A fundamental approach to multicast routing in wireless networks is the construction of a Steiner tree, which connects a source node to multiple destination nodes while minimizing total transmission cost. However, the Steiner tree problem (STP) is NP-hard, making it challenging to construct efficient multicast trees that satisfy QoS constraints. Moreover, implementing QoS-aware multicast routing in MANETs is difficult due to their dynamic topology, which changes over time as a result of node mobility or energy conservation. This paper proposes a novel variant of the Simulated Annealing (SA) algorithm that integrates an adaptive mechanism for selecting neighborhood structures, to solve both static and dynamic instances of the multicast routing problem (MRP) in MANETs under QoS constraints. To evaluate the performance of our adaptive simulated annealing (ASA), we compare it with other metaheuristics using various datasets. We describe how ASA adapts to the dynamic topology of MANETs and assess its effectiveness under varying network conditions. Experimental results demonstrate that ASA significantly outperforms existing algorithms in static scenarios. In dynamic scenarios, it exhibits strong adaptability to topological changes, consistently producing high-quality solutions after each network update.