.png){kind=icon}
.png){kind=icon}
Return
Time Synchronized Node Localization Using Optimal H-Node Allocation in a Small World WSN
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2020.3008086.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Time synchronization and node localization over a wireless sensor network (WSN) is a vital problem in applications such as Internet of Things (IoT) and context-aware pervasive systems. Addressing this problem leads to an efficient data fusion, power scheduling, bandwidth utilization, geographic routing, time-based channel sharing, and clustering among sensor nodes. In a WSN, sensor nodes utilize multi-hop data transmission model towards the data transfer. Utilization of large number of hops for the data transfer leads to poor time synchronization resulting in erroneous node location estimates. In this letter, we make use of a recent development in social networks termed as small world characteristics and propose a novel method of time synchronized node localization over a small world WSN (SW-WSN). The results are obtained via simulations over a medium scale WSN. The performance of the proposed method is evaluated by conducting detailed analysis of time synchronization and node localization errors over the SW-WSN. The results obtained illustrate that the proposed small world model yields improved localization results when compared to results obtained over a regular WSN.
Keywords:
Wireless sensor networks
Synchronization
Data transfer
Clocks
Resource management
Internet of Things
Small world wireless sensor networks (SW-WSNs)
time synchronization
node localization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
View more organizations