Agents In Wireless Sensor Networks Research Articles

Energy-efficient data-aggregation for optimizing quality of service using mobile agents in wireless sensor network

<p>Quality of service (QoS) is essential for carrying out data transmission using resource-constrained sensor nodes in wireless sensor network (WSN). The introduction of mobile agent-based data aggregation is reported to offer energy efficiency; however, it has limitations, especially using a single mobile agent, where QoS optimization is not feasible. A review of existing studies showcases some dedicated attempts to use a mobile agent-based approach and address QoS enhancements. However, they were never combined studied. Therefore, this paper introduces a unique concept of retaining maximum QoS performance during data aggregation using a single mobile agent. The model introduces a unique communication framework, transmission provisioning using exceptional routine management, and simplified energy modeling. The proposed model has aimed for a lower delay and faster data aggregation speed with lower consumption of transmittance energy. The implementation and assessment of the model are carried out considering the challenging environment of WSN with multiple scales of data priority. The proposed model also contributes to evolving out with simplified communication vectors in a highly decentralized method. MATLAB's simulation outcome shows that the proposed system offers better delay performance, optimal energy management, and faster response time than existing schemes.</p>

CDS-MIP: CDS-based Multiple Itineraries Planning for mobile agents in wireless sensor network

using multi agents in the wireless sensor networks (WSNs) for aggregating data has gained significant attention. Planning the optimal itinerary of the mobile agent is an essential step before the process of data gathering. Many approaches have been proposed to solve the problem of planning MAs itineraries, but all of those approaches are assuming that the MAs visit all SNs and large number of intermediate nodes. This assumption imposed a burden; the size of agent increases with the increase in the visited SNs, therefore consume more energy and spend more time in its migration. None of those proposed approaches takes into account the significant role that the connected dominating nodes play as virtual infrastructure in such wireless sensor networks WSNs. This article introduces a novel energy-efficient itinerary planning algorithmic approach based on the minimum connected dominating sets (CDSs) for multi-agents dedicated in data gathering process. In our proposed approach, instead of planning the itineraries over all sensor nodes SNs, we plan the itineraries among subsets of the MCDS in each cluster. Thus, no need to move the agent in all the SNs, and the intermediate nodes (if any) in each itinerary will be few. Simulation results have demonstrated that our approach is more efficient than other approaches in terms of overall energy consumption and task execution time.

Determination of Itinerary Planning for Multiple Agents in Wireless Sensor Networks

The mobile agent is a new technology in wireless sensor networks that outperforms the traditional client/server architecture in terms of energy consumption, end to end delay and packet delivery ratio. Single mobile agent will not be efficient for large scale networks. Therefore, the use of multiple mobile agents will be an excellent solution to resolve the problem of the task duration especially for this kind of networks. The itinerary planning of mobile agents represents the main challenge to achieve the trade-off between energy consumption and end to end delay. In this article we present a new algorithm named Optimal Multi-Agents Itinerary Planning (OMIP). The source nodes are grouped into clusters and the sink sends a mobile agent to the cluster head of every cluster; which migrates between source nodes, collects and aggregates data before returning to the sink. The results of the simulations testify the efficiency of our algorithm against the existing algorithms of multi-agent itinerary planning. The performance gain is evident in terms of energy consumption, accumulated hop count and end to end delay of the tasks in the network.

A new Itinerary planning approach among multiple mobile agents in wireless sensor networks (WSN) to reduce energy consumption

one of the important challenges in wireless sensors networks (WSN) resides in energy consumption. In order to resolve this limitation, several solutions were proposed. Recently, the exploitation of mobile agent technologies in wireless sensor networks to optimize energy consumption attracts researchers. Despite their advantage as an ambitious solution, the itineraries followed by migrating mobile agents can surcharge the network and so have an impact on energy consumption. Many researches have dealt with itinerary planning in WSNs through the use of a single agent (SIP: Single agent Itinerary Planning) or multiple mobile agents (MIP: Multiple agents Itinerary Planning). However, the use of multi-agents causes the emergence of the data load unbalancing problem among mobile agents, where the geographical distance is the unique factor motivating to plan the itinerary of the agents. The data balancing factor has an important role especially in Wireless sensor networks multimedia that owns a considerable volume of data size. It helps to optimize the tasks duration and thus optimizes the overall answer time of the network. In this paper, we provide a new MIP solution (GIGM-MIP) which is based not only on geographic information but also on the amount of data provided by each node to reduce the energy consumption of the network. The simulation experiments show that our approach is more efficient than other approaches in terms of task duration and the amount of energy consumption.

