DV-Hop Localization With Protocol Sequence Based Access

Gui, Linqing; Huang, Xinyu; Fu, Xiao; Zhang, Yijin; Shu, Feng; Wei, Jun; Val, Thierry

doi:10.1109/tvt.2018.2864270

Cited by 16 publications

(4 citation statements)

References 34 publications

(51 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each node sends data according to the assigned protocol sequence, ensuring that the data is successfully transmitted within a fixed delay and providing good stability for short-term communication performance. Up to now, there have been a lot of constructions of protocol sequence, such as Chinese Remainder Theorem(CRT) sequence, prime sequence, extended prime sequence [23][24][25][26], etc. Conflict-avoiding code is used to ensure that each node can successfully send data at least once within a sequence cycle under time slot synchronization [?, 27,28].…”

Section: Access In Data Linkmentioning

confidence: 99%

A Construction of Control Sequences Set for Access Control in Data Link

Tan

Niu

et al. 2022

2022 10th International Workshop on Signal Design and Its Applications in Communications (IWSDA)

View full text Add to dashboard Cite

Time slots are a valuable channel resource in the data link network with time division multiple access architecture. The need for finding a secure and efficient way to meet the requirements of large access capacity, differentiated access, maximum utilization of time slot resource and strong anti-eavesdropping ability in data link networks is well motivated. In this paper, a control sequence-based hierarchical access control scheme is proposed, which not only achieves differentiated time slots allocation for the different needs and levels of nodes, but also enhances randomness and anti-interception performance in data link networks. Based on the scheme, a new theoretical bound is derived to characterize parameter relationships for designing optimal hierarchical control sequence(HCS) set. Moreover, two flexible classes of optimal hierarchical control sequence sets are constructed. By our construction, the terminal user in the data link can access hierarchically and randomly and transmit data packets during its own hopping time slots of the successive frames to prevent eavesdropping while maintaining high throughput.

show abstract

Section: Access In Data Linkmentioning

confidence: 99%

A Construction of Control Sequences Set for Access Control in Data Link

Tan

Niu

et al. 2022

2022 10th International Workshop on Signal Design and Its Applications in Communications (IWSDA)

View full text Add to dashboard Cite

show abstract

“…In addition, the main idea is that the unknown node is first located will be considered an anchor node and then locate other unknown nodes. To combat the conflict problem of the packet transmission process, Gui et al proposed a medium access control method, which is based on Chinese Remainder Theorem (CRT) protocol sequence. Phoemphon et al reduced positioning errors by reducing anchor nodes and narrowing coverage to specific areas, and solving them using particle swarm optimization (PSO) algorithms.…”

Section: Related Workmentioning

confidence: 99%

A Gaussian error correction multi‐objective positioning model with NSGA‐II

Wang

Huang

Cui

et al. 2019

Concurrency and Computation

167

140

View full text Add to dashboard Cite

Distance vector-hop (DVHop), as a range-independent positioning algorithm, is a significant positioning method in wireless sensor networks (WSNs). It is composed of three parts, including connectivity detection, distance estimation, and position estimation. However, this simple positioning method results in a larger positioning error. Therefore, to enhance the positioning precision, this paper investigates the characteristic of error distribution between the estimated and real distance in the DVHop algorithm and reveals that the error is subjecting to the Gaussian distribution, N∼(0,1/3CR). Furthermore, to improve positioning accuracy, we propose a Gaussian error correction multi-objective positioning model with non-dominated sorting (NSGA-II), which named GGAII-DVHop. Finally, this model is tested on three complex network topologies, and the results demonstrate that it is significantly superior to other four algorithms in both positioning precision and robustness. KEYWORDSGaussian error correction, GGAII-DVHop, multi-objective DVHop model, wireless sensor networks INTRODUCTIONRecently, the smaller and smarter sensors are deployed in WSNs 1-3 with the micro electromechanical systems technologies advanced. These seemingly tiny nodes are made up of devices such as memory, transceivers, power supplies, etc, which constitute inexpensive, independent, and low-powered WSNs. In addition, WSNs are widely applied to industry, 4 medical treatment, home care, machine learning, and so on. However, their communication radius (CR) is limited due to their low power consumption, which determines the nodes that communicate with each other by transmitting packets, that is multi-hop routing. The Internet of Things (IoT) 5-7 is composed of many such small and relatively independent WSNs.In these applications, the location of the sensor nodes is an unavoidable topic because many of the data will be meaningless without location information. For this reason, various localization algorithms were designed to sharpen the positioning accuracy of nodes, including the range-dependent and range-independent localization algorithms. Among them, the received signal strength indicator (RSSI), 8 time of arrival (TOA), 9 and Ad hoc positioning system (APS) 10 are typically range-dependent positioning algorithms; the distance vector hop (DVHop), 11 convex position estimation (CPE), 12 and multi-dimensional scaling (MDS) 13 are representatives of range-independent localization algorithms, such as Figure 1. Because of the limitation of the computer hardware and overall cost, the range-independent localization algorithms 14,15 are more popular with researchers.The DVHop is widely used due to its simple operation and low hardware requirements. It uses the multi-hop routing between sensor nodes, and the average distance of per hop between each anchor node to locate. The positioning process of DVHop can be divided into three parts, including connectivity detection, distance estimation, and position estimation. However, this simple positioning principle us...

show abstract

“…A cross-layer distributed cooperative MAC has been identified where the best cooperative nodes are selected on the basis of residual energy and location information [67]. A new medium access control (MAC) for the DV-HOP localization algorithm has been proposed using the Chinese remainder theorem (CRT) protocol sequence to improve the packet transmission success rate [68].…”

Section: Present State Of Research and Research Gapsmentioning

confidence: 99%

Energy Efficient Range-Free Localization Algorithm for Wireless Sensor Networks

Goyat

Kumar

et al. 2019

Sensors

View full text Add to dashboard Cite

In this paper, an energy-efficient localization algorithm is proposed for precise localization in wireless sensor networks (WSNs) and the process is accomplished in three steps. Firstly, the beacon nodes discover their one-hop neighbor nodes with additional tone requests and reply packets over the media access control (MAC) layer to avoid collision of packets. Secondly, the discovered one-hop unknown nodes are divided into two sets, i.e. unknown nodes with direct communication, and with indirect communication for energy efficiency. In direct communication, source beacon nodes forward the information directly to the unknown nodes, but a common beacon node is selected for communication which reduces overall energy consumption during transmission in indirect communication. Finally, a correction factor is also introduced, and localized unknown nodes are upgraded into helper nodes for reducing the localization error. To analyze the efficiency and effectiveness of the proposed algorithm, various simulations are conducted and compared with the existing algorithms.

show abstract

DV-Hop Localization With Protocol Sequence Based Access

Cited by 16 publications

References 34 publications

A Construction of Control Sequences Set for Access Control in Data Link

A Construction of Control Sequences Set for Access Control in Data Link

A Gaussian error correction multi‐objective positioning model with NSGA‐II

Energy Efficient Range-Free Localization Algorithm for Wireless Sensor Networks

Contact Info

Product

Resources

About