A method of deploying static auxiliary chargers (ACs) next to somesensor nodes is used to improve the maximum flow from sources to sinks in the network. So
the research formulates a mixed integer linear program (MILP) for the problem and proves that the problem is NP-hard. Firstly
it proposes to use BottleNeck algorithm whichuses path-by-unit and deploys ACs using the lowest energy node-first principleto generate initial population for genetic algorithm. Then the Improved Adaptive Genetic Algorithm (IAGA) is used to simulate the natural evolutionary process and search for the optimal location for deployment of ACs to maximize the flow rate to sinks. The simulation results show that IAGA can effectively increase the maximum flow arriving at the sinks compared with some other algorithms of distributing ACs.
关键词
Keywords
references
Rappaport T S. Wireless Communications: Principles and Practice[M]. Prentice HallPTR, 1996.
Xiao Y, Chen H, Li F H. Handbook on Sensor Networks[M]. World Scientific, 2010.
Heinzelman W R, Chandrakasan A, Balakrishnan H. Energy-Efficient Communication Protocol for Wireless Microsensor Networks[C]// Hawaii International Conference on System Sciences. IEEE Computer Society, 2000: 4-7.
Zhu C, Liu K, Yu C, et al. Simulation and experimental analysis on wireless energy transfer based on magnetic resonances[C]// Vehicle Power and Propulsion Conference. IEEE, 2008: 1-4.
Kurs A, Karalis A, Moffatt R, et al. Wireless Power Transfer via Strongly Coupled Magnetic Resonances[J]. Science, 2007, 317, 83-86. DOI: 83
Goldberg D E. Genetic Algorithm in Search, Optimization, and Machine Learning[J].1989, xiii(7): 2104-2116.
He T, Chin K W, Soh S. On using Wireless Power Transfer to increase the max flow of Rechargeable Wireless Sensor Networks[C]// IEEE Tenth International Conference on Intelligent Sensors, Sensor Networks and Information Processing. IEEE, 2015: 1-6.
Ahuja R K, Magnanti T L, Orlin J B. Network flows: theory, algorithms, and applications[J]. Journal of the Operational Research Society, 1993, 45(11):791-796. DOI: 791
Srinivas M, Patnaik L M. Adaptive probabilities of crossover and mutation in genetic algorithms[J]. IEEE Transactions on Systems Man % Cybernetics, 2002, 24(4):656-667. DOI: 656
Ford L R J, Fulkerson D R. A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem[J]. Canadian Journal of Mathematics, 1955, 9:210--218. DOI: 210