International Symposium on Computer Science and Its Applications 2008
DOI: 10.1109/csa.2008.34
|View full text |Cite
|
Sign up to set email alerts
|

NPASA: A Noble Path Selection Algorithm

Abstract: As the network is growing exponentially, challenges and issues also increases. They affect the performance of the network.Many factors contribute to improve the performance of the network. One such factor is finding the path quickly. In this paper, we are going to find a shortest path faster compared to Dijkstra's shortest path algorithm. We have introduced new ideas in building the end-to-end path. Various steps involved in finding the shortest path are refined. The simulated algorithm shows better results th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…The WLAN performance is impacted by many factors which include topology, types of links, and qualifications of the software and hardware [2]. The performance of the network is also influenced by the calculation overhead and operation overload [3]. ITU-T standard E.800 states the required QoS which indicates consumer satisfaction about the service provider and their loyalty [4].…”
Section: Introductionmentioning
confidence: 99%
“…The WLAN performance is impacted by many factors which include topology, types of links, and qualifications of the software and hardware [2]. The performance of the network is also influenced by the calculation overhead and operation overload [3]. ITU-T standard E.800 states the required QoS which indicates consumer satisfaction about the service provider and their loyalty [4].…”
Section: Introductionmentioning
confidence: 99%
“…Neighbor node density: Average number of neighbor nodes per node. This paper studies the above mentioned aspects related to the performance of the ad hoc network using MATLAB simulation with areas of different shape using Dijkstra's shortest path routing algorithm [10][11][12][13][14].…”
Section: Introductionmentioning
confidence: 99%