دانلود رایگان مقاله گسترش گره رله انرژی قابل حفظ در شبکه های حسگر بی سیم

Abstract

Emergence of diverse renewable energy harvesting technologies and their incorporation into tiny sensor devices have given birth to Energy Harvesting Wireless Sensor Networks (EH-WSNs), where the problem domain has shifted from energy conservation to energy sustainability of the network. Renewable energy harvesting and depletion of sensor devices are stochastic and thus, energy availability in the devices is sporadic rather than continuous. Therefore, the optimal deployment of data routing devices (i.e., relay nodes) and their activity scheduling to ensure that, the data from all source sensors could be routed to the sink while keeping the network functional perpetually, is a challenging research problem. In this paper, we develop a multi-constraint mixed integer linear program (MILP) to minimize the number of relay nodes to be deployed in the network, while considering connectivity, sustainability and unpredictable energy harvesting and depletion rates. We refer to this problem as SMRMC (sustainable minimum-relay maximum-connectivity deployment) which is proved to be NP-hard. A light weight k-connected greedy solution to the SMRMC problem has been developed first for k=1, and thereafter, a generalized solution has been presented for any k (k ≥ 2) by constructing convex-polytopes among the existing relay nodes. Extensive simulation experiments have been conducted to validate the performance of the proposed deployment strategies. Performance studies carried out in MATLAB, show that the proposed SMRMC algorithms can achieve up to twice the network lifetime compared to state-of-the-art approaches whilst deploying minimum number of relay nodes.

6. Conclusion

In this work, we have investigated the problem of optimal relay node placement in EH-WSNs. Careful node placement can be a very effective optimization means for achieving enhanced, even perpetual lifetime in EH-WSN. We have studied the SMRMC (sustainable minimum-relay maximum-connectivity) problem of EHWSNs and analyzed the state-of-the-art researches on optimal node deployments. The problem of optimal deployment of relay nodes has been formulated as an MILP so as to achieve perpetual sensor networks. The MILP optimization framework is applicable irrespective of locations of the sink and source nodes; however, its complexity raises to very high as the network size increases. We have also investigated greedy solutions to the k-connected SMRMC problem using convex polytopes. Through computer simulations, we show that our greedy SMRMC algorithms can provide upto two times better performance in terms of network lifetime. Thus, our solution would provide network designers and researchers with a lucrative deployment strategy for relay nodes in EH-WSNs.