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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2014
|
| Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-57749204394&partnerID=40&md5=08c71978ef8bf1e150a1df0d44783259 http://cmuir.cmu.ac.th/handle/6653943832/5336 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Language: | English |
| id |
th-cmuir.6653943832-5336 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-53362014-08-30T02:56:25Z The complexity of the grid wireless mobility model Kantabutra S. Longani P. 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. 2014-08-30T02:56:25Z 2014-08-30T02:56:25Z 2008 Conference Paper 9780769532639 10.1109/SNPD.2008.25 74795 http://www.scopus.com/inward/record.url?eid=2-s2.0-57749204394&partnerID=40&md5=08c71978ef8bf1e150a1df0d44783259 http://cmuir.cmu.ac.th/handle/6653943832/5336 English |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| language |
English |
| 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 or Workshop Item |
| author |
Kantabutra S. Longani P. |
| spellingShingle |
Kantabutra S. Longani P. The complexity of the grid wireless mobility model |
| author_facet |
Kantabutra S. Longani P. |
| author_sort |
Kantabutra S. |
| 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 |
2014 |
| url |
http://www.scopus.com/inward/record.url?eid=2-s2.0-57749204394&partnerID=40&md5=08c71978ef8bf1e150a1df0d44783259 http://cmuir.cmu.ac.th/handle/6653943832/5336 |
| _version_ |
1681420406173466624 |