Article ID: | iaor20125997 |
Volume: | 24 |
Issue: | 4 |
Start Page Number: | 485 |
End Page Number: | 507 |
Publication Date: | Nov 2012 |
Journal: | Journal of Combinatorial Optimization |
Authors: | Li Minming, Zhao Yingchao, Liu Qin, Wang Jianping |
Keywords: | combinatorial optimization, networks: flow, queues: applications, simulation: applications |
In a large‐scale storage‐centric wireless sensor network (SWSN) where data from different clusters are archived at distributed storage nodes, the dispatching design problem is to determine one or multiple storage nodes for each cluster. To achieve high data fidelity in SWSNs, the dispatching design should aim to reduce the data loss due to the network congestion and, at the same time, to prolong the network lifetime by avoiding sending excessive traffic to some particular storage nodes in order to achieve energy consumption balance among the relaying sensors around the storage node. In this paper, we propose an