Hi there.
Recently I focus on the link scheduling problem in wireless sensor network, especially in IEEE802.15.4e Time Sync Channel Hopping (TSCH) networks. The key of the scheduling is to decide the order of the links, a.k.a different oder result in different performance such as average delay time.
The problem maybe related to permutation optimization，somebody suggest stochastic optimization(like simulation annealing) or genetic algorithm or swarm optimization. While these method requires high computation cost.
Any other feasible idea?
TSCH provides deterministic delay or have predictable behavior as it is proposed specifically for industrial networks. for optimization of TSCH networks neural networks can be used.
in MODESA algorithm authors have used integer optimization. you can refer to that also.
Basically, it looks like a typical NP-hard question in a large networking of wireless sensor. So, the heuristic algorithms are the natural solutions. Further, your focus is not to seek the algorithm, but profile your research questions, and it is the priority than selecting the algorithms.
- Badges
- Science topic