Jianxiong Wen, Lianghui Ding, Feng Yang, Liang Qian, Chuan Sun
{"title":"改进的水声网络多跳时间同步","authors":"Jianxiong Wen, Lianghui Ding, Feng Yang, Liang Qian, Chuan Sun","doi":"10.1109/WCSP.2013.6677184","DOIUrl":null,"url":null,"abstract":"Time synchronization is important for many distributed applications in Underwater Acoustic Networks (UANs) with large propagation delay, such as precise scheduling, target tracking and energy conservation. In this paper, we prove that the accuracy of time skew estimation increases as the number of overheard packet exchange from other neighboring nodes increases, and propose a light-weighted synchronization algorithm for multi-hop UANS, named as Improved Multi-hop time Synchronization for Underwater Acoustic Networks(IMSUAN). IMSUAN consists of three parts. The first one is to establish a time synchronization tree with the reference node as the root, and assign each node a tree level as low as possible. The second one is to synchronize with the parent node by dedicated three-time handshake and overhear exchange packets from parent and neighboring nodes. The third is to filter the inaccurate time-stamps of the overheard synchronization packets. In the paper, we establish a simulation platform in OPNET to evaluate the performance of IMSUAN. Simulation results show that the performance of extended Tri-message, MSUAN and IMSUAN are the same when no overhearing exists. However, when overhearing is possible in a random topology, the performance of IMSUAN can be 60% better than extended Tri-Message and 40% better than MSUAN.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Improved multi-hop time synchronization for Underwater Acoustic Networks\",\"authors\":\"Jianxiong Wen, Lianghui Ding, Feng Yang, Liang Qian, Chuan Sun\",\"doi\":\"10.1109/WCSP.2013.6677184\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Time synchronization is important for many distributed applications in Underwater Acoustic Networks (UANs) with large propagation delay, such as precise scheduling, target tracking and energy conservation. In this paper, we prove that the accuracy of time skew estimation increases as the number of overheard packet exchange from other neighboring nodes increases, and propose a light-weighted synchronization algorithm for multi-hop UANS, named as Improved Multi-hop time Synchronization for Underwater Acoustic Networks(IMSUAN). IMSUAN consists of three parts. The first one is to establish a time synchronization tree with the reference node as the root, and assign each node a tree level as low as possible. The second one is to synchronize with the parent node by dedicated three-time handshake and overhear exchange packets from parent and neighboring nodes. The third is to filter the inaccurate time-stamps of the overheard synchronization packets. In the paper, we establish a simulation platform in OPNET to evaluate the performance of IMSUAN. Simulation results show that the performance of extended Tri-message, MSUAN and IMSUAN are the same when no overhearing exists. However, when overhearing is possible in a random topology, the performance of IMSUAN can be 60% better than extended Tri-Message and 40% better than MSUAN.\",\"PeriodicalId\":342639,\"journal\":{\"name\":\"2013 International Conference on Wireless Communications and Signal Processing\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Wireless Communications and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCSP.2013.6677184\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Wireless Communications and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2013.6677184","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improved multi-hop time synchronization for Underwater Acoustic Networks
Time synchronization is important for many distributed applications in Underwater Acoustic Networks (UANs) with large propagation delay, such as precise scheduling, target tracking and energy conservation. In this paper, we prove that the accuracy of time skew estimation increases as the number of overheard packet exchange from other neighboring nodes increases, and propose a light-weighted synchronization algorithm for multi-hop UANS, named as Improved Multi-hop time Synchronization for Underwater Acoustic Networks(IMSUAN). IMSUAN consists of three parts. The first one is to establish a time synchronization tree with the reference node as the root, and assign each node a tree level as low as possible. The second one is to synchronize with the parent node by dedicated three-time handshake and overhear exchange packets from parent and neighboring nodes. The third is to filter the inaccurate time-stamps of the overheard synchronization packets. In the paper, we establish a simulation platform in OPNET to evaluate the performance of IMSUAN. Simulation results show that the performance of extended Tri-message, MSUAN and IMSUAN are the same when no overhearing exists. However, when overhearing is possible in a random topology, the performance of IMSUAN can be 60% better than extended Tri-Message and 40% better than MSUAN.