Directional Itinerary Planning for Multiple Mobile Agents in Wireless Sensor Networks

Currently, the majority of research in the area of wireless sensor networks (WSNs) is directed towards optimizing energy use during itinerary planning by mobile agents (MAs). The route taken by the MA when migrating can get a significant effect on energy consumption and the lifespan of the network. Conversely, finding an ideal arrangement of Source Nodes (SNs) for mobile agents to visit could be a problematic issue. It is within this framework that this work focused on solving certain problems related to itinerary planning based on a multimobile agent (MMA) strategy in networks. The objective of our research was to increase the lifespan of sensor networks and to diminish the length of the data collection task. In order to achieve our objective, we proposed a new approach in WSNs, which took into consideration the criterion of an appropriate number of MAs, the criterion of the appropriate grouping of SNs, and finally the criterion of the optimal itinerary followed by each MA to visit all its SNs. Thus, we suggested an approach that may be classified as a centralized planning model where the itinerary schedule is entirely shaped by the base station (sink) which, unlike other approaches, is no longer constrained by energy consumption. A series of simulations to measure the performance of the new planning process was also carried out.

A review on the applications of multiagent systems in wireless sensor networks

Nowadays, the efficiency of multiagent systems in wireless sensor networks prompts the researchers to use these emerging mobile software packets in different simulated approaches or real-world applications. Heterogeneous and distributed wireless sensor networks could be integrated with the multiagent systems to map the real-world challenges into the artificial intelligence world. The multiagent systems have been applied from simulated approaches like object detection/tracking, healthcare, control/assistant, and security systems to real-world applications, including medical/human-care systems and unmanned aerial vehicles. Furthermore, the integration of wireless sensor networks with multiagent systems have emerged novel application, which is known as mobile robots. However, the extensive use of mobile agents in wireless sensor networks has posed different challenges for researchers, including security, resource, and timing limitation. In this work, we review recent simulated approaches and real-world applications of multiagent systems in wireless sensor networks, in which a set of common factors about the things that have been studied are extracted and compared to analyze the performance of mobile agent–based systems in the wireless sensor networks, as well. This analysis provides new research directions about multiagent systems in wireless sensor networks for interested researchers. Finally, a novel framework for dealing with the challenges of multiagent-based applications in the wireless sensor networks which have been mentioned is suggested.

CDS-MIP: CDS-based Multiple Itineraries Planning for mobile agents in wireless sensor network

using multi agents in the wireless sensor networks (WSNs) for aggregating data has gained significant attention. Planning the optimal itinerary of the mobile agent is an essential step before the process of data gathering. Many approaches have been proposed to solve the problem of planning MAs itineraries, but all of those approaches are assuming that the MAs visit all SNs and large number of intermediate nodes. This assumption imposed a burden; the size of agent increases with the increase in the visited SNs, therefore consume more energy and spend more time in its migration. None of those proposed approaches takes into account the significant role that the connected dominating nodes play as virtual infrastructure in such wireless sensor networks WSNs. This article introduces a novel energy-efficient itinerary planning algorithmic approach based on the minimum connected dominating sets (CDSs) for multi-agents dedicated in data gathering process. In our proposed approach, instead of planning the itineraries over all sensor nodes SNs, we plan the itineraries among subsets of the MCDS in each cluster. Thus, no need to move the agent in all the SNs, and the intermediate nodes (if any) in each itinerary will be few. Simulation results have demonstrated that our approach is more efficient than other approaches in terms of overall energy consumption and task execution time.

Delay sensitive data routing optimization using rendezvous agents in wireless sensor networks with mobile sink

The method of data collection and transmission of delay sensitive data often relies on mobile sink in wireless sensor networks. This is either by transmitting directly to the mobile sink if the mobile sink is in the reachable range of the sensor that is intended to send the data, or by using the route established by the hop level sensors between the sensors that are intended to send the data and the mobile sink. The constraint of this strategy can portray as the energy consumption due to the suboptimal methods of routing between source sensor and mobile sink and the fault intolerance in data collection and transmission sequence. Hence, it is obvious to conclude that the significant contributions required about the design of optimal data collection and transmitting strategies for energy efficient and fault tolerant delay sensitive data transmission in wireless sensor networks with mobile sink. According to the context of these objectives stated, this manuscript portrayed a ‘Delay Sensitive Data Routing Optimization using Rendezvous Agents’ for energy efficient and fault tolerant delay sensitive data transmission in wireless sensor networks with mobile sink. The significance of the proposal was evaluated by experimental study using network simulation. Performance of the proposal is scaled by comparing the proposed model with the other contemporary model built under similar objectives. The traditional metrics are in use to compare and scale the performance of the proposal with the contemporary model.

