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
Minimum Cost Wireless Broadband Overlay Network Planning
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks
Computer Communications
A service location problem with QoS constraints
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Wireless Personal Communications: An International Journal
Optimizing deployment of Internet gateway in Wireless Mesh Networks
Computer Communications
Mobility-aware clustering algorithms with interference constraints in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Gateway Access-Point Selection Problem and Traffic Balancing in Wireless Mesh Networks
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Gateway selection and routing in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Minimum-cost gateway placement in wireless mesh networks with QoS constraints
International Journal of Communication Networks and Distributed Systems
Integrated BS/ONU placement in hybrid EPON-WiMAX access networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Impact of gateways placement on clustering algorithms in wireless mesh networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Quality of Service in mobile ad hoc networks: a survey
International Journal of Ad Hoc and Ubiquitous Computing
An efficient clusterhead placement for hybrid sensor networks
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
Design and analysis of mobility-aware clustering algorithms for wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
A reliable gateway for in-vehicle networks based on LIN, CAN, and FlexRay
ACM Transactions on Embedded Computing Systems (TECS)
Zero-Degree algorithm for Internet GateWay placement in backbone wireless mesh networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
This study considers the problem of designing an efficient and low-cost infrastructure for connecting static multihop 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 study 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 a 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 subproblems 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.