In this thesis, we visit the reader-coverage collision avoidance deployment problem with adjusted interrogation ranges in radio frequency identification networks. We propose a deterministic approach to deploy readers. First, we divide the target field into grids and use the interlaced position of the point as the position where the reader can be deployed later. Next, calculate the weight of the tags covered by each position, and we will choose the position with the highest weight value to deploy the reader. The above deployment of the reader will be repeated until all tags are covered by the readers. At the same time, we adjust the reading range of the reader to an appropriate range by the ability of the reader to adjust the range. In this way, the reader can cover the tags more efficiently in the problem of no reader interference.
為了持續優化網站功能與使用者體驗,本網站將Cookies分析技術用於網站營運、分析和個人化服務之目的。
若您繼續瀏覽本網站,即表示您同意本網站使用Cookies。