{"title":"A new tree target tracking algorithm in WSNs","authors":"A. Odeh, Eman Abdelfattah","doi":"10.1109/UEMCON.2017.8249006","DOIUrl":null,"url":null,"abstract":"Wireless sensor networks are becoming increasingly the essential part of the digital world. Target tracking system is a significant part of wireless sensor networks. It has its own advantages and challenges. In this paper, a new Tree-Based target-tracking algorithm is proposed, by employing the minimum traffic rate to reduce the time and energy consumption. The proposed algorithm consists of four phases that create a tree structure from undirected and connected graph. It reduces the communication cost, overcomes message-flooding problem, maximizes the life time for each node to maximize the overall life time of the network.","PeriodicalId":403890,"journal":{"name":"2017 IEEE 8th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 8th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UEMCON.2017.8249006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Wireless sensor networks are becoming increasingly the essential part of the digital world. Target tracking system is a significant part of wireless sensor networks. It has its own advantages and challenges. In this paper, a new Tree-Based target-tracking algorithm is proposed, by employing the minimum traffic rate to reduce the time and energy consumption. The proposed algorithm consists of four phases that create a tree structure from undirected and connected graph. It reduces the communication cost, overcomes message-flooding problem, maximizes the life time for each node to maximize the overall life time of the network.