MRMP
Encyclopedia
MRMP is a power-aware multicast protocol designed for large-scale mobile ad hoc networks, in which nodes may be with high mobility.
In the past decades, many excellent power-aware routing algorithms/protocols have been proposed for mobile ad hoc networks. However, most of the existing results rely on the knowledge of certain global information, such as the remaining energy of all nodes and/or the minimum transmission power between every pair of nodes. The maintenance problem of similar global information is highly challenging in protocol designs because of the difficulty and cost in the maintenance of up-to-date information. As a result, various assumptions, such as static network topologies
and/or fixed traffic patterns, are made to reduce the problem complexity.
Unlike the past work, MRMP is designed for applications with a huge population of mobile devices such that no global information can be efficiently maintained at any node. MRMP relies on a distributed algorithm
that is proved to be loop-free and theoretically optimal in the maximization of minimum residual energy. In MRMP, no periodic control message is employed to collect routing information
or repair link breakages. Neither group membership nor neighbor relationship is maintained at a node by explicit control messages. When desiring a route, a source invokes a route-discovery procedure over the network, and the individual decisions of intermediate nodes form a loop-free transient multicast tree naturally. The data packets are then forwarded by nodes at proper power levels on the established multicast tree. MRMP was implemented and evaluated over NS2, and simulations were conducted extensively with parameters set based on a realistic commercial wireless device. MRMP has demonstrated itself being effective and efficient in essential performance metrics adopted generally for routing protocol
evaluation.
The distributed methodology is also applicable to various related optimization problems (such as the minimization of the total energy consumption of any path from a source to a destination) and provides useful insights when network resources (such as bandwidth) might change over time.
Networks", IEEE Transactions on Mobile Computing
, 2009 Available from: http://ieeexplore.ieee.org/xpls/pre_abs_all.jsp?isnumber=4358975&arnumber=4796204
In the past decades, many excellent power-aware routing algorithms/protocols have been proposed for mobile ad hoc networks. However, most of the existing results rely on the knowledge of certain global information, such as the remaining energy of all nodes and/or the minimum transmission power between every pair of nodes. The maintenance problem of similar global information is highly challenging in protocol designs because of the difficulty and cost in the maintenance of up-to-date information. As a result, various assumptions, such as static network topologies
Network topology
Network topology is the layout pattern of interconnections of the various elements of a computer or biological network....
and/or fixed traffic patterns, are made to reduce the problem complexity.
Unlike the past work, MRMP is designed for applications with a huge population of mobile devices such that no global information can be efficiently maintained at any node. MRMP relies on a distributed algorithm
Distributed computing
Distributed computing is a field of computer science that studies distributed systems. A distributed system consists of multiple autonomous computers that communicate through a computer network. The computers interact with each other in order to achieve a common goal...
that is proved to be loop-free and theoretically optimal in the maximization of minimum residual energy. In MRMP, no periodic control message is employed to collect routing information
Routing
Routing is the process of selecting paths in a network along which to send network traffic. Routing is performed for many kinds of networks, including the telephone network , electronic data networks , and transportation networks...
or repair link breakages. Neither group membership nor neighbor relationship is maintained at a node by explicit control messages. When desiring a route, a source invokes a route-discovery procedure over the network, and the individual decisions of intermediate nodes form a loop-free transient multicast tree naturally. The data packets are then forwarded by nodes at proper power levels on the established multicast tree. MRMP was implemented and evaluated over NS2, and simulations were conducted extensively with parameters set based on a realistic commercial wireless device. MRMP has demonstrated itself being effective and efficient in essential performance metrics adopted generally for routing protocol
Route assignment
Route assignment, route choice, or traffic assignment concerns the selection of routes between origins and destinations in transportation networks. It is the fourth step in the conventional transportation forecasting model, following trip generation, trip distribution, and mode choice...
evaluation.
The distributed methodology is also applicable to various related optimization problems (such as the minimization of the total energy consumption of any path from a source to a destination) and provides useful insights when network resources (such as bandwidth) might change over time.
External links
Pi-Cheng Hsiu and Tei-Wei Kuo: "A Maximum-Residual Multicast Protocol for Large-Scale Mobile Ad HocAd hoc
Ad hoc is a Latin phrase meaning "for this". It generally signifies a solution designed for a specific problem or task, non-generalizable, and not intended to be able to be adapted to other purposes. Compare A priori....
Networks", IEEE Transactions on Mobile Computing
Mobile computing
Mobile computing is a form of human–computer interaction by which a computer is expected to be transported during normal usage. Mobile computing has three aspects: mobile communication, mobile hardware, and mobile software...
, 2009 Available from: http://ieeexplore.ieee.org/xpls/pre_abs_all.jsp?isnumber=4358975&arnumber=4796204