Sensor coverage problem in sparse MANET environments

Jong Beom Lim, Heonchang Yu, Joon Min Gil

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationAdvances in Computer Science and Ubiquitous Computing - CSA-CUTE2016
PublisherSpringer Verlag
Pages273-278
Number of pages6
Volume421
ISBN (Print)9789811030222
DOIs
Publication statusPublished - 2017
Event11th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2016 - Bangkok, Thailand
Duration: 2016 Dec 192016 Dec 21

Publication series

NameLecture Notes in Electrical Engineering
Volume421
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Other

Other11th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2016
CountryThailand
CityBangkok
Period16/12/1916/12/21

Keywords

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

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Sensor coverage problem in sparse MANET environments'. Together they form a unique fingerprint.

Cite this