Open AccessThis article is
- freely available
A Review of Routing Protocols Based on Ant-Like Mobile Agents
Department of Computer and Information Engineering, Nippon Institute of Technology, 4-1 Gakuendai, Miyashiro-machi, Saitama 345-8501, Japan
Received: 17 June 2013; in revised form: 15 July 2013 / Accepted: 31 July 2013 / Published: 6 August 2013
Abstract: A survey on the routing protocols based on ant-like mobile agents is given. These protocols are often employed in Mobile Ad Hoc Networks (MANET). Mobile Ad Hoc Networks are collections of wireless mobile nodes such as PDAs, laptop computers, and cellular phones having wireless communication capability that dynamically form a temporary network without using any existing network infrastructures such as wireless access points. The only infrastructure in MANET is the wireless communication interfaces on the devices. In such a circumstance, where some of the wireless devices are not within wireless range of each other, multi-hop routing is required to transmit messages to the destination. A node that wants to start communication with other nodes that are not within its one-hop wireless transmission range has to request intermediate nodes to forward their communication packets to the destination. In this paper, we survey a variety of proposed network protocols to accommodate this situation. We focus especially on biologically-inspired routing algorithms that are based on the ant colony optimization algorithm.
Keywords: MANET; ACO; routing P2P networks; mobile software agents; multi-agent system
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Kambayashi, Y. A Review of Routing Protocols Based on Ant-Like Mobile Agents. Algorithms 2013, 6, 442-456.
Kambayashi Y. A Review of Routing Protocols Based on Ant-Like Mobile Agents. Algorithms. 2013; 6(3):442-456.
Kambayashi, Yasushi. 2013. "A Review of Routing Protocols Based on Ant-Like Mobile Agents." Algorithms 6, no. 3: 442-456.