{"title":"一种改进的聚类自组织网络八卦算法","authors":"Basak Oztas, F. Alagoz","doi":"10.1109/WIRELESSVITAE.2011.5940825","DOIUrl":null,"url":null,"abstract":"Gossip based algorithms, which constitute an important group among many other techniques for broadcasting in ad hoc networks, are inefficient on clustered networks. There is a trade off between the total load on the network and guaranteed delivery on the cluster connecting nodes. This paper introduces a modified gossip algorithm for broadcasting in clustered ad hoc networks. Additionally, a novel graph generation method for creating clustered networks is proposed for the simulations.","PeriodicalId":68078,"journal":{"name":"无线互联科技","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A modified gossip algorithm for clustered ad hoc networks\",\"authors\":\"Basak Oztas, F. Alagoz\",\"doi\":\"10.1109/WIRELESSVITAE.2011.5940825\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Gossip based algorithms, which constitute an important group among many other techniques for broadcasting in ad hoc networks, are inefficient on clustered networks. There is a trade off between the total load on the network and guaranteed delivery on the cluster connecting nodes. This paper introduces a modified gossip algorithm for broadcasting in clustered ad hoc networks. Additionally, a novel graph generation method for creating clustered networks is proposed for the simulations.\",\"PeriodicalId\":68078,\"journal\":{\"name\":\"无线互联科技\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"无线互联科技\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1109/WIRELESSVITAE.2011.5940825\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"无线互联科技","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/WIRELESSVITAE.2011.5940825","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A modified gossip algorithm for clustered ad hoc networks
Gossip based algorithms, which constitute an important group among many other techniques for broadcasting in ad hoc networks, are inefficient on clustered networks. There is a trade off between the total load on the network and guaranteed delivery on the cluster connecting nodes. This paper introduces a modified gossip algorithm for broadcasting in clustered ad hoc networks. Additionally, a novel graph generation method for creating clustered networks is proposed for the simulations.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
