{"title":"AAaS: Android DTN的区域逼近和喷雾等待路由方案","authors":"Weitao Wang, Huimei Lu, Yong Xiang, Bingying Cai, Jingbang Wu, Rui Gao","doi":"10.1109/ICACT.2016.7423451","DOIUrl":null,"url":null,"abstract":"Most of the existing DTN routing algorithms have been studied in the simulation environment. They are not sufficiently used to the historical location and historical neighbor's information. So AAaS (Area Approaching and Spray-and-Wait) routing algorithm is proposed, which considers the practicability of the algorithm and the rules of the node's movement and the law of the meeting. AAaS divides the map into areas by the administrative area, public places and areas the DTN nodes clustered with historical GPS position. Each area maintenance the frequency vectors of different time scales and the frequency vectors of the historical encountered neighbor. AAaS forwards the bundles by these frequency vectors in the bundle lifetime, select the appropriate next hop, more efficient use of the limited bandwidth of encountered nodes in DTN network. Finally, the prototype of AAaS routing algorithm is implemented in Android based on Bytewalla. The experimental results prove that, even in the case of the buffer is not limited, the AAaS is more efficient than Epidemic in the use of the limited bandwidth between encountered nodes.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"AAaS: Area approaching and spray-and-wait routing scheme for DTN in Android\",\"authors\":\"Weitao Wang, Huimei Lu, Yong Xiang, Bingying Cai, Jingbang Wu, Rui Gao\",\"doi\":\"10.1109/ICACT.2016.7423451\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most of the existing DTN routing algorithms have been studied in the simulation environment. They are not sufficiently used to the historical location and historical neighbor's information. So AAaS (Area Approaching and Spray-and-Wait) routing algorithm is proposed, which considers the practicability of the algorithm and the rules of the node's movement and the law of the meeting. AAaS divides the map into areas by the administrative area, public places and areas the DTN nodes clustered with historical GPS position. Each area maintenance the frequency vectors of different time scales and the frequency vectors of the historical encountered neighbor. AAaS forwards the bundles by these frequency vectors in the bundle lifetime, select the appropriate next hop, more efficient use of the limited bandwidth of encountered nodes in DTN network. Finally, the prototype of AAaS routing algorithm is implemented in Android based on Bytewalla. The experimental results prove that, even in the case of the buffer is not limited, the AAaS is more efficient than Epidemic in the use of the limited bandwidth between encountered nodes.\",\"PeriodicalId\":125854,\"journal\":{\"name\":\"2016 18th International Conference on Advanced Communication Technology (ICACT)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 18th International Conference on Advanced Communication Technology (ICACT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACT.2016.7423451\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 18th International Conference on Advanced Communication Technology (ICACT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACT.2016.7423451","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
摘要
现有的DTN路由算法大多在仿真环境下进行了研究。他们对历史位置和历史邻居的信息没有充分的了解。为此提出了AAaS (Area approached and Spray-and-Wait)路由算法,该算法考虑了算法的实用性以及节点的运动规律和相遇规律。AAaS根据行政区域、公共场所和DTN节点与历史GPS位置聚集的区域将地图划分为区域。每个区域保持不同时间尺度的频率向量和历史上遇到的相邻区域的频率向量。AAaS在包生命周期内通过这些频率向量转发包,选择合适的下一跳,更有效地利用DTN网络中遇到的节点的有限带宽。最后,基于Bytewalla在Android平台上实现了AAaS路由算法的原型。实验结果证明,即使在缓冲区不受限制的情况下,AAaS在利用遇到节点之间有限的带宽方面也比Epidemic更有效。
AAaS: Area approaching and spray-and-wait routing scheme for DTN in Android
Most of the existing DTN routing algorithms have been studied in the simulation environment. They are not sufficiently used to the historical location and historical neighbor's information. So AAaS (Area Approaching and Spray-and-Wait) routing algorithm is proposed, which considers the practicability of the algorithm and the rules of the node's movement and the law of the meeting. AAaS divides the map into areas by the administrative area, public places and areas the DTN nodes clustered with historical GPS position. Each area maintenance the frequency vectors of different time scales and the frequency vectors of the historical encountered neighbor. AAaS forwards the bundles by these frequency vectors in the bundle lifetime, select the appropriate next hop, more efficient use of the limited bandwidth of encountered nodes in DTN network. Finally, the prototype of AAaS routing algorithm is implemented in Android based on Bytewalla. The experimental results prove that, even in the case of the buffer is not limited, the AAaS is more efficient than Epidemic in the use of the limited bandwidth between encountered nodes.