{"title":"An Analysis on the Delay-Aware Data Collection Network Structure Using Pareto Optimality","authors":"Chi-Tsun Cheng, C. K. Tse","doi":"10.1109/CyberC.2012.65","DOIUrl":null,"url":null,"abstract":"Clustering techniques are effective techniques in reducing energy consumption in wireless sensor networks (WSNs). A data collection process (DCP) is an operation for a base station (BS) to collect a complete set of data from a WSN. Clustering techniques may, however, introduce bottlenecks to a DCP and cause extra delays. For time-sensitive applications, a delay-aware network structure is necessary. A delay-aware network structure should not only minimize the duration of a single DCP, but also shorten the duration of consecutive DCPs. Furthermore, for better sensing quality, a delay-aware network structure should try to accommodate as many wireless sensor nodes as possible. This paper investigates the trade-offs among the above objective functions in a delay-aware data collection network structure using the concepts of Pareto optimality. The analyses provide an insight into selecting the most suitable network parameters.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"314 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberC.2012.65","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Clustering techniques are effective techniques in reducing energy consumption in wireless sensor networks (WSNs). A data collection process (DCP) is an operation for a base station (BS) to collect a complete set of data from a WSN. Clustering techniques may, however, introduce bottlenecks to a DCP and cause extra delays. For time-sensitive applications, a delay-aware network structure is necessary. A delay-aware network structure should not only minimize the duration of a single DCP, but also shorten the duration of consecutive DCPs. Furthermore, for better sensing quality, a delay-aware network structure should try to accommodate as many wireless sensor nodes as possible. This paper investigates the trade-offs among the above objective functions in a delay-aware data collection network structure using the concepts of Pareto optimality. The analyses provide an insight into selecting the most suitable network parameters.