{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:53:39Z","timestamp":1773154419752,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T00:00:00Z","timestamp":1614211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T00:00:00Z","timestamp":1614211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010426","name":"UGC-DAE\u00a0Consortium for Scientific Research, University Grants Commission","doi-asserted-by":"publisher","award":["F.No.\/2014-15\/NFO-2014-15-OBC-PON-3843\/(SA-III\/WEBSITE)"],"award-info":[{"award-number":["F.No.\/2014-15\/NFO-2014-15-OBC-PON-3843\/(SA-III\/WEBSITE)"]}],"id":[{"id":"10.13039\/501100010426","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s11277-021-08253-1","type":"journal-article","created":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T15:06:30Z","timestamp":1614265590000},"page":"1111-1135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Flower Pollination Algorithm with Powell\u2019s Method for the Minimum Energy Broadcast Problem in Wireless Sensor Network"],"prefix":"10.1007","volume":"119","author":[{"given":"M.","family":"Rajeswari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kalaipriyan","family":"Thirugnanasambandam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. S.","family":"Raghav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Prabu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Devaraj","family":"Saravanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2008-6828","authenticated-orcid":false,"given":"Dinesh Kumar","family":"Anguraj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"key":"8253_CR1","first-page":"1","volume-title":"International conference on learning and intelligent optimization","author":"S Al-Shihabi","year":"2007","unstructured":"Al-Shihabi, S., Merz, P., & Wolf, S. (2007). Nested partitioning for the minimum energy broadcast problem. International conference on learning and intelligent optimization (pp. 1\u201311). Berlin Heidelberg: Springer."},{"key":"8253_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.swevo.2013.04.001","volume":"12","author":"D Arivudainambi","year":"2013","unstructured":"Arivudainambi, D., & Rekha, D. (2013). Memetic algorithm for minimum energy broadcast problem in wireless ad hoc networks. Swarm and Evolutionary Computation, 12, 57\u201364.","journal-title":"Swarm and Evolutionary Computation"},{"issue":"2","key":"8253_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.orl.2009.01.004","volume":"37","author":"J Bauer","year":"2009","unstructured":"Bauer, J., Haugland, D., & Yuan, D. (2009). A fast local search method for minimum energy broadcast in wireless ad hoc networks. Operations Research Letters, 37(2), 75\u201379.","journal-title":"Operations Research Letters"},{"key":"8253_CR4","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.asoc.2015.08.037","volume":"37","author":"G Bekda\u015f","year":"2015","unstructured":"Bekda\u015f, G., Nigdeli, S. M., & Yang, X.-S. (2015). Sizing optimization of truss structures using flower pollination algorithm. Applied Soft Computing, 37, 322\u2013331.","journal-title":"Applied Soft Computing"},{"key":"8253_CR5","doi-asserted-by":"crossref","unstructured":"\u010cagalj, M., Hubaux, J.-P., & Enz, C. (2002). Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In Proceedings of the 8th annual international conference on mobile computing and networking (pp. 172\u2013182). ACM.","DOI":"10.1145\/570645.570667"},{"key":"8253_CR6","unstructured":"Das, A. K., Marks, R. J., El-Sharkawi, M., Arabshahi, P., & Gray, A. (2002). The minimum power broadcast problem in wireless networks: An ant colony system approach. In Proceedings of the IEEE workshop on wireless communications and networking."},{"key":"8253_CR7","doi-asserted-by":"crossref","unstructured":"Das, A. K., Marks, R. J., El-Sharkawi, M., Arabshahi, P., & Gray, A. (2003). r-shrink: A heuristic for improving minimum power broadcast trees in wireless networks. In Global telecommunications conference, 2003. GLOBECOM'03 (vol. 1, pp. 523\u2013527). IEEE.","DOI":"10.1109\/GLOCOM.2003.1258292"},{"issue":"9","key":"8253_CR8","doi-asserted-by":"publisher","first-page":"2129","DOI":"10.1016\/j.comcom.2007.04.006","volume":"30","author":"S Guo","year":"2007","unstructured":"Guo, S., & Yang, O. W. W. (2007). Energy-aware multicasting in wireless ad hoc networks: A survey and discussion. Computer Communications, 30(9), 2129\u20132148.","journal-title":"Computer Communications"},{"key":"8253_CR9","unstructured":"Guo, S., & Yang, O. (2004). A dynamic multicast tree reconstruction algorithm for minimum-energy multicasting in wireless ad hoc networks. In 2004 IEEE international conference on performance, computing, and communications (pp. 637\u2013642). IEEE."},{"issue":"2","key":"8253_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s11721-009-0027-7","volume":"3","author":"H Hern\u00e1ndez","year":"2009","unstructured":"Hern\u00e1ndez, H., & Blum, C. (2009). Ant colony optimization for multicasting in static wireless ad-hoc networks. Swarm Intelligence, 3(2), 125\u2013148.","journal-title":"Swarm Intelligence"},{"issue":"12","key":"8253_CR11","doi-asserted-by":"publisher","first-page":"4786","DOI":"10.1016\/j.asoc.2013.08.008","volume":"13","author":"P-C Hsiao","year":"2013","unstructured":"Hsiao, P.-C., Chiang, T.-C., & Fu, L.-C. (2013). Static and dynamic minimum energy broadcast problem in wireless ad-hoc networks: A PSO-based approach and analysis. Applied Soft Computing, 13(12), 4786\u20134801.","journal-title":"Applied Soft Computing"},{"issue":"6","key":"8253_CR12","doi-asserted-by":"publisher","first-page":"4918","DOI":"10.3390\/s90604918","volume":"9","author":"J-A Jiang","year":"2009","unstructured":"Jiang, J.-A., Chen, C.-P., Chuang, C. L., Lin, T.-S., Tseng, C.-L., Yang, E.-C., & Wang, Y.-C. (2009). CoCMA: Energy-efficient coverage control in cluster-based wireless sensor networks using a memetic algorithm. Sensors, 9(6), 4918\u20134940.","journal-title":"Sensors"},{"key":"8253_CR13","doi-asserted-by":"crossref","unstructured":"Kang, I., & Poovendran, R. (2003). A novel power-efficient broadcast routing algorithm exploiting broadcast efficiency. In Vehicular technology conference, 2003. VTC 2003-fall. 2003 IEEE 58th (vol. 5, pp. 2926\u20132930). IEEE.","DOI":"10.1109\/VETECF.2003.1286159"},{"key":"8253_CR14","doi-asserted-by":"crossref","unstructured":"Kang, I., & Poovendran, R. (2004). Broadcast with heterogeneous node capability [wireless ad hoc or sensor networks]. In Global telecommunications conference, 2004. GLOBECOM'04 (vol. 6, pp. 4114\u20134119). IEEE.","DOI":"10.1109\/GLOCOM.2004.1379139"},{"key":"8253_CR15","doi-asserted-by":"crossref","unstructured":"Kang, I., & Poovendran, R. (2005). Iterated local optimization for minimum energy broadcast. In Third international symposium on modeling and optimization in mobile, ad hoc, and wireless networks, 2005. WIOPT 2005 (pp. 332\u2013341). IEEE.","DOI":"10.1109\/WIOPT.2005.24"},{"issue":"4","key":"8253_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.swevo.2011.06.004","volume":"1","author":"EA Khalil","year":"2011","unstructured":"Khalil, E. A., & Bara\u2019a, A. A. (2011). Energy-aware evolutionary routing protocol for dynamic clustering of wireless sensor networks. Swarm and Evolutionary Computation, 1(4), 195\u2013203.","journal-title":"Swarm and Evolutionary Computation"},{"key":"8253_CR17","first-page":"866","volume-title":"International conference on research in networking","author":"R Klasing","year":"2004","unstructured":"Klasing, R., Navarra, A., Papadopoulos, A., & P\u00e9rennes, A. (2004). Adaptive broadcast consumption (ABC), a new heuristic and new bound for the minimum energy broadcast routing problem. International conference on research in networking (pp. 866\u2013877). Berlin Heidelberg: Springer."},{"issue":"14","key":"8253_CR18","doi-asserted-by":"publisher","first-page":"2753","DOI":"10.1016\/j.comcom.2007.05.013","volume":"30","author":"A Konstantinidis","year":"2007","unstructured":"Konstantinidis, A., Yang, K., Chen, H.-H., & Zhang, Q. (2007). Energy-aware topology control for wireless sensor networks using memetic algorithms. Computer Communications, 30(14), 2753\u20132764.","journal-title":"Computer Communications"},{"issue":"6","key":"8253_CR19","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.comnet.2009.08.010","volume":"54","author":"A Konstantinidis","year":"2010","unstructured":"Konstantinidis, A., Yang, K., Zhang, Q., & Zeinalipour-Yazti, D. (2010). A multi-objective evolutionary algorithm for the deployment and power assignment problem in wireless sensor networks. Computer Networks, 54(6), 960\u2013976.","journal-title":"Computer Networks"},{"key":"8253_CR20","doi-asserted-by":"crossref","unstructured":"Liang, W. (2002). Constructing minimum-energy broadcast trees in wireless ad hoc networks. In Proceedings of the 3rd ACM international symposium on mobile ad hoc networking and computing (pp. 112\u2013122). ACM.","DOI":"10.1145\/513800.513815"},{"issue":"5","key":"8253_CR21","doi-asserted-by":"publisher","first-page":"4677","DOI":"10.1103\/PhysRevE.49.4677","volume":"49","author":"RN Mantegna","year":"1994","unstructured":"Mantegna, R. N. (1994). Fast, accurate algorithm for numerical simulation of Levy stable stochastic processes. Physical Review E, 49(5), 4677.","journal-title":"Physical Review E"},{"key":"8253_CR22","first-page":"298","volume-title":"International conference on ad-hoc networks and wireless","author":"C Miller","year":"2009","unstructured":"Miller, C., & Poellabauer, C. (2009). A decentralized approach to minimum-energy broadcasting in static ad hoc networks. International conference on ad-hoc networks and wireless (pp. 298\u2013311). Berlin Heidelberg: Springer."},{"issue":"1","key":"8253_CR23","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1016\/j.asoc.2010.02.021","volume":"11","author":"G Molina","year":"2011","unstructured":"Molina, G., & Alba, E. (2011). Location discovery in wireless sensor networks using metaheuristics. Applied Soft Computing, 11(1), 1223\u20131240.","journal-title":"Applied Soft Computing"},{"key":"8253_CR24","doi-asserted-by":"crossref","unstructured":"Montemanni, R., Gambardella, L. M., & Das, A. K. (2005). The minimum power broadcast problem in wireless networks: A simulated annealing approach. In Wireless communications and networking conference, 2005 IEEE (vol. 4, pp. 2057\u20132062).","DOI":"10.1109\/WCNC.2005.1424835"},{"issue":"2","key":"8253_CR25","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1016\/j.jcp.2007.06.008","volume":"226","author":"I Pavlyukevich","year":"2007","unstructured":"Pavlyukevich, I. (2007). L\u00e9vy flights, non-local search and simulated annealing. Journal of Computational Physics, 226(2), 1830\u20131844.","journal-title":"Journal of Computational Physics"},{"issue":"1","key":"8253_CR26","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"MJD Powell","year":"1977","unstructured":"Powell, M. J. D. (1977). Restart procedures for the conjugate gradient method. Mathematical Programming, 12(1), 241\u2013254.","journal-title":"Mathematical Programming"},{"key":"8253_CR27","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1155\/2017\/6563498","volume":"2017","author":"M Rajeswari","year":"2017","unstructured":"Rajeswari, M., Amudhavel, J., Pothula, S., & Dhavachelvan, P. (2017). Directed bee colony optimization algorithm to solve the nurse rostering problem. Computational Intelligence and Neuroscience, 2017, 26. https:\/\/doi.org\/10.1155\/2017\/6563498.","journal-title":"Computational Intelligence and Neuroscience"},{"key":"8253_CR28","doi-asserted-by":"crossref","unstructured":"Raju, R., Amudhavel, J., Kannan, N., & Monisha, M. (2014). A bio inspired energy-aware multi objective chiropteran algorithm (EAMOCA) for hybrid cloud computing environment. In 2014 International conference on green computing communication and electrical engineering (ICGCCEE) (pp. 1\u20135). IEEE.","DOI":"10.1109\/ICGCCEE.2014.6922463"},{"issue":"4","key":"8253_CR29","doi-asserted-by":"publisher","first-page":"e354","DOI":"10.1371\/journal.pone.0000354","volume":"2","author":"AM Reynolds","year":"2007","unstructured":"Reynolds, A. M., & Frye, M. A. (2007). Free-flight odor tracking in Drosophila is consistent with an optimal intermittent scale-free search. PLoS ONE, 2(4), e354.","journal-title":"PLoS ONE"},{"issue":"1","key":"8253_CR30","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.engappai.2012.05.018","volume":"26","author":"S Sengupta","year":"2013","unstructured":"Sengupta, S., Das, S., Nasir, M. D., & Panigrahi, B. K. (2013). Multi-objective node deployment in WSNs: In search of an optimal trade-off among coverage, lifetime, energy consumption, and connectivity. Engineering Applications of Artificial Intelligence, 26(1), 405\u2013416.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"1","key":"8253_CR31","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.asoc.2009.12.027","volume":"11","author":"A Singh","year":"2011","unstructured":"Singh, A., & Bhukya, W. N. (2011). A hybrid genetic algorithm for the minimum energy broadcast problem in wireless ad hoc networks. Applied Soft Computing, 11(1), 667\u2013674.","journal-title":"Applied Soft Computing"},{"issue":"6","key":"8253_CR32","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1023\/A:1020381720601","volume":"8","author":"P-J Wan","year":"2002","unstructured":"Wan, P.-J., C\u0103linescu, G., Li, X.-Y., & Frieder, O. (2002). Minimum-energy broadcasting in static ad hoc wireless networks. Wireless Networks, 8(6), 607\u2013617.","journal-title":"Wireless Networks"},{"key":"8253_CR33","doi-asserted-by":"crossref","unstructured":"Wieselthier, J. E., Nguyen, G. D., & Ephremides, A. (2000). On the construction of energy-efficient broadcast and multicast trees in wireless networks. In INFOCOM 2000. Nineteenth annual joint conference of the IEEE computer and communications societies. Proceedings (vol. 2, pp. 585\u2013594). IEEE.","DOI":"10.1109\/INFCOM.2000.832232"},{"key":"8253_CR34","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-78604-7_6","volume-title":"European conference on evolutionary computation in combinatorial optimization","author":"S Wolf","year":"2008","unstructured":"Wolf, S., & Merz, P. (2008). Evolutionary local search for the minimum energy broadcast problem. European conference on evolutionary computation in combinatorial optimization (pp. 61\u201372). Berlin Heidelberg: Springer."},{"key":"8253_CR35","doi-asserted-by":"crossref","unstructured":"Wu, X., Wang, X., & Liu, R. (2008). Solving minimum power broadcast problem in wireless ad-hoc networks using genetic algorithm. In Communication networks and services research conference, 2008. CNSR 2008. 6th annual (pp. 203\u2013207). IEEE.","DOI":"10.1109\/CNSR.2008.91"},{"key":"8253_CR36","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-32894-7_27","volume-title":"International conference on unconventional computing and natural computation","author":"X-S Yang","year":"2012","unstructured":"Yang, X.-S. (2012). Flower pollination algorithm for global optimization. International conference on unconventional computing and natural computation (pp. 240\u2013249). Berlin Heidelberg: Springer."}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-021-08253-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11277-021-08253-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-021-08253-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T12:20:07Z","timestamp":1625487607000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11277-021-08253-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,25]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["8253"],"URL":"https:\/\/doi.org\/10.1007\/s11277-021-08253-1","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,25]]},"assertion":[{"value":"4 February 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}