{"title":"机会路由传感器网络中的动态占空比方案","authors":"Bingxin Niu, Heng Qi, Keqiu Li, Xiulong Liu, Weilian Xue","doi":"10.1109/ICCCN.2015.7288391","DOIUrl":null,"url":null,"abstract":"In Wireless Sensor Networks (WSNs), end-to-end delay is an important metric because the sensed information is necessary to be transmitted to the sink node within a predefined time threshold. Therefore, opportunistic routing protocols are proposed to reduce the end-to-end delay. As a matter of fact, increasing the number of wake-up slots will certainly reduce the transmission delay, however, also consumes more energy. Hence, it is interesting to control the number of wake-up slots to investigate the trade-off between the end-to-end delay and the energy-efficiency. To the best of our knowledge, no existing work takes both of end-to-end delay and energy-efficiency into consideration in the opportunistic routing networks. Therefore, this paper studies how to minimize the energy-consumption while guaranteeing that the expected end-to-end delay is below a given threshold. To solve this problem, we propose an energy-based Dynamic Duty Cycle Scheme(D2CS) in opportunistic routing network. Specifically, we first present an analytical model to measure the expected end-to-end delay. Then, we decompose the studied problem into a set of single-hop delay guarantee problems and using the feedback controller to approximate the optimal solution. Finally, extensive simulations are conducted to evaluate the performance of the proposed D2CS algorithm. The experimental results reveal that our D2CS can guarantee the delay requirement, meanwhile, significantly reduce the energy consumption compared with prior schemes.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"D2CS: Dynamic Duty Cycle Scheme in an Opportunistic Routing Sensor Network\",\"authors\":\"Bingxin Niu, Heng Qi, Keqiu Li, Xiulong Liu, Weilian Xue\",\"doi\":\"10.1109/ICCCN.2015.7288391\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Wireless Sensor Networks (WSNs), end-to-end delay is an important metric because the sensed information is necessary to be transmitted to the sink node within a predefined time threshold. Therefore, opportunistic routing protocols are proposed to reduce the end-to-end delay. As a matter of fact, increasing the number of wake-up slots will certainly reduce the transmission delay, however, also consumes more energy. Hence, it is interesting to control the number of wake-up slots to investigate the trade-off between the end-to-end delay and the energy-efficiency. To the best of our knowledge, no existing work takes both of end-to-end delay and energy-efficiency into consideration in the opportunistic routing networks. Therefore, this paper studies how to minimize the energy-consumption while guaranteeing that the expected end-to-end delay is below a given threshold. To solve this problem, we propose an energy-based Dynamic Duty Cycle Scheme(D2CS) in opportunistic routing network. Specifically, we first present an analytical model to measure the expected end-to-end delay. Then, we decompose the studied problem into a set of single-hop delay guarantee problems and using the feedback controller to approximate the optimal solution. Finally, extensive simulations are conducted to evaluate the performance of the proposed D2CS algorithm. The experimental results reveal that our D2CS can guarantee the delay requirement, meanwhile, significantly reduce the energy consumption compared with prior schemes.\",\"PeriodicalId\":117136,\"journal\":{\"name\":\"2015 24th International Conference on Computer Communication and Networks (ICCCN)\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 24th International Conference on Computer Communication and Networks (ICCCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2015.7288391\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2015.7288391","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
D2CS: Dynamic Duty Cycle Scheme in an Opportunistic Routing Sensor Network
In Wireless Sensor Networks (WSNs), end-to-end delay is an important metric because the sensed information is necessary to be transmitted to the sink node within a predefined time threshold. Therefore, opportunistic routing protocols are proposed to reduce the end-to-end delay. As a matter of fact, increasing the number of wake-up slots will certainly reduce the transmission delay, however, also consumes more energy. Hence, it is interesting to control the number of wake-up slots to investigate the trade-off between the end-to-end delay and the energy-efficiency. To the best of our knowledge, no existing work takes both of end-to-end delay and energy-efficiency into consideration in the opportunistic routing networks. Therefore, this paper studies how to minimize the energy-consumption while guaranteeing that the expected end-to-end delay is below a given threshold. To solve this problem, we propose an energy-based Dynamic Duty Cycle Scheme(D2CS) in opportunistic routing network. Specifically, we first present an analytical model to measure the expected end-to-end delay. Then, we decompose the studied problem into a set of single-hop delay guarantee problems and using the feedback controller to approximate the optimal solution. Finally, extensive simulations are conducted to evaluate the performance of the proposed D2CS algorithm. The experimental results reveal that our D2CS can guarantee the delay requirement, meanwhile, significantly reduce the energy consumption compared with prior schemes.