Weighted Localized Clustering: A Coverage-Aware Reader Collision Arbitration Protocol in RFID Networks

This paper addresses a weighted localized scheme and its application to the hierarchical clustering architecture, which results in reduced overlapping areas of clusters. Our previous proposed scheme, Low-Energy Localized Clustering (LLC), dynamically regulates the radius of each cluster for minimizing energy consumption of cluster heads (CHs) while the entire network field is still being covered by each cluster in sensor networks. We present weighted Low-Energy Localized Clustering(w-LLC), which has better efficiency than LLC by assigning weight functions to each CH. Drew on the w-LLC scheme, weighted Localized Clustering for RFID networks(w-LCR) addresses a coverage-aware reader collision arbitration protocol as an application. w-LCR is a protocol that minimizes collisions by minimizing overlapping areas of clusters.

[1]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[2]  Kai-Yeung Siu,et al.  Efficient memoryless protocol for tag identification (extended abstract) , 2000, DIALM '00.

[3]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[4]  Joongheon Kim,et al.  Low-energy localized clustering: an adaptive cluster radius configuration scheme for topology control in wireless sensor networks , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[5]  Daniel W. Engels,et al.  Colorwave: an anticollision algorithm for the reader collision problem , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[6]  Jianping Pan,et al.  Topology control for wireless sensor networks , 2003, MobiCom '03.

[7]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[8]  Murat Demirbas,et al.  Design and analysis of a fast local clustering service for wireless sensor networks , 2004, First International Conference on Broadband Networks.

[9]  Jorge Nocedal,et al.  On the limited memory BFGS method for large scale optimization , 1989, Math. Program..

[10]  Xiaokang Lin,et al.  Adaptive load balancing in mobile ad hoc networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[11]  Mohamed F. Younis,et al.  Load-balanced clustering of wireless sensor networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[12]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[13]  Feng Zhou,et al.  Evaluating and optimizing power consumption of anti-collision protocols for applications in RFID systems , 2004, Proceedings of the 2004 International Symposium on Low Power Electronics and Design (IEEE Cat. No.04TH8758).

[14]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[15]  Joongheon Kim,et al.  Effect of localized optimal clustering for reader anti-collision in RFID networks: fairness aspects to the readers , 2005, Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005..

[16]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[17]  Catherine Rosenberg,et al.  Design guidelines for wireless sensor networks: communication, clustering and aggregation , 2004, Ad Hoc Networks.

[18]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..