Joint Routing and Channel Assignment for Throughput Maximization in Mobile Wireless Sensor Networks

We consider the joint routing, mobility, and channel assignment to maximize the throughput of Mobile Wireless Sensor Networks (MWSN). In order to route packets to the destination, the creation/termination of the links and the interference between links need to be considered. To represent the inference between links, the concepts of conflict graph and independent sets are used, where the number of independent sets grows exponentially as the number of links grows. The problem of maximizing the throughput of MWSN is formulated as a linear program (LP), where the number of variables is very large. Therefore, we propose a heuristic algorithm to find a solution for the problem of joint routing and channel assignment between the sources and the sink node. Extensive simulations show that our algorithm achieves up to 60% reduction in terms of schedule length compared to the state-of-the-art schemes when transmitting the same number of packets.