Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/60264Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Sanpawat Kantabutra | en_US |
| dc.contributor.author | Pattama Longani | en_US |
| dc.date.accessioned | 2018-09-10T03:40:24Z | - |
| dc.date.available | 2018-09-10T03:40:24Z | - |
| dc.date.issued | 2008-12-24 | en_US |
| dc.identifier.other | 2-s2.0-57749204394 | en_US |
| dc.identifier.other | 10.1109/SNPD.2008.25 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=57749204394&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/60264 | - |
| dc.description.abstract | 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. | en_US |
| dc.subject | Computer Science | en_US |
| dc.title | The complexity of the grid wireless mobility model | en_US |
| dc.type | Conference Proceeding | en_US |
| article.title.sourcetitle | Proc. 9th ACIS Int. Conf. Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2008 and 2nd Int. Workshop on Advanced Internet Technology and Applications | en_US |
| article.stream.affiliations | Chiang Mai University | en_US |
| Appears in Collections: | CMUL: Journal Articles | |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.