Premium
Joint channel and sink assignment for data collection in cognitive wireless sensor networks
Author(s) -
Wang Xinglong,
Huang Liusheng,
Leng Bing,
Xu Hongli,
Yang Chenkai
Publication year - 2015
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.3047
Subject(s) - computer science , wireless sensor network , data collection , sink (geography) , computer network , channel (broadcasting) , data transmission , node (physics) , greedy algorithm , wireless , linear programming , mathematical optimization , distributed computing , algorithm , telecommunications , mathematics , statistics , cartography , structural engineering , engineering , geography
Summary Data collection is a fundamental operation in cognitive wireless sensor networks (CWSNs). However, previous works on data collection assume that a node can transmit data to any node within its transmission range, which is not reasonable in CWSNs. To ensure that the previous works can be applied in CWSNs, this paper focuses on the joint channel and sink assignment problem, which is a critical preparatory work for data collection in CWSNs. Because the capacity performance of a CWSN is usually considered as a key problem in fundamental understanding, we are interested in finding a joint channel and sink assignment for each sensor node, such that the minimum capacity of all sensor nodes is maximized. We formulate our problem as a mixed integer linear program by some elaborate mathematical skills. Then, two algorithms based on greedy strategy and linear relaxation technique are proposed. Extensive simulations results show that our algorithms are efficient and able to achieve near‐optimal performance. Copyright © 2015 John Wiley & Sons, Ltd.