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: | Sanpawat Kantabutra, Pattama Longani |
---|---|
Format: | Conference Proceeding |
Published: |
2018
|
Subjects: | |
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 |
Similar Items
-
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) -
The complexity of the grid wireless mobility model
by: Kantabutra S., et al.
Published: (2014) -
Maximum coverage of radius-one sources in the wireless communication
by: Pattama Longani, et al.
Published: (2018) -
Multi-sources simultaneous communication in the wireless mobility model is NP-complete
by: Pattama Longani, et al.
Published: (2018)