The complexity of the grid wireless mobility model

This paper describes a communication model in a 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. Asymp...

Full description

Saved in:

Bibliographic Details
Main Authors:	Sanpawat Kantabutra, Pattama Longani
Format:	Conference Proceeding
Published:	2018
Subjects:	Computer Science
Online Access:	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=57749204394&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60264
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Chiang Mai University

id	th-cmuir.6653943832-60264
record_format	dspace
spelling	th-cmuir.6653943832-602642018-09-10T03:40:24Z The complexity of the grid wireless mobility model Sanpawat Kantabutra Pattama Longani Computer Science This paper describes a communication model in a 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. In contrast to the first two "easy" problems, the intractability of the third problem called the Access Point Location Problem (APLP) is also shown and discussed. © 2008 IEEE. 2018-09-10T03:40:24Z 2018-09-10T03:40:24Z 2008-12-24 Conference Proceeding 2-s2.0-57749204394 10.1109/SNPD.2008.25 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=57749204394&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60264
institution	Chiang Mai University
building	Chiang Mai University Library
country	Thailand
collection	CMU Intellectual Repository
topic	Computer Science
spellingShingle	Computer Science Sanpawat Kantabutra Pattama Longani The complexity of the grid wireless mobility model
description	This paper describes a communication model in a 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. In contrast to the first two "easy" problems, the intractability of the third problem called the Access Point Location Problem (APLP) is also shown and discussed. © 2008 IEEE.
format	Conference Proceeding
author	Sanpawat Kantabutra Pattama Longani
author_facet	Sanpawat Kantabutra Pattama Longani
author_sort	Sanpawat Kantabutra
title	The complexity of the grid wireless mobility model
title_short	The complexity of the grid wireless mobility model
title_full	The complexity of the grid wireless mobility model
title_fullStr	The complexity of the grid wireless mobility model
title_full_unstemmed	The complexity of the grid wireless mobility model
title_sort	complexity of the grid wireless mobility model
publishDate	2018
url	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=57749204394&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60264
_version_	1681425403756937216

The complexity of the grid wireless mobility model

Similar Items