{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:07:41Z","timestamp":1761581261760,"version":"build-2065373602"},"reference-count":32,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2014,12,17]],"date-time":"2014-12-17T00:00:00Z","timestamp":1418774400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>In this paper, we study mobile element (ME)-based data-gathering schemes in wireless sensor networks. Due to the physical speed limits of mobile elements, the existing data-gathering schemes that usemobile elements can suffer from high data-gathering latency. In order to address this problem, this paper proposes a new hierarchical and cooperative data-gathering (HiCoDG) scheme that enables multiple mobile elements to cooperate with each other to collect and relay data. In HiCoDG, two types of mobile elements are used: the mobile collector (MC) and the mobile relay (MR). MCs collect data from sensors and forward them to the MR, which will deliver them to the sink. In this work, we also formulated an integer linear programming (ILP) optimization problem to find the optimal trajectories for MCs and the MR, such that the traveling distance of MEs is minimized. Two variants of HiCoDG, intermediate station (IS)-based and cooperative movement scheduling (CMS)-based, are proposed to facilitate cooperative data forwarding from MCs to theMR. An analytical model for estimating the average data-gathering latency in HiCoDG was also designed. Simulations were performed to compare the performance of the IS and CMS variants, as well as a multiple traveling salesman problem (mTSP)-based approach. The simulation results show that HiCoDG outperformsmTSP in terms of latency. The results also show that CMS can achieve the lowest latency with low energy consumption.<\/jats:p>","DOI":"10.3390\/s141224278","type":"journal-article","created":{"date-parts":[[2014,12,17]],"date-time":"2014-12-17T10:19:28Z","timestamp":1418811568000},"page":"24278-24304","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["HiCoDG: A Hierarchical Data-Gathering Scheme Using Cooperative Multiple Mobile Elements"],"prefix":"10.3390","volume":"14","author":[{"given":"Duc","family":"Van Le","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Ulsan, Ulsan 680-749, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoon","family":"Oh","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Ulsan, Ulsan 680-749, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seokhoon","family":"Yoon","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Ulsan, Ulsan 680-749, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2014,12,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2292","DOI":"10.1016\/j.comnet.2008.04.002","article-title":"Wireless Sensor Network Survey","volume":"52","author":"Yick","year":"2008","journal-title":"Comput. Netw."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/TPDS.2007.70770","article-title":"Avoiding Energy Holes in Wireless Sensor Networks with Nonuniform Node Distribution","volume":"19","author":"Wu","year":"2008","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_3","first-page":"7:1","article-title":"Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey","volume":"8","author":"Das","year":"2011","journal-title":"ACM Trans. Sens. Netw."},{"key":"ref_4","unstructured":"Le, D.V., Oh, H., and Yoon, S. (2014, January 8\u201311). A Novel Hierarchical Cooperative Data Gathering Architecture Using Multiple Mobile Elements. Shanghai, China."},{"key":"ref_5","unstructured":"Wang, Z., Basagni, S., Melachrinoudis, E., and Petrioli, C. (2005, January 3\u20136). Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime. Big Island, HI, USA."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1476","DOI":"10.1109\/TPDS.2007.1070","article-title":"SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks","volume":"18","author":"Ma","year":"2007","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1252","DOI":"10.1109\/TKDE.2007.1062","article-title":"On the Optimal Robot Routing Problem in Wireless Sensor Networks","volume":"19","author":"Yuan","year":"2007","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_8","unstructured":"Gu, Y., Bozdag, D., Ekici, E., Ozguner, F., and Lee, C.G. (2005, January 26\u201329). Partitioning Based Mobile Element Scheduling in Wireless Sensor Networks. Santa Clara, CA, USA."},{"key":"ref_9","unstructured":"Somasundara, A.A., Ramamoorthy, A., and Srivastava, M.B. (2004, January 5\u20138). Mobile Element Scheduling for Efficient Data Collection in Wireless Sensor Networks with Dynamic Deadlines. Lisbon, Portugal."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Guo, S., Wang, C., and Yang, Y. (2013, January 14\u201319). Mobile Data Gathering with Wireless Energy Replenishment in Rechargeable Sensor Networks. Turin, Italy.","DOI":"10.1109\/INFCOM.2013.6566993"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s11276-012-0466-8","article-title":"On Reducing Delay in Mobile Data Collection Based Wireless Sensor Networks","volume":"19","author":"Kumar","year":"2013","journal-title":"Wirel. Netw."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1109\/TMC.2009.113","article-title":"Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks","volume":"9","author":"Sugihara","year":"2010","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TMC.2010.193","article-title":"Efficient Data Collection in Wireless Sensor Networks with Path-Constrained Mobile Sinks","volume":"10","author":"Gao","year":"2011","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.2010.140","article-title":"Efficient Data Gathering with Mobile Collectors and Space-Division Multiple Access Technique in Wireless Sensor Networks","volume":"60","author":"Zhao","year":"2011","journal-title":"IEEE Trans. Comput."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/11502593_20","article-title":"Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks","volume":"3560","author":"Jea","year":"2005","journal-title":"Distributed Computing in Sensor Systems"},{"key":"ref_16","unstructured":"Kim, D., Abay, B., Uma, R.N., Wu, W., Wang, W., and Tokuta, A. (2012, January 25\u201330). Minimizing Data Collection Latency in Wireless Sensor Network with Multiple Mobile Elements. Orlando, FL, USA."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Gu, Z., Hua, Q.S., Wang, Y., and Lau, F. (2013, January 14\u201319). Reducing Information Gathering Latency Through Mobile Aerial Sensor Network. Turin, Italy.","DOI":"10.1109\/INFCOM.2013.6566851"},{"key":"ref_18","unstructured":"He, L., Pan, J., and Xu, J. (2011, January 5\u20139). Analysis on Data Collection with Multiple Mobile Elements in Wireless Sensor Networks. Houston, TX, USA."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"He, L., Pan, J., and Xu, J. (2011, January 10\u201315). Reducing Data Collection Latency in Wireless Sensor Networks with Mobile Elements. Shanghai, China.","DOI":"10.1109\/icc.2011.5962796"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1308","DOI":"10.1109\/TMC.2012.105","article-title":"A Progressive Approach to Reducing Data Collection Latency in Wireless Sensor Networks with Mobile Elements","volume":"12","author":"He","year":"2013","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Aslanyan, H., Leone, P., and Rolim, J. (2010, January 20\u201322). Data Propagation with Guaranteed Delivery for Mobile Networks. Naples, Italy.","DOI":"10.1007\/978-3-642-13193-6_33"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Cai, C., Yang, C., Zhu, Q., and Liang, Y. (2007, January 5\u20138). Collision Avoidance in Multi-Robot Systems. Harbin, China.","DOI":"10.1109\/ICMA.2007.4304002"},{"key":"ref_23","unstructured":"Hennes, D., Claes, D., Meeussen, W., and Tuyls, K. (2012, January 4\u20138). Multi-robot Collision Avoidance with Localization Uncertainty. Valencia, Spain."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1109\/LCOMM.2012.031912.112484","article-title":"Degree-Based Clustering Algorithms for Wireless Ad Hoc Networks Under Attack","volume":"16","author":"Tselikis","year":"2012","journal-title":"IEEE Commun. Lett."},{"key":"ref_25","unstructured":"Peng, W., and Edwards, D. (2010, January 16\u201318). K-Means Like Minimum Mean Distance Algorithm for wireless sensor networks. Chengdu, China."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1137\/S00361445023685","article-title":"Teaching Integer Programming Formulations Using The Traveling Salesman Problem","volume":"45","author":"Pataki","year":"2003","journal-title":"SIAM Rev."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1016\/j.ejor.2005.03.008","article-title":"Integer linear Programming Formulations of Multiple Salesman Problems and Its Variations","volume":"174","author":"Kara","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"ref_28","unstructured":"Kara, I., and Bektas, T. (2003, January 6\u201310). Integer Linear Programming Formulation of the Generalized Vehicle Routing Problem. Istanbul, Turkey."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","article-title":"The Euclidean Travelling Salesman Problem is NP-complete","volume":"4","author":"Papadimitriou","year":"1977","journal-title":"Theor. Comput. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"8695","DOI":"10.3390\/s130708695","article-title":"RoCoMAR: Robots' Controllable Mobility Aided Routing and Relay Architecture for Mobile Sensor Networks","volume":"13","author":"Le","year":"2013","journal-title":"Sensors"},{"key":"ref_31","unstructured":"GLPK (GNU Linear Programming Kit). Available online: https:\/\/www.gnu.org\/software\/glpk\/."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Rahimi, M., Shah, H., Sukhatme, G., Heideman, J., and Estrin, D. (2003, January 14\u201319). Studying the Feasibility of Energy Harvesting in a Mobile Sensor Network. Taipei, Taiwan.","DOI":"10.1109\/ROBOT.2003.1241567"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/14\/12\/24278\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:11:13Z","timestamp":1760217073000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/14\/12\/24278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,17]]},"references-count":32,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2014,12]]}},"alternative-id":["s141224278"],"URL":"https:\/\/doi.org\/10.3390\/s141224278","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2014,12,17]]}}}