Fault tolerant broadcasting analysis in wireless monitoring networks

Wireless monitoring networks can be used for security applications such as the monitoring of narrow passages and operational fields. These networks can be designed based on sensor networks. In sensor networks, each node can hear a message and broadcast the message to its neighbor nodes. Nevertheless, nodes may fail, so that faulty nodes cannot hear or cannot transmit any message, where the locations of the faulty nodes are unknown and their failures are permanent. In this paper, the nodes are situated on a line or a square grid-based topology in a plane for security/monitoring applications. For each topology, 2 nonadaptive and adaptive broadcasting scheduling algorithms are proposed and analyzed. In addition, the scheduling algorithms take the energy consumption of the sensor nodes into account in order to prolong the network's lifetime. The analysis results show that adaptive algorithms need less time than nonadaptive algorithms to inform the whole network domain.

Fault tolerant broadcasting analysis in wireless monitoring networks

Wireless monitoring networks can be used for security applications such as the monitoring of narrow passages and operational fields. These networks can be designed based on sensor networks. In sensor networks, each node can hear a message and broadcast the message to its neighbor nodes. Nevertheless, nodes may fail, so that faulty nodes cannot hear or cannot transmit any message, where the locations of the faulty nodes are unknown and their failures are permanent. In this paper, the nodes are situated on a line or a square grid-based topology in a plane for security/monitoring applications. For each topology, 2 nonadaptive and adaptive broadcasting scheduling algorithms are proposed and analyzed. In addition, the scheduling algorithms take the energy consumption of the sensor nodes into account in order to prolong the network's lifetime. The analysis results show that adaptive algorithms need less time than nonadaptive algorithms to inform the whole network domain.

