Optimal Covering Problem for a MANET through Geometric Theory
A reliable routing protocol with the purpose of attaining high percentage of data delivery in the mobile ad hoc networks is presented. The routing protocol presented for MANETs employs multi-grid routing scheme adaptively uses varying cell sizes, unlike single-grid based protocols. In a dense network, a small-cell node is employed to serve more alternative cells for a path. Meanwhile, a large-cell can be used to allow the probability of seamless data forwarding when the network is sparse. The paper simplifies complex coverage problem step by step. By means of math modeling, theoretical analysis and formula deducting, classical geometric theories and the method of mathematics induction are adopted.
KeywordsMobile Ad-hoc Networks(MANET) data forwarding sensing
Unable to display preview. Download preview PDF.
- 1.Gorantala, K.: Routing protocols in Mobile ad- hoc networks, master’s thesis report, Ume° a University, Sweden (June 15, 2006)Google Scholar
- 2.Perkins, C., Royer, E.: Ad-hoc on-demand distance vector routing. In: Proc. 2nd IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100 (1999)Google Scholar
- 3.Johnson, D., Maltz, D.: Dynamic source routing in ad hoc wireless networks. In: Imielinski, Korth (eds.) Mobile Computing, vol. 353, Kluwer Academic, Boston (1996)Google Scholar
- 4.Ding, R., Yang, L.: A reactive geographic routing protocol for wireless sensor networks. Beihang University, China (1963)Google Scholar
- 5.Shrestha, D.M., Kim, C., Ko, Y.-B.: A Reliable Multi-Grid Routing Protocol for Tactical MANETs. In: RACS 2011. ACM (November 2011) ISBN: 978-1-4503-1087Google Scholar