{"title":"无线传感器网络的节能聚合转发","authors":"M. Busse, T. Haenselmann, W. Effelsberg","doi":"10.1109/SENSORCOMM.2007.47","DOIUrl":null,"url":null,"abstract":"Based on an energy efficiency metric that is defined by the fraction of end-to-end delivery ratio and required energy, we propose a new distributed algorithm for the case of correlated data. In contrast to related work, our metric considers energy savings due to aggregation a priori and achieves a superior performance. However, a problem that arises from the ability to aggregate and to change energy cost during the construction of a forwarding tree is that routing cycles may occur because information used may be out-dated. By employing different types of sequence numbers, our strategy is able to prevent such cycles, accounting for the distributed nature of sensor networks.","PeriodicalId":161788,"journal":{"name":"2007 International Conference on Sensor Technologies and Applications (SENSORCOMM 2007)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Energy-Efficient Aggregation Forwarding for Wireless Sensor Networks\",\"authors\":\"M. Busse, T. Haenselmann, W. Effelsberg\",\"doi\":\"10.1109/SENSORCOMM.2007.47\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on an energy efficiency metric that is defined by the fraction of end-to-end delivery ratio and required energy, we propose a new distributed algorithm for the case of correlated data. In contrast to related work, our metric considers energy savings due to aggregation a priori and achieves a superior performance. However, a problem that arises from the ability to aggregate and to change energy cost during the construction of a forwarding tree is that routing cycles may occur because information used may be out-dated. By employing different types of sequence numbers, our strategy is able to prevent such cycles, accounting for the distributed nature of sensor networks.\",\"PeriodicalId\":161788,\"journal\":{\"name\":\"2007 International Conference on Sensor Technologies and Applications (SENSORCOMM 2007)\",\"volume\":\"144 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Sensor Technologies and Applications (SENSORCOMM 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SENSORCOMM.2007.47\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Sensor Technologies and Applications (SENSORCOMM 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SENSORCOMM.2007.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Energy-Efficient Aggregation Forwarding for Wireless Sensor Networks
Based on an energy efficiency metric that is defined by the fraction of end-to-end delivery ratio and required energy, we propose a new distributed algorithm for the case of correlated data. In contrast to related work, our metric considers energy savings due to aggregation a priori and achieves a superior performance. However, a problem that arises from the ability to aggregate and to change energy cost during the construction of a forwarding tree is that routing cycles may occur because information used may be out-dated. By employing different types of sequence numbers, our strategy is able to prevent such cycles, accounting for the distributed nature of sensor networks.