Mobile user-preference-based data dissemination on mobile P2P networks

Dohoon Kim, Young Gab Kim, Hoh In

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A considerable number of studies have been performed recently on mobile peer-to-peer networks (MOPNETs), as the number of services based on mobile devices has increased. However, existing studies still reveal numerous shortcomings, such as bandwidth overhead, and redundant transmission in terms of multi-broadcast between peers. Especially, owing to the characteristics of MOPNETs, it is extremely important to determine broadcast size and to disseminate data within the limited environment of the network. The mechanism directly affects how well resource information in a mobile device is discovered and how data are transmitted. In this context, it is vital to efficiently disseminate data to be able to arrange hierarchal sequences of resource information of each mobile device for better search performance. Especially, it is also vital to determine the broadcast size, considering the consumption patterns of mobile users. In this article, we propose an adaptable algorithm that determines weighted values and disseminates data using the high-order Markov chain (HoMC). We apply weighted values in consideration of the MOPNET environment. In addition, the proposed HoMC-based Mobile User-preference-based Data Dissemination algorithm was simulated with a Qualnet simulator. Results show that the proposed algorithm performs 17.3% better, on average, in terms of data dissemination, than the existing dissemination methods.

Original languageEnglish
Article number118
JournalEurasip Journal on Wireless Communications and Networking
Volume2011
Issue number1
DOIs
Publication statusPublished - 2011 Dec 1

Fingerprint

Peer to peer networks
Mobile devices
Wireless networks
Markov processes
Simulators
Bandwidth

Keywords

  • high-order Markov Chain
  • mobile P2P networks
  • Qualnet
  • rank-based broadcast

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing
  • Computer Science Applications

Cite this

Mobile user-preference-based data dissemination on mobile P2P networks. / Kim, Dohoon; Kim, Young Gab; In, Hoh.

In: Eurasip Journal on Wireless Communications and Networking, Vol. 2011, No. 1, 118, 01.12.2011.

Research output: Contribution to journalArticle

@article{4b825eeeea2c45b9a874e9e41f047c16,
title = "Mobile user-preference-based data dissemination on mobile P2P networks",
abstract = "A considerable number of studies have been performed recently on mobile peer-to-peer networks (MOPNETs), as the number of services based on mobile devices has increased. However, existing studies still reveal numerous shortcomings, such as bandwidth overhead, and redundant transmission in terms of multi-broadcast between peers. Especially, owing to the characteristics of MOPNETs, it is extremely important to determine broadcast size and to disseminate data within the limited environment of the network. The mechanism directly affects how well resource information in a mobile device is discovered and how data are transmitted. In this context, it is vital to efficiently disseminate data to be able to arrange hierarchal sequences of resource information of each mobile device for better search performance. Especially, it is also vital to determine the broadcast size, considering the consumption patterns of mobile users. In this article, we propose an adaptable algorithm that determines weighted values and disseminates data using the high-order Markov chain (HoMC). We apply weighted values in consideration of the MOPNET environment. In addition, the proposed HoMC-based Mobile User-preference-based Data Dissemination algorithm was simulated with a Qualnet simulator. Results show that the proposed algorithm performs 17.3{\%} better, on average, in terms of data dissemination, than the existing dissemination methods.",
keywords = "high-order Markov Chain, mobile P2P networks, Qualnet, rank-based broadcast",
author = "Dohoon Kim and Kim, {Young Gab} and Hoh In",
year = "2011",
month = "12",
day = "1",
doi = "10.1186/1687-1499-2011-118",
language = "English",
volume = "2011",
journal = "Eurasip Journal on Wireless Communications and Networking",
issn = "1687-1472",
publisher = "Springer Publishing Company",
number = "1",

}

TY - JOUR

T1 - Mobile user-preference-based data dissemination on mobile P2P networks

AU - Kim, Dohoon

AU - Kim, Young Gab

AU - In, Hoh

PY - 2011/12/1

Y1 - 2011/12/1

N2 - A considerable number of studies have been performed recently on mobile peer-to-peer networks (MOPNETs), as the number of services based on mobile devices has increased. However, existing studies still reveal numerous shortcomings, such as bandwidth overhead, and redundant transmission in terms of multi-broadcast between peers. Especially, owing to the characteristics of MOPNETs, it is extremely important to determine broadcast size and to disseminate data within the limited environment of the network. The mechanism directly affects how well resource information in a mobile device is discovered and how data are transmitted. In this context, it is vital to efficiently disseminate data to be able to arrange hierarchal sequences of resource information of each mobile device for better search performance. Especially, it is also vital to determine the broadcast size, considering the consumption patterns of mobile users. In this article, we propose an adaptable algorithm that determines weighted values and disseminates data using the high-order Markov chain (HoMC). We apply weighted values in consideration of the MOPNET environment. In addition, the proposed HoMC-based Mobile User-preference-based Data Dissemination algorithm was simulated with a Qualnet simulator. Results show that the proposed algorithm performs 17.3% better, on average, in terms of data dissemination, than the existing dissemination methods.

AB - A considerable number of studies have been performed recently on mobile peer-to-peer networks (MOPNETs), as the number of services based on mobile devices has increased. However, existing studies still reveal numerous shortcomings, such as bandwidth overhead, and redundant transmission in terms of multi-broadcast between peers. Especially, owing to the characteristics of MOPNETs, it is extremely important to determine broadcast size and to disseminate data within the limited environment of the network. The mechanism directly affects how well resource information in a mobile device is discovered and how data are transmitted. In this context, it is vital to efficiently disseminate data to be able to arrange hierarchal sequences of resource information of each mobile device for better search performance. Especially, it is also vital to determine the broadcast size, considering the consumption patterns of mobile users. In this article, we propose an adaptable algorithm that determines weighted values and disseminates data using the high-order Markov chain (HoMC). We apply weighted values in consideration of the MOPNET environment. In addition, the proposed HoMC-based Mobile User-preference-based Data Dissemination algorithm was simulated with a Qualnet simulator. Results show that the proposed algorithm performs 17.3% better, on average, in terms of data dissemination, than the existing dissemination methods.

KW - high-order Markov Chain

KW - mobile P2P networks

KW - Qualnet

KW - rank-based broadcast

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

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

U2 - 10.1186/1687-1499-2011-118

DO - 10.1186/1687-1499-2011-118

M3 - Article

AN - SCOPUS:84964200212

VL - 2011

JO - Eurasip Journal on Wireless Communications and Networking

JF - Eurasip Journal on Wireless Communications and Networking

SN - 1687-1472

IS - 1

M1 - 118

ER -