scholarly journals MINDS: Mobile Agent Itinerary Planning Using Named Data Networking in Wireless Sensor Networks

2021 ◽  
Vol 10 (2) ◽  
pp. 28
Author(s):  
Saeid Pourroostaei Ardakani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Mobile Agent ◽  
Network Traffic ◽  
Mobile Agents ◽  
Route Planning ◽  
Wireless Sensor ◽  
Named Data Networking ◽  
Sensory Data

Mobile agents have the potential to offer benefits, as they are able to either independently or cooperatively move throughout networks and collect/aggregate sensory data samples. They are programmed to autonomously move and visit sensory data stations through optimal paths, which are established according to the application requirements. However, mobile agent routing protocols still suffer heavy computation/communication overheads, lack of route planning accuracy and long-delay mobile agent migrations. For this, mobile agent route planning protocols aim to find the best-fitted paths for completing missions (e.g., data collection) with minimised delay, maximised performance and minimised transmitted traffic. This article proposes a mobile agent route planning protocol for sensory data collection called MINDS. The key goal of this MINDS is to reduce network traffic, maximise data robustness and minimise delay at the same time. This protocol utilises the Hamming distance technique to partition a sensor network into a number of data-centric clusters. In turn, a named data networking approach is used to form the cluster-heads as a data-centric, tree-based communication infrastructure. The mobile agents utilise a modified version of the Depth-First Search algorithm to move through the tree infrastructure according to a hop-count-aware fashion. As the simulation results show, MINDS reduces path length, reduces network traffic and increases data robustness as compared with two conventional benchmarks (ZMA and TBID) in dense and large wireless sensor networks.

scholarly journals Multi-mobile agent itinerary planning algorithms for data gathering in wireless sensor networks: A review paper

2017 ◽  
Vol 13 (1) ◽  
pp. 155014771668484 ◽  
Author(s):  
Huthiafa Q Qadori ◽  
Zuriati A Zulkarnain ◽  
Zurina Mohd Hanapi ◽  
Shamala Subramaniam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Agent ◽  
Mobile Agents ◽  
Single Agent ◽  
Data Gathering ◽  
Optimal Number ◽  
Wireless Sensor ◽  
Itinerary Planning ◽  
Multi Agent

Recently, wireless sensor networks have employed the concept of mobile agent to reduce energy consumption and obtain effective data gathering. Typically, in data gathering based on mobile agent, it is an important and essential step to find out the optimal itinerary planning for the mobile agent. However, single-agent itinerary planning suffers from two primary disadvantages: task delay and large size of mobile agent as the scale of the network is expanded. Thus, using multi-agent itinerary planning overcomes the drawbacks of single-agent itinerary planning. Despite the advantages of multi-agent itinerary planning, finding the optimal number of distributed mobile agents, source nodes grouping, and optimal itinerary of each mobile agent for simultaneous data gathering are still regarded as critical issues in wireless sensor network. Therefore, in this article, the existing algorithms that have been identified in the literature to address the above issues are reviewed. The review shows that most of the algorithms used one parameter to find the optimal number of mobile agents in multi-agent itinerary planning without utilizing other parameters. More importantly, the review showed that theses algorithms did not take into account the security of the data gathered by the mobile agent. Accordingly, we indicated the limitations of each proposed algorithm and new directions are provided for future research.

An Improved Congestion Control Mechanism Based on Mobile Agent for Wireless Sensor Networks

2014 ◽  
Vol 519-520 ◽  
pp. 1239-1242
Author(s):  
Xiao Hu Yu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Congestion Control ◽  
Mobile Agent ◽  
Mobile Agents ◽  
Control Mechanism ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Routing Table ◽  
Congestion Control Mechanism

An improved congestion control mechanism based on mobile agent for wireless sensor networks is proposed, which includes node-level congestion and link-level congestion control. The formers congestion information is collected and distributed by mobile agents (MA). When mobile agent travels through the networks, it can select a less-loaded neighbor node as its next hop and update the routing table according to the nodes congestion status. Minimum package of node outgoing traffic was preferentially transmitted in the link-level congestion. Simulation result shows that proposed mechanism attains high delivery ratio and throughput with reduced delay when compared with the existing technique.

Mobile agent-based energy-aware and user-centric data collection in wireless sensor networks

2014 ◽  
Vol 74 ◽  
pp. 58-70 ◽  
Author(s):  
Mianxiong Dong ◽  
Kaoru Ota ◽  
Laurence T. Yang ◽  
Shan Chang ◽  
Hongzi Zhu ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Mobile Agent ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Agent Based ◽  
User Centric

scholarly journals A SURVEY ON MOBILE AGENT ITINERARY PLANNING IN WIRELESS SENSOR NETWORKS

2016 ◽  
pp. 180-185
Author(s):  
LINGARAJ. K ◽  
ARADHANA. D
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Agent ◽  
Wireless Sensor ◽  
Important Research ◽  
Itinerary Planning ◽  
Sensory Data ◽  
Multi Agent ◽  
Data Source ◽  
Application Aware

It has been proven recently that using Mobile Agent (MA) in wireless sensor networks (WSNs) can drastically help to obtain the flexibility of application-aware deployment. Normally, in any MA based sensor network, it is an important research issue to find out an optimal itinerary for the MA in order to achieve efficient and effective data collection from multiple sensory data source nodes. In this paper, we firstly investigate a number of conventional single MA itinerary planning based schemes, and then indicate some shortcomings of these schemes, since only one MA is used by them. Having these investigations and analysis, novel Multi-agent Itinerary Planning (MIP) algorithms to address the shortcomings of large latency and global unbalancing of using single MA and its effectiveness is proved by conducting the extensive experiments in professional environment.

Sign in / Sign up

Export Citation Format

Share Document