Mobile Grid Routing Algorithm in Mobile Ad Hoc Networks with Obstacles

Mobile grid provides mobile devices with a high reliability, performance and cost-efficiency. Physical limitations of the mobile devices make necessary the adaptation of the services that mobile grid can provide to the mobile devices. In the paper, we proposed a mobile grid routing algorithm in the presence of obstacles called obstacle mobile grid routing algorithm (OMGR). OMGR consists of mobility model, connected dominating set (CDS) election and mobile gird routing algorithm. In obstacle mobility model, we introduce STANDBY nodes as relaying nodes between two nodes that are invisible. The distributed CDS election algorithm extends Wu and Li´s algorithm and utilizes STANDBY nodes to connect the existing dominating-nodes belonging to dominating set. In addition, OMGR based on a CDS uses hybrid routing scheme (flooding-based approach and position-based approach) to forward around any obstacles. Eventually, an example is given to show that the proposed approach can form a CDS and successfully construct routes.