{"title":"Load Balanced AODV - An Improvement of Performance and Fairness","authors":"Chao Gao, S. Nethi, R. Jantti","doi":"10.1109/ITST.2007.4295828","DOIUrl":null,"url":null,"abstract":"In this paper we focus on the performance improvement of reactive routing protocol of wireless ad-hoc networks by considering traffic load and geographical information of the network that are involved in routing procedure. A mobile node that already has or potentially will have excessive routing duty should act as a relaying node with relatively low probability. We use three parameters that are available in AODV: the size of routing table L, the expiration time of each route entry i in the table Δti, and the number of neighbors of each node j involved in routing nj. Simulation results from ns-2 show that our scheme gives significant improvement in terms of packet delivery ratio, end-to-end delay, and arrival jitter.","PeriodicalId":106396,"journal":{"name":"2007 7th International Conference on ITS Telecommunications","volume":"104 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 7th International Conference on ITS Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITST.2007.4295828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this paper we focus on the performance improvement of reactive routing protocol of wireless ad-hoc networks by considering traffic load and geographical information of the network that are involved in routing procedure. A mobile node that already has or potentially will have excessive routing duty should act as a relaying node with relatively low probability. We use three parameters that are available in AODV: the size of routing table L, the expiration time of each route entry i in the table Δti, and the number of neighbors of each node j involved in routing nj. Simulation results from ns-2 show that our scheme gives significant improvement in terms of packet delivery ratio, end-to-end delay, and arrival jitter.