{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T20:40:25Z","timestamp":1740429625902,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,8,20]],"date-time":"2010-08-20T00:00:00Z","timestamp":1282262400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s11227-010-0470-7","type":"journal-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T07:48:00Z","timestamp":1282204080000},"page":"744-761","source":"Crossref","is-referenced-by-count":8,"title":["EF-MPR, a new energy eFficient multi-point relay selection algorithm for MANET"],"prefix":"10.1007","volume":"59","author":[{"given":"Hassan","family":"Chizari","sequence":"first","affiliation":[]},{"given":"Majid","family":"Hosseini","sequence":"additional","affiliation":[]},{"given":"Shaharuddin","family":"Salleh","sequence":"additional","affiliation":[]},{"given":"Shukor Abd","family":"Razak","sequence":"additional","affiliation":[]},{"given":"Abdul Hanan","family":"Abdullah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,20]]},"reference":[{"issue":"2\/3","key":"470_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1013763825347","volume":"8","author":"Y-C Tseng","year":"2002","unstructured":"Tseng Y-C, Ni S-Y, Chen Y-S, Sheu J-P (2002) The broadcast storm problem in a mobile ad hoc network. Wirel Netw 8(2\/3):153\u2013167","journal-title":"Wirel Netw"},{"key":"470_CR2","unstructured":"Qayyum A, Viennot L, Laouiti A (2000) Multipoint relaying: an efficient technique for flooding in mobile wireless networks. Technical Report, Institu National de Recherche en Informatique et en Automatique"},{"volume-title":"Handbook of approximation algorithms and metaheuristics","year":"2007","key":"470_CR3","unstructured":"Gonzalez TF (ed) (2007) Handbook of approximation algorithms and metaheuristics. Chapman and Hall\/CRC Press, London\/Boca Raton"},{"issue":"3","key":"470_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chavatal","year":"1979","unstructured":"Chavatal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4(3):233","journal-title":"Math Oper Res"},{"issue":"3","key":"470_CR5","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TSMCB.2008.915645","volume":"38","author":"P Guturu","year":"2008","unstructured":"Guturu P, Dantu R (2008) An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some np-hard problems in graph and set theory via clique finding. IEEE Trans Syst Man Cybern B 38(3):645\u2013666","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"470_CR6","unstructured":"Chiang CC, Dai HK (2005) On the minimum-cost set-covering problem. In: Proceedings of the 2005 international conference on parallel and distributed processing techniques and applications, PDPTA\u201905, vol 3, pp 1199\u20131205"},{"key":"470_CR7","doi-asserted-by":"crossref","unstructured":"Khan AY, Rashid S, Iqbal A (2005) Mobility vs predictive MPR selection for mobile ad hoc networks using OLSR. In: Proceedings\u2014IEEE 2005 international conference on emerging technologies, ICET 2005, vol 2005, pp 52\u201357","DOI":"10.1109\/ICET.2005.1558854"},{"key":"470_CR8","unstructured":"Chang Y-K, Ting Y-W, Wu S-C (2007) Power-efficient and path-stable broadcasting scheme for wireless ad hoc networks. In: Proceedings\u201421st international conference on advanced information networking and applications workshops\/symposia, AINAW\u201907, vol 1, pp 707\u2013712"},{"key":"470_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/978-3-540-76809-8_2","volume-title":"Mobility versus density metric for OLSR enhancement","author":"C Yawut","year":"2007","unstructured":"Yawut C, Paillassa B, Dhaou R (2007) Mobility versus density metric for OLSR enhancement. Lecture notes in computer science, vol\u00a04866, pp\u00a02\u201317. Springer, Berlin"},{"key":"470_CR10","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1109\/AINAW.2007.94","volume-title":"Ainaw \u201907: Proceedings of the 21st international conference on advanced information networking and applications workshops","author":"D Nguyen","year":"2007","unstructured":"Nguyen D, Minet P (2007) Analysis of MPR selection in the OLSR protocol. In: Ainaw \u201907: Proceedings of the 21st international conference on advanced information networking and applications workshops, Washington, DC, USA. IEEE Comput. Soc., Los Alamitos, pp 887\u2013892"},{"key":"470_CR11","doi-asserted-by":"crossref","unstructured":"Liang O, Sekercioglu YA, Mani N (2006) Gateway multipoint relays-an MPR-based broadcast algorithm for ad hoc networks. In: 10th IEEE Singapore international conference on communication systems, 2006 ICCS 2006, pp. 1\u20136, 30 Nov 2006","DOI":"10.1109\/ICCS.2006.301379"},{"key":"470_CR12","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/800125.804034","volume-title":"STOC \u201973: Proceedings of the 5th annual ACM symposium on theory of computing","author":"DS Johnson","year":"1973","unstructured":"Johnson DS (1973) Approximation algorithms for combinatorial problems. In: STOC \u201973: Proceedings of the 5th annual ACM symposium on theory of computing, New York, USA. ACM, New York, pp 38\u201349"},{"issue":"4","key":"470_CR13","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1057\/palgrave.jors.2600380","volume":"48","author":"L Lorena","year":"1997","unstructured":"Lorena L, de Souza Lopes L (1997) Genetic algorithms applied to computationally difficult set covering problems. J Oper Res Soc 48(4):440\u2013445","journal-title":"J Oper Res Soc"},{"key":"470_CR14","first-page":"569","volume":"2","author":"W-C Huang","year":"1994","unstructured":"Huang W-C, Kao C-Y, Horng J-T (1994) Genetic algorithm approach for set covering problems. IEEE Conf Evol Comput Proc 2:569\u2013574","journal-title":"IEEE Conf Evol Comput Proc"},{"issue":"9","key":"470_CR15","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1016\/S0305-0548(01)00026-0","volume":"29","author":"M Solar","year":"2002","unstructured":"Solar M, Parada V, Urrutia R (2002) A parallel genetic algorithm to solve the set-covering problem. Comput Oper Res 29(9):1221\u20131235","journal-title":"Comput Oper Res"},{"key":"470_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna F (1997) Tabu search. Kluwer Academic, Boston"},{"key":"470_CR17","series-title":"Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics)","first-page":"302","volume-title":"Local search algorithm for unicost set covering problem","author":"N Musliu","year":"2006","unstructured":"Musliu N (2006) Local search algorithm for unicost set covering problem. Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), vol\u00a04031, pp\u00a0302\u2013311. Springer, Berlin"},{"key":"470_CR18","unstructured":"Brusco MJ, Jacobs LW, Thompson GM (1996) A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated weighted set-covering problems. Working paper, Operations Management and Information Systems Department, Northern Illinois University"},{"issue":"7","key":"470_CR19","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M","volume":"42","author":"LW Jacobs","year":"1995","unstructured":"Jacobs LW, Brusco MJ (1995) Note: a local-search heuristic for large set-covering problems. Nav Res Logist 42(7):1129\u20131140","journal-title":"Nav Res Logist"},{"key":"470_CR20","doi-asserted-by":"crossref","unstructured":"Hossain A, Chakrabarti S, Biswas PK (2008) Sensing models and its impact on network coverage in wireless sensor network. In: IEEE region 10 colloquium and the 3rd ICIIS, Dec 2008","DOI":"10.1109\/ICIINFS.2008.4798455"},{"key":"470_CR21","unstructured":"The Network Simulator 2 (NS2). http:\/\/www.isi.edu\/nsnam\/ns\/ (2010)"},{"key":"470_CR22","unstructured":"Johnson DB (1999) Validation of wireless and mobile network models and simulation. In DARPA\/NIST network simulation validation workshop"},{"key":"470_CR23","doi-asserted-by":"crossref","unstructured":"Kunz T (2008) Energy-efficient variations of OLSR, Piscataway, NJ 08855-1331, United States, pp 517\u2013522","DOI":"10.1109\/IWCMC.2008.90"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-010-0470-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-010-0470-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-010-0470-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T20:03:00Z","timestamp":1740427380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-010-0470-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,20]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["470"],"URL":"https:\/\/doi.org\/10.1007\/s11227-010-0470-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2010,8,20]]}}}