rahul gupta, 601303023, thesis presentation

Cop

yrig

ht 2

013-

2014

Firefly based Optimized Routing Over MANETs

THAPAR UNIVERSITY, PATIALA Monday, May 1, 2023

Presented By:Rahul Gupta

601303023Supervisor:

Dr. Rajesh KumarAssociate Professor, CSED

Cop

yrig

ht 2

013-

2014

Firefly Algorithm

• Given by Xin-She Yang in 2008.

• Overview Based on flashing patterns of

fireflies and their behaviour [1]. Two primary functionalities are

implemented by these flashing patterns, one is to attract other firefly and second is to warn other firefly of the harshness of the firefly.

The effectiveness of the algorithm depends upon the communication among the fireflies, which, in turn, depends on the flashing pattern that is directly proportional to intensity of the flashes.

Monday, May 1, 2023THAPAR UNIVERSITY, PATIALA 2

Cop

yrig

ht 2

013-

2014

Mobile Ad Hoc Networks (MANETs)

• A MANETs is a network without the aid of any fixed infrastructure, in which nodes belonging to the MANETs can either act as end-points or routers.

• The mobile nodes that are in radio range of each other can directly communicate, whereas others needs the aid of intermediate nodes to route their packets.

• Characteristics of MANETs Distributed operation Multi hop routing Dynamic Topology Light-weight terminals

• Issues with MANETs Node Mobility Lack of Central Control


SI

D

Cop

yrig

ht 2

013-

2014

Classification of MANETs


MANETS is classified [3] as • Proactive

Maintain the routing information even before required.

• Reactive Searches for the path in on-

demand manner (i.e. whenever required) and then establishes the connection.

• Hybrid Uses both proactive as well

reactive mechanism at different stages.

Cop

yrig

ht 2

013-

2014

Literature Review


Cop

yrig

ht 2

013-

2014

Literature Review (contd.)


Cop

yrig

ht 2

013-

2014

Problem Statement and Objectives

• The Problem here is to improve the efficiency of route acquisition phase of routing in Mobile Ad Hoc Networks using firefly algorithms.

• After formulating the problem, following objectives were identified.– To study and review various firefly optimization

techniques for different problems.– To design and develop efficient firefly based routing

algorithm for MANETs.– To verify the proposed firefly based algorithm and

compare it with standard MANETs routing protocol.


Cop

yrig

ht 2

013-

2014

Proposed Algorithm


Cop

yrig

ht 2

013-

2014

1. 50X5 swarm array

2. 50X1 local

3. Local best is selected

4. Communication

among fireflies

5. Global maximum is

selected


Route Acquisition

Cop

yrig

ht 2

013-

2014

1. β0 is the attractiveness

2. γ is the light absorption

coefficient

3. r1 is the distance computed in

terms of deviation between the

nodes as

4. k is the number of input

parameters

5. a is the randomization parameter

6. e is the vector of random number

drawn from a Gaussian

distribution.Monday, May 1, 2023THAPAR UNIVERSITY,

PATIALA 10

Route Update

Cop

yrig

ht 2

013-

2014For Simulation, NS-2.35 simulator is used and snapshots of NAM file at time t

= 174.559560s and t = 369.169978s are shown above. Nam file is the visualization of node movements which shows how nodes interact with each other and how they send and receive packets.


Results

Cop

yrig

ht 2

013-

2014

As shown in figure, the results obtained from proposed algorithm is better than AOMDV algorithm. More number of packets are delivered by proposed algorithms. Packets delivery ratio is continuously increasing after a certain number of nodes.


Results (contd.)

Cop

yrig

ht 2

013-

2014

The figure shows that the proposed algorithm loses lesser number of packets as compared to AOMDV algorithm.


Results (contd.)

Cop

yrig

ht 2

013-

2014

More throughput is given by the proposed algorithm than AOMDV algorithm as shown in figure. The proposed algorithm gives more throughput as every time next hop is chosen on basis of several parameters using firefly algorithm. This helps in choosing best available neighbour node.


Results (contd.)

Cop

yrig

ht 2

013-

2014

The End-to-End delay for the proposed algorithm is lesser as compared to AOMDV algorithm as best among all the next hop is chosen at every step as shown in figure.


Results (contd.)

Cop

yrig

ht 2

013-

2014

Contribution to society or Research

• The algorithm presented here can be used in a network environment when there is need of– Adaptive routing to topology changes.– Routing with mobile nodes–Multicast routing


Cop

yrig

ht 2

013-

2014

Conclusion and Future Work

• Simulation results shows that the proposed algorithm outperforms AOMDV with respect to packet delivery ratio, packet loss, throughput and delay.

