Energy-efficient clustering in lossy wireless sensor networks

摘要: Recent experimental studies have revealed that a large percentage of wireless links are lossy and unreliable for data delivery in sensor networks (WSNs). Such findings raise new challenges the design clustering algorithms WSNs terms reliability energy efficiency. In this paper, we propose distributed with mobile collector, where collector moves close to each cluster head receive directly then uploads collected base station. We first consider constructing one-hop clusters all members within direct communication range their heads. formulate problem into an integer program, aiming at maximizing network lifetime, which is defined as number rounds collection until node dies. prove NP-hard. After that, metric-based algorithm solve problem. adopt metric called selection weight indicates both link qualities around its capability being head. further extend multi-hop achieve better scalability. found out performance small very optimal results obtained by mathematical tools. conducted extensive simulations demonstrate proposed can significantly improve reception ratio, reduce total consumption prolong lifetime compared typical algorithm, HEED, does not links.