Fariborz Ahmadi - Department of Computer Science, Yazd Branch, Islamic Azad University, Yazd, Iran
Omid Abedi - Department of Computer Science, Yazd Branch, Islamic Azad University, Yazd, Iran
Sima Emadi - Department of Computer Science, Yazd Branch, Islamic Azad University, Yazd, Iran

Heterogeneous wireless sensor networks with mobile supernodes consist of n sensors and m mobile supernodes. Disjoint paths are used in these networks to enhance fault tolerance, improve the network lifetime, and implement an effective load distribution. The network topology is disrupted because disjoint paths disappear when a supernode changes its location to improve the network lifetime and avoid the death of adjacent nodes. This paper proposes a distributed method for finding disjoint paths from ordinary sensors to mobile supernodes when supernodes move to new locations. The proposed algorithm will have a message complexity of O(n۲Δ) and an execution time of O(n۲Δ۲), in which n denotes the number of nodes, and Δ indicates the highest node degree. According to evaluation results, mobile supernodes led to a ۹۶% longer lifetime than static supernodes, and the network fault tolerance with mobile supernodes was ۷.۱ times higher than the fault tolerance with static supernodes.

disjoint paths, fault tolerance, heterogeneous wireless sensor networks, mobile supernodes, Distributed algorithms