{"title":"面向无线传感器网络的分布式无碰撞数据聚合方法","authors":"M. Merzoug, A. Mostefaoui, Samir Chouali","doi":"10.1109/DCOSS.2017.9","DOIUrl":null,"url":null,"abstract":"This paper presents a distributed serial data aggregation approach, called Spreading Aggregation~(SA), in which one packet hops sequentially over nodes and aggregates their data. The next hop of the aggregation packet is determined locally by each traversed node using only its one-hop neighborhood information, so no network topology information needs to be known by nodes, nor collisions are generated as only one node is communicating at any given time. This localized and distributed characteristic makes the proposed approach highly scalable and very efficient in terms of communication-reduction, energy conservation, and aggregation time, as confirmed by the numerous simulation results we obtained. These results confirm also the superiority of the proposed approach over the state-of-the-art serial approaches, particularly in very large scale network deployments.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Distributed Collision-Free Data Aggregation Approach for Wireless Sensor Networks\",\"authors\":\"M. Merzoug, A. Mostefaoui, Samir Chouali\",\"doi\":\"10.1109/DCOSS.2017.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a distributed serial data aggregation approach, called Spreading Aggregation~(SA), in which one packet hops sequentially over nodes and aggregates their data. The next hop of the aggregation packet is determined locally by each traversed node using only its one-hop neighborhood information, so no network topology information needs to be known by nodes, nor collisions are generated as only one node is communicating at any given time. This localized and distributed characteristic makes the proposed approach highly scalable and very efficient in terms of communication-reduction, energy conservation, and aggregation time, as confirmed by the numerous simulation results we obtained. These results confirm also the superiority of the proposed approach over the state-of-the-art serial approaches, particularly in very large scale network deployments.\",\"PeriodicalId\":399222,\"journal\":{\"name\":\"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCOSS.2017.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCOSS.2017.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed Collision-Free Data Aggregation Approach for Wireless Sensor Networks
This paper presents a distributed serial data aggregation approach, called Spreading Aggregation~(SA), in which one packet hops sequentially over nodes and aggregates their data. The next hop of the aggregation packet is determined locally by each traversed node using only its one-hop neighborhood information, so no network topology information needs to be known by nodes, nor collisions are generated as only one node is communicating at any given time. This localized and distributed characteristic makes the proposed approach highly scalable and very efficient in terms of communication-reduction, energy conservation, and aggregation time, as confirmed by the numerous simulation results we obtained. These results confirm also the superiority of the proposed approach over the state-of-the-art serial approaches, particularly in very large scale network deployments.