{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T22:40:10Z","timestamp":1748904010114,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319339351"},{"type":"electronic","value":"9783319339368"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-33936-8_27","type":"book-chapter","created":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T06:33:55Z","timestamp":1461738835000},"page":"348-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Link Deployment for Minimizing Average Path Length in Chain Networks"],"prefix":"10.1007","author":[{"given":"Zeki","family":"Bilgin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murat","family":"Gunestas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Demir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sahin","family":"Buyrukbilen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,28]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1155\/2014\/767802","volume":"2014","author":"S Kim","year":"2014","unstructured":"Kim, S., Kim, J., Yoo, Y.: Container security device chain network for safe railway\u00a0transportation. Int. J. Distrib. Sens. Netw. 2014, 12 (2014). doi: 10.1155\/2014\/767802 . Article ID 767802","journal-title":"Int. J. Distrib. Sens. Netw."},{"issue":"1","key":"27_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s11277-006-9103-0","volume":"40","author":"J Agbinya","year":"2007","unstructured":"Agbinya, J.: Design considerations of MoHotS and wireless chain networks. Wireless Pers. Commun. 40(1), 91\u2013106 (2007). http:\/\/dx.doi.org\/10.1007\/s11277-006-9103-0","journal-title":"Wireless Pers. Commun."},{"issue":"1","key":"27_CR3","first-page":"17","volume":"21","author":"J Haifeng","year":"2011","unstructured":"Haifeng, J., Jiansheng, Q., Yanjing, S., Guoyong, Z.: Energy optimal routing for long chain-type wireless sensor networks in underground mines. Min. Sci. Technol. 21(1), 17\u201321 (2011). (china). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1674526410000219","journal-title":"Min. Sci. Technol."},{"issue":"1","key":"27_CR4","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1016\/j.proeps.2009.09.225","volume":"1","author":"Y Yuan","year":"2009","unstructured":"Yuan, Y., Shen, Z., Quan-fu, W., Pei, S.: Long distance wireless sensor networks applied in coal mine. Procedia Earth Planet. Sci. 1(1), 1461\u20131467 (2009). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1674526410000219","journal-title":"Procedia Earth Planet. Sci."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1155\/2015\/405374","volume":"2015","author":"G Zhou","year":"2015","unstructured":"Zhou, G., Zhu, Z., Zhang, P., Li, W.: Source-aware redundant packet forwarding\u00a0scheme for emergency information delivery in chain-typed multihop wireless sensor\u00a0networks. Int. J. Distrib. Sens. Netw. 2015, 10 (2015). doi: 10.1155\/2015\/405374 . Article ID 405374","journal-title":"Int. J. Distrib. Sens. Netw."},{"issue":"4","key":"27_CR6","doi-asserted-by":"publisher","first-page":"656","DOI":"10.3923\/itj.2013.656.663","volume":"12","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Ren, T., Liu, Y., Zhou, Y.: Lifetime maximization algorithm for chain wireless sensor networks. Inform. Technol. J. 12(4), 656\u2013663 (2013)","journal-title":"Inform. Technol. J."},{"doi-asserted-by":"crossref","unstructured":"Leu, F.Y., Huang, Y.T.: Maximum capacity in chain-topology wireless mesh networks. In: Wireless Telecommunications Symposium, WTS 2008, pp. 250\u2013259, April 2008","key":"27_CR7","DOI":"10.1109\/WTS.2008.4547572"},{"issue":"1\u20132","key":"27_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/B:MONE.0000048544.06992.f7","volume":"10","author":"M Flammini","year":"2005","unstructured":"Flammini, M., Gambosi, G., Navarra, A.: Wireless ATM layouts for chain networks. Mob. Netw. Appl. 10(1\u20132), 35\u201345 (2005). http:\/\/dx.doi.org\/10.1023\/B3AMONE.0000048544.06992.f7","journal-title":"Mob. Netw. Appl."},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"2","key":"27_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12204-012-1259-z","volume":"17","author":"ZG Xu","year":"2012","unstructured":"Xu, Z.G., Zhu, L.J., Shi, Y.S., Jiang, H.: Research of scalability of the belt-type sensor networks. J. Shanghai Jiaotong Univ. 17(2), 237\u2013240 (2012). (Science)","journal-title":"J. Shanghai Jiaotong Univ."},{"issue":"7","key":"27_CR11","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1016\/j.cnsns.2006.12.003","volume":"13","author":"F Chen","year":"2008","unstructured":"Chen, F., Chen, Z., Wang, X., Yuan, Z.: The average path length of scale free networks. Commun. Nonlinear Sci. Numer. Simul. 13(7), 1405\u20131410 (2008). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1007570406002383","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"doi-asserted-by":"crossref","unstructured":"Yen, C.C., Yeh, M.Y., Chen, M.S.: An efficient approach to updating closeness centrality and average path length in dynamic networks. In: 2013 IEEE 13th International Conference on Data Mining (ICDM), pp. 867\u2013876, December 2013","key":"27_CR12","DOI":"10.1109\/ICDM.2013.135"},{"unstructured":"Guly\u00e1s, L., Horv\u00e1th, G., Cs\u00e9ri, T., Kampis, G.: An estimation of the shortest and largest average path length in graphs of given density. ArXiv e-prints, January 2011","key":"27_CR13"},{"issue":"41","key":"27_CR14","doi-asserted-by":"publisher","first-page":"415002","DOI":"10.1088\/1751-8113\/44\/41\/415002","volume":"44","author":"D Guo","year":"2011","unstructured":"Guo, D., Liang, M., Li, D., Jiang, Z.: Effect of random edge failure on the average path length. J. Phys. A: Math. Theor. 44(41), 415002 (2011). http:\/\/stacks.iop.org\/1751-8121\/44\/i=41\/a=415002","journal-title":"J. Phys. A: Math. Theor."},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.matcom.2014.09.005","volume":"109","author":"AI Reppas","year":"2015","unstructured":"Reppas, A.I., Spiliotis, K., Siettos, C.I.: Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model. Math. Comput. Simul. 109, 186\u2013196 (2015). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378475414002456","journal-title":"Math. Comput. Simul."},{"issue":"5","key":"27_CR16","first-page":"724","volume":"5","author":"J Peng","year":"2013","unstructured":"Peng, J.: Average path length for sierpinski pentagon. Int. J. Adv. Comput. Technol. 5(5), 724\u2013732 (2013). http:\/\/search.proquest.com.mutex.gmu.edu\/docview\/1400499426?accountid=14541","journal-title":"Int. J. Adv. Comput. Technol."},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"017102","DOI":"10.1103\/PhysRevE.77.017102","volume":"77","author":"Z Zhang","year":"2008","unstructured":"Zhang, Z., Chen, L., Zhou, S., Fang, L., Guan, J., Zou, T.: Analytical solution of average path length for apollonian networks. Phys. Rev. E 77, 017102 (2008). http:\/\/link.aps.org\/doi\/10.1103\/PhysRevE.77.017102","journal-title":"Phys. Rev. E"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"056110","DOI":"10.1103\/PhysRevE.70.056110","volume":"70","author":"A Fronczak","year":"2004","unstructured":"Fronczak, A., Fronczak, P., Ho\u0142yst, J.A.: Average path length in random networks. Phys. Rev. E 70, 056110 (2004). http:\/\/link.aps.org\/doi\/10.1103\/PhysRevE.70.056110","journal-title":"Phys. Rev. E"},{"doi-asserted-by":"crossref","unstructured":"Mao, G., Zhang, N.: Analysis of average shortest-path length ofscale-free network. Int. J. Appl. Math. (2013)","key":"27_CR19","DOI":"10.1155\/2013\/865643"},{"issue":"9","key":"27_CR20","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1109\/TC.2005.137","volume":"54","author":"J Butler","year":"2005","unstructured":"Butler, J., Sasao, T., Matsuura, M.: Average path length of binarydecision diagrams. IEEE Trans. Comput. 54(9), 1041\u20131053 (2005)","journal-title":"IEEE Trans. Comput."},{"unstructured":"Kleinrock, L., Silvester, J.: Optimum transmission radii for packet radio networks or why six is a magic number. In: Proceedings of the IEEE National Telecommunications Conference, vol. 4 (1978)","key":"27_CR21"},{"issue":"2","key":"27_CR22","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1016\/j.jmaa.2015.10.001","volume":"434","author":"F Gao","year":"2016","unstructured":"Gao, F., Le, A., Xi, L., Yin, S.: Asymptotic formula on average path length of fractal networks modeled on sierpinski gasket. J. Math. Anal. Appl. 434(2), 1581\u20131596 (2016). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022247X15009312","journal-title":"J. Math. Anal. Appl."},{"key":"27_CR23","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. McGraw-Hill Higher Education, New York (2001)","edition":"2"},{"key":"27_CR24","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."}],"container-title":["Lecture Notes in Computer Science","Wired\/Wireless Internet Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33936-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T22:04:55Z","timestamp":1748901895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33936-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319339351","9783319339368"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33936-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"28 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}