Name
Title | ||
|---|---|---|
OCSID: Orthogonal Accessing Control Without Spectrum Spreading for Massive RFID Network |
Abstract | ||
|---|---|---|
In radio-frequency identification (RFID)-based sensors networks, each sensor is integrated with a tag and sensors may co-exist in an area of interest. Before sending data packets, the sensors send their IDs for channel reservations. However, ID collisions happen frequently at the reservation stage which leads to significant time delays, especially for massive and dense networks. In this article, by employing group theory, we show that for
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$B=2^{k}$ </tex-math></inline-formula>
, where
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>
is a positive integer, the set
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\{-1,+1\}^{B}$ </tex-math></inline-formula>
and the Hadamard product
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\circ $ </tex-math></inline-formula>
forms a group
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\{\{-1,+1\}^{B}, \circ \}$ </tex-math></inline-formula>
that can be divided into
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(2^{B}/B)$ </tex-math></inline-formula>
disjoint subsets, each of which has
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$B$ </tex-math></inline-formula>
binary vectors that are mutually orthogonal. Based on this finding, we propose orthogonal coset identification (OCSID) and its generalization, query tree (QT)-OCSID, that can recover ID information from collisions, and thus considerably improve the efficiency at the reservation stage, particularly when the network is large and/or dense. In an ideal case, it can recover/decode
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$B$ </tex-math></inline-formula>
tags for each query. The fundamental difference between the proposed OCSID schemes and code-division multiple access-based schemes is that, OCSID achieves orthogonal design for ID information recovery by exploiting the inherent orthogonal structure of the binary vector set, instead of spreading the spectrum. Hence, it requires a narrower frequency band, lower circuit complexity, and lower synchronization precision, which are much more preferred by hardware limited devices. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/JIOT.2020.3027204 | IEEE Internet of Things Journal |
Keywords | DocType | Volume |
Code-division multiple access (CDMA),cosets,group theory,massive network,orthogonal accessing control,query tree (QT) | Journal | 8 |
Issue | ISSN | Citations |
6 | 2327-4662 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongbo Guo | 1 | 15 | 5.02 |
| Chen He | 2 | 2 | 1.70 |
| Luyang Han | 3 | 0 | 1.35 |
| Nan Chen | 4 | 0 | 0.34 |
| Z. Jane Wang | 5 | 406 | 55.43 |