Modeling of Mobile Adhoc Networks Using Distributed Spanning Tree Approach

Mobile Ad hoc NETworks (MANETs) are a collection of distributed nodes which communicate using multi-hop wireless links with frequent node mobility. The frequent mobility of nodes leads network partition and futile communication. So, there need an interconnection technique that should guarantee network connectivity, efficient routing and maintain network performance in MANET. Distributed Spanning Tree (DST) is a well-known interconnection technique in which nodes of MANET are made to form a forest of spanning trees in a distributed fashion which improves network connectivity and reduces the bottleneck. In this paper, the authors propose a distributed algorithm to formulate of DST in MANET with respective constraints.