1. |
- Chen, Yaoming, et al.
(författare)
-
Wireless E-Care Sensor Network Management
- 2008
-
Ingår i: Proceedings of The 1st Workshop on Wireless Broadband Access for Communities and Rural Developing Regions (WIRELESS4D'08, co-located with M4D 2008). - Karlstad : Karlstad University. ; , s. 164-167
-
Konferensbidrag (refereegranskat)
|
|
2. |
|
|
3. |
|
|
4. |
- Huo, Hongwei, et al.
(författare)
-
Coexistence Issues of 2.4GHz Sensor Networks at Home
- 2010
-
Ingår i: The Journal of China Universities of Posts and Telecommunications. - Beijing,China : China Universities of Posts and Telecommunication. - 1005-8885. ; 17:1, s. 9-18
-
Tidskriftsartikel (refereegranskat)
|
|
5. |
|
|
6. |
|
|
7. |
|
|
8. |
|
|
9. |
- Mubeen, Saad, et al.
(författare)
-
Smart Application Gateway for Wireless E-Care Systems
- 2008
-
Ingår i: Proceedings of The 1st Workshop on Wireless Broadband Access for Communities and Rural Developing Regions (WIRELESS4D'08, co-locaded with M4D 2008). - Karlstad : Karlstad University. ; , s. 112-118
-
Konferensbidrag (refereegranskat)
|
|
10. |
- Nazir, Mian Hammad, 1985-, et al.
(författare)
-
Optimal Dynamic Frame-Slotted Aloha : (ODFSA)
- 2011
-
Ingår i: Optimal Dynamic Frame Slotted Aloha, Proceedings of the 7th International Conference on Wireless Communications Networking and Mobile Computing, Wuhan China, Sep 23, 2011 - Sep 25, 2011. - IEEE : IEEE. ; , s. 1-4
-
Konferensbidrag (refereegranskat)abstract
- Passive UHF RFID systems using Dynamic Frame-Slotted ALOHA (DFSA) adjust the frame size according to the number of tags, but frame size N is equals to 2^Q and cannot be adjusted exactly to the number of tags to be identified. In this paper, we propose an optimal Aloha algorithm (ODFSA), which uses probabilistic approach for tags to access the frame. The Query or Query Adjust packet contains both the parameter Q and P called frame access probability, which represents the ratio of number of active tags in the current frame to the estimated total number of tags which remain to be identified in the system. Estimation of number of unread tags is updated after end of each frame; parameters Q and P are calculated and informed at the beginning of each frame. Mathematical analysis and computer simulations show that the proposed Aloha achieves maximum system efficiency, utilizes less number of slots compared with other algorithms and also takes less identification time.
|
|