loading...
Mobile Grid Routing Algorithm in Mobile Ad Hoc Networks with Obstacles
Guilin, Guangxi, China November 01-November 03
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SKG.2006.63Second International Conference on Se ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Di Wu, Dalian University of Technology, China
Ning Tong, Dalian University of Technology, China
Keqiu Li, Dalian Maritime University, China; The University of Tokyo, Japan
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.
Citation:
Di Wu, Ning Tong, Keqiu Li, "Mobile Grid Routing Algorithm in Mobile Ad Hoc Networks with Obstacles," skg, pp.12, Second International Conference on Semantics, Knowledge, and Grid (SKG'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions