Anycast Based Lightweight Routing Protocol for Mobile Sink Discovery in Sensor Networks

Abstract

Applications for wireless sensor networks have grown enormously over the past few years. Routing and sink discovery protocols designed for ad hoc networks do not adapt to sensor networks, and generic sensor network routing techniques are not optimal for all scenarios. We propose a light weight routing protocol to discover mobile sinks in battle-field operations or large terrains. Initial experimentation shows promising results in reduction of control over head, good data delivery with support of multi-metric path selection.

Cooperative Robots and Sensor Networks 2015

“…Ant colony optimization, another technique of the population-based optimization approaches, was used in [59] to solve the task allocation problem of MRS. In [60], ant algorithm was used in the context of multi-robot cooperation for the aim of solving the task allocation problem.…”

“…Let x be an estimate of x. To simplify the computations, we use the modified Bayesian CRLB [59][60][61], which allows us to first treat the robot clock skews β 1 and β 2 as known values, and then taking expectation over all random clock skews. The actual Bayesian CRLB gives a tighter error bound, but has a much more complicated form that unfortunately does not provide additional insights compared to the analysis in this paper.…”

“…Within a cluster region, proactive routing is used while between clusters reactive routing is performed [59]. For instance, in [60], the sink periodically advertises a HELLO message which is saved with time stamp by the receiving nodes. In case of an event the nodes first try for any available sink in its cache, otherwise it initiates a route discovery process.…”