Detecting Energy-Efficient Central Nodes for Cooperative Caching in Wireless Sensor Networks

The deployment of wireless sensor networks in many application areas like environment control, target tracking in battlefields, requires an optimization to the communication among the sensors so as to serve data in short latency and with minimal energy consumption. Cooperative data caching has been proposed as an effective and efficient technique to achieve these goals concurrently. The design of protocols for such networks depends mainly on the selection of the sensors which will take special roles in coordinating the procedure of caching and take forwarding decisions. This article introduces a new metric to aid in the selection of such nodes. Based on this metric, we propose a new energy efficient cooperative caching protocol, which is compared against the state-of-the-art competing protocol. The simulation results attest the superiority of the proposed protocol.

[1]  Yannis Manolopoulos,et al.  Cooperative Caching in Wireless Multimedia Sensor Networks , 2007, MobiMedia '07.

[2]  L. Freeman Centrality in social networks conceptual clarification , 1978 .

[3]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[4]  Wenzhong Li,et al.  Energy-Efficient Cache Replacement Policies for Cooperative Caching in Mobile Ad Hoc Network , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[5]  Guohong Cao,et al.  Supporting Cooperative Caching in Ad Hoc Networks , 2006, IEEE Trans. Mob. Comput..

[6]  Qinghua Li,et al.  Multicasting in delay tolerant networks: a social network perspective , 2009, MobiHoc '09.

[7]  Charles Ofria,et al.  Distributed Cooperative Caching in Social Wireless Networks , 2013, IEEE Transactions on Mobile Computing.

[8]  Srinivasan Parthasarathy,et al.  Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks , 2004 .

[9]  M. Saravanan,et al.  Analyzing and labeling telecom communities using structural properties , 2011, Social Network Analysis and Mining.

[10]  Leandros Tassiulas,et al.  Social network analysis concepts in the design of wireless Ad Hoc network protocols , 2010, IEEE Network.

[11]  Siddhartha Annapureddy,et al.  Shark: scaling file servers via cooperative caching , 2005, NSDI.

[12]  Vikram Srinivasan,et al.  Energy-efficient caching strategies in ad hoc wireless networks , 2003, MobiHoc '03.

[13]  Bin Tang,et al.  Benefit-Based Data Caching in Ad Hoc Networks , 2008, IEEE Trans. Mob. Comput..

[14]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[15]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[16]  Faraz Zaidi,et al.  Communities and hierarchical structures in dynamic social networks: analysis and visualization , 2011, Social Network Analysis and Mining.

[17]  Ossama Younis,et al.  Node clustering in wireless sensor networks: recent developments and deployment challenges , 2006, IEEE Network.

[18]  Hyuk Lim,et al.  J-Sim: a simulation and emulation environment for wireless sensor networks , 2006, IEEE Wireless Communications.

[19]  P. Bonacich Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[20]  Manoj Misra,et al.  Cooperative caching for homogeneous wireless sensor networks , 2009 .

[21]  Sherief Abdallah,et al.  Generalizing unweighted network measures to capture the focus in interactions , 2011, Social Network Analysis and Mining.

[22]  Aidong Zhang,et al.  Bridging centrality: graph mining from element level to group level , 2008, KDD.