{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:11:15Z","timestamp":1750824675656,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319655147"},{"type":"electronic","value":"9783319655154"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-65515-4_21","type":"book-chapter","created":{"date-parts":[[2017,7,27]],"date-time":"2017-07-27T10:33:56Z","timestamp":1501151636000},"page":"250-262","source":"Crossref","is-referenced-by-count":0,"title":["New Formulations for an Optimal Connectivity Approach for Mobile Ad-hoc Networks"],"prefix":"10.1007","author":[{"given":"Pablo","family":"Adasme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ismael","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Seguel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,28]]},"reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/net.21610","volume":"65","author":"P Adasme","year":"2015","unstructured":"Adasme, P., Andrade, R., Letournel, M., Lisser, A.: Stochastic maximum weight forest problem. Networks 65(4), 289\u2013305 (2015)","journal-title":"Networks"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.comnet.2016.11.011","volume":"112","author":"P Adasme","year":"2017","unstructured":"Adasme, P., Andrade, R., Lisser, A.: Minimum cost dominating tree sensor networks under probabilistic constraints. Comput. Netw. 112, 208\u2013222 (2017)","journal-title":"Comput. Netw."},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1007\/978-0-387-30165-5_30","volume-title":"Handbook of Optimization in Telecommunications","author":"B Balasundaram","year":"2006","unstructured":"Balasundaram, B., Butenko, S.: Graph domination, coloring and cliques in telecommunications. In: Resende, M.G.C., Pardalos, P.M. (eds.) Handbook of Optimization in Telecommunications, pp. 865\u2013890. Springer, New York (2006)"},{"key":"21_CR4","first-page":"43","volume-title":"Cooperative Control: Models, Applications and Algorithms","author":"S Butenko","year":"2002","unstructured":"Butenko, S., Cheng, X., Du, D.Z., Pardalos, P.M.: On the construction of virtual backbone for ad-hoc wireless networks. In: Butenko, S., Murphey, R., Pardalos, P.M. (eds.) Cooperative Control: Models, Applications and Algorithms, vol. 1, Dordrecht edn, pp. 43\u201354. Kluwer, Dordrecht (2002)","edition":"Dordrecht"},{"issue":"8","key":"21_CR5","doi-asserted-by":"crossref","first-page":"4183","DOI":"10.1109\/TWC.2013.052613.130019","volume":"12","author":"B Cheng","year":"2013","unstructured":"Cheng, B., Coyle, A., McGarry, S., Pedan, I., Veytser, L., Wheeler, J.: Characterizing routing with radio-to-router information in a heterogeneous airborne network. IEEE Trans. Wirel. Commun. 12(8), 4183\u20134195 (2013)","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"21_CR6","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press and McGraw-Hill, Cumberland (2009)"},{"key":"21_CR7","unstructured":"Ibm, ILOG, CPLEX High-performance mathematical programming engine . http:\/\/www.ibm.com\/software\/integration\/optimization\/cplex\/"},{"key":"21_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"issue":"4","key":"21_CR9","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/ijoc.2013.0589","volume":"26","author":"B Gendron","year":"2014","unstructured":"Gendron, B., Lucena, A., de Cunha, A., Simonetti, L.: Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem. Inform. J. Comput. 26(4), 645\u2013657 (2014)","journal-title":"Inform. J. Comput."},{"issue":"4","key":"21_CR10","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Ibrahim, H.M., Omar, N.M., William, E.K.: A secure technique for construction and maintenance of a trusted mobile backbone network in MANET. In: IEEE 12th International Conference on Networking, Sensing and Control, pp. 116\u2013121 (2015)","DOI":"10.1109\/ICNSC.2015.7116020"},{"issue":"2","key":"21_CR12","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.1109\/TVT.2016.2564423","volume":"66","author":"R Jia","year":"2017","unstructured":"Jia, R., Yang, F., Yao, S., Tian, X., Wang, X., Zhang, W., Xu, J.: Optimal CapacityDelayTradeoff in MANETs with correlation of node mobility. IEEE Trans. Veh. Technol 66(2), 1772\u20131785 (2017)","journal-title":"IEEE Trans. Veh. Technol"},{"issue":"9","key":"21_CR13","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.1109\/TMC.2006.140","volume":"5","author":"W Jie","year":"2006","unstructured":"Jie, W., Fai, D.: Virtual backbone construction in MANETs using adjustable transmission ranges. IEEE Trans. Mob. Comput. 5(9), 1188\u20131200 (2006)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/5.849157","volume":"88","author":"T Keller","year":"2000","unstructured":"Keller, T., Hanzo, L.: Adaptive multicarrier modulation: a convenient framework for time frequency processing in wireless communications. Proc. IEEE 88, 611\u2013640 (2000)","journal-title":"Proc. IEEE"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Kim, I., Lee, H.L., Kim, B., Lee, Y.H.: On the use of linear programming for dynamic subchannel and bit allocation in multiuser OFDM. In: IEEE GLOBECOM 2001, vol. 6, pp. 3648\u20133652 (2001)","DOI":"10.1109\/GLOCOM.2001.966362"},{"issue":"1","key":"21_CR16","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/TWC.2015.2475258","volume":"15","author":"J Liu","year":"2016","unstructured":"Liu, J., Sheng, M., Xu, Y., Li, J., Jiang, X.: End-to-End delay modeling in buffer-limited MANETs: a general theoretical framework. IEEE Trans. Wirel. Commun. 15(1), 498\u2013511 (2016)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"9","key":"21_CR17","doi-asserted-by":"crossref","first-page":"7543","DOI":"10.1109\/TVT.2015.2481427","volume":"65","author":"Z Luo","year":"2016","unstructured":"Luo, Z., Gan, X., Wang, X., Luo, H.: Optimal ThroughputDelay tradeoff in MANETs with supportive infrastructure using random linear coding. IEEE Trans. Veh. Technol. 65(9), 7543\u20137558 (2016)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"21_CR18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10287-009-0116-5","volume":"7","author":"A Lucena","year":"2010","unstructured":"Lucena, A., Maculan, N., Simonetti, L.: Reformulations and solution algorithms for the maximum leaf spanning tree problem. Comput. Manag. Sci. 7, 289\u2013311 (2010)","journal-title":"Comput. Manag. Sci."},{"issue":"1","key":"21_CR19","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1049\/iet-com.2016.0574","volume":"11","author":"PFA Selvi","year":"2017","unstructured":"Selvi, P.F.A., Manikandan, M.S.K.: Ant based multipath backbone routing for load balancing in MANET. IET Commun. 11(1), 136\u2013141 (2017)","journal-title":"IET Commun."},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Rajashekhar, B., Sunilkumar, M.: Multicast routing in MANET using multiple reliable rings backbone. In: 3rd International Conference on Advances in Recent Technologies in Communication and Computing (ARTCom 2011), pp. 56\u201361 (2011)","DOI":"10.1049\/ic.2011.0051"},{"issue":"11","key":"21_CR21","doi-asserted-by":"crossref","first-page":"1566","DOI":"10.1049\/iet-com.2010.0680","volume":"5","author":"M Sheikhan","year":"2011","unstructured":"Sheikhan, M., Hemmati, E.: High reliable disjoint path set selection in mobile ad-hoc network using hopfield neural network. IET Commun. 5(11), 1566\u20131576 (2011)","journal-title":"IET Commun."},{"key":"21_CR22","doi-asserted-by":"crossref","first-page":"627","DOI":"10.4218\/etrij.08.1308.0099","volume":"30","author":"J Stankovic","year":"2008","unstructured":"Stankovic, J.: When sensor and actuator networks cover the world. ETRI J. 30, 627\u2013633 (2008)","journal-title":"ETRI J."},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Vodnala, D., Aluvala, S., Phani, Kumar, S.: A backbone based multicast routing protocol for route recovery in MANETs. In: 2nd International Conference on Electronics and Communication Systems (ICECS), pp. 237\u2013241 (2015)","DOI":"10.1109\/ECS.2015.7124900"},{"issue":"12","key":"21_CR24","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1109\/TPDS.2008.43","volume":"19","author":"S Yang","year":"2008","unstructured":"Yang, S., Wu, J., Dai, F.: Efficient directional network backbone construction in mobile ad hoc networks. IEEE Trans. Parallel Distrib. Syst. 19(12), 1601\u20131613 (2008)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Mobile Web and Intelligent Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-65515-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T18:22:32Z","timestamp":1750789352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-65515-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319655147","9783319655154"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-65515-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}