Routing Protocols and Graph Theory Algorithms for Mobile Ad Hoc Networks
Latest Publications

TOTAL DOCUMENTS

19

(FIVE YEARS 0)

H-INDEX

1

(FIVE YEARS 0)

Published By IGI Global

9781522522270

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Dijkstra Algorithm for Minimum Weight Path Routing

Routing Protocols and Graph Theory Algorithms for Mobile Ad Hoc Networks ◽

10.4018/978-1-5225-2227-0.les6 ◽

2017 ◽

pp. 2417-3355

Author(s):

Natarajan Meghanathan

Keyword(s):

Minimum Weight ◽

Dijkstra Algorithm

Download Full-text

Breadth First Search

Routing Protocols and Graph Theory Algorithms for Mobile Ad Hoc Networks ◽

10.4018/978-1-5225-2227-0.les3 ◽

2017 ◽

pp. 971-1411

Author(s):

Natarajan Meghanathan

Keyword(s):

Breadth First Search

Download Full-text

Heuristic For Degree-Based Minimum Connected Dominating Sets

Routing Protocols and Graph Theory Algorithms for Mobile Ad Hoc Networks ◽

10.4018/978-1-5225-2227-0.les16 ◽

2017 ◽

pp. 9449-9990

Author(s):

Natarajan Meghanathan

Keyword(s):

Dominating Sets ◽

Connected Dominating Sets

Download Full-text

Graph Theoretic Algorithms for Multi-Path Routing

Routing Protocols and Graph Theory Algorithms for Mobile Ad Hoc Networks ◽

10.4018/978-1-5225-2227-0.les10 ◽

2017 ◽

pp. 5643-6124

Author(s):

Natarajan Meghanathan

Keyword(s):

Graph Theoretic

Download Full-text

Floyd's All Pairs Minimum Weight Paths Algorithm

Routing Protocols and Graph Theory Algorithms for Mobile Ad Hoc Networks ◽

10.4018/978-1-5225-2227-0.les8 ◽

2017 ◽

pp. 4442-5248

Author(s):

Natarajan Meghanathan

Keyword(s):

Download Full-text

Graph Theory Basics

Routing Protocols and Graph Theory Algorithms for Mobile Ad Hoc Networks ◽

10.4018/978-1-5225-2227-0.les2 ◽

2017 ◽

pp. 476-971

Author(s):

Natarajan Meghanathan

Keyword(s):

Download Full-text

Max-Min Bottleneck Path Protocol and Algorithm

Routing Protocols and Graph Theory Algorithms for Mobile Ad Hoc Networks ◽

10.4018/978-1-5225-2227-0.les11 ◽

2017 ◽

pp. 6124-7031

Author(s):

Natarajan Meghanathan

Download Full-text

Bellman-Ford Algorithm for Minimum Weight Path Routing

Routing Protocols and Graph Theory Algorithms for Mobile Ad Hoc Networks ◽

10.4018/978-1-5225-2227-0.les7 ◽

2017 ◽

pp. 3355-4442

Author(s):

Natarajan Meghanathan

Keyword(s):

Download Full-text

Heuristic For Link Weight-Based Minimum Connected Dominating Sets

Routing Protocols and Graph Theory Algorithms for Mobile Ad Hoc Networks ◽

10.4018/978-1-5225-2227-0.les18 ◽

2017 ◽

pp. 10415-11287

Author(s):

Natarajan Meghanathan

Keyword(s):

Dominating Sets ◽

Connected Dominating Sets ◽

Download Full-text

Heuristic For Node Weight-Based Minimum Connected Dominating Sets

Routing Protocols and Graph Theory Algorithms for Mobile Ad Hoc Networks ◽

10.4018/978-1-5225-2227-0.les17 ◽

2017 ◽

pp. 9990-10415

Author(s):

Natarajan Meghanathan

Keyword(s):

Dominating Sets ◽

Connected Dominating Sets ◽

Download Full-text