Effective Determination of Mobile Agent Itineraries for Data Aggregation on Sensor Networks

Konstantopoulos, Charalampos; Mpitziopoulos, Aristides; Gavalas, Damianos; Pantziou, Grammati

doi:10.1109/tkde.2009.203

Cited by 81 publications

(69 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [14], the authors proposed a greedy tree-based itinerary design (TBID) algorithm to find near optimal itineraries for multiple agents. This algorithm is executed centrally at the sink and statically determines the number of agents that should be employed and their itineraries.…”

Section: Centralized Approach-based Schemesmentioning

confidence: 99%

“…The route of an agent is dynamically decided at each hop using cost function. MMADIDD adapts to unexpected node failures during an agent migration, but consumes slightly more energy than TBID [14]. This protocol provides a fair amount of fault tolerance, but the migration of agents depends on the wedge structure.…”

Section: Distributed Approach-based Schemesmentioning

confidence: 99%

“…The sink node has enough battery power and computational capability to handle all of the necessary calculations, while the sensor nodes in the network have limited battery power and computational capability. For our proposed scheme we used a network model similar to the model used in [2,14], and is shown in Fig. 2. …”

Section: N1mentioning

confidence: 99%

“…The efficiency of a mobile agent-based data aggregation and collection scheme depends upon the agent migration scheme, which affects the overall energy consumption and aggregation cost [5]. The solutions that have been proposed until now, are either using a centralized approach [6][7][8][9][10][11][12][13][14] or a dynamic and distributed approach [15][16][17][18] to determine the migration paths of the agents. In a dynamic and distributed approach, the migration path of an agent is determined using local information at each host, while in a centralized approach, it is pre-computed at the sink node before an agent is dispatched and it is based on the global information of the network topology.…”

Section: Introductionmentioning

confidence: 99%

“…When all mobile agent clones return to the root node SNi, they handover the collected data to the mobile agent, MAj. We used three metrics, which are called the average energy consumption, the overall response time, and the success rate of agent's trip, to evaluate the performance of the CDDAM scheme in comparison with the previous schemes of CBID [2], TBID [14], and MMADIDD [19]. The CBID [2] and TBID [14] schemes are well known centralized approach-based agent migration schemes. However, MMADIDD [19] is a distributed approach-based agent migration scheme.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

An Energy Efficient Distributed Approach-Based Agent Migration Scheme for Data Aggregation in Wireless Sensor Networks

2014

J Inf Process Syst

View full text Add to dashboard Cite

The use of mobile agents for collaborative processing in wireless sensor network has gained considerable attention. This is when mobile agents are used for data aggregation to exploit redundant and correlated data. The efficiency of agent-based data aggregation depends on the agent migration scheme. However, in general, most of the proposed schemes are centralized approach-based schemes where the sink node determines the migration paths for the agents before dispatching them in the sensor network. The main limitations with such schemes are that they need global network topology information for deriving the migration paths of the agents, which incurs additional communication overhead, since each node has a very limited communication range. In addition, a centralized approach does not provide fault tolerant and adaptive migration paths. In order to solve such problems, we have proposed a distributed approach-based scheme for determining the migration path of the agents where at each hop, the local information is used to decide the migration of the agents. In addition, we also propose a local repair mechanism for dealing with the faulty nodes. The simulation results show that the proposed scheme performs better than existing schemes in the presence of faulty nodes within the networks, and manages to report the aggregated data to the sink faster.

show abstract

Section: Centralized Approach-based Schemesmentioning

confidence: 99%

Section: Distributed Approach-based Schemesmentioning

confidence: 99%

Section: N1mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An Energy Efficient Distributed Approach-Based Agent Migration Scheme for Data Aggregation in Wireless Sensor Networks

2014

J Inf Process Syst

View full text Add to dashboard Cite

show abstract

Mobile agent itinerary planning for WSN data fusion: considering multiple sinks and heterogeneous networks

Gavalas

Venetis

Konstantopoulos

et al. 2016

Int J Communication

Self Cite

View full text Add to dashboard Cite

Mobile agent (MA)-based middleware has been thoroughly investigated in the past few years as a means to address the efficiency, scalability, and reliability issues of data fusion applications on wireless sensor networks. Deriving an efficient itinerary for each MA to follow is of high importance, because itineraries determine to a large extent the overall performance of data fusion tasks. In this article, we present a novel algorithmic approach for efficient itinerary planning of MA objects undertaking data fusion tasks. We adopt a method based on iterated local search to construct the itineraries (ie, visiting sequences of source nodes) assigned to multiple traveling MAs. We apply alternative optimization criteria which aim either at minimizing the overall energy expenditure over all derived MA itineraries or prolonging the network lifetime. Furthermore, we propose algorithmic solutions for 2 realistic settings which have not been investigated in the past: firstly, the employment of multiple sinks that share the responsibility of MA-based data fusion tasks across the sensor field, and secondly, the consideration of heterogeneous sensor networks comprising nodes powerful enough to host the runtime environment required to execute MA code as well as "ordinary" nodes which lack these resources. Simulation tests verify the performance gain attained by our algorithmic methods against alternative itinerary planning approaches which involve multiple MAs.

show abstract

PRWSN: A Hybrid Routing Algorithm with Special Parameters in Wireless Sensor Network

Delavar

Artin

Tajari

2011

Communications in Computer and Information Science

View full text Add to dashboard Cite

Effective Determination of Mobile Agent Itineraries for Data Aggregation on Sensor Networks

Cited by 81 publications

References 32 publications

An Energy Efficient Distributed Approach-Based Agent Migration Scheme for Data Aggregation in Wireless Sensor Networks

An Energy Efficient Distributed Approach-Based Agent Migration Scheme for Data Aggregation in Wireless Sensor Networks

Mobile agent itinerary planning for WSN data fusion: considering multiple sinks and heterogeneous networks

PRWSN: A Hybrid Routing Algorithm with Special Parameters in Wireless Sensor Network

Contact Info

Product

Resources

About