In the current wireless sensor network (WSN) environment, multi-path and multi-hop routing are multi-objective optimization problems with numerous constraints requiring careful attention. Limited transmission bandwidth and energy resources further complicate the routing process. Traditional approaches often suffer from drawbacks such as high computational complexity, long problem-solving times, difficulty in achieving optimal solutions, and susceptibility to get trapped in local optima. To address these challenges, a multi-objective Sand Cat Swarm Optimization (MSCSO) algorithm is proposed for multi-path and multi-hop routing. The MSCSO algorithm is designed to identify the optimal multi-hop routes and the best multi-path solutions based on a well-defined multi-objective function. Simulation results indicate the effectiveness of our proposed approach compared to other clustering algorithms.

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

Multi-objective Sand Cat Swarm Optimization for Efficient Multi-hop Routing in Wireless Sensor Networks

  • Aida Zaier,
  • Ines Lahmar,
  • Mohamed Yahia,
  • Ali Tarig,
  • Ridha Boaullegue

摘要

In the current wireless sensor network (WSN) environment, multi-path and multi-hop routing are multi-objective optimization problems with numerous constraints requiring careful attention. Limited transmission bandwidth and energy resources further complicate the routing process. Traditional approaches often suffer from drawbacks such as high computational complexity, long problem-solving times, difficulty in achieving optimal solutions, and susceptibility to get trapped in local optima. To address these challenges, a multi-objective Sand Cat Swarm Optimization (MSCSO) algorithm is proposed for multi-path and multi-hop routing. The MSCSO algorithm is designed to identify the optimal multi-hop routes and the best multi-path solutions based on a well-defined multi-objective function. Simulation results indicate the effectiveness of our proposed approach compared to other clustering algorithms.