Open Access Open Access  Restricted Access Subscription or Fee Access

Improved Energy Efficiency using Distributed Swarm Intelligence (DSI) in Wireless Mobile Networks

N. Kamal, Dr.J. Janet


Distributed Swarm Intelligence (DSI) is a relatively new paradigm being applied in a host of research settings to improve the management and control of large numbers of interacting entities such as communication, computer, mobile networks, satellite constellations and more. Distributed path computation is a core functionality of modern communication networks and is expected to remain so, even though some recent proposals contemplate the use of more centralized solutions and patterns. Depending on the mode of information dissemination and subsequent computation using the disseminated information, there are two broad classes of algorithms: (i) link-state algorithms and (ii) distance-vector algorithms. In both methods, nodes choose successor (next-hop) nodes for each destination based only on local information, along with this objective we are providing an additional algorithm i.e. Mobile Ants-Based Routing (MABR) with DSI to chosen better paths to the destination by effective in an appropriate manner. Using Ant Colony optimization with DSI for the distribution computation is the novel approach carried on which clearly shows the performance improvement of their QoS metrics based on the parameters viz. Delay, Data rate, Packets Received and Packets Lost were analyzed. We are able to achieve consistency across nodes, thus energy Efficiency using Distributed Swarm Intelligence (DSI) in Wireless Mobile Networks.


MABR-DSI, ACO, Wireless Mobile Networks, Distributive Computing

Full Text:



N. Feamster, H. Balakrishnan, J. Rexford, A. Shaikh, and K. van der Merwe, “The case for separating routing from routers,” in Proc. ACM SIGCOMM Workshop FDNA, Portland, OR, Sep. 2005, pp. 5–12.

A. Shankar, C. Alaettinoglu, K. Dussa-Zieger, and I. Matta, “Transient and steady-state performance of routing protocols: Distance-vector versus link-state,” Internetw.: Res. Exper., vol. 6, no. 2, pp. 59–87, Jun. 2004.

A. Myers, E. Ng, and H. Zhang, “Rethinking the service model: Scaling Ethernet to a million nodes,” presented at the ACM SIGCOMM Hot- Nets, San Diego, CA, 2004.

Y. Ohba, “Issues on loop prevention in MPLS networks,” IEEE Commun. Mag., vol. 37, no. 12, pp. 64–68, Dec. 2003. RAY et al.: ALWAYS ACYCLIC DISTRIBUTED PATH COMPUTATION 319

Gye-Jeong Kim, Seung-Cheon Baek, Hyun-Sook Lee, Han-Deok Lee, Moon Jeung Joe, " LGeDBMS: a small DBMS for embedded system with flash memory", 32nd international conference on very large data bases, pp. 1255~1258, 2006 .

John E. Canavan, "Fundamentals of Network Security", ARTECH HOUSE, INC., 2001, 61~62

Jonathan Knudsen, “WIRELESS JAVA : Developing with Java 2, Micro Edition”, A press, 2001, pp. 155.

“LGeDBMS: a Small DBMS for Embedded System with Flash Memory” Gye-Jeong Kim Seung-Cheon Baek Hyun-Sook Lee Han-Deok Lee Moon Jeung Joe Embedded System Technology Group, Information Technology Lab. LG Electronics Institute of Technology 16 Woomyeon-Dong, Seocho-Gu, Seoul, Korea.

“Rethinking the Service Model: Scaling Ethernet to a Million Nodes” Andy Myersy, T. S. Eugene Ngz, Hui Zhangy Carnegie Mellon University Rice University

“Swarm Intelligence Inspired Multicast Routing: an Ant Colony Optimization Approach” Xiao-Min Hu, Jun Zhang, and Li-Ming Zhang Department of Computer Science, Sun Yat-Sen University, Guangzhou, P.R. China.

“The Case for Separating Routing from Routers” Nick Feamster, Hari Balakrishnan Jennifer Rexford, Aman Shaikh, Jacobus van der Merwe MIT Computer Science & AI Lab AT&T Labs Research.

“Swarm Intelligence for Routing in Communication Networks” Kassabalidis, M.A. El-Sharkawi, R.J.Marks II, P. Arabshahi, A.A. Gray. Dept. of Electrical Eng., Box 352500, University of Washington, Seattle, WA 98195 USA, Jet Propulsion Laboratory, 4800 Oak Grove Drive, MS 238-343 Pasadena, CA 91109 USA


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.