• Title/Summary/Keyword: MPR candidate

Search Result 2, Processing Time 0.02 seconds

Efficient Relay Selection Algorithm Using S-MPR for Ad-Hoc Networks Based on CSMA/CA (CSMA/CA 기반 애드혹 네트워크에서 S-MPR을 이용한 효율적인 중계 노드 선택 알고리즘)

  • Park, Jong-Ho;Oh, Chang-Yeong;Ahn, Ji-Hyoung;Seo, Myung-Hwan;Cho, Hyung-Weon;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.8B
    • /
    • pp.657-667
    • /
    • 2012
  • In the MPR selection algorithm of Optimized Link State Routing (OLSR), each node selects own MPRs independently, so most of nodes are selected to MPR at least once. To cope with this problem, the MPR candidate selection algorithm was proposed. The MPR candidate selection algorithm can reduce the number of MPRs, but the efficiencies of route and connectivity decline due to decreased number of MPRs. So, in this paper, we propose the Significant Multi-Point Relay (S-MPR) selection algorithm which can enhance the performance of ad hoc network by improving the MPR selection algorithm of OLSR. In proposed S-MPR selection algorithm, each node selects the most important node to S-MPR to guarantee the connectivity then selects remaining MPRs in MPR candidates. So proposed S-MPR selection algorithm can reduce the overhead of many MPRs without decline of routing performance. To show the performance gain of proposed S-MPR selection algorithm, we simulate the proposed S-MPR selection algorithm by using OPNET.

Enhanced Multi-Point Relay Selection Algorithm for Mobility and Distribution of Nodes (노드 이동성 및 분포를 고려한 향상된 다중 점 릴레이 선택 알고리즘)

  • Park, Jongho;Oh, Chang-Yeong;Ahn, Ji Hyoung;Kim, Joung-Sik;Jung, Sunghun;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.12
    • /
    • pp.1128-1137
    • /
    • 2012
  • In this paper, we propose an improved MPR selection method considering mobility and density of nodes for ad-hoc networks. In Optimized Link State Routing(OLSR), a node selects 1-hop Multi-Point Relay(MPR) nodes to cover all 2-hop neighbor nodes. In a high population area, many nodes are likely to be selected as MPR nodes by their neighbors. This leads to increase in contention among MPR nodes and may decrease overall performance of the network. In addition, when an MPR node leaves the communication range of its MPR selector node, it can no longer perform as the MPR node and the performance of the network may also decrease. In this paper, we propose an MPR selection method which measures the mobility and density of nodes by exchanging the hello messages and gives the priorities to the nodes for MPR selection. Performance evaluation results using OPNET show that the proposed method is superior to OLSR or the MPR candidate method in terms of connectivity and throughput.