Is the clustering coefficient a measure for fault tolerance in wireless sensor networks?

Distributed systems such as the Internet and wireless sensor networks must provide a high degree of resilience against errors and attacks. Besides steps that increase reliability of data and resources of the network, the topology structure itself plays a crucial role in the efficacy of the fault-tolerance behavior. The network topology is a supportive factor to reduce or avoid malfunction behavior of the system after a strike on a strategic node or a random failure of a node. For a self-organizing topology with numerous nodes, it is necessary to have a local fault tolerance measure instead of collecting information of the entire network to adjust the topology locally when needed. The local clustering coefficient determines the degree of the connectedness of the node's neighbors. The correlation between the clustering coefficient and fault tolerance is an open research problem. In this paper, we propose the clustering coefficient as a local metric for fault tolerance, in particular for wireless sensor networks. We describe how to increase the clustering coefficient by (a) exclusively adding and (b) exclusively removing links to a wireless sensor network topology. Simulation results indicate that the clustering coefficient is correlated to the fault tolerance of the system.

[1]  Jennifer C. Hou,et al.  FLSS: a fault-tolerant topology control algorithm for wireless networks , 2004, MobiCom '04.

[2]  Roger Wattenhofer Sensor Networks: Distributed Algorithms Reloaded - or Revolutions? , 2006, SIROCCO.

[3]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[4]  Ivan Stojmenovic,et al.  Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks , 2005, Ad Hoc Networks.

[5]  Biswanath Mukherjee,et al.  Wireless sensor network survey , 2008, Comput. Networks.

[6]  Damla Turgut,et al.  Multi‐hop localization system for environmental monitoring in wireless sensor and actor networks , 2013, Concurr. Comput. Pract. Exp..

[7]  Ivan Stojmenovic,et al.  Mobile Ad Hoc Networking: Basagni/Ad Hoc Networking , 2004 .

[8]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[9]  Marco Conti,et al.  Mobile Ad-hoc Networking - Minitrack Introduction , 2001, HICSS.

[10]  Vahab S. Mirrokni,et al.  Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks , 2006, Wirel. Networks.

[11]  Paolo Santi Topology control in wireless ad hoc and sensor networks , 2005 .

[12]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[13]  Damla Turgut,et al.  Local positioning for environmental monitoring in wireless sensor and actor networks , 2010, IEEE Local Computer Network Conference.

[14]  Damla Turgut,et al.  LSWTC: A local small-world topology control algorithm for backbone-assisted mobile ad hoc networks , 2010, IEEE Local Computer Network Conference.

[15]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[16]  Prasun Sinha,et al.  Throughput and energy efficiency in topology-controlled multi-hop wireless sensor networks , 2003, WSNA '03.

[17]  Stefano Basagni,et al.  Mobile Ad Hoc Networking , 2010 .

[18]  Albert-László Barabási,et al.  Scale-Free Networks: A Decade and Beyond , 2009, Science.

[19]  Dharma P. Agrawal,et al.  Mobile Ad hoc Networking , 2002 .

[20]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.