Mobile node rostering in intermittently connected passive RFID networks

2011 IEEE International Conference on Pervasive Computing and Communications, PerCom 2011

Volumn , Issue , 2011, Pages 111-119

  Yang, Zhipeng ^a   Wu, Hongyi ^a  

^a University of Louisiana at Lafayette   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODING SCHEME; COMPUTATION POWER; CONTINUOUS FUNCTIONS; INFORMATION REDUNDANCIES; KNAPSACK MODEL; LARGE SCALE SIMULATIONS; MOBILE NODES; NETWORK RESOURCE; PASSIVE RFID; RESOURCE-CONSTRAINED; ROSTERING; SHORT-INTERVAL; TIME INTERVAL;

COMMUNICATION; CRYPTOGRAPHY; INTERNET PROTOCOLS; RADIO FREQUENCY IDENTIFICATION (RFID); REDUNDANCY; UBIQUITOUS COMPUTING;

PASSIVE NETWORKS;

EID: 79957956367     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PERCOM.2011.5767575     Document Type: Conference Paper

References (11)

1. V. Dyo, S. A. Ellwood, D. W. Macdonald, A. Markham, C. Mascolo, B. Pasztor, S. Scellato, N. Trigoni, R. Wohlers, and K. Yousef, "Evolution and Sustainability of a Wildlife Monitoring Sensor Network," in Proc. of ACM Sensys, 2010.
2. M. Wikelski, R. W. Kays, N. J. Kasdin, K. Thorup, J. A. Smith, and G. W. Swenson, "Going Wild: What a Global Small-Animal Tracking System Could Do for Experimental Biologists," The Journal of Experimental Biology, pp. 181-186, 2007.
3. Z. Yang and H. Wu, "Featherlight Information Network with Delay-Endurable RFID Support (FINDERS)," in Proc. of IEEE SECON, pp. 55-63, 2009.
4. V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, and H. Weiss, "Delay Tolerant Network Architecture." draft-irtf-dtnrg-arch-02.txt, 2004.
5. UHF Class 1 Gen 2 Standard v. 1.1.0.
6. M. Jelasity, A. Montresor, and O. Babaoglu, "Gossip-based Aggregation in Large Dynamic Networks," in Proc. of ACM Transactions on Computer Systems, vol. 23, pp. 219-252, 2005.
7. D. Angluin, J. Aspnes, and D. Eisenstat, "Fast Computation by Population Protocols with A Leader," in Proc. of The 20th International Symposium on Distributed Computing, pp. 61-75, 2006.
8. J. Aspnes and E. Ruppert, "An Introduction to Population Protocols," Bulletin of the European Association for Theoretical Computer Science, vol. 93, pp. 98-117, 2007.
9. B. D. Walker, J. K. Glenn, and T. C. Clancy, "Analysis of Simple Counting Protocols for Delay-Tolerant Networks," in Proc. of ACM Workshop on Challenged Networks (CHANTS), pp. 19-26, 2007.
10. Introduction to Algorithms, pp. 382-283. The MIT Press, 2001.
11. J. Leguay, T. Friedman, and V. Conan, "DTN Routing in a Mobility Pattern Space," in Proc. of ACM SIGCOMM'05 Workshop on Delay Tolerant Networking and Related Topics, pp. 276-283, 2005.