[PDF][PDF] Performance evaluation of approximation algorithms for multipoint relay selection
B Mans, N Shrestha - … of the 3rd Annual Mediterranean Ad Hoc …, 2004 - researchgate.net
B Mans, N Shrestha
Proceedings of the 3rd Annual Mediterranean Ad Hoc Networking Workshop, 2004•researchgate.netIn Mobile Ad Hoc Networks (MANET), the selection of Multipoint Relays provides an efficient
routing scheme for efficient broadcast and shortest-path unicast. As such a selection is NP-
hard, a heuristic has been designed and effectively implemented in protocols for MANET
such as the Optimized Link State Routing protocol (OLSR). In this paper, we introduce other
heuristics that consider the impact of collision by exploiting the topological properties of the
network (without assuming a knowledge of geographic positions or geometric properties) …
routing scheme for efficient broadcast and shortest-path unicast. As such a selection is NP-
hard, a heuristic has been designed and effectively implemented in protocols for MANET
such as the Optimized Link State Routing protocol (OLSR). In this paper, we introduce other
heuristics that consider the impact of collision by exploiting the topological properties of the
network (without assuming a knowledge of geographic positions or geometric properties) …
Abstract
In Mobile Ad Hoc Networks (MANET), the selection of Multipoint Relays provides an efficient routing scheme for efficient broadcast and shortest-path unicast. As such a selection is NP-hard, a heuristic has been designed and effectively implemented in protocols for MANET such as the Optimized Link State Routing protocol (OLSR).
In this paper, we introduce other heuristics that consider the impact of collision by exploiting the topological properties of the network (without assuming a knowledge of geographic positions or geometric properties). For each heuristic, we give its respective provable guaranteed approximation performance when compared to a solution of optimal value.
researchgate.net
以上显示的是最相近的搜索结果。 查看全部搜索结果