Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Osama H. Hussein

dblp:278/0410 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Routing and switching · 87% Network optimization and economics · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching › ad hoc network routing
mobile ad hoc network routing
0.112005
Probability routing algorithm for mobile ad hoc networks' resources management · IEEE J. Sel. Areas Commun. 2005
Routing and switching › routing algorithms
stochastic routing
0.112005
Probability routing algorithm for mobile ad hoc networks' resources management · IEEE J. Sel. Areas Commun. 2005
Network optimization and economics
resource allocation
0.012005
Probability routing algorithm for mobile ad hoc networks' resources management · IEEE J. Sel. Areas Commun. 2005

Methods — techniques the papers use, named apart from their topics

simulation · 0.1ant colony optimization · 0.1
YearPublicationVenuePosition
2005 Probability routing algorithm for mobile ad hoc networks' resources management
abstract
This paper introduces a resource management application of a probabilistic-based ant routing algorithm for mobile ad hoc networks (ARAMA) that is inspired from the ant's life . Mobile ad hoc networks (MANETs) are highly dynamic, self-configured and self-built networks. The goal of this paper is to present ARAMA ability to manage MANET's resources by achieving fair network resources distribution, while considering the dynamic characteristics of MANETs and the need for low control overheads. This paper provides a description for the algorithm. In this algorithm, the nodes' (node's energy, processing power, ...) and links' (bandwidth, ...) parameters are measured and collected in the nodes' indices. A path index is used to measure the path total resources and serves to minimize the forward control packet (ant) size. The concepts of negative backward ant destination trail are introduced to enhance the performance of the algorithm. The simulation results show the potential of ARAMA to achieve fair energy usage across the network nodes as an example of the network resource management. More, the results show the general ability of the algorithm to solve MANET's routing problem.
Osama H. Hussein, Tarek N. Saadawi, Myung J. Lee
IEEE J. Sel. Areas Commun.1