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...
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-52949093482&partnerID=40&md5=07811b2e9de4306bc7e2b9f19c61772d http://cmuir.cmu.ac.th/handle/6653943832/5470 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Language: | English |
| id |
th-cmuir.6653943832-5470 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-54702014-08-30T02:56:34Z Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model Longani P. Kantabutra S. 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. 2014-08-30T02:56:34Z 2014-08-30T02:56:34Z 2008 Conference Paper 1424421012; 9781424421015 10.1109/ECTICON.2008.4600379 73753 http://www.scopus.com/inward/record.url?eid=2-s2.0-52949093482&partnerID=40&md5=07811b2e9de4306bc7e2b9f19c61772d http://cmuir.cmu.ac.th/handle/6653943832/5470 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 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 or Workshop Item |
| author |
Longani P. Kantabutra S. |
| spellingShingle |
Longani P. Kantabutra S. Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model |
| author_facet |
Longani P. Kantabutra S. |
| author_sort |
Longani P. |
| 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 |
2014 |
| url |
http://www.scopus.com/inward/record.url?eid=2-s2.0-52949093482&partnerID=40&md5=07811b2e9de4306bc7e2b9f19c61772d http://cmuir.cmu.ac.th/handle/6653943832/5470 |
| _version_ |
1681420431797518336 |