Dual-interference minimization routing techniques in wireless sensor networks

Interference minimization whether on topology or routing level has been a prominent concern in wireless sensor networks (WSNs). Existing graph-based approaches focus on minimizing whole topology and network interference. Work on having an interference minimum routing path on bidirectional connected graph models of WSNs is still left to explore under different interference models. So, this paper focuses on establishing an efficient routing path from the source to the destination node of minimum total link interference and maximum receiver node interference by optimally balancing between both the interference levels on any bidirectional connected graph model of WSN. We have proposed a dual-interference model based optimization (DIMO) routing algorithm by engaging ant colony optimization technique with two distinct interference models simultaneously that are link SUM interference model and receiver interference model. Moreover, a new interference model named as Disc-SUM model has also been developed whose implementation with Dijkstra’s algorithm results in a dual-interference minimized routing path in quadratic time complexity. Simulation work has been carried out to validate the DIMO algorithm and the Disc-SUM model for implementing a routing path between the source to the destination node with optimally reduced total link interference, maximum receiver node interference, total transmission cost, and hop counts.