Reliability of Mobile Agents for Reliable Service Discovery Protocol in MANET
Roshni Neogy, Chandreyee Chowdhury, Sarmistha Neogy

TL;DR
This paper presents a Monte Carlo simulation-based algorithm to estimate the reliability of mobile agent systems in MANETs, considering node mobility, link failures, and radio propagation effects, to improve service discovery dependability.
Contribution
It introduces a novel reliability estimation algorithm for mobile agent systems in MANETs that accounts for mobility patterns and link failures, enhancing service discovery dependability.
Findings
The proposed algorithm effectively estimates route reliability.
Mobility patterns significantly impact MAS performance.
Optimal network bandwidth for agent support is identified.
Abstract
Recently mobile agents are used to discover services in mobile ad-hoc network (MANET) where agents travel through the network, collecting and sometimes spreading the dynamically changing service information. But it is important to investigate how reliable the agents are for this application as the dependability issues(reliability and availability) of MANET are highly affected by its dynamic nature.The complexity of underlying MANET makes it hard to obtain the route reliability of the mobile agent systems (MAS); instead we estimate it using Monte Carlo simulation. Thus an algorithm for estimating the task route reliability of MAS (deployed for discovering services) is proposed, that takes into account the effect of node mobility in MANET. That mobility pattern of the nodes affects the MAS performance is also shown by considering different mobility models. Multipath propagation effect of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
