Handling network merging and partitioning in MANETs

Abstract

In wireless ad-hoc networks, nodes require IP addresses to communicate. The configuration of IP addresses in wireless adhoc networks is accomplished by using distributed algorithms rather than a centralized mechanism such as DHCP. Due to the unpredictable nature of wireless adhoc networks, independently configured networks may come into contact and duplicate IP address may occur. So many approaches have been proposed to handle this problem. After a network merger is detected, the first task is to detect address conflicts and then take corrective action, i.e. some nodes need to acquire new addresses. Even though a number of solutions have been proposed to address this problem, the ability to respond to network dynamics is still a challenge. In this paper, we propose a solution that addressed both the partitioning and the merging of networks. Our network partitioning solution can distinguish between temporary and permanent network partitioning. Simulations were carried out in NS2 and results presented.