基于时隙ALOHA的标签识别机制-8 Problem Formulation -The reader is essential to issue a number of query rounds to finish identifying all tags.Suppose in a certain query round l,the frame size is f,the number of remaining tags is t,the objective is how to set a frame size f for each query round,such that the overall scanning time T(or: overall number of slots)is minimized while finishing reading all tags. overall scanning time T Minimized! query round I Query Query Query f=? Rep Rep t tags
基于时隙ALOHA的标签识别机制-8 • Problem Formulation – The reader is essential to issue a number of query rounds to finish identifying all tags. Suppose in a certain query round l, the frame size is f, the number of remaining tags is t, the objective is how to set a frame size f for each query round, such that the overall scanning time T (or: overall number of slots) is minimized while finishing reading all tags. Query �=? Query Rep Query Rep …… overall scanning time T Minimized! query round l …… t tags
基于时隙ALOHA的标签识别机制-9 ◆Solution: Modeling Compute the optimal frame size overall scanning time T Minimized! query round I Query Query Query f=? Rep Rep t tags 原0原0重
基于时隙ALOHA的标签识别机制-9 • Solution: – Modeling – Compute the optimal frame size Query �=? Query Rep Query Rep …… overall scanning time T Minimized! query round l …… t tags