Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Emerging mobile and wireless networks
Communications of the ACM
Clustering algorithms for wireless ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Towards realistic mobility models for mobile ad hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
An integrated mobility and traffic model for vehicular wireless networks
Proceedings of the 2nd ACM international workshop on Vehicular ad hoc networks
Rendezvous design algorithms for wireless sensor networks with a mobile base station
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
A distributed group mobility adaptive clustering algorithm for mobile ad hoc networks
Computer Communications
Distance Reduction in Mobile Wireless Communication: Lower Bound Analysis and Practical Attainment
IEEE Transactions on Mobile Computing
A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An environment-aware mobility model for wireless ad hoc network
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Wireless Communications
Mobility modeling, location tracking, and trajectory prediction in wireless ATM networks
IEEE Journal on Selected Areas in Communications
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
The Impact of Mobility on Gossip Algorithms
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Wireless communication has become omnipresent in the world and enables users to have an unprecedented ability to communicate any time and any place. In this article, we propose a mobility model for studying wireless communication. The model incorporates elements such as users, access points, and obstacles so that it faithfully mimics the real environment. Interesting problems that have practical applications are posed and solved. More specifically, we study the complexity of three problems in a grid. The source reachability problem (SRP) models a situation in which we want to determine whether two access points can communicate at a certain time in a mobile environment. When users are involved in this situation, we call this problem the user communication problem (UCP). We show that SRP can be solved in O(max{d,t}m2) time, where d is the number of obstacles, t is the time bound in the statement of the problem, and m is the number of access points; we show that UCP can be solved in O(max{d,t}m4) time. The third problem called the user communication, limited source access problem (UCLSAP) studies a situation where we want to determine whether two users can communicate uninterruptedly during the duration of the model while considering battery-time limits of the access points. In contrast to the first two problems, we demonstrate that UCLSAP is intractable, unless P = NP. In conclusion, we briefly discuss the extension of our model to three dimensions and provide a list of open problems. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.