{"title":"Efficient routing in wireless networks with random node distribution","authors":"M. Haenggi","doi":"10.1109/ISIT.2004.1365056","DOIUrl":null,"url":null,"abstract":"After deriving the distribution of the distance to the n/sup th/ nearest neighbor in uniformly random networks of any dimension we establish that nearest-neighbor routing schemes perform poorly in random networks. We suggest and analyze an improved scheme that approaches the performance of regular networks.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2004.1365056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
After deriving the distribution of the distance to the n/sup th/ nearest neighbor in uniformly random networks of any dimension we establish that nearest-neighbor routing schemes perform poorly in random networks. We suggest and analyze an improved scheme that approaches the performance of regular networks.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
