A Review of Computation Solutions by Mobile Agents in an Unsafe Environment
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2013, Vol 4, Issue 4
Abstract
Exploration in an unsafe environment is one of the major problems that can be seen as a basic block for many distributed mobile protocols. In such environment we consider that either the nodes (hosts) or the agents can pose some danger to the network. Two cases are considered. In the first case, the dangerous node is a called black hole, a node where incoming agents are trapped, and the problem is for the agents to locate it. In the second case, the dangerous agent is a virus; an agent moving between nodes infecting them, and the problem is for the “good” agents to capture it, and decontaminate the network. In this paper, we present several solutions for a black–hole and network decontamination problems. Then, we analyze their efficiency. Efficiency is evaluated based on the complexity, and the effort is in the minimization of the number of simultaneous decontaminating elements active in the system while performing the decontamination techniques.
Authors and Affiliations
Anis Zarrad, Yassine Daadaa
Keywords
Related Articles
- EP ID EP146264
- DOI 10.14569/IJACSA.2013.040415
- Views 100
- Downloads 0
An Adaptive Intrusion Detection Method for Wireless Sensor Networks
Current intrusion detection systems for Wireless Sensor Networks (WSNs) which are usually designed to detect a specific form of intrusion or only applied for one specific type of network structure has apparently restrict...
LASyM: A Learning Analytics System for MOOCs
Nowadays, the Web has revolutionized our vision as to how deliver courses in a radically transformed and enhanced way. Boosted by Cloud computing, the use of the Web in education has revealed new challenges and looks for...
Sectorization of Full Kekre’s Wavelet Transform for Feature extraction of Color Images
An innovative idea of sectorization of Full Kekre’s Wavelet transformed (KWT)[1] images for extracting the features has been proposed. The paper discusses two planes i.e. Forward plane (Even plane) and backward plane (Od...
: Optimized Min-Sum Decoding Algorithm for Low Density Parity Check Codes
Low Density Parity Check (LDPC) code approaches Shannon–limit performance for binary field and long code lengths. However, performance of binary LDPC code is degraded when the code word length is small. An op...
Classified Arabic Documents Using Semi-Supervised Technique
In this work, we test the performance of the Naïve Bayes classifier in the categorization of Arabic text. Arabic is rich and unique in its own way and has its own distinct features. The issues and characteristics of Arab...