Efficient Minimization of Routing Cost in Wireless Networks
This paper studies how to select a path with the minimum cost .the networks are characterized by limited computational and power source capabilities. Thus, it is necessary to provide an efficient method for producing routing decisions. Wireless networks do not have any fixed communication infrastru...
Main Authors: | Anas Ali Hussien, Sarah Yahia Ali |
---|---|
Format: | Article |
Language: | Arabic |
Published: |
Mustansiriyah University/College of Engineering
2013-06-01
|
Series: | Journal of Engineering and Sustainable Development |
Subjects: | |
Online Access: | https://jeasd.uomustansiriyah.edu.iq/index.php/jeasd/article/view/1118 |
Similar Items
-
DESIGN AND IMPLEMENTATION OF SHORTEST PATH ALGORITHM FOR NETWORK OF ROADS
by: Nadia Moqbel Hassan
Published: (2015-11-01) -
Fully dynamic (2 + epsilon) approximate all-pairs shortest paths with fast query and close to linear update time
by: Bernstein, Aaron
Published: (2010) -
Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm
by: Elizabeth Nurmiyati Tamatjita, et al.
Published: (2016-09-01) -
Threaded block-parallel algorithm for finding the shortest paths on graph
by: O. N. Karasik, et al.
Published: (2019-06-01) -
A Framework Similarity Estimation of Unweighted Undirected Graphs
by: Valentin Sysoev
Published: (2022-10-01)