{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T21:10:02Z","timestamp":1748898602773,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319336206"},{"type":"electronic","value":"9783319336220"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.5"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-33622-0_23","type":"book-chapter","created":{"date-parts":[[2016,4,20]],"date-time":"2016-04-20T14:42:39Z","timestamp":1461163359000},"page":"249-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Game-Theoretical Approach in Network Routing: Algorithms and Their Performance Analysis in OMNeT++"],"prefix":"10.1007","author":[{"given":"Serap","family":"Erg\u00fcn","sequence":"first","affiliation":[]},{"given":"Tuncay","family":"Aydo\u011fan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,21]]},"reference":[{"key":"23_CR1","first-page":"2","volume":"100","author":"J Leino","year":"2003","unstructured":"Leino, J.: Applications of game theory in ad hoc networks. UNe 100, 2\u20135 (2003)","journal-title":"UNe"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02579075","volume":"9","author":"P Borm","year":"2001","unstructured":"Borm, P., Hamers, H., Hendrickx, R.: Operations research games: a survey. Top 9(2), 139\u2013199 (2001)","journal-title":"Top"},{"key":"23_CR3","unstructured":"Diaz-Estebaranz, J., Portilla-Figueras, J. A., Salcedosanz, S., Faro-Rivas, M., Esteve-Asensio, G.: Using an OMNET++ network based simulator as test-bed for network design algorithms. In: SMO\u201908: Proceedings of the 8th Conference on Simulation, Modeling and Optimization, Sept 2008"},{"key":"23_CR4","unstructured":"INET Framework Documentation. http:\/\/www.omnetpp.org\/doc\/INET"},{"key":"23_CR5","unstructured":"Mayer, C.P., Gamer, T.: Integrating real world applications into OMNeT++. Institute of Telematics, University of Karlsruhe, Karlsruhe, Germany, Technical report TM-2008-2 (2008)"},{"key":"23_CR6","unstructured":"OMNeT++ Discrete Event Simulator. https:\/\/omnetpp.org\/ (2015)"},{"key":"23_CR7","unstructured":"Varga, A.: The OMNeT++ discrete event simulation system. In: Proceedings of the European Simulation Multiconference (ESM\u20192001), vol. 9, no. S 185, p. 65, June 2001"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Xian, X., Shi, W., Huang, H.: Comparison of OMNET++ and other simulator for WSN simulation. In: 3rd IEEE Conference on Industrial Electronics and Applications, ICIEA 2008, pp. 1439\u20131443. IEEE, June 2008","DOI":"10.1109\/ICIEA.2008.4582757"},{"key":"23_CR9","unstructured":"Mallanda, C., Suri, A., Kunchakarra, V., Iyengar, S.S., Kannan, R., Durresi, A., Sastry, S.: Simulating wireless sensor networks with OMNeT++. Submitted to IEEE Computer (2005)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Varga, A., Hornig, R.: An overview of the OMNeT++ simulation environment. In: Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, Networks And Systems and Workshops, p. 60. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering) Mar 2008","DOI":"10.4108\/ICST.SIMUTOOLS2008.3027"},{"issue":"1\u20134","key":"23_CR11","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/COMST.2005.1593279","volume":"7","author":"V Srivastava","year":"2005","unstructured":"Srivastava, V., Neel, J.O., MacKenzie, A.B., Menon, R., DaSilva, L.A., Hicks, J.E., Gilles, R.P.: Using game theory to analyze wireless ad hoc networks. IEEE Commun. Surv. Tut. 7(1\u20134), 46\u201356 (2005)","journal-title":"IEEE Commun. Surv. Tut."},{"key":"23_CR12","unstructured":"Peleg, B., Sudh\u00f6lter, P.: Introduction to the Theory of Cooperative Games, vol. 34. Springer Science & Business Media (2007)"},{"key":"23_CR13","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT press (1994)"},{"key":"23_CR14","unstructured":"Vazirani, V.V.: In: Roughgarden, T., Tardos, E. (eds.) Algorithmic Game Theory, vol. 1. Cambridge University Press, Campbridge (2007)"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/MIS.2012.47","volume":"3","author":"G Chalkiadakis","year":"2012","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Cooperative game theory: basic concepts and computational challenges. IEEE Intell. Syst. 3, 86\u201390 (2012)","journal-title":"IEEE Intell. Syst."},{"key":"23_CR16","unstructured":"Savunen, T.: Application of the cooperative game theory to global strategic alliances. Doctoral dissertation, Helsinki University of Technology (2009)"},{"issue":"11","key":"23_CR17","doi-asserted-by":"publisher","first-page":"1638","DOI":"10.1016\/j.cor.2011.02.004","volume":"38","author":"S Moretti","year":"2011","unstructured":"Moretti, S., G\u00f6k, S.Z.A., Branzei, R., Tijs, S.: Connection situations under uncertainty and cost monotonic solutions. Comput. Oper. Res. 38(11), 1638\u20131645 (2011)","journal-title":"Comput. Oper. Res."},{"key":"23_CR18","unstructured":"Branzei, R., Dimitrov, D., Tijs, S.: Models in Cooperative Game Theory, vol. 556. Springer Science & Business Media (2008)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Ahuja, R. K., Magnanti, T. L., Orlin, J.B.: Network flows (No. MIT-WP-2059-88). Alfred P Sloan School of Management, Cambridge, MA (1988)","DOI":"10.21236\/ADA594171"},{"key":"23_CR20","unstructured":"Evans, J.: Optimization Algorithms for Networks and Graphs. CRC Press (1992)"},{"issue":"1","key":"23_CR21","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"issue":"6","key":"23_CR22","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"23_CR23","unstructured":"Bor\u016fvka, O.: O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm (1926)"},{"key":"23_CR24","unstructured":"Chartrand, G., Oellermann, O. R.: Applied and Algorithmic Graph Theory (1993)"}],"container-title":["Advances in Intelligent Systems and Computing","Software Engineering Perspectives and Application in Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33622-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T20:40:15Z","timestamp":1748896815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-33622-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319336206","9783319336220"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33622-0_23","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"21 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}