___

  • stated in [23]. However, the energy consumption of the nodes increases in 3× 3 regions, for the same reason discussed in Section 3.1. Therefore, the number of faulty nodes in 3× 3 regions grows faster than 5 × 5 regions. Therefore, after a while, most of the nodes in 3
  • × 3 regions fail and the MBT goes up compared with 5× 5 regions.
  • SGT adaptive algorithm
  • Table. Comparison of the upper bound complexities.
  • Broadcasting algorithm
  • Line nonadaptive algorithm
  • Line adaptive algorithm 1 Line adaptive algorithm 2 SGT nonadaptive algorithm
  • SGT adaptive algorithm Complexity O(D + F ) 2×D+ O(log2(U )) D + O( O(D + F ) O(D+ log2(U ))
  • I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, “Wireless sensor networks: a survey”, Computer Networks, Vol. 38, pp. 393–422, 2002.
  • S. Kamel, A.G. Rahbar, “Heuristic surveillance of targets in sensor networks”, IEEE 5th International Symposium on High Capacity Optical Networks and Enabling Technologies, pp. 46–51, 2008.
  • L. Song, D. Hatzinakos, “A cross-layer architecture of wireless sensor networks for target tracking”, IEEE/ACM Transactions on Networking, Vol. 15, pp. 145–158, 2007.
  • K. Ren, K. Zeng, W. Lou, “Secure and fault-tolerant event boundary detection in wireless sensor networks”, IEEE Transactions on Wireless Communications, Vol. 7, pp. 354–363, 2008.
  • P. Sridhar, A.M. Madni, M. Jamshidi, “Hierarchical aggregation and intelligent monitoring and control in fault- tolerant wireless sensor networks”, IEEE Systems Journal, Vol. 1, pp. 38–54, 2007.
  • S.C. Geyik, B.K. Szymanski, “Multi-target tracking and identification by a vector of sensors”, IEEE Military Communications Conference, 2008.
  • S. Panichpapiboon, G. Ferrari, O.K. Tonguz, “Sensor networks with random versus uniform topology: MAC and interference considerations”, IEEE Vehicular Technology Conference, pp. 2111–2115, 2004.
  • R. Iyengar, K. Kar, S. Banerjee, “Low coordination wakeup algorithms for multiple connected-covered topologies in sensornets”, International Journal of Sensor Networks, Vol. 5, pp. 33–47, 2009.
  • N.A. Ab. Aziz, K.Ab. Aziz, W.Z.W. Ismail, “Coverage strategies for wireless sensor networks”, World Academy of Science, Engineering and Technology, Vol. 50, pp. 145–150, 2009.
  • W.C. Ke, B.H. Liu, M.J. Tsai, “The critical-square-grid coverage problem in wireless sensor networks is NP- complete”, Computer Networks, Vol. 55, 11, pp. 2209–2220, 2011.
  • S. Dolev, T. Herman, L. Lahiani, “Polygonal broadcast for sensor networks”, 2nd IEEE Upstate New York Workshop Sensor Networks, 2003.
  • J.N. Al-Karaki, A.E. Kamal, “Routing techniques in wireless sensor networks: a survey”, IEEE Wireless Commu- nications, Vol. 11, pp. 6–28, 2004.
  • X. Mao, H. Chen, P. Qiu, Z. Zhang, “Energy-efficient scheduling for multiple access in wireless sensor networks: a job scheduling method”, Computer Networks, Vol. 54, pp. 2137–2146, 2010.
  • A.F. Liu, X.Y. Wu, Z.G. Chen, W.H. Gui, “Research on the energy hole problem based on unequal cluster-radius for wireless sensor networks”, Computer Communications, Vol. 33, pp. 302–321, 2010.
  • I. Bekmezci, F. Alag¨oz, “Delay sensitive, energy efficient and fault tolerant distributed slot assignment algorithm for wireless sensor network under converge cast data traffic”, International Journal of Distributed Sensor Networks, Vol. 5, pp. 557–575, 2009.
  • A. Jawahar, S. Radha, R. Sharath Kumar, “Capacity-preserved, energy-enhanced hybrid topology management scheme in wireless sensor networks for hazardous applications”, International Journal of Distributed Sensor Net- works, Vol. 2012, 2012.
  • C.H. Lung, C. Zhou, “Using hierarchical agglomerative clustering in wireless sensor networks: An energy-efficient and flexible approach”, Ad Hoc Networks, Vol. 8, pp. 328–344, 2010.
  • M.K. Watfa, O. Mirza, J. Kawtharani, “BARC: a battery aware reliable clustering algorithm for sensor networks”, Journal of Network and Computer Applications, Vol. 32, pp. 1183–1193, 2009.
  • M. Cardei, S. Yang, J. Wu, “Algorithms for fault-tolerant topology in heterogeneous wireless sensor networks”, IEEE Transactions on Parallel and Distributed Systems, Vol. 19, 545–558, 2008.
  • A. Boukerche, A. Martirosyan, R. Pazzi, “An inter-cluster communication based energy aware and fault tolerant protocol for wireless sensor networks”, Mobile Networks and Applications, Vol. 13, pp. 614–626, 2008.
  • N. Li, J.C. Hou, “FLSS: a fault-tolerant topology control algorithm for wireless networks”, ACM International Conference on Mobile Computing and Networking, 2004.
  • M. Bahramgiri, M.T. Hajiaghayi, V.S. Mirrokni, “Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multihop networks”, IEEE International Conference on Computer Communications and Networks, 2002.
  • E. Kranakis, D. Krizanc, A. Pelc, “Fault-tolerant broadcasting in radio networks”, Journal of Algorithms, Vol. 39, pp. 47–67, 2001.
  • S. Guo, Z. Zhong, T. He, “FIND: faulty node detection for wireless sensor networks”, ACM Conference on Embedded Networked Sensor Systems, 2009.
  • F. Koushanfar, M. Potkonjak, A. Sangiovanni-Vincentelli, “On-line fault detection of sensor measurements”, Pro- ceedings of IEEE Sensors, Vol. 2, pp. 974–979, 2003. [26]X. Luo, M. Dong, Y. Huang, “On distributed fault-tolerant detection in wireless sensor networks”, IEEE Transac- tions on Computers, Vol. 55, pp. 58–70, 2006.