A Mobile Agent Routing Protocol for Data Aggregation in Wireless Sensor Networks

Mobile agent data aggregation routing forwards mobile agents in wireless sensor network to collect and aggregate data. The key objective of data aggregation routing is to maximise the number of collected data samples at the same time as minimising network resource consumption and data collection delay. This paper proposes a mobile agent routing protocol, called zone-based mobile agent aggregation. This protocol utilises a bottom-up mobile agent migration scheme in which the mobile agents start their journeys from the centre of the event regions to the sink aiming to reduce the MA itinerary cost and delay and increase data aggregation routing accuracy. In addition, the proposed protocol reduces the impact of network architecture, event source distribution model and/or data heterogeneity on the performance of data aggregation routing.

EMIP: energy-efficient itinerary planning for multiple mobile agents in wireless sensor network

As software entities that migrate among nodes, mobile agents (MAs) are able to deliver and execute codes for flexible application re-tasking, local processing, and collaborative signal and information processing. In contrast to the conventional wireless sensor network operations based on the client---server computing model, recent research has shown the efficiency of agent-based data collection and aggregation in collaborative and ubiquitous environments. In this paper, we consider the problem of calculating multiple itineraries for MAs to visit source nodes in parallel. Our algorithm iteratively partitions a directional sector zone where the source nodes are included in an itinerary. The length of an itinerary is controlled by the angle of the directional sector zone in such a way that near-optimal routes for MAs can be obtained by selecting the angle efficiently in an adaptive fashion. Simulation results confirm the effectiveness of the proposed algorithm as well as its performance gain over alternative approaches.

Energy and trust aware mobile agent migration protocol for data aggregation in wireless sensor networks

Recently, the use of mobile agents in wireless sensor networks (WSNs) has emerged as the topic of extensive research due to their efficient utilization of network bandwidth and energy, and flexibility of their use for different WSN applications. Most of the proposed mobile agent based schemes use static itineraries for agents׳ migration that are computed at the sink using a centralized algorithm. These centralized algorithms require global knowledge of sensor distribution, which is difficult to obtain accurately. Other issue with static itinerary based agent migration is that an agent may not move along its itinerary due to node failures or malicious node attacks. In order to solve these issues, we first propose a framework for trust evaluation to identify the malicious behavior of sensor nodes and then give a localized distributed protocol, called energy and trust aware mobile agent migration (ETMAM) protocol for periodic data gathering application. The results of our simulation study show that the ETMAM protocol is effective in improving resilience against node failures or malicious nodes attacks.

Randomly Roving Agents in Wireless Sensor Networks

Quantitative characterization of randomly roving agents in wireless sensor networks (WSN) is studied. Below the formula simplifications, regarding the known results and publications, it is shown that the basic agent model is probabilistically equivalent to a similar simpler model and then a formula for frequencies is achieved in terms of combinatorial second kind Stirling numbers. Stirling numbers are well studied and different estimates are known for them letting to justify the roving agents quantitative characteristics.

Modelling Networked Agents’ Behaviour using Timed Hybrid Petri Nets

This paper deals with the modelling of networked identical agents. It focuses on the agent hybrid state representation and its dynamic behaviour, and their interaction with neighbour agents in wireless sensor networks. A framework for modelling this kind of systems specified by timed hybrid Petri nets (THPN) is presented. The state of an agent, expressed as a set of variables that can be either integer or real valued are represented in a THPN model, as well as their updating functions. The framework is illustrated through a case study regarding a sensor network.

Optimal itinerary planning for mobile multiple agents in WSN

Multi mobile agents based on data collection and aggregations have proved their effective in wireless sensor networks (WSN). However, the way in which these agents are deployed must be intelligently planned and should be adapted to the characteristics of wireless sensor networks. While most existing studies are based on the algorithms of itinerary planning for multiple agents i.e. determining the number of mobile agents (MAs) to be deployed, how to group source nodes for each MA, attributing the itinerary of each MA for its source nodes. These algorithms determine the efficiency or effectiveness of aggregation. This paper aims at presenting the drawbacks of these approaches in large-scale network, and proposes a method for grouping network nodes to determine the optimal itinerary based on multi agents using a minimum amount of energy with efficiency of aggregation in a minimum time. Our approach is based on the principle of visiting central location (VCL). The simulation experiments show that our approach is more efficient than other approaches in terms of the amount of energy consumed in relation with the efficiency of aggregation in a minimum time.

