Sensor coverage problem in sparse MANET environments

Jong Beom Lim; Heon Chang Yu; Joon Min Gil

doi:10.1007/978-981-10-3023-9_44

Sensor coverage problem in sparse MANET environments

Jong Beom Lim, Heon Chang Yu, Joon Min Gil

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper, we define the problem of sensor coverage in sparse mobile ad hoc networks. Previously, the nodes are assumed static or the number of nodes is large enough to cover the area for the coverage problem in wireless sensor networks. However, in sparse mobile ad hoc network environments, the semantics of the coverage problem differ in that the nodes are free to move in the area and the distance between the nodes should be long enough in order not to overlap the nodes’ coverage to maximize the total coverage area in the network. We formulate the sensor coverage problem in sparse mobile ad hoc network environments.

Original language	English
Title of host publication	Advances in Computer Science and Ubiquitous Computing - CSA-CUTE2016
Editors	Vincenzo Loia, James J. Jong Hyuk Park, Gangman Yi, Yi Pan
Publisher	Springer Verlag
Pages	273-278
Number of pages	6
ISBN (Print)	9789811030222
DOIs	https://doi.org/10.1007/978-981-10-3023-9_44
Publication status	Published - 2017
Event	11th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2016 - Bangkok, Thailand Duration: 2016 Dec 19 → 2016 Dec 21

Publication series

Name	Lecture Notes in Electrical Engineering
Volume	421
ISSN (Print)	1876-1100
ISSN (Electronic)	1876-1119

Other

Other	11th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2016
Country/Territory	Thailand
City	Bangkok
Period	16/12/19 → 16/12/21

Bibliographical note

Funding Information:
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2014R1A1A2055463 and NRF-2015R1D1A1A01061373).

Publisher Copyright:
© Springer Nature Singapore Pte Ltd. 2017.

Keywords

Machine to machine
Mobile ad hoc network
Sensor coverage
Wireless sensor network

ASJC Scopus subject areas

Industrial and Manufacturing Engineering

Access to Document

10.1007/978-981-10-3023-9_44

Cite this

Sensor coverage problem in sparse MANET environments. / Lim, Jong Beom; Yu, Heon Chang; Gil, Joon Min.
Advances in Computer Science and Ubiquitous Computing - CSA-CUTE2016. ed. / Vincenzo Loia; James J. Jong Hyuk Park; Gangman Yi; Yi Pan. Springer Verlag, 2017. p. 273-278 (Lecture Notes in Electrical Engineering; Vol. 421).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Lim, JB, Yu, HC & Gil, JM 2017, Sensor coverage problem in sparse MANET environments. in V Loia, JJ Jong Hyuk Park, G Yi & Y Pan (eds), Advances in Computer Science and Ubiquitous Computing - CSA-CUTE2016. Lecture Notes in Electrical Engineering, vol. 421, Springer Verlag, pp. 273-278, 11th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2016, Bangkok, Thailand, 16/12/19. https://doi.org/10.1007/978-981-10-3023-9_44

@inproceedings{3250c549cda14c03b4eb804f234eec72,

title = "Sensor coverage problem in sparse MANET environments",

abstract = "In this paper, we define the problem of sensor coverage in sparse mobile ad hoc networks. Previously, the nodes are assumed static or the number of nodes is large enough to cover the area for the coverage problem in wireless sensor networks. However, in sparse mobile ad hoc network environments, the semantics of the coverage problem differ in that the nodes are free to move in the area and the distance between the nodes should be long enough in order not to overlap the nodes{\textquoteright} coverage to maximize the total coverage area in the network. We formulate the sensor coverage problem in sparse mobile ad hoc network environments.",

keywords = "Machine to machine, Mobile ad hoc network, Sensor coverage, Wireless sensor network",

author = "Lim, {Jong Beom} and Yu, {Heon Chang} and Gil, {Joon Min}",

note = "Funding Information: This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2014R1A1A2055463 and NRF-2015R1D1A1A01061373). Publisher Copyright: {\textcopyright} Springer Nature Singapore Pte Ltd. 2017.; 11th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2016 ; Conference date: 19-12-2016 Through 21-12-2016",

year = "2017",

doi = "10.1007/978-981-10-3023-9_44",

language = "English",

isbn = "9789811030222",

series = "Lecture Notes in Electrical Engineering",

publisher = "Springer Verlag",

pages = "273--278",

editor = "Vincenzo Loia and {Jong Hyuk Park}, {James J.} and Gangman Yi and Yi Pan",

booktitle = "Advances in Computer Science and Ubiquitous Computing - CSA-CUTE2016",

}

TY - GEN

T1 - Sensor coverage problem in sparse MANET environments

AU - Lim, Jong Beom

AU - Yu, Heon Chang

AU - Gil, Joon Min

N1 - Funding Information: This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2014R1A1A2055463 and NRF-2015R1D1A1A01061373). Publisher Copyright: © Springer Nature Singapore Pte Ltd. 2017.

PY - 2017

Y1 - 2017

N2 - In this paper, we define the problem of sensor coverage in sparse mobile ad hoc networks. Previously, the nodes are assumed static or the number of nodes is large enough to cover the area for the coverage problem in wireless sensor networks. However, in sparse mobile ad hoc network environments, the semantics of the coverage problem differ in that the nodes are free to move in the area and the distance between the nodes should be long enough in order not to overlap the nodes’ coverage to maximize the total coverage area in the network. We formulate the sensor coverage problem in sparse mobile ad hoc network environments.

AB - In this paper, we define the problem of sensor coverage in sparse mobile ad hoc networks. Previously, the nodes are assumed static or the number of nodes is large enough to cover the area for the coverage problem in wireless sensor networks. However, in sparse mobile ad hoc network environments, the semantics of the coverage problem differ in that the nodes are free to move in the area and the distance between the nodes should be long enough in order not to overlap the nodes’ coverage to maximize the total coverage area in the network. We formulate the sensor coverage problem in sparse mobile ad hoc network environments.

KW - Machine to machine

KW - Mobile ad hoc network

KW - Sensor coverage

KW - Wireless sensor network

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

U2 - 10.1007/978-981-10-3023-9_44

DO - 10.1007/978-981-10-3023-9_44

M3 - Conference contribution

AN - SCOPUS:85007353262

SN - 9789811030222

T3 - Lecture Notes in Electrical Engineering

SP - 273

EP - 278

BT - Advances in Computer Science and Ubiquitous Computing - CSA-CUTE2016

A2 - Loia, Vincenzo

A2 - Jong Hyuk Park, James J.

A2 - Yi, Gangman

A2 - Pan, Yi

PB - Springer Verlag

T2 - 11th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2016

Y2 - 19 December 2016 through 21 December 2016

ER -

Sensor coverage problem in sparse MANET environments

Abstract

Publication series

Other

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this