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: | Kantabutra S., Longani P. |
---|---|
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 |
Similar Items
-
The complexity of the grid wireless mobility model
by: Sanpawat Kantabutra, et al.
Published: (2018) -
Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model
by: Longani P., et al.
Published: (2014) -
A mobility model for studying wireless communication and the complexity of problems in the model
by: Greenlaw R., et al.
Published: (2017) -
Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model
by: Pattama Longani, et al.
Published: (2018) -
A mobility model for studying wireless communication and the complexity of problems in the model
by: Raymond Greenlaw, et al.
Published: (2018)