Gaussian message passing-based cooperative localization with node selection scheme in wireless networks

Cooperative localization is an emerging paradigm that circumvents the needs for high-power, high-density anchor deployment, and offers additional positioning accuracy by exchanging information between adjacent agents. Considering that positioning accuracy only need to meet the application requirements, too high positioning accuracy means that too much redundant information is exchanged.
 This paper presents a neighbors selection algorithm that tries to meet the positioning accuracy required by an application , while the system consumption is optimized. More specifically, this proposed algorithm tries to minimize the number of neighbors involved in cooperation on the basis of the equivalent Fisher information matrix. Before putting forward the algorithm, we first introduce the notion of equivalent Fisher information and characterize localization accuracy called the squared position error bound. Then we find that not only the Fisher information of neighbor nodes determines the positioning accuracy of the agent to be located, but also the direction of Fisher information affected the positioning accuracy. Based on this, an algorithm for selecting the minimum cooperative subset is proposed. Simulation results show that the proposed algorithm can obviously improving the utilization of energy compared to other commonly used methods by exchanging information with a few nodes, while achieving the specified positioning accuracy.

A Novel Method to Select Minimum Neighbors in Cooperative Localization Network

The invention provides a user position privacy protection method under the road network environment and a system thereof, and relates to mobile terminal position safety According to method, position privacy and inquiring privacy of a mobile communication terminal are considered, road segment diversity is considered in the aspect of position privacy, and sensitive inquiring privacy is protected by setting the upper limit value of probability of sensitive inquiring Voronoi graph partition is performed on a road network according to node dimension and the minimal road segment requirement of an anonymity set is formed Average information entropy and probability of sensitive inquiring are calculated, and road segments are continuously added in an anonymous box if the requirement of average information entropy and probability of sensitive inquiring is not met According to the method, two levels of security can be greatly protected for users, which is quite close to the real user privacy protection requirement The user position privacy protection method under the road network environment and the system thereof can be applied to a mobile terminal privacy protection system under the road network environment

User position privacy protection method under road network environment and system thereof

Taking advantage of precise positioning technology, location-based service (LBS) has brought a lot of convenience to people’s daily life and made the city smarter. However, the LBS applications also bring some challenges to personal location privacy protection. In order to obtain services from LBS providers, users have to upload their queries including sensitive information, such as identities and locations. This information may be leaked out by the LBS providers or even eavesdropped on by malicious adversaries, which may cause privacy leakage. To tackle this problem, many solutions have been investigated under the assumption that users are uniformly distributed. However, the users are not always uniformly distributed in real-world situations. For a side-weight inference attack, the adversary would infer that the target user is more likely to belong to the road section with more users, resulting in performance deterioration. In this paper, we investigate the issue of location privacy preservation against side-weight inference attack for non-uniform distributed road network. Meanwhile, we consider the cost function of LBS and formulate the object as a mixed integer programming problem. Then, we propose a road truncation-based scheme to protect location privacy. The road section with high user density is designed to be truncated. Finally, simulation results show that our scheme meets the demand for privacy protection at a low cost. As a result, our scheme is proven to protect users’ location privacy effectively and efficiently.

/pdf/a-road-truncation-based-location-privacy-preserving-method-55zrukle.pdf

A Road Truncation-Based Location Privacy-Preserving Method against Side-Weight Inference Attack

The invention relates to an EFI-based cooperative localization node selection method. The EFI-based cooperative localization node selection method comprises the steps that a precision threshold g of alocalization system is set according to the application requirement, and a target node acquires a neighbor node set; the target node updates an edge Fisher information matrix of the target node according to the edge Fisher information matrix of the target node and received edge Fisher information matrixes of neighbor nodes and calculates SPEBi and SPEBj; the node enabling the SPEBi and SPEBj to be minimum is selected and added into Ii, and the I node is removed from deltai; the step 2, the step 3 and the step 4 are repeated according to the updated edge Fisher information matrix of the targetnode until the localization precision of the node is lower than or equal to g; and the location of the node is calculated with nodes in I.

EFI-based cooperative localization node selection method

Traditional positioning needs lots of measurements between the target and anchors. However, this requirement is faced with significant challenge in the most practical scenarios. The cooperation between mobile nodes is an effective solution. In order to avoid large computational complexity, we need to cooperate with neighbors selectively. This paper proposes a novel node selection algorithm based on the Fisher information matrix. We represented cooperation information with the equivalent Fisher information matrix and then selected neighbors. Simulation results show that the proposed algorithm is able to improve positioning accuracy obviously compared with distance-based node selection algorithm.

/pdf/node-selection-algorithm-based-on-fisher-information-n5989fa0ag.pdf

Node selection algorithm based on Fisher information

With the development of mobile internet, protecting location privacy has already been an important issue. Based on previous studies and the drawback of traditional algorithms, the paper proposes a novel algorithm for protecting location privacy. The algorithm is based on the voronoi map of a road network, considers the problem of side-weight inference, and utilizes the information entropy as metrics. Meanwhile, the algorithm can defense the attack of side-weight inference and replay. Lastly, we verified the algorithm based on the real data of the road network. Results of experiences show that the improved algorithm has the better performance on some key performance metrics.

/pdf/the-research-for-protecting-location-privacy-based-on-v-w-1zul6jzesn.pdf

The research for protecting location privacy based on V-W algorithm

In impulse radio ultra wideband (IR-UWB) dense multipath environment, the time of arrival (TOA) based on energy detection (ED) estimation algorithms are usually used as the ranging methods, in which the signal’s first path (FP) detection is very challenging. In ED receiver, threshold-crossing (TC) algorithms are used frequently. The choice of threshold becomes a key part of TC algorithms, or else the false detection probability will be high. The paper sets the threshold according to the skewness and the maximum slope of the received signal, and then because of the fixity of the FP and the randomness of TC noise samples, detects the FP by calculating the frequencies of TC energy samples in certain frames. The performance of several approaches is compared via Monte Carlo simulations using the CM3 channel model of the standard IEEE 802.15.4a. Simulation results show that the TOA estimation algorithm in the paper outperforms others.

The Received Signal Characteristics-Based TOA Estimation in UWB Dense Multipath Channels

Localization of primary user (PU) is the key problem for location-aware spectrum allocation in cognitive radio networks (CRNs). In order to improve spectrum efficiency and reduce the interference from secondary users (SUs) to PU, localization of PU must be rapid and accurate enough. Aiming at the drawback of existing localization algorithm for PU localization, a PU localization algorithm based on node selection is proposed. The algorithm is suitable for PU localization with unknown transmit power and selects nodes based on geometric precision. The simulation results show that the proposed scheme has a good performance in terms of localization accuracy. Meanwhile, the complexity and communication traffic are reduced because of selecting part of the secondary users.

A Primary User Localization Method in Cognitive Radio Networks

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Fei Zhou

Author Tools

Chat about Author

Papers

Node selection algorithm based on Fisher information

The research for protecting location privacy based on V-W algorithm

The Received Signal Characteristics-Based TOA Estimation in UWB Dense Multipath Channels

A Primary User Localization Method in Cognitive Radio Networks