Efficient Computing Method for Location-Based Density of Mobile Node 


Vol. 40,  No. 11, pp. 2196-2204, Nov.  2015


PDF
  Abstract

Location-based density information of mobile node could be used well in various, new and expanding areas such as location-based services, internet of things, smart grid technologies, and intelligent building. In general, receiving mobile nodes of a wireless mobile node depend on the maximum communication range of transmitting mobile node. In this paper, efficient computing method for mobile node using Delaunay triangulation is proposed, which is irrespective of mobile node’s maximum communication range and reflect relative location in a given situation. Proposed method may be good used to find out the density of network constructed by various max communication range devices as Internet of Things. This method suggested in this paper could work well for location-based services, internet of things, smart grid technologies, and intelligent building.

  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]

I. Kim and C. Seo, "Efficient Computing Method for Location-Based Density of Mobile Node," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 11, pp. 2196-2204, 2015. DOI: .

[ACM Style]

In-bum Kim and Choon-weon Seo. 2015. Efficient Computing Method for Location-Based Density of Mobile Node. The Journal of Korean Institute of Communications and Information Sciences, 40, 11, (2015), 2196-2204. DOI: .

[KICS Style]

In-bum Kim and Choon-weon Seo, "Efficient Computing Method for Location-Based Density of Mobile Node," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 11, pp. 2196-2204, 11. 2015.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880