Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Routing Algorithm

Handbook of Research on Mobile Multimedia, Second Edition
An algorithm that routes packets of data from a source to destination based on some criteria.
Published in Chapter:
Routing Algorithms for Mobile Ad Hoc Networks
Saad Harous (University of Sharjah, UAE)
Copyright: © 2009 |Pages: 11
DOI: 10.4018/978-1-60566-046-2.ch011
Abstract
In this chapter, we will introduce mobile ad hoc networks and issues related to routing data in such networks. Mobile ad hoc networks (MANET) are multi-hop networks made up of mobile nodes cooperating together to maintain the network connectivity. These kinds of network are very useful in situations where a temporary network is needed, such as military area, disaster area, and so on. MANET routing protocols are divided into two categories: proactive (table driven routing) and reactive (on-demand routing) routing. In conventional routing algorithms, if information is to be sent between two nodes, then the shortest path connecting these two nodes is found and used. However this approach does not take into consideration the fact that these devices are battery-operated, so the energy consumed is very important. A number of energy aware algorithms will be presented and their advantages and disadvantages will be discussed in this chapter. Also we will present and discuss the different metrics considered when designing a power aware routing algorithm
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR