Minimization time and battery for a straight movement in MANET

© 2012 Newswood Limited. All rights reserved. In this work we propose two problems that related to a theoretical mobility model previously proposed by Greenlaw and Kantabutra and add some definitions to make the model more complete. The first problem is the minimum time maximum coverage (MTMC) probl...

Full description

Saved in:
Bibliographic Details
Main Author: Pattama Longani
Format: Conference Proceeding
Published: 2018
Subjects:
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85050004316&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/51544
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
id th-cmuir.6653943832-51544
record_format dspace
spelling th-cmuir.6653943832-515442018-09-04T06:03:58Z Minimization time and battery for a straight movement in MANET Pattama Longani Computer Science © 2012 Newswood Limited. All rights reserved. In this work we propose two problems that related to a theoretical mobility model previously proposed by Greenlaw and Kantabutra and add some definitions to make the model more complete. The first problem is the minimum time maximum coverage (MTMC) problem to minimize time to move a group of sources which covered a terrain to cover another terrain while all sources can still communicate through a movement duration. The second one is the minimum battery maximum coverage (MBMC) problem to minimize battery usage to move sources which covered a terrain to cover another terrain while all sources can still communicate through a movement duration. The best movement patterns in time consuming and battery usage for both problems are shown by techniques of proof. In addition, we focus on maximum starting and ending coveraged terrain in strainght line fashion only. 2018-09-04T06:03:58Z 2018-09-04T06:03:58Z 2012-01-01 Conference Proceeding 20780958 2-s2.0-85050004316 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85050004316&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/51544
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
topic Computer Science
spellingShingle Computer Science
Pattama Longani
Minimization time and battery for a straight movement in MANET
description © 2012 Newswood Limited. All rights reserved. In this work we propose two problems that related to a theoretical mobility model previously proposed by Greenlaw and Kantabutra and add some definitions to make the model more complete. The first problem is the minimum time maximum coverage (MTMC) problem to minimize time to move a group of sources which covered a terrain to cover another terrain while all sources can still communicate through a movement duration. The second one is the minimum battery maximum coverage (MBMC) problem to minimize battery usage to move sources which covered a terrain to cover another terrain while all sources can still communicate through a movement duration. The best movement patterns in time consuming and battery usage for both problems are shown by techniques of proof. In addition, we focus on maximum starting and ending coveraged terrain in strainght line fashion only.
format Conference Proceeding
author Pattama Longani
author_facet Pattama Longani
author_sort Pattama Longani
title Minimization time and battery for a straight movement in MANET
title_short Minimization time and battery for a straight movement in MANET
title_full Minimization time and battery for a straight movement in MANET
title_fullStr Minimization time and battery for a straight movement in MANET
title_full_unstemmed Minimization time and battery for a straight movement in MANET
title_sort minimization time and battery for a straight movement in manet
publishDate 2018
url https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85050004316&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/51544
_version_ 1681423788978208768