{"title":"Delay based routing for real-time traffic in ad hoc networks","authors":"D. Darshana, M. Chatterjee, K. Kwiat","doi":"10.1109/ICCES.2010.5674901","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a routing protocol in an ad hoc network that ensures timely delivery of real-time data packets. This is achieved by carefully accessing the resources available to a route before a session is admitted along that route. Each link in the route is checked for sufficient bandwidth not only for the new session to be admitted but also for the sessions that are already using that link. The new session is admitted only if its admission does not violate the delay bounds of any of the on-going sessions. This method of route selection coupled with per-hop link reservations allows us to provide bounds on the delay performance. Extensive simulation experiments are also conducted that demonstrate the performance of the proposed routing protocol in terms of throughput, session blocking probability, average path length and delay.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"142 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2010 International Conference on Computer Engineering & Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCES.2010.5674901","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In this paper, we propose a routing protocol in an ad hoc network that ensures timely delivery of real-time data packets. This is achieved by carefully accessing the resources available to a route before a session is admitted along that route. Each link in the route is checked for sufficient bandwidth not only for the new session to be admitted but also for the sessions that are already using that link. The new session is admitted only if its admission does not violate the delay bounds of any of the on-going sessions. This method of route selection coupled with per-hop link reservations allows us to provide bounds on the delay performance. Extensive simulation experiments are also conducted that demonstrate the performance of the proposed routing protocol in terms of throughput, session blocking probability, average path length and delay.