TY - JOUR
T1 - Mobile user-preference-based data dissemination on mobile P2P networks
AU - Kim, Dohoon
AU - Kim, Young Gab
AU - In, Hoh Peter
N1 - Funding Information:
This research was partially supported by: the MKE-ITRC (NIPA-2011-C1090-1131-0008), Software Engineering Technologies Development program of NIPA, and the Center of the Seoul Development Institute (WR080951, Establishment of Bell Labs in Seoul/Research of Broadband Convergent Networks and their Enabling Technologies), and the Second Brain Korea 21 Project.
Publisher Copyright:
© 2011, Kim et al; licensee Springer.
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 - Qualnet
KW - high-order Markov Chain
KW - mobile P2P networks
KW - rank-based broadcast
UR - http://www.scopus.com/inward/record.url?scp=84964200212&partnerID=8YFLogxK
U2 - 10.1186/1687-1499-2011-118
DO - 10.1186/1687-1499-2011-118
M3 - Article
AN - SCOPUS:84964200212
SN - 1687-1472
VL - 2011
JO - Eurasip Journal on Wireless Communications and Networking
JF - Eurasip Journal on Wireless Communications and Networking
IS - 1
M1 - 118
ER -