|
Abstract
|
Article Information:
An Improved Query Tree Anti-Collision Algorithm Using Collision Location
Keli Chen and Bing Li
Corresponding Author: Keli Chen
Submitted: July 27, 2012
Accepted: September 12, 2012
Published: March 15, 2013 |
Abstract:
|
In order to reduce the identification delay and the energy consumption of the Query Tree Anti-collision Algorithm, the disadvantage of the current query tree anti-collision algorithms is analyzed and an improved query tree anti-collision algorithm is proposed, which is called collision Location based Hybrid Query Tree (LHQT) algorithm. In the algorithm, Manchester code is used and collision location is detected when a collision occurs. Then collision location is used to update quickly and accurately the query prefix in Query Tree (QT) algorithm and Hybrid Query Tree (HQT) Algorithm. Theoretical analysis and simulation show that the proposed algorithm can efficiently decrease the identification cycles and transmitted bits, which reduce the identification delay and the energy consumption.
Key words: Anti-collision algorithm, collision location, query tree, , , ,
|
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
Keli Chen and Bing Li, . An Improved Query Tree Anti-Collision Algorithm Using Collision Location. Research Journal of Applied Sciences, Engineering and Technology, (08): 2494-2498.
|
|
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