Balancing energy consumption with mobile agents in wireless sensor networks

For Wireless Sensor Networks (WSNs), an unbalanced energy consumption will decrease the lifetime of network. In this paper, we leverage mobile agent technology to investigate the problem of how to balance the energy consumption during data collection in WSNs. We first demonstrate that for a sensor network with uniform node distribution and constant data reporting, balancing the energy of the whole network cannot be realized when the distribution of data among sensor nodes is unbalanced. We design a method to mitigate the uneven energy dissipation problem by controlling the mobility of agents, which is achieved by an energy prediction strategy to find their positions. Finally, we propose energy balancing cluster routing based on a mobile agent (EBMA) for WSNs. To obtain better performance, the cluster structure is formed based on cellular topology taking into consideration the energy balancing of inter-cluster and intra-cluster environments. Extensive simulation experiments are carried out to evaluate EBMA with several performance criteria. Our simulation results show that EBMA can effectively balance energy consumption and perform high efficiency in large-scale network deployment.

Design of stateless weight-based routing algorithm for mobile Agent in WSN

In order to make the routing of mobile agents no longer depend on the network structure too much, a routing algorithm, called Stateless Weight Routing for Mobile Agent (SWR-MA), for mobile Agents in Wireless Sensor Networks (WSN) was presented. In SWR-MA, a weight metric was introduced which was related to the position of the nodes. By comparing the weights values, mobile Agents can determine their own routes automatically. SWR-MA can be applied when topological information of WSN changes such as in a network with mobile Sinks. The energy consumptions and the delays of the network can be reduced and the reliability of WSN can be improved by this protocol. Finally, a simulation evaluation was made to validate the performance of SWR-MA.

Group Migration by Mobile Agents in Wireless Sensor Networks

A wireless sensor network (WSN) consists of spatially distributed nodes that monitor physical conditions. Thus far, WSNs have been constructed for specific applications. However, in the future, system operators may want an existing WSN to deploy simultaneous applications. Existing studies have demonstrated the effectiveness of applying mobile agents to enable simultaneous applications in WSNs. However, two problems make the present form of mobile agents impractical for applications involving cooperation and group migration by mobile agents. The first problem is the lack of a suitable architecture enabling cooperation and interaction between agents, and the second is the lack of an efficient way of achieving group migration by agents in WSNs. To address these problems, we propose an architecture organized by mobile agents that has specific functionalities and that enables group migration by multiple agents.

Applications and design issues for mobile agents in wireless sensor networks

Recently, research interest has increased in the design, development, and deployment of mobile agent systems for high-level inference and surveillance in a wireless sensor network (WSN). Mobile agent systems employ migrating codes to facilitate flexible application re-tasking, local processing, and collaborative signal and information processing. This provides extra flexibility, as well as new capabilities to WSNs in contrast to the conventional WSN operations based on the client-server computing model. In this article we survey the potential applications of mobile agents in WSNs and discuss the key design issues for such applications. We decompose the agent design functionality into four components, that is, architecture, itinerary planning, middleware system design, and agent cooperation. This taxonomy covers low-level to high-level design issues and facilitates the creation of a component-based and efficient mobile agent system for a wide range of applications. With a different realization for each design component, it is expected that flexible trade-offs (e.g., between energy and delay) can be achieved according to specific application requirements.

Energy-efficient routing for mobile agents in wireless sensor networks

In wireless sensor networks, data fusion (in-network processing) is a critical issue because sensor networks are energy-constrained and bandwidth-constrained. Recently, a new scheme based on mobile agent has been proposed to solve the problem. The order and number of nodes on the route traversed by a mobile agent determine the energy consumption, and hence, they have a significant impact on the overall performance of the whole system. Considering the limited transmission range of sensor nodes, we showed that this routing problem in a multi-hop cluster could be modeled as a node-weighted traveling tourist problem (TTP). We proved that the problem was nondeterministic polynomial time (NP)-complete. Then we presented a new approximation algorithm to solve the problem. Simulation experiments demonstrate that the proposed heuristic is more energy-efficient than the two earlier ones.