{"title":"An anchor-based routing protocol with cell ID management system for ad hoc networks","authors":"Huaizhi Li, M. Singhal","doi":"10.1109/ICCCN.2005.1523853","DOIUrl":null,"url":null,"abstract":"Ad hoc networks, which do not rely on any infrastructure such as access points or base station, can be deployed rapidly and inexpensively even in situations with geographical or time constraints. So ad hoc networks have attractive applications in both military and disaster situations and also in commercial uses like sensor networks or conferencing. In ad hoc networks, each node acts both as a router and as a host. The topology of an ad hoc network may change dynamically, which makes it difficult to design an efficient routing protocol. Nowadays, more and more wireless devices are being used, which can form large ad hoc networks. It is important to design a scalable routing protocol for ad hoc networks. In this paper, we propose anchor-based routing protocol with cell ID management system (ARPC), a scalable routing protocol for ad hoc networks. ARPC is a hybrid routing protocol, which combines the advantages of table-based routing strategy and geographic routing strategy, and avoids the burden-GPS (Global Positioning System) (E. D. Kaplan, 1996) support. Simulation results show that ARPC is efficient and scales well to large networks. Especially for large networks (1000 and 1600 nodes), ARPC achieves 21 percent higher packet delivery ratio than AODV, and has 19 percent lower overhead. This denotes that ARPC has better scalability than AODV.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2005.1523853","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
Ad hoc networks, which do not rely on any infrastructure such as access points or base station, can be deployed rapidly and inexpensively even in situations with geographical or time constraints. So ad hoc networks have attractive applications in both military and disaster situations and also in commercial uses like sensor networks or conferencing. In ad hoc networks, each node acts both as a router and as a host. The topology of an ad hoc network may change dynamically, which makes it difficult to design an efficient routing protocol. Nowadays, more and more wireless devices are being used, which can form large ad hoc networks. It is important to design a scalable routing protocol for ad hoc networks. In this paper, we propose anchor-based routing protocol with cell ID management system (ARPC), a scalable routing protocol for ad hoc networks. ARPC is a hybrid routing protocol, which combines the advantages of table-based routing strategy and geographic routing strategy, and avoids the burden-GPS (Global Positioning System) (E. D. Kaplan, 1996) support. Simulation results show that ARPC is efficient and scales well to large networks. Especially for large networks (1000 and 1600 nodes), ARPC achieves 21 percent higher packet delivery ratio than AODV, and has 19 percent lower overhead. This denotes that ARPC has better scalability than AODV.