Optimal MPR Set Selection Algorithm Based on OLSR Routing Protocol
Siyu Dong, Hong Zhang
Available Online December 2016.
- https://doi.org/10.2991/iceeecs-16.2016.149How to use a DOI?
- OLSR; MPR Set; Ad Hoc; Link State; Connection Degree
- The optimal MPR (Multi Point Relay) set selection algorithm is proposed based on the researches of the OLSR (Optimized Link State Routing) protocol of the Ad Hoc network. This paper analyzes the MPR set selection problem from the point of view of mathematical collection. By abstracting one-hop neighbor nodes and the neighbors which are connected by the nodes into the set containing the subsets, we calculate the independent subset of the remaining set to generate MPR relay nodes, and thus find the MPR set with the minimum number. The simulation results show that the algorithm improves the success rate of the data transmission and enhances the network throughput.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Siyu Dong AU - Hong Zhang PY - 2016/12 DA - 2016/12 TI - Optimal MPR Set Selection Algorithm Based on OLSR Routing Protocol BT - 2016 4th International Conference on Electrical & Electronics Engineering and Computer Science (ICEEECS 2016) PB - Atlantis Press SN - 2352-538X UR - https://doi.org/10.2991/iceeecs-16.2016.149 DO - https://doi.org/10.2991/iceeecs-16.2016.149 ID - Dong2016/12 ER -