Clustering with case-based reasoning for wireless sensor network

In wireless sensor network one of the key issues is how to maximize the network lifetime since it consists of sensor nodes of limited energy. Numerous cluster-based routing schemes have been proposed for sensor networks. Here various important factors such as sensing coverage and distribution of live nodes need to be effectively accounted in forming the clusters. In this paper we propose a new scheme which considers the nodes' remaining energy, distance between the nodes, and sensor coverage in clustering the nodes. We also employ the case-based reasoning technique in the clustering process. Compared with the existing cluster-based protocols such as LEACH and Coverage-Preserving protocol through computer simulation, the proposed scheme allows substantially enhanced network lifetime and coverage. Especially, it is more effective when the network has been used for a while and thus some nodes have become inoperable.

[1]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[2]  Arun K. Pujari,et al.  Q-Coverage Problem in Wireless Sensor Networks , 2009, ICDCN.

[3]  Yuh-Ren Tsai WSN04-5: Coverage-Preserving Routing Protocols for Randomly Distributed Wireless Sensor Networks , 2006, IEEE Globecom 2006.

[4]  Wei Wang,et al.  Information Coverage in Randomly Deployed Wireless Sensor Networks , 2007, IEEE Transactions on Wireless Communications.

[5]  Dirk Timmermann,et al.  Low energy adaptive clustering hierarchy with deterministic cluster-head selection , 2002, 4th International Workshop on Mobile and Wireless Communications Network.

[6]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2005, Mob. Networks Appl..

[7]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[8]  Hee Yong Youn,et al.  Energy-Driven Adaptive Clustering Hierarchy (EDACH) for Wireless Sensor Networks , 2005, EUC Workshops.

[9]  Dickson Lukose,et al.  How Case-Based Reasoning and Cooperative Query Answering Techniques Support RICAD ? , 1997, ICCBR.

[10]  Sartaj Sahni,et al.  Power-aware routing in sensor networks , 2005 .

[11]  Yuh-Ren Tsai,et al.  Coverage-preserving routing protocols for randomly distributed wireless sensor networks , 2007, IEEE Transactions on Wireless Communications.

[12]  Hee Yong Youn,et al.  Optimized Clustering for Maximal Lifetime of Wireless Sensor Networks , 2006, EUC Workshops.

[13]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[14]  T. Thumthawatworn,et al.  Method for cluster heads selection in wireless sensor networks , 2004, 2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No.04TH8720).

[15]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[16]  Weifa Liang,et al.  Approximate coverage in wireless sensor networks , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.