Dynamic Multipoint Relay Candidate Selection for Broadcast Data Aggregation in Mobile Ad-Hoc Networks

Hyung-Weon CHO; Jong-Moon CHUNG; Myunghwan SEO; Jongho PARK; Jihyoung AHN; Bumkwi CHOI; Tae-Jin LEE

doi:10.1587/transcom.E94.B.2629

Dynamic Multipoint Relay Candidate Selection for Broadcast Data Aggregation in Mobile Ad-Hoc Networks

Hyung-Weon CHO, Jong-Moon CHUNG, Myunghwan SEO, Jongho PARK, Jihyoung AHN, Bumkwi CHOI, Tae-Jin LEE

Full Text Views

0

Share
Cite this

Summary :

In OLSR, only selected multipoint relays (MPRs) are allowed to forward broadcast data during the flooding process, which reduces the message propagation overhead compared to the classical flooding mechanism. Since every node in a network selects its own MPRs independently, many nodes may be MPRs of other nodes, which results in many collisions in the medium access control (MAC) layer under heavy traffic conditions. In this paper, we propose an MPR candidate selection mechanism for broadcast data aggregation in mobile ad-hoc networks. The proposed MPR candidate selection scheme can reduce the number of MPR candidates and appropriately spread MPR candidates over the whole network area. The performance of the proposed MPR candidate selection mechanism is investigated via mathematical analysis and simulations. We also propose a broadcast data aggregation mechanism to achive efficient resource utilization. Performance evaluation indicates that the proposed MPR candidate selection and broadcast data aggregation mechanism is efficient under heavy broadcast traffic load conditions.

Publication: IEICE TRANSACTIONS on Communications Vol.E94-B No.9 pp.2629-2633

Publication Date: 2011/09/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E94.B.2629

Type of Manuscript: LETTER

Category: Network

Cite this

Copy

Hyung-Weon CHO, Jong-Moon CHUNG, Myunghwan SEO, Jongho PARK, Jihyoung AHN, Bumkwi CHOI, Tae-Jin LEE, "Dynamic Multipoint Relay Candidate Selection for Broadcast Data Aggregation in Mobile Ad-Hoc Networks" in IEICE TRANSACTIONS on Communications, vol. E94-B, no. 9, pp. 2629-2633, September 2011, doi: 10.1587/transcom.E94.B.2629.
Abstract: In OLSR, only selected multipoint relays (MPRs) are allowed to forward broadcast data during the flooding process, which reduces the message propagation overhead compared to the classical flooding mechanism. Since every node in a network selects its own MPRs independently, many nodes may be MPRs of other nodes, which results in many collisions in the medium access control (MAC) layer under heavy traffic conditions. In this paper, we propose an MPR candidate selection mechanism for broadcast data aggregation in mobile ad-hoc networks. The proposed MPR candidate selection scheme can reduce the number of MPR candidates and appropriately spread MPR candidates over the whole network area. The performance of the proposed MPR candidate selection mechanism is investigated via mathematical analysis and simulations. We also propose a broadcast data aggregation mechanism to achive efficient resource utilization. Performance evaluation indicates that the proposed MPR candidate selection and broadcast data aggregation mechanism is efficient under heavy broadcast traffic load conditions.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.2629/_p

Copy

@ARTICLE{e94-b_9_2629,
author={Hyung-Weon CHO, Jong-Moon CHUNG, Myunghwan SEO, Jongho PARK, Jihyoung AHN, Bumkwi CHOI, Tae-Jin LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Dynamic Multipoint Relay Candidate Selection for Broadcast Data Aggregation in Mobile Ad-Hoc Networks},
year={2011},
volume={E94-B},
number={9},
pages={2629-2633},
abstract={In OLSR, only selected multipoint relays (MPRs) are allowed to forward broadcast data during the flooding process, which reduces the message propagation overhead compared to the classical flooding mechanism. Since every node in a network selects its own MPRs independently, many nodes may be MPRs of other nodes, which results in many collisions in the medium access control (MAC) layer under heavy traffic conditions. In this paper, we propose an MPR candidate selection mechanism for broadcast data aggregation in mobile ad-hoc networks. The proposed MPR candidate selection scheme can reduce the number of MPR candidates and appropriately spread MPR candidates over the whole network area. The performance of the proposed MPR candidate selection mechanism is investigated via mathematical analysis and simulations. We also propose a broadcast data aggregation mechanism to achive efficient resource utilization. Performance evaluation indicates that the proposed MPR candidate selection and broadcast data aggregation mechanism is efficient under heavy broadcast traffic load conditions.},
keywords={},
doi={10.1587/transcom.E94.B.2629},
ISSN={1745-1345},
month={September},}

Copy

TY - JOUR
TI - Dynamic Multipoint Relay Candidate Selection for Broadcast Data Aggregation in Mobile Ad-Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2629
EP - 2633
AU - Hyung-Weon CHO
AU - Jong-Moon CHUNG
AU - Myunghwan SEO
AU - Jongho PARK
AU - Jihyoung AHN
AU - Bumkwi CHOI
AU - Tae-Jin LEE
PY - 2011
DO - 10.1587/transcom.E94.B.2629
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2011
AB - In OLSR, only selected multipoint relays (MPRs) are allowed to forward broadcast data during the flooding process, which reduces the message propagation overhead compared to the classical flooding mechanism. Since every node in a network selects its own MPRs independently, many nodes may be MPRs of other nodes, which results in many collisions in the medium access control (MAC) layer under heavy traffic conditions. In this paper, we propose an MPR candidate selection mechanism for broadcast data aggregation in mobile ad-hoc networks. The proposed MPR candidate selection scheme can reduce the number of MPR candidates and appropriately spread MPR candidates over the whole network area. The performance of the proposed MPR candidate selection mechanism is investigated via mathematical analysis and simulations. We also propose a broadcast data aggregation mechanism to achive efficient resource utilization. Performance evaluation indicates that the proposed MPR candidate selection and broadcast data aggregation mechanism is efficient under heavy broadcast traffic load conditions.
ER -