Fault Tolerant Topology Design for Ad Hoc and Sensor Networks

Author(s):  
Yu Wang

Fault tolerance is one of the premier system design desiderata in wireless ad hoc and sensor networks. It is crucial to have a certain level of fault tolerance in most of ad hoc and sensor applications, especially for those used in surveillance, security, and disaster relief. In addition, several network security schemes require the underlying topology provide fault tolerance. In this chapter, we will review various fault tolerant techniques used in topology design for ad hoc and sensor networks, including those for power control, topology control, and sensor coverage.

Fault Tolerant Reliable Protocol (FTRP) is proposed as a novel routing protocol designed for Wireless Sensor Networks (WSNs). FTRP offers fault tolerance reliability for packet exchange and support for dynamic network changes. The key concept used is the use of node logical clustering. The protocol delegates the routing ownership to the cluster heads where fault tolerance functionality is implemented. FTRP utilizes cluster head nodes along with cluster head groups to store packets in transient. In addition, FTRP utilizes broadcast, which reduces the message overhead as compared to classical flooding mechanisms. FTRP manipulates Time to Live values for the various routing messages to control message broadcast. FTRP utilizes jitter in messages transmission to reduce the effect of synchronized node states, which in turn reduces collisions. FTRP performance has been extensively through simulations against Ad-hoc On-demand Distance Vector (AODV) and Optimized Link State (OLSR) routing protocols. Packet Delivery Ratio (PDR), Aggregate Throughput and End-to-End delay (E-2-E) had been used as performance metrics. In terms of PDR and aggregate throughput, it is found that FTRP is an excellent performer in all mobility scenarios whether the network is sparse or dense. In stationary scenarios, FTRP performed well in sparse network; however, in dense network FTRP’s performance had degraded yet in an acceptable range. This degradation is attributed to synchronized nodes states. Reliably delivering a message comes to a cost, as in terms of E-2-E. results show that FTRP is considered a good performer in all mobility scenarios where the network is sparse. In sparse stationary scenario, FTRP is considered good performer, however in dense stationary scenarios FTRP’s E-2-E is not acceptable. There are times when receiving a network message is more important than other costs such as energy or delay. That makes FTRP suitable for wide range of WSNs applications, such as military applications by monitoring soldiers’ biological data and supplies while in battlefield and battle damage assessment. FTRP can also be used in health applications in addition to wide range of geo-fencing, environmental monitoring, resource monitoring, production lines monitoring, agriculture and animals tracking. FTRP should be avoided in dense stationary deployments such as, but not limited to, scenarios where high application response is critical and life endangering such as biohazards detection or within intensive care units.


2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Juan R. Diaz ◽  
Jaime Lloret ◽  
Jose M. Jimenez ◽  
Sandra Sendra ◽  
Joel J. P. C. Rodrigues

Multimedia traffic can be forwarded through a wireless ad hoc network using the available resources of the nodes. Several models and protocols have been designed in order to organize and arrange the nodes to improve transmissions along the network. We use a cluster-based framework, called MWAHCA architecture, which optimizes multimedia transmissions over a wireless ad hoc network. It was proposed by us in a previous research work. This architecture is focused on decreasing quality of service (QoS) parameters like latency, jitter, and packet loss, but other network features were not developed, like load balance or fault tolerance. In this paper, we propose a new fault tolerance mechanism, using as a base the MWAHCA architecture, in order to recover any multimedia flow crossing the wireless ad hoc network when there is a node failure. The algorithm can run independently for each multimedia flow. The main objective is to keep the QoS parameters as low as possible. To achieve this goal, the convergence time must be controlled and reduced. This paper provides the designed protocol, the analytical model of the algorithm, and a software application developed to test its performance in a real laboratory.


Author(s):  
VENKATESH S

In Wireless Sensor Networks (WSNs), Efficient clustering is key for optimal use of available nodes. Fault tolerance to any failure on the network or node level is an essential requirement in this context. Hence, a novel approach towards clustering and multiple object tracking in WSNs is being explored. The Proposed method employs judicious mix of burdening all available nodes including GH (Group Head) to earn energy efficiency and fault tolerance. Initially, node with the maximum residual energy in a cluster becomes group head and node with the second maximum residual energy becomes altruist node, but not mandatory. Later on, selection of cluster head will be based on available residual energy. We use Matlab software as simulation platform to check energy consumption at cluster by evaluation of proposed algorithm. Eventually we evaluated and compare this proposed method against previous method and we demonstrate our model is better optimization than other method such as Traditional clustering in energy consumption rate.


2010 ◽  
pp. 109-142
Author(s):  
Songqing Yue ◽  
Yang Xiao ◽  
Xihui Zhang ◽  
Jiming Chen ◽  
Jianhui Zhang ◽  
...  

2008 ◽  
Vol 13 (1) ◽  
pp. 81-85 ◽  
Author(s):  
Wen-qing Cheng ◽  
Zhi-qiang Xiong ◽  
Wei Liu ◽  
Zong-kai Yang ◽  
Yong-jian Xu

2011 ◽  
Vol 63-64 ◽  
pp. 905-910
Author(s):  
Xiao Wu Huang ◽  
Gui Tang Wang ◽  
Wen Juan Liu ◽  
Feng Wang

Time synchronization is a key technology in wireless sensor networks. In this paper, aim at high-speed railway GSM-R network require higher real time, fault tolerance and band coverage way, presents a real-time fault-tolerant wireless sensor network time synchronization algorithm, using direct forwarding strategy, regression analysis and abnormal data filtering methods to meet the requirements of GSM-R network. Analysis and simulation show that the algorithm has good real-time and fault tolerance to meet the requirements of GSM-R network applications.


Sign in / Sign up

Export Citation Format

Share Document