Neighborhood-based interference minimization for stable position-based routing in mobile ad hoc networks

• First interference aware, stable position-based routing algorithms for MANETs.
• Next hop choice combines Conservative Neighborhood Range with interference awareness.
• Interference metrics of node are number of other paths part of, or neighbor count.
• Next hop node choice seeks shortest path while minimizing interference metric.

For efficient communication in a mobile ad hoc network (MANET), dealing with interference while performing concurrent multi-hop routing is of great importance. By establishing an interference-aware route we can potentially reduce the interference effects in the overall wireless communication, resulting in improved network performance. Typically, mobile devices, represented by nodes in a MANET, broadcast in a limited shared media. Using both routing and scheduling mechanisms for wireless transmissions can reduce both redundancy and communication interference. We study communication interference problems in the context of maintaining stable connection routes between mobile devices in MANETs. This paper presents extensions of our previously studied position-based stable routing protocol Greedy-based Backup Routing Protocol with Conservative Neighborhood Range to maintain connection stability while minimizing the number of corrupted packets in the presence of more general communication interference. Simulation results demonstrate the effectiveness of the new protocols.