An Energy-Efficient Algorithm for Solving Coverage Problem and Sensing Big Data in Sparse MANET Environments


KIPS Transactions on Computer and Communication Systems, Vol. 6, No. 11, pp. 463-468, Nov. 2017
10.3745/KTCCS.2017.6.11.463,   PDF Download:
Keywords: Sensor Coverage, Mobile Ad Hoc Network, Wireless Sensor Network, Self-Organization
Abstract

To sense a wide area with mobile nodes, the uniformity of node deployment is a very important issue. In this paper, we consider the coverage problem to sense big data in sparse mobile ad hoc networks. In most existing works on the coverage problem, it has been assumed that the number of nodes is large enough to cover the area in the network. However, the coverage problem in sparse mobile ad hoc networks differs in the sense that a long-distance between nodes should be formed to avoid the overlapping coverage areas. We formulate the sensor coverage problem in sparse mobile ad hoc networks and provide the solution to the problem by a self-organized approach without a central authority. The experimental results show that our approach is more efficient than the existing ones, subject to both of coverage areas and energy consumption.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
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. Gil, "An Energy-Efficient Algorithm for Solving Coverage Problem and Sensing Big Data in Sparse MANET Environments," KIPS Transactions on Computer and Communication Systems, vol. 6, no. 11, pp. 463-468, 2017. DOI: 10.3745/KTCCS.2017.6.11.463.

[ACM Style]
Joon-Min Gil. 2017. An Energy-Efficient Algorithm for Solving Coverage Problem and Sensing Big Data in Sparse MANET Environments. KIPS Transactions on Computer and Communication Systems, 6, 11, (2017), 463-468. DOI: 10.3745/KTCCS.2017.6.11.463.