• The algorithm was capable to handle network latency and offers better network lifetime, and it can promptly adapt to a changing network status.

• In future, an efficient probability distribution model can be formulated that can optimally utilize the features of the proposed scheme in real time environment.


Cop

yrig

ht 2

013-

2014

Publications and Placement

• Publication– Rahul Gupta and Dr. Rajesh Kumar, “Firefly based Routing

for Optimized Transmission over MANETs”, i-Manager’s Journal of Mobile Applications and Technology. [Status: Communicated and under full paper review].

• Placement– Tavant Technologies in Bangalore for the role of Quality

Engineer.


Cop

yrig

ht 2

013-

2014

References1. X. Yang. "Nature-inspired optimization algorithms". Elsevier, 2014.2. Aarti, S. Tyagi. “Study Of Manet: Characteristics, Challenges, Application And Security Attacks”.

International Journal of Advanced Research in Computer Science and Software Engineering, Vol. 3, No. 5, pp. 252-257, 2013.

3. M. Abolhasan, T. Wysocki, and E. Dutkiewicz. "A review of routing protocols for mobile ad hoc networks". Ad hoc networks, Vol. 2, No. 1, pp. 1-22, 2004.

4. M. Golshahi, M. Mosleh, M. Kheyrandish. "Implementing an ACO routing algorithm for AD-HOC networks". IEEE International Conference on Advanced Computer Theory and Engineering, ICACTE'08, held at Phuket, Thailand, pp. 143-147, Dec. 2008.

5. Y. Ko, N. Vaidya. "Location‐Aided Routing (LAR) in mobile ad hoc networks". Wireless Networks, Vol. 6, No. 4, pp. 307-321, 2000.

6. C. Daniel, A. Loureiro. "A gps/ant-like routing algorithm for ad hoc networks". IEEE Wireless Communications and Networking Conference, WCNC, held at Chicago, IL, USA, Vol. 3, pp. 1232-1236, Sept. 2000.

7. S. Marwaha, C. Tham, and D. Srinivasan. "A novel routing protocol using mobile agents and reactive route discovery for ad hoc wireless networks". 10th IEEE International Conference on Networks, ICON, held at Grand Copthorne Waterfront, Singapore, pp. 311-316, Aug. 2002.

8. C. Caro, M. Dorigo. “AntNet: A mobile agents approach to adaptive routing”. Ninth Dutch Conference on Artificial Intelligence (NAIC '97), technical report IRIDIA/97-12, held at Antwerpen, Belgium, Nov. 1997.


Cop

yrig

ht 2

013-

2014

References (contd.)9. J. S. Baras and H. Mehta. “A Probabilistic Emergent Routing Algorithm (PERA) for Mobile Ad Hoc

Networks". Proceedings of WiOpt ’03: Modeling and Optimization in Mobile, AdHoc and Wireless Networks, held at Sophia-Antipolis, France, Mar. 2003.

10. Z. Yuan-Yuan, H. Yan-Xiang. "Ant routing algorithm for mobile ad-hoc networks based on adaptive improvement". Proceedings of the IEEE International Conference on Wireless Communications, Networking and Mobile Computing, held at China, Vol. 2, pp. 678-681, Sept. 2005.

11. D. Kumar, S. Bhuvaneswaran. "Proposal on multi agent ants based routing algorithm for mobile ad-hoc networks". International Journal of Computer Science and Network Security, IJCSNS, Vol. 7, No. 6, pp. 260-268, 2007.

12. J. Wang, E. Osagie, P. Thulasiraman, R. Thulasiram. "HOPNET: A hybrid ant colony optimization routing algorithm for mobile ad hoc network". Ad Hoc Networks, Vol. 7, No. 4, pp. 690-705, 2009.

13. E. Osagie , P. Thulasiraman, R. Thulasiram. "PACONET: imProved ant colony optimization routing algorithm for mobile ad hoc networks". 22nd IEEE International Conference on Advanced Information Networking and Applications, AINA 2008, held at GinoWan, Okinawa, Japan, pp. 204-211, Mar. 2008.

14. A. M. Elmoniem, H. M. Ibrahim, M. H. Mohamed and A. R. Hedar. “Ant Colony and Load Balancing Optimizations for AODV Routing Protocol”. Ant Colony and Load Balancing Optimizations for AODV Routing Protocol, Vol. 1, No. 1, pp. 1-14, 2012.

15. G. Singh, N. Kumar, A. K. Verma. “ANTALG : An Innovative ACO based Routing Algorithm for MANETs”. Journal of Network and Computer Applications, Vol. 45, pp. 151-167, 2014.


Cop

yrig

ht 2

013-

2014

Thank You


rahul gupta, 601303023, thesis presentation

Documents