ASH: tackling node mobility in large-scale networks

Abstract

With the increased adoption of technologies like wireless sensor networks by real-world applications, dynamic network topologies are becoming the rule rather than the exception. Node mobility, however, introduces a range of problems (communication interference, path uncertainty, low quality of service and information loss, etc.) that are not handled well by periodically refreshing state information, as algorithms designed for static networks typically do. To address specifically this problem, the main contribution of this paper is the introduction of a novel mechanism (called ASH) for the creation of a quasi-static overlay on top of a mobile topology. It is powered by simple, local interactions between nodes and exhibits self-healing and self-organization capabilities with respect to failures and node mobility. We show that the overlay mechanism works without assumptions about position, orientation, speed, motion correlation, and trajectory prediction of the nodes. A preliminary evaluation by means of simulation shows that ASH succeeds in tackling node mobility, while consuming only minimal resources.

Automatic discovery of algorithms for multi-agent systems

“…[3] Besides that, a well-known property of large-scale systems is that above a certain system size, global properties occur somewhat unexpectedly out of simple local interactions. In a very small number of cases, this emergent behavior is a positive property and can be put to good use by synchronization algorithms [23], clustering schemes [19], distributed feed-back mechanisms [5] etc., while in the large majority of cases it has mainly a negative effect [15].…”

Gossip-based density estimation in dynamic heterogeneous sensor networks

“…Pruteanu in [20] introduces a diffusion based mechanism called ASH-NetSize to guarantee the mass conservation. According to the suggested self healing mechanism one of the nodes has the responsibility of injecting mass based on the difference between average mass and the network size.…”

“…We apply random walk pattern [22] for the mobile node scenario. ASH [20] is used as a clustering scheme which is designed for mobile networks and supports stationary networks as well. We use various scenarios in order to check the behavior of the devised algorithm over different circumstances.…”