Data Gathering by Mobile Mules in a Spatially Separated Wireless Sensor Network
檔案
本條目沒有附加檔案。
日期
2009
類型
系所
期刊名稱
MDM: 2009 10TH INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT
卷期與頁次
頁 293–298
ISBN
978-1-4244-4153-2
語言
英文
摘要
While wireless sensor networks (WSNs) are typically targeted at large-scale deployment, due to many practical or inevitable reasons, a WSN may not always remain connected. In this paper we consider the possibility that a WSN may be spatially separated into multiple subnetworks. Data gathering, which is a fundamental mission of WSN, thus may rely on a mobile mule ("mule" for short) to conduct data gathering by visiting each subnetwork. This leads to the problem of minimizing the path length traversed by the mobile mule. We show that minimizing the path length, which may reflect the data gathering latency and the energy consumption of the mule is a generalization of the traveling salesman problem and is NP-complete. Some heuristics based on geometrical properties of node deployment are proposed. Our simulation results show that these heuristics perform very close to optimal solutions in most practical cases.
關鍵詞
computer geometrycommunication holesdata gatheringmobile muletraveling salesman problem (TSP)wireless sensor networks所屬典藏
會議論文引用此條目
Wu, F.-J., Huang, C.-F., & Tseng, Y.-C. (2009). Data Gathering by Mobile Mules in a Spatially Separated Wireless Sensor Network. MDM: 2009 10TH INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT, 293–298. https://ir.lib.nycu.edu.tw/handle/11536/14178
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/14178