M3S: Markovian Mobility Management Simulator for Mobility Conscious Routing in Global Networks

摘要

MANETs (Mobile Ad Hoc Networks) are a particular paradigm where wireless devices communicate in a decentralized fashion. In order to avoid a situation where nodes nomadically try to communicate, distributed and localized structures (graphs, trees) need to be recognized in such networks. Mobility brings challenging issues to the maintenance and optimality of such structures. simulation is undoubtedly the most effective method of designing and evaluating new routing protocols for MANET. In conventional approaches, structures are adapted to the current topology by each node periodically sending beacon messages, which is a significant waste of network resources. In this paper, we propose M3S (Markovian Mobility Management Simulator) followed by MCR (Mobility Conscious Routing) algorithm that estimates the “future” location of a MD according to the user’s movement history, i.e., prior movement patterns. Each MD computes the new proposed field CS (Connection Status) and estimates about the stability of each adjacent link through the transient probability matrix that overrides the default path selection mechanisms. The transient matrices reflecting the movement pattern of MDs are stored in the routing table and for each link; connection status to each immediate neighbor is kept in the form of CS (0,1) over a time interval. With this criterion, MCR can selectively send packets only through the more reliable slice of the topology. Finally the simulation results confirms that MCR algorithm based on M3S results in relative to DSR, more stable routes thereby preventing performance taxation to a reasonable extent due to frequent link breakage in MANETS.