Optimal Request Clustering for Link Reliability Guarantee in Wireless Networked Control
Optimal Request Clustering for Link Reliability Guarantee in Wireless Networked Control
复制标题
DOI：
10.1109/wcnc.2017.7925790
复制
发表时间：
2017-03
期刊：
影响因子：
--
通讯作者：
Yu Chen;Hongwei Zhang
中科院分区：
文献类型：
--
作者：
Yu Chen;Hongwei Zhang
In wireless networked control systems, ensuring predictable communication link reliabilities among sensors, controllers, and actuators is critical. In such scenarios, different data gathered at the application layer of each sender require different packet delivery ratios (i.e., reliabilities). The lower layers try to accommodate these requests by first mapping each of them into a service level and then deliver the associated data packets to the receiver at the mapped service level. Due to resource constraints and maintenance overhead, the number of supported service levels is usually limited. An important question is then how to determine the set of service levels to maintain and how to map each request to an appropriate service level, such that the requested reliabilities are guaranteed and the total cost of mapping is minimized? We formally formulate this as an optimal request clustering problem since each service level acts as a cluster and can host multiple requests. In particular, we formulate the Migratory Clustering Problem and the Non-Migratory Clustering Problem, depending on whether a request can migrate from one service level to another after its initial assignment. We propose two optimal algorithms to solve both problems.
