{"title":"LABAR: location area based ad hoc routing for GPS-scarce wide-area ad hoc networks","authors":"G. Záruba, Vamsi Chaluvadi, Azeem M. Suleman","doi":"10.1109/PERCOM.2003.1192781","DOIUrl":null,"url":null,"abstract":"Wireless ad hoc networks are becoming increasingly important in today's world. The most challenging problem in conjunction with ad hoc networks is routing, i.e., the procedure in charge of determining the trajectory of packets traveling over the network. For large-scale ad hoc networks scalability of the routing approach is extremely important. One of the approaches to scale up ad hoc routing is geographical location based routing, which usually requires all nodes to be aware of their exact locations. In this paper, a new routing algorithm is proposed which requires only a subset of nodes to know their exact location forming location areas around these nodes. This paper outlines the LABAR (Location Area Based Ad Hoc Routing) routing protocol and provides simulation measurements on its average routing distance compared to the optimum shortest path.","PeriodicalId":230787,"journal":{"name":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003).","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PERCOM.2003.1192781","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29
Abstract
Wireless ad hoc networks are becoming increasingly important in today's world. The most challenging problem in conjunction with ad hoc networks is routing, i.e., the procedure in charge of determining the trajectory of packets traveling over the network. For large-scale ad hoc networks scalability of the routing approach is extremely important. One of the approaches to scale up ad hoc routing is geographical location based routing, which usually requires all nodes to be aware of their exact locations. In this paper, a new routing algorithm is proposed which requires only a subset of nodes to know their exact location forming location areas around these nodes. This paper outlines the LABAR (Location Area Based Ad Hoc Routing) routing protocol and provides simulation measurements on its average routing distance compared to the optimum shortest path.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
