A Novel Shadow Clustering Mechanism based on Gauss-Markov Mobility Model in Nested Heterogeneous Networks 


Vol. 34,  No. 2, pp. 143-150, Feb.  2009


PDF Full-Text
  Abstract

In this paper, we propose a novel shadow clustering mechanism including a mobility estimation algorithm based on Gauss-Markov mobility model which analyses patterns of moving direction and speed of a mobile terminal respectively and a selection algorithm of the most suitable network for the requirements of mobile terminals. The proposed mechanism makes much less shadow cluster area than that of the legacy methods, and reduces unnecessary resource reservation. It is compared the proposed algorithm with traditional methods under various scenarios.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Park, W. Kim, Y. Park, "A Novel Shadow Clustering Mechanism based on Gauss-Markov Mobility Model in Nested Heterogeneous Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 2, pp. 143-150, 2009. DOI: .

[ACM Style]

Je-Man Park, Won-Tae Kim, and Yong-Jin Park. 2009. A Novel Shadow Clustering Mechanism based on Gauss-Markov Mobility Model in Nested Heterogeneous Networks. The Journal of Korean Institute of Communications and Information Sciences, 34, 2, (2009), 143-150. DOI: .

[KICS Style]

Je-Man Park, Won-Tae Kim, Yong-Jin Park, "A Novel Shadow Clustering Mechanism based on Gauss-Markov Mobility Model in Nested Heterogeneous Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 2, pp. 143-150, 2. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880