loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
The Complexity of the Grid Wireless Mobility Model
August 06-August 08
ISBN: 978-0-7695-3263-9
ASCII Text
x 
 
Sanpawat Kantabutra, Pattama Longani, "The Complexity of the Grid Wireless Mobility Model," Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on, pp. 85-90, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008.
 
 
BibTex
x
 
@article{ 10.1109/SNPD.2008.25,
author = {Sanpawat Kantabutra and Pattama Longani},
title = {The Complexity of the Grid Wireless Mobility Model},
journal ={Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3263-9},
pages = {85-90},
doi = {http://doi.ieeecomputersociety.org/10.1109/SNPD.2008.25},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
TI - The Complexity of the Grid Wireless Mobility Model
SN - 978-0-7695-3263-9
SP85
EP90
A1 - Sanpawat Kantabutra,
A1 - Pattama Longani,
PY - 2008
KW - Complexity
KW - Wireless Mobility Model
VL - 0
JA - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
ER -
 
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.
Index Terms:
Complexity, Wireless Mobility Model
Citation:
Sanpawat Kantabutra, Pattama Longani, "The Complexity of the Grid Wireless Mobility Model," snpd, pp.85-90, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008
Usage of this product signifies your acceptance of the Terms of Use.