LIÊN KẾT WEBSITE
Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs
Optimization Letters Số 7, năm 2016 (Tập 10, trang 1393-1401)
DOI: 10.1007/s11590-016-1007-7
Tài liệu thuộc danh mục: ISI, Scopus
Optim. Lett.
English
Từ khóa: Costs; Wireless sensor networks; Absorbing set; Guaranteed performance; Heterogeneous sensor networks; Strongly connected; Virtual backbone; Approximation algorithms
Tóm tắt tiếng anh
The strongly connected dominating and absorbing set (DAS) is used as a virtual backbone in heterogeneous wireless sensor. To reduce routing cost, we introduce a routing-cost constraint and study the problem of computing the minimum strongly connected DAS under routing-cost constraint. An approximation algorithm with guaranteed performance will be presented. 2016, Springer-Verlag Berlin Heidelberg.