Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model

This paper describes a communication model in a two-dimensional grid for mobile wireless networks and shows how to optimally solve some decision problems related to the model. We show that User Communication Problem (UCP) and Source Reachability Problem (SRP) can be most efficiently solved in polyno...

Full description

Saved in:
Bibliographic Details
Main Authors: Pattama Longani, Sanpawat Kantabutra
Format: Conference Proceeding
Published: 2018
Subjects:
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=52949093482&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/60288
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
id th-cmuir.6653943832-60288
record_format dspace
spelling th-cmuir.6653943832-602882018-09-10T03:42:13Z Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model Pattama Longani Sanpawat Kantabutra Computer Science Engineering This paper describes a communication model in a two-dimensional grid for mobile wireless networks and shows how to optimally solve some decision problems related to the model. We show that User Communication Problem (UCP) and Source Reachability Problem (SRP) can be most efficiently solved in polynomial time. Asymptotically time-optimal algorithms for solving these problems are also presented. ©2008 IEEE. 2018-09-10T03:40:38Z 2018-09-10T03:40:38Z 2008-10-06 Conference Proceeding 2-s2.0-52949093482 10.1109/ECTICON.2008.4600379 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=52949093482&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60288
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
topic Computer Science
Engineering
spellingShingle Computer Science
Engineering
Pattama Longani
Sanpawat Kantabutra
Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model
description This paper describes a communication model in a two-dimensional grid for mobile wireless networks and shows how to optimally solve some decision problems related to the model. We show that User Communication Problem (UCP) and Source Reachability Problem (SRP) can be most efficiently solved in polynomial time. Asymptotically time-optimal algorithms for solving these problems are also presented. ©2008 IEEE.
format Conference Proceeding
author Pattama Longani
Sanpawat Kantabutra
author_facet Pattama Longani
Sanpawat Kantabutra
author_sort Pattama Longani
title Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model
title_short Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model
title_full Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model
title_fullStr Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model
title_full_unstemmed Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model
title_sort time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model
publishDate 2018
url https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=52949093482&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/60288
_version_ 1681425408213385216