Discrete Mathematics - Topics on domination
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Fast distributed network decompositions and covers
Journal of Parallel and Distributed Computing
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Low-Diameter Graph Decomposition is in NC
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fixed broadband wireless access: state of the art, challenges, and future directions
IEEE Communications Magazine
A comparative evaluation of DECT, PACS, and PHS standards for wireless local loop applications
IEEE Communications Magazine
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
A charging and rewarding scheme for packet forwarding in multi-hop cellular networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The Journal of Supercomputing
Information Raining and Optimal Link-Layer Design for Mobile Hotspots
IEEE Transactions on Mobile Computing
Proceedings of the 11th annual international conference on Mobile computing and networking
MoB: a mobile bazaar for wide-area wireless services
Proceedings of the 11th annual international conference on Mobile computing and networking
Node Cooperation in Hybrid Ad Hoc Networks
IEEE Transactions on Mobile Computing
A mobile bazaar for wide-area wireless services
Wireless Networks
Cooperative content dissemination in multi-channel WLAN hotspots
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimization models and methods for planning wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A gateway placement algorithm in wireless mesh networks
WICON '07 Proceedings of the 3rd international conference on Wireless internet
Location-based incentive pricing for tree-based relaying in multi-hop cellular networks
Computer Communications
The joint Gateway Placement and Spatial Reuse Problem in Wireless Mesh Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Green WLANs: On-Demand WLAN Infrastructures
Mobile Networks and Applications
Optimization models for the radio planning of wireless mesh networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
On optimizing gateway placement for throughput in wireless mesh networks
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
Hi-index | 0.00 |
This work considers the problem of designing an efficient and low-cost infrastructure for connecting static multi-hop wireless networks with wired backbone, while ensuring QoS requirements such as bandwidth and delay. This infrastructure is useful for designing low cost and fast deployed access networks in rural and suburban areas. It may also be used for providing access to sensor networks or for efficient facility placement in wireless networks. In these networks some nodes are chosen as access points and function as gateways to access a wired backbone. Each access point serves a cluster of its nearby user and a spanning tree rooted at the access point is used for message delivery. The work addresses both the design optimization and the operation aspects of the system. From the design perspective, we seek for a partition of the network nodes into minimal number of disjoint clusters that satisfy multiple constraints; Each cluster is required to be a connected graph with an upper bound on its radius. We assume that each node has a weight (representing its bandwidth requirement) and the total weight of all cluster nodes is also bounded. We show that these clustering requirements can be formulated as an instance of the Capacitated Facility Location problem (CFLP) with additional constraints. By breaking the problem into two sub-problems and solving each one separately, we propose polynomial time approximation algorithms that calculate solutions within a constant factor of the optimal ones. From the operation viewpoint, we introduce an adaptive delivery mechanism that maximizes the throughput of each cluster without violating the QoS constraints.