A Signal Separation Method for Physical Wireless Parameter Conversion Sensor Networks Using K-Shortest Path

被引:0
|
作者
Yamasaki, Shuhei [1 ]
Oriuchi, Minato [1 ]
Takyu, Osamu [1 ]
Shirai, Keiichiro [1 ]
Fujii, Takeo [2 ]
Ohta, Mai [3 ]
Sasamori, Fumihito [1 ]
Handa, Shiro [1 ]
机构
[1] Shinshu Univ, Nagano, Japan
[2] Northwestern Univ Electrocomuns, Tokyo, Japan
[3] Northwestern Fukuoka Univ, Fukuoka, Fukuoka, Japan
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Addressing low delay and high traffic performance is a technique necessary for wireless sensor networks (WSN). Although physical wireless parameter conversion sensor networks (PhyC-SN) achieve simultaneous information gathering from multiple sensors, separating the gathered mixed sensing results becomes a difficult problem. The proposed method utilizes an approach used in multi target tracking (MTT) in order to separate the mixed data points into a set of sequential ones. Particularly, we regard the data separation problem as path planning problems. In short, we consider paths by connecting data points observed at the adjacent time, and find a set of continuous paths consisting of data points of the same sensor. Following the problem, the same number of paths as sensors are obtained, so all sensing results can be correctly discriminated and labeled over all times in WSN. Therefore, we focus on a k-shortest pass method of MTT. In this paper, we show the accuracy of signal separation through simulation experiments and evaluate it in terms of the precision rate quantitatively.
引用
收藏
页码:165 / 170
页数:6
相关论文
共 50 条
  • [1] Efficient Multi-hop Broadcasting in Wireless Networks Using k-Shortest Path Pruning
    Rieck, Michael Q.
    Dhar, Subhankar
    [J]. DISTRIBUTED COMPUTING AND NETWORKING, PROCEEDINGS, 2010, 5935 : 283 - +
  • [2] COMPUTING K-SHORTEST PATH LENGTHS IN EUCLIDEAN NETWORKS
    SKISCIM, CC
    GOLDEN, BL
    [J]. NETWORKS, 1987, 17 (03) : 341 - 352
  • [3] Adaptations of k-Shortest Path Algorithms for Transportation Networks
    Scano, Gregoire
    Huguet, Marie-Jose
    Ngueveu, Sandra Ulrich
    [J]. 2015 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM), 2015, : 663 - 669
  • [4] K-Shortest Path Algorithm for Overlay Protection in Optical Networks
    Wang, Xi
    Zhang, Qiong
    Palacharla, Paparao
    Naito, Takao
    [J]. 2009 14TH OPTOELECTRONICS AND COMMUNICATIONS CONFERENCE (OECC 2009), 2009, : 60 - 61
  • [6] Virtual network construction with K-shortest path algorithm and optimization problems for robust physical networks
    Urayama, Yasuhiro
    Tachibana, Takuji
    [J]. INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2017, 30 (01)
  • [7] Implementation of K-shortest path algorithm in GPU using CUDA
    AvadheshPratapSingh
    DhirendraPratapSingh
    [J]. INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATION AND CONVERGENCE (ICCC 2015), 2015, 48 : 5 - 13
  • [8] Data Separation Technique using Spatial Correlation of Sensing Results for Physical Wireless Parameter Conversion Sensor Networks
    Amano, Naoya
    Takyu, Osamu
    Shirai, Keiichiro
    Sasamori, Fumihito
    Handa, Shiro
    [J]. 2018 ASIA-PACIFIC SIGNAL AND INFORMATION PROCESSING ASSOCIATION ANNUAL SUMMIT AND CONFERENCE (APSIPA ASC), 2018, : 785 - 789
  • [9] Data Separation Considering Smoothness of Sensing Data in Physical Wireless Parameter Conversion Sensor Networks
    Yamasaki, Shuhei
    Takyu, Osamu
    Shirai, Keiichiro
    Fujii, Takeo
    Ohta, Mai
    Sasamori, Fumihito
    Handa, Shiro
    [J]. 33RD INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN 2019), 2019, : 421 - 423
  • [10] Optimal uncertainty reduction search using the k-shortest path algorithm
    Sujit, PB
    Ghose, D
    [J]. PROCEEDINGS OF THE 2003 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 2003, : 3269 - 3274