{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:53:59Z","timestamp":1753887239046,"version":"3.41.2"},"reference-count":29,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,1,21]],"date-time":"2018-01-21T00:00:00Z","timestamp":1516492800000},"content-version":"vor","delay-in-days":20,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>In modern wireless networks deployments, each serving node needs to keep its Neighbour Cell List (NCL) constantly up to date to keep track of network changes. The time needed by each serving node to update its NCL is an important parameter of the network\u2019s reliability and performance. An adequate estimate of such parameter enables a significant improvement of self\u2010configuration functionalities. This paper focuses on the update time of NCLs when an approach of crowdsourced user reports is adopted. In this setting, each user periodically reports to the serving node information about the set of nodes sensed by the user itself. We show that, by mapping the local topological structure of the network onto states of increasing knowledge, a crisp mathematical framework can be obtained, which allows in turn for the use of a variety of user mobility models. Further, using a simplified mobility model we show how to obtain useful upper bounds on the expected time for a serving node to gain Full Knowledge of its local neighbourhood.<\/jats:p>","DOI":"10.1155\/2018\/9028427","type":"journal-article","created":{"date-parts":[[2018,1,21]],"date-time":"2018-01-21T23:32:31Z","timestamp":1516577551000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Updating Neighbour Cell List via Crowdsourced User Reports: A Framework for Measuring Time Performance"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0981-3409","authenticated-orcid":false,"given":"A.","family":"Checco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Lancia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. J.","family":"Leith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.2662"},{"key":"e_1_2_10_2_2","unstructured":"Technical Specification Group Radio Access Network Home Node B (HNB) Radio Frequency (RF) requirements (FDD) 3rd Generation Partnership Project TR 25.967 2011."},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00064-2"},{"key":"e_1_2_10_4_2","doi-asserted-by":"crossref","unstructured":"KuhnF.andWattenhoferR. On the complexity of distributed graph coloring Proceeding of the twenty-fifth annual ACM symposium on Principles of distributed computing (PODC \u203206) July 2006 Denver Colo USA ACM 7\u201315 https:\/\/doi.org\/10.1145\/1146381.1146387.","DOI":"10.1145\/1146381.1146387"},{"key":"e_1_2_10_5_2","doi-asserted-by":"crossref","unstructured":"LubyM. Removing randomness in parallel computation without a processor penalty Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science October 1988 White Plains NY USA IEEE 162\u2013173 https:\/\/doi.org\/10.1109\/SFCS.1988.21934.","DOI":"10.1109\/SFCS.1988.21934"},{"key":"e_1_2_10_6_2","doi-asserted-by":"crossref","unstructured":"SzegedyM.andVishwanathanS. Locality based graph coloring Proceedings of the twenty-fifth annual ACM symposium on Theory of computing (STOC \u203293) May 1993 San Diego Calif USA ACM 201\u2013207 https:\/\/doi.org\/10.1145\/167088.167156.","DOI":"10.1145\/167088.167156"},{"key":"e_1_2_10_7_2","doi-asserted-by":"crossref","unstructured":"OlofssonH. MagnussonS. andAlmgrenM. A concept for dynamic neighbor cell list planning in a cellular system Proceeding of the Seventh IEEE International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC \u203296) Taipei Taiwan IEEE 138\u2013142 https:\/\/doi.org\/10.1109\/PIMRC.1996.567532.","DOI":"10.1109\/PIMRC.1996.567532"},{"key":"e_1_2_10_8_2","doi-asserted-by":"crossref","unstructured":"MagnussonS.andOlofssonH. Dynamic neighbor cell list planning in a microcellular network Proceedings of the ICUPC 97 - 6th International Conference on Universal Personal Communications San Diego Calif USA 223\u2013227 https:\/\/doi.org\/10.1109\/ICUPC.1997.625551.","DOI":"10.1109\/ICUPC.1997.625551"},{"key":"e_1_2_10_9_2","doi-asserted-by":"crossref","unstructured":"NguyenV. M.andClaussenH. Efficient self-optimization of neighbour cell lists in macrocellular networks Proceedings of the 21st International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC \u203210) September 2010 Instanbul Turkey 1923\u20131928 https:\/\/doi.org\/10.1109\/PIMRC.2010.5671609 2-s2.0-78751519413.","DOI":"10.1109\/PIMRC.2010.5671609"},{"key":"e_1_2_10_10_2","doi-asserted-by":"crossref","unstructured":"AmirijooM. FrengerP. GunnarssonF. KallinH. MoeJ. andZetterbergK. Neighbor cell relation list and measured cell identity management in LTE Proceedings of the NOMS 2008 - IEEE\/IFIP Network Operations and Management Symposium: Pervasive Management for Ubiquitous Networks and Services April 2008 Salvador Bahia Brazil 152\u2013159 https:\/\/doi.org\/10.1109\/NOMS.2008.4575129 2-s2.0-51849123810.","DOI":"10.1109\/NOMS.2008.4575129"},{"key":"e_1_2_10_11_2","doi-asserted-by":"crossref","unstructured":"AtawiaR. El AzabM. ElshabrawyT. andAshourM. Ranked overlapping coverage based construction of efficient neighboring cell list for GSM\/UMTS cellular networks Proceedings of the International Conference on Communications and Information Technology (ICCIT \u203212) June 2012 Hammamet Tunisia 254\u2013259 https:\/\/doi.org\/10.1109\/ICCITechnol.2012.6285802 2-s2.0-84867342389.","DOI":"10.1109\/ICCITechnol.2012.6285802"},{"key":"e_1_2_10_12_2","doi-asserted-by":"crossref","unstructured":"KimD. ShinB. HongD. andLimJ. Self-configuration of neighbor cell list utilizing E-UTRAN NodeB scanning in LTE systems Proceedings of the 7th IEEE Consumer Communications and Networking Conference (CCNC \u203210) January 2010 Las Vegas Nev USA IEEE 1\u20135 https:\/\/doi.org\/10.1109\/CCNC.2010.5421822 2-s2.0-77951287769.","DOI":"10.1109\/CCNC.2010.5421822"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1002\/bltj.20457"},{"key":"e_1_2_10_14_2","doi-asserted-by":"crossref","unstructured":"CheccoA. RazaviR. LeithD. J. andClaussenH. Self-configuration of scrambling codes for WCDMA small cell networks Proceedings of the IEEE 23rd International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC \u203212) September 2012 Sydney NSW Australia IEEE 149\u2013154 https:\/\/doi.org\/10.1109\/PIMRC.2012.6362585 2-s2.0-84871968967.","DOI":"10.1109\/PIMRC.2012.6362585"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2222923"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2013.2251604"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2751544"},{"key":"e_1_2_10_18_2","doi-asserted-by":"crossref","unstructured":"WatanabeY. MatsunagaY. KobayashiK. SugaharaH. andHamabeK. Dynamic neighbor cell list management for handover optimization in LTE Proceedings of the IEEE 73rd Vehicular Technology Conference (VTC \u203211-Spring) May 2011 Yokohama Japan IEEE 1\u20135 https:\/\/doi.org\/10.1109\/vetecs.2011.5956456 2-s2.0-80052018690.","DOI":"10.1109\/VETECS.2011.5956456"},{"key":"e_1_2_10_19_2","unstructured":"SapianoP. \u201cDiscovering neighbouring femto cells\u201d US Patent EP2 214 434 http:\/\/www.freepatentsonline.com\/EP2214434A1.html."},{"key":"e_1_2_10_20_2","doi-asserted-by":"crossref","unstructured":"EdwardsJ. Implementation of network listen modem for WCDMA femtocell Proceedings of the IET Seminar on Cognitive Radio and Software Defined Radio: Technologies and Techniques September 2008 London UK IET https:\/\/doi.org\/10.1049\/ic:20080401 2-s2.0-67649845447.","DOI":"10.1049\/ic:20080401"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2393302"},{"key":"e_1_2_10_22_2","doi-asserted-by":"crossref","unstructured":"SoldaniD.andOreI. Self-optimizing neighbor cell list for UTRA FDD networks using detected set reporting Proceedings of the IEEE 65th Vehicular Technology Conference - VTC2007-Spring April 2007 Dublin Ireland IEEE 694\u2013698 https:\/\/doi.org\/10.1109\/VETECS.2007.153 2-s2.0-34547240110.","DOI":"10.1109\/VETECS.2007.153"},{"key":"e_1_2_10_23_2","doi-asserted-by":"crossref","unstructured":"ParodiF. Kylv\u00e4j\u00e4M. AlfordG. LiJ. andPradasJ. An automatic procedure for neighbor cell list definition in cellular networks Proceedings of the IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WOWMOM \u203207) June 2007 Espoo Finland IEEE 1\u20136 https:\/\/doi.org\/10.1109\/WOWMOM.2007.4351742 2-s2.0-47749147260.","DOI":"10.1109\/WOWMOM.2007.4351742"},{"key":"e_1_2_10_24_2","doi-asserted-by":"crossref","unstructured":"HasanM. R. KawserM. T. andIslamM. R. An automatic GSM neighbor cell list update procedure enhancing SON in LTE Proceedings of the 6th International Conference on Electrical and Computer Engineering (ICECE \u203210) December 2010 Dhaka Bangladesh IEEE 143\u2013146 https:\/\/doi.org\/10.1109\/ICELCE.2010.5700647 2-s2.0-79951780199.","DOI":"10.1109\/ICELCE.2010.5700647"},{"key":"e_1_2_10_25_2","doi-asserted-by":"crossref","unstructured":"LiJ.andJ\u00e4nttiR. On the study of self-configuration neighbour cell list for mobile WiMAX Proceedings of the International Conference on Next Generation Mobile Applications Services and Technologies (NGMAST \u203207) September 2007 Cardiff UK IEEE 199\u2013204 https:\/\/doi.org\/10.1109\/NGMAST.2007.4343421 2-s2.0-47849085854.","DOI":"10.1109\/NGMAST.2007.4343421"},{"key":"e_1_2_10_26_2","doi-asserted-by":"crossref","unstructured":"BecvarZ. VondraM. andMachP. Dynamic optimization of neighbor cell list for femtocells Proceedings of the 77th Vehicular Technology Conference (VTC Spring \u203213) June 2013 Dresden Germany IEEE 1\u20136 https:\/\/doi.org\/10.1109\/VTCSpring.2013.6692526 2-s2.0-84893620893.","DOI":"10.1109\/VTCSpring.2013.6692526"},{"volume-title":"Markov chains and mixing times","year":"2009","author":"Levin D. A.","key":"e_1_2_10_27_2"},{"volume-title":"Finite Markov chains: with a new appendix \u201cGeneralization of a fundamental matrix\u201d","year":"1976","author":"Kemeny J. G.","key":"e_1_2_10_28_2"},{"key":"e_1_2_10_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/99.372944"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/9028427.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/9028427.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/9028427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:43:22Z","timestamp":1723016602000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/9028427"}},"subtitle":[],"editor":[{"given":"Stefano","family":"Savazzi","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/9028427"],"URL":"https:\/\/doi.org\/10.1155\/2018\/9028427","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2017-07-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-11-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-01-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"9028427"}}