Network cooperation for client-ap association optimization
Author(s): Baid, Akash; Schapira, Michael; Seskar, Ivan; Rexford, Jennifer; Raychaudhuri, Dipankar
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr19g2z
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Baid, Akash | - |
dc.contributor.author | Schapira, Michael | - |
dc.contributor.author | Seskar, Ivan | - |
dc.contributor.author | Rexford, Jennifer | - |
dc.contributor.author | Raychaudhuri, Dipankar | - |
dc.date.accessioned | 2021-10-08T19:49:32Z | - |
dc.date.available | 2021-10-08T19:49:32Z | - |
dc.date.issued | 2012 | en_US |
dc.identifier.citation | Baid, Akash, Michael Schapira, Ivan Seskar, Jennifer Rexford, and Dipankar Raychaudhuri. "Network cooperation for client-AP association optimization." In 2012 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt) (2012): pp. 431-436. | en_US |
dc.identifier.uri | https://www.cs.princeton.edu/~jrex/papers/rawnet12.pdf | - |
dc.identifier.uri | https://ieeexplore.ieee.org/document/6260496 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr19g2z | - |
dc.description.abstract | In a WiFi deployment with multiple access points, optimizing the way each client selects an AP from amongst the available choices, has a significant impact on the realized performance. When two or more such multi-AP networks are deployed in the same region, APs from different networks can cause severe interference to one another. In this paper, we study how inter-network interference effects the intra-network association optimization and propose a cooperative optimization scheme to mitigate the interference. We model the interference between multiple overlapping WiFi deployments, determine the information that networks need to share, and formulate a non-linear program that each network can solve for optimal proportional-fair association of clients to APs. Assuming a ‘sum of log rates’ utility function, we apply a known 2+ε approximation algorithm for solving the NP-hard problem in polynomial time. We evaluate the performance gain through large-scale simulations with multiple overlapping networks, each consisting of 15–35 access points and 50–250 clients in a 0.5×0.5 sq.km. urban setting. Results show an average of 150% improvement in random deployments and upto 7× improvements in clustered deployments for the least-performing client throughputs with modest reductions in the mean client throughputs. | en_US |
dc.format.extent | 431 - 436 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | 2012 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt) | en_US |
dc.rights | Author's manuscript | en_US |
dc.title | Network cooperation for client-ap association optimization | en_US |
dc.type | Conference Article | en_US |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceeding | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
NetworkCooperationOpt.pdf | 368.96 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.