{"title":"Exploring the energy-latency tradeoff of geographic random forwarding for ad hoc and sensor networks","authors":"M. Zorzi, R. Rao","doi":"10.1109/VETECS.2003.1208897","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a novel forwarding technique based on collision avoidance and on knowledge of the geographical location of the nodes involved. Selection of the relaying nodes is made randomly via contention among receivers. We consider a simplified performance analysis and provide analytical parameter optimization. Comparisons giving evidence of the accuracy of our approximate approach are also provided. The scheme is compared with STEM, and is shown to perform significantly better for sufficient node density.","PeriodicalId":272763,"journal":{"name":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VETECS.2003.1208897","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In this paper, we consider a novel forwarding technique based on collision avoidance and on knowledge of the geographical location of the nodes involved. Selection of the relaying nodes is made randomly via contention among receivers. We consider a simplified performance analysis and provide analytical parameter optimization. Comparisons giving evidence of the accuracy of our approximate approach are also provided. The scheme is compared with STEM, and is shown to perform significantly better for sufficient node density.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
