An Optimized Method for Minimum MPRs Selection Based on Node Density

Author

Bai, Yunfei ; Liu, Yuan´an ; Yuan, Dongming

Author_Institution

Beijing Univ. of Posts & Telecommun. (BUPT), Beijing, China

fYear

2010

fDate

23-25 Sept. 2010

Firstpage

1

Lastpage

4

Abstract

Multipoint Relay (MPR) have been introduced in the proactive protocol OLSR to optimize the flooding overhead of control traffic. In this paper, we propose an optimized method for the selection of the minimum MPR set computed by greedy algorithm. On the basis of node density, an incomplete traversal process is executed in the common MPR set calculated by greedy algorithm in order to reselect the minimum MPR set. It is shown by the simulation that the optimized method can reduce the number of nodes in minimum MPR set and TC packets flooding in the network.

Keywords

greedy algorithms; routing protocols; telecommunication control; telecommunication traffic; TC packets flooding; flooding overhead; greedy algorithm; multipoint relay selection; node density; proactive protocol optimized link state routing; traffic control; Greedy algorithms; Mobile ad hoc networks; Mobile communication; Network topology; Routing protocols; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications Networking and Mobile Computing (WiCOM), 2010 6th International Conference on

Conference_Location

Chengdu

Print_ISBN

978-1-4244-3708-5

Electronic_ISBN

978-1-4244-3709-2

Type

conf

DOI

10.1109/WICOM.2010.5600966

Filename

5600966