An approach for near-optimal distributed data fusion in wireless sensor networks

Abstract

In wireless sensor networks (WSNs), a lot of sensory traffic with redundancy is produced due to massive node density and their diverse placement. This causes the decline of scarce network resources such as bandwidth and energy, thus decreasing the lifetime of sensor network. Recently, the mobile agent (MA) paradigm has been proposed as a solution to overcome these problems. The MA approach accounts for performing data processing and making data aggregation decisions at nodes rather than bring data back to a central processor (sink). Using this approach, redundant sensory data is eliminated. In this article, we consider the problem of calculating nearoptimal routes for MAs that incrementally fuse the data as they visit the nodes in a WSN. The order of visited nodes (the agent's itinerary) affects not only the quality but also the overall cost of data fusion. Our proposed heuristic algorithm adapts methods usually applied in network design problems in the specific requirements of sensor networks. It computes an approximate solution to the problem by suggesting an appropriate number of MAs that minimizes the overall data fusion cost and constructs nearoptimal itineraries for each of them. The performance gain of our algorithm over alternative approaches both in terms of cost and task completion latency is demonstrated by a quantitative evaluation and also in simulated environments through a Java-based tool.

Multilayer and Multi-agent Data Fusion in WSN

“…Researchers also studied data gathering algorithm based on mobile agent for emergent event monitoring in [6]. Gavalas put forward a nearly optimal distributed data fusion method for WSN based on the Agent in 2010 [7]. It computes an approximate solution to the problem by suggesting an appropriate number of MAs that minimizes the overall data fusion cost and constructs near-optimal itineraries for each of them.…”

A research of multiple Mobile Agents routing algorithm based on redundancy for wireless sensor network

“…Wireless connection, a kind of data communication, is different from the traditional wired connection and is used for the information transfer between sensor nodes and between sensor nodes and PE. MA [8] is a execution code for completing data fusion. It transports between the sensor nodes, obtains the local node data, removes redundant and useless information and carries the final fusion results to return to the processing node after transport.…”

“…C/S model Apparently, this will result in great waste by sending large amounts of raw data (containing even some unnecessary and useless information) and consume valuable bandwidth and resources such as nodes energy. Thus, data fusion, based on MAs [5][6][7][8], emerges at the right moment.…”

Optimal itinerary planning for mobile multiple agents in WSN

“…Mpitziopoulos et al in [12] proposed a Near-Optimal Itinerary Design (NOID) algorithm to solve the problem of computing a near-optimal itinerary for MA. NOID algorithm was designed so as to adapt rapidly to changing conditions of the network, the MA itinerary must contain only source nodes with enough energy availability and the number of AMs should depend on the number of physical locations of the source nodes to be visited.…”