A fault tolerance approach to topology control in Distributed Sensor Networks

Bhajantri, Lokesh B.; Nalini, N.

doi:10.1109/icaccct.2012.6320772

Cited by 3 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Wireless networks have attracted more and more attention, and extensive research efforts [1,12] have been made. In [13], based on a particular condensation phenomenon, the authors exploited and analyzed an adaptive probabilistic broadcast containment technique, which can introduce significant benefits for the broadcast-based reactive routing protocols in mobile ad-hoc networks.…”

Section: Related Workmentioning

confidence: 99%

On efficient replication-based routing in vehicular networks

Deng

Zhu

2014

Journal of High Speed Networks

View full text Add to dashboard Cite

Efficient routing in vehicular networks is one of the most challenging problems because of frequent network disruption and fast topological change. Some replication-based routing protocols such as epidemic routing have been proposed. However, these existing replicationbased routing protocols cannot achieve high delivery ratio, low end-to-end delay and low delivery cost. In this paper, we design an efficient replication-based routing protocol called ERR for efficient routing in vehicular networks. ERR is a fully distributed protocol, and it has the following three desirable design objectives: first, ERR delivers the majority of the messages generated in time-to-live; second, ERR achieves low end-to-end delay; third, ERR introduces as little delivery cost as possible. To achieve these design objectives, ERR adopts an adaptive strategy for the number of copies of a message in a distributed fashion. In addition, we propose two forwarding rules for a message carrier with some copies to decide whether it should forward the message when it meets a vehicle. Based on real traces of vehicles, we have conducted real trace-driven simulations. Performance results demonstrate that ERR can increase delivery ratio, decrease end-to-end delay, and decrease delivery cost, when compared with four other alternative protocols.A number of protocols have been proposed for routing in Delay Tolerant Networks (DTNs), which can also be used in vehicular networks. The majority of these routing protocols are replication-based, such as epidemic routing [17], direct transmission [15] and spray-and-wait routing [16]. Replication-based routing protocols spread some duplicate copies of a message to a subset of nodes in the network, and the message is successfully delivered if one of these nodes encounters the destination. In epidemic routing, every message carrier forwards the message to any node it meets, until the message times out. Epidemic routing can achieve the maximum delivery ratio and minimum end-to-end delay. However, it also introduces unacceptable communication overhead, so that it is inappropriate for resource-constrained networks. In direct transmission, the source carries the message all the way unless it meets the destination. Direct transmission performs extremely low delivery ratio and high end-to-end delay, although it introduces little communication overhead. Spray-and-wait routing is a multiple-copy routing protocol, and it divides routing into two phases: spraying phase and waiting phase. In spraying phase, the source of a message generates a certain number of copies for the message, then spreads the message copies to some distinct relays. In waiting phase, each relay transmits the message only when it meets the message destination. Spray-andwait routing can be viewed as a tradeoff between delivery ratio and communication overhead. However, there are still two weaknesses in spray-and-wait routing: (1) once the number of copies of a message is determined, it is not changed during routing process, and (2) it is difficult to set...

show abstract

Section: Related Workmentioning

confidence: 99%

On efficient replication-based routing in vehicular networks

Deng

Zhu

2014

Journal of High Speed Networks

View full text Add to dashboard Cite

show abstract

“…Such artifacts (that will be simply referred as sensors in the rest of the paper) are densely deployed in the area interested by the phenomenon, and have self-organizing, specialized network protocols and networking techniques, to face applications in which positioning of the sensors is difficult or can only happen randomly, and to face power management problems. General fault tolerant topology optimization is addressed in [5].…”

Section: Wireless Sensor Networkmentioning

confidence: 99%

Petri net based evaluation of energy consumption in wireless sensor nodes

D’Arienzo¹,

Iacono²,

Marrone³

et al. 2013

Journal of High Speed Networks

View full text Add to dashboard Cite

Wireless Sensor Networks have proven their capability to deal with problems where wide and hardly accessible areas need to be monitored. Among the other systems there are also sensor networks in which nodes can (voluntarily) modify their positions to better adapt to changes of monitored phenomenon. One of the major issues arising in these situations is the energy consumption: as all the movements affect the batteries lifetime, the life of a sensor can be extended by equipping the device with power generators that exploit renewable sources, albeit this solution does not always avoid a full battery discharge. In this paper a Fluid Stochastic Petri Net modelling framework is presented to provide a wide evaluation of all the factors that contribute to the energy dissipation in mobile wireless sensor nodes. The framework allows the generation of extensible and composable models capable to evaluate the energy consumption due to sensing, communication and movement functions as well as the impact of power saving mechanisms on the energetical balance of the node. The approach is applied to a marine sensing problem and is validated by comparing the model analysis results with experimental results achieved through an existing off-the-shelf sensor network simulator. M. D'Arienzo et al. / Petri net based evaluation of energy consumption in wireless sensor nodesof having sensors that are capable to reach the desired position lays in the possibility to optimize their distribution, even dynamically, to compensate the loss of some of them: sensors can be moved by a remote radio control or, even better, can be autonomous and reach a desired position using their own resources, or even behave as autonomous agents and decide the best current position according to the environmental conditions and information coming from the other sensors: moreover, a network in which all sensors are capable of movement can chase the phenomenon to be sensed, in case its dynamics would be such that its extension or its center changes with time or other conditions. Despite the lower deployment number need, these moving sensors use part of their batteries for movement engines, and are generally even more expensive due to the presence of additional components.Marine environment is an interesting scenario for MSNs: although deployment is not necessarily difficult, the movement capability is a feature useful to compensate the effects of the environment on sensors position, like for instance the effects of streams and winds. Moreover, interesting phenomena are spread in the water: dispersed pollution agents, colonies of microorganisms, herds of animals or chemical/thermal gradients generally move in the water, creating the need for a network that can be moved or extended according to the dynamics of phenomena. Additionally, the isolation of the network from maintainers would benefit from the possibility that sensors that are temporarily not needed for a reduction of the monitoring area can be put in a sleep mode to prolongate their useful life, but still keep...

show abstract

“…One of the most important issues in sensor networks is routing, fault tolerance and topology control [3,4]. For each of these issues, algorithms and protocols have been presented so far.…”

Section: Introductionmentioning

confidence: 99%

Eer-Al: An Energy Efficient Routing Protocol Based on Automated Learning Method

Kiani¹

2018

IJCT

View full text Add to dashboard Cite

The issue of energy in a wireless sensor network is one of the most important challenges for these networks. This issue is also being considered today in the new IoT topic. This paper studies the ability of the learning automata model to solve the problem in the sensor networks. Because they have capabilities such as low computational load, ability to use in distributed environments, and inaccurate information, require the least feedback from the environment, etc. One of the solutions to energy optimization is to provide routing protocols. In the routing area, a routing protocol based on learning automata has been proposed in which the network lifetime criterion is considered. The simulation results and the comparison of the proposed protocol with other protocols indicate that this protocol has better performance in the energy conversation and network lifetime.

show abstract

A fault tolerance approach to topology control in Distributed Sensor Networks

Cited by 3 publications

References 10 publications

On efficient replication-based routing in vehicular networks

On efficient replication-based routing in vehicular networks

Petri net based evaluation of energy consumption in wireless sensor nodes

Eer-Al: An Energy Efficient Routing Protocol Based on Automated Learning Method

Contact Info

Product

Resources

About