Suppressive Fair Buffer Management Policy for Intermittently Connected Mobile Ad Hoc Networks

Tomotaka Kimura, Chinthaka Premachandra

研究成果: Article

1 引用 (Scopus)

抄録

We propose a suppressive fair buffer management policy for intermittently connected mobile ad-hoc networks. So far, several buffer management policies have been considered. These existing buffer management policies assume that all stored messages can be replaced when nodes encounter each other. Buffer management policies, however, can prioritize messages stored at the receiving side over those at the sending side. By doing this, message transmissions are suppressive, and thus energy consumption in terms of sending messages is reduced. Moreover, our proposed policy gives relay messages with a small number of message copies to high priority. Specifically, our proposed policy maintains a sharing of buffer spaces that is as fair as possible. In this paper, we reveal how the suppression of receiving messages affects the system performance compared with existing buffer management policies. Through simulation experiments, we show that the suppressive fair buffer management policy improves energy consumption without largely degrading the delivery failure probability and the mean delivery delay.

元の言語English
ページ(範囲)1-15
ページ数15
ジャーナルWireless Personal Communications
DOI
出版物ステータスAccepted/In press - 2017 8 17

Fingerprint

Mobile ad hoc networks
Energy utilization
Experiments

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering

これを引用

@article{08d13675b59746e5b26f1b60a13ee693,
title = "Suppressive Fair Buffer Management Policy for Intermittently Connected Mobile Ad Hoc Networks",
abstract = "We propose a suppressive fair buffer management policy for intermittently connected mobile ad-hoc networks. So far, several buffer management policies have been considered. These existing buffer management policies assume that all stored messages can be replaced when nodes encounter each other. Buffer management policies, however, can prioritize messages stored at the receiving side over those at the sending side. By doing this, message transmissions are suppressive, and thus energy consumption in terms of sending messages is reduced. Moreover, our proposed policy gives relay messages with a small number of message copies to high priority. Specifically, our proposed policy maintains a sharing of buffer spaces that is as fair as possible. In this paper, we reveal how the suppression of receiving messages affects the system performance compared with existing buffer management policies. Through simulation experiments, we show that the suppressive fair buffer management policy improves energy consumption without largely degrading the delivery failure probability and the mean delivery delay.",
keywords = "Buffer management, Delay tolerant networking, Store-carry-forward routing, Suppressive resource management",
author = "Tomotaka Kimura and Chinthaka Premachandra",
year = "2017",
month = "8",
day = "17",
doi = "10.1007/s11277-017-4886-8",
language = "English",
pages = "1--15",
journal = "Wireless Personal Communications",
issn = "0929-6212",
publisher = "Springer Netherlands",

}

TY - JOUR

T1 - Suppressive Fair Buffer Management Policy for Intermittently Connected Mobile Ad Hoc Networks

AU - Kimura, Tomotaka

AU - Premachandra, Chinthaka

PY - 2017/8/17

Y1 - 2017/8/17

N2 - We propose a suppressive fair buffer management policy for intermittently connected mobile ad-hoc networks. So far, several buffer management policies have been considered. These existing buffer management policies assume that all stored messages can be replaced when nodes encounter each other. Buffer management policies, however, can prioritize messages stored at the receiving side over those at the sending side. By doing this, message transmissions are suppressive, and thus energy consumption in terms of sending messages is reduced. Moreover, our proposed policy gives relay messages with a small number of message copies to high priority. Specifically, our proposed policy maintains a sharing of buffer spaces that is as fair as possible. In this paper, we reveal how the suppression of receiving messages affects the system performance compared with existing buffer management policies. Through simulation experiments, we show that the suppressive fair buffer management policy improves energy consumption without largely degrading the delivery failure probability and the mean delivery delay.

AB - We propose a suppressive fair buffer management policy for intermittently connected mobile ad-hoc networks. So far, several buffer management policies have been considered. These existing buffer management policies assume that all stored messages can be replaced when nodes encounter each other. Buffer management policies, however, can prioritize messages stored at the receiving side over those at the sending side. By doing this, message transmissions are suppressive, and thus energy consumption in terms of sending messages is reduced. Moreover, our proposed policy gives relay messages with a small number of message copies to high priority. Specifically, our proposed policy maintains a sharing of buffer spaces that is as fair as possible. In this paper, we reveal how the suppression of receiving messages affects the system performance compared with existing buffer management policies. Through simulation experiments, we show that the suppressive fair buffer management policy improves energy consumption without largely degrading the delivery failure probability and the mean delivery delay.

KW - Buffer management

KW - Delay tolerant networking

KW - Store-carry-forward routing

KW - Suppressive resource management

UR - http://www.scopus.com/inward/record.url?scp=85027844877&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027844877&partnerID=8YFLogxK

U2 - 10.1007/s11277-017-4886-8

DO - 10.1007/s11277-017-4886-8

M3 - Article

AN - SCOPUS:85027844877

SP - 1

EP - 15

JO - Wireless Personal Communications

JF - Wireless Personal Communications

SN - 0929-6212

ER -