Optimal MPR Set Selection Algorithm Based on OLSR Routing Protocol

DOI

10.2991/iceeecs-16.2016.149How to use a DOI?

Keywords

OLSR; MPR Set; Ad Hoc; Link State; Connection Degree

Abstract

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.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

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  - Proceedings of the 2016 4th International Conference on Electrical & Electronics Engineering and Computer Science (ICEEECS 2016)
PB  - Atlantis Press
SP  - 749
EP  - 754
SN  - 2352-538X
UR  - https://doi.org/10.2991/iceeecs-16.2016.149
DO  - 10.2991/iceeecs-16.2016.149
ID  - Dong2016/12
ER  -