{"title":"无线传感器网络的高能效数据传播","authors":"M. Busse, T. Haenselmann, W. Effelsberg","doi":"10.1109/PERCOMW.2007.44","DOIUrl":null,"url":null,"abstract":"In order to disseminate a large amount of data through a sensor network, it is common to split the data into small-sized chunk packets. If the data is additionally encoded by a forward error correction (FEC) code, missed chunks can be recovered. Fountain codes are a special kind of FEC code which have the property that the sender provides the data in a virtually endless stream by combining original chunks at random. No matter which chunks get lost, each receiver only needs any k chunks from the stream. In broadcast scenarios, fountains have the additional advantage that only little redundancy is required, even if several receivers have missed different chunks. We will show the benefit of Fountain codes in wireless sensor networks in comparison to raw transmissions and other FEC codes. To support the actual data dissemination, we propose two generic distributed protocols: an acknowledgement-based and a request-based protocol. The evaluation is carried out in a real testbed consisting of 20 sensor nodes","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Energy-Efficient Data Dissemination for Wireless Sensor Networks\",\"authors\":\"M. Busse, T. Haenselmann, W. Effelsberg\",\"doi\":\"10.1109/PERCOMW.2007.44\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to disseminate a large amount of data through a sensor network, it is common to split the data into small-sized chunk packets. If the data is additionally encoded by a forward error correction (FEC) code, missed chunks can be recovered. Fountain codes are a special kind of FEC code which have the property that the sender provides the data in a virtually endless stream by combining original chunks at random. No matter which chunks get lost, each receiver only needs any k chunks from the stream. In broadcast scenarios, fountains have the additional advantage that only little redundancy is required, even if several receivers have missed different chunks. We will show the benefit of Fountain codes in wireless sensor networks in comparison to raw transmissions and other FEC codes. To support the actual data dissemination, we propose two generic distributed protocols: an acknowledgement-based and a request-based protocol. The evaluation is carried out in a real testbed consisting of 20 sensor nodes\",\"PeriodicalId\":352348,\"journal\":{\"name\":\"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PERCOMW.2007.44\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PERCOMW.2007.44","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Energy-Efficient Data Dissemination for Wireless Sensor Networks
In order to disseminate a large amount of data through a sensor network, it is common to split the data into small-sized chunk packets. If the data is additionally encoded by a forward error correction (FEC) code, missed chunks can be recovered. Fountain codes are a special kind of FEC code which have the property that the sender provides the data in a virtually endless stream by combining original chunks at random. No matter which chunks get lost, each receiver only needs any k chunks from the stream. In broadcast scenarios, fountains have the additional advantage that only little redundancy is required, even if several receivers have missed different chunks. We will show the benefit of Fountain codes in wireless sensor networks in comparison to raw transmissions and other FEC codes. To support the actual data dissemination, we propose two generic distributed protocols: an acknowledgement-based and a request-based protocol. The evaluation is carried out in a real testbed consisting of 20 sensor nodes