%0 Conference Paper
%B 2011 Proceedings IEEE INFOCOM
%D 2011
%T Approximation algorithms for throughput maximization in wireless networks with delay constraints
%A Guanhong Pei
%A Anil Kumar,V. S
%A Parthasarathy,S.
%A Srinivasan, Aravind
%K Approximation algorithms
%K Approximation methods
%K approximation theory
%K Delay
%K delay constraints
%K delays
%K general interference model
%K Interference
%K multihop wireless networks
%K optimisation
%K Optimized production technology
%K radio networks
%K radiofrequency interference
%K target delay bound
%K Throughput
%K throughput maximization
%K Wireless networks
%X We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention starting with the work of Grossglauser and Tse (2002), and it has been shown that there is a significant tradeoff between the end-to-end delays and the total achievable rate. We develop algorithms to compute such tradeoffs with provable performance guarantees for arbitrary instances, with general interference models. Given a target delay-bound Δ(c) for each session c, our algorithm gives a stable flow vector with a total throughput within a factor of O (logΔm/log log Δm) of the maximum, so that the per-session (end-to-end) delay is O ((logΔm/log log Δm Δ(c))2), where Δm = maxc{Δ(c)}; note that these bounds depend only on the delays, and not on the network size, and this is the first such result, to our knowledge.
%B 2011 Proceedings IEEE INFOCOM
%I IEEE
%P 1116 - 1124
%8 2011/04/10/15
%@ 978-1-4244-9919-9
%G eng
%R 10.1109/INFCOM.2011.5934887
%0 Conference Paper
%B IEEE INFOCOM 2009
%D 2009
%T Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks
%A Han,Bo
%A Kumar,V. S.A
%A Marathe,M. V
%A Parthasarathy,S.
%A Srinivasan, Aravind
%K access hash function
%K Channel allocation
%K channel assignment algorithm
%K channel capacity
%K collision avoidance
%K Computer science
%K cryptography
%K distributed algorithm
%K distributed algorithms
%K Educational institutions
%K inductive-scheduling technique
%K Interference
%K interference set
%K packet scheduling algorithm
%K Peer to peer computing
%K Radio network
%K radio networks
%K radiofrequency interference
%K random oracle methodology
%K scheduling
%K Scheduling algorithm
%K simultaneous channel allocation
%K software radio
%K software-defined radio wireless network capacity
%K telecommunication congestion control
%K telecommunication security
%K Throughput
%K wireless channels
%K Wireless networks
%X Equipping wireless nodes with multiple radios can significantly increase the capacity of wireless networks, by making these radios simultaneously transmit over multiple non-overlapping channels. However, due to the limited number of radios and available orthogonal channels, designing efficient channel assignment and scheduling algorithms in such networks is a major challenge. In this paper, we present provably-good distributed algorithms for simultaneous channel allocation of individual links and packet-scheduling, in software-defined radio (SDR) wireless networks. Our distributed algorithms are very simple to implement, and do not require any coordination even among neighboring nodes. A novel access hash function or random oracle methodology is one of the key drivers of our results. With this access hash function, each radio can know the transmitters' decisions for links in its interference set for each time slot without introducing any extra communication overhead between them. Further, by utilizing the inductive-scheduling technique, each radio can also backoff appropriately to avoid collisions. Extensive simulations demonstrate that our bounds are valid in practice.
%B IEEE INFOCOM 2009
%I IEEE
%P 1521 - 1529
%8 2009/04/19/25
%@ 978-1-4244-3512-8
%G eng
%R 10.1109/INFCOM.2009.5062069
%0 Conference Paper
%B IEEE INFOCOM 2008. The 27th Conference on Computer Communications
%D 2008
%T Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
%A Chafekar,D.
%A Kumart,V. S.A
%A Marathe,M. V
%A Parthasarathy,S.
%A Srinivasan, Aravind
%K Algorithm design and analysis
%K approximation algorithm
%K Approximation algorithms
%K approximation theory
%K Computer networks
%K Computer science
%K graph theory
%K graph-based model
%K Interference constraints
%K polynomial time algorithm
%K Propagation losses
%K Protocols
%K radio networks
%K radiofrequency interference
%K signal to interference plus noise ratio
%K Signal to noise ratio
%K Throughput
%K wireless interference
%K wireless network
%K Wireless networks
%X A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused on either random distributions of points, or has assumed simple graph-based models for wireless interference. In this paper, we study capacity estimation problem using the more general Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks. The problem becomes much harder in this setting, because of the non-locality of the SINR model. Recent work by Moscibroda et al. (2006) has shown that the throughput in this model can differ from graph based models significantly. We develop polynomial time algorithms to provably approximate the total throughput in this setting.
%B IEEE INFOCOM 2008. The 27th Conference on Computer Communications
%I IEEE
%P 1166 - 1174
%8 2008/04/13/18
%@ 978-1-4244-2025-4
%G eng
%R 10.1109/INFOCOM.2008.172
%0 Conference Paper
%B IEEE INFOCOM 2008. The 27th Conference on Computer Communications
%D 2008
%T Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
%A Chafekar,D.
%A Levin,D.
%A Kumar,V. S.A
%A Marathe,M. V
%A Parthasarathy,S.
%A Srinivasan, Aravind
%K asynchronous random-access scheduling
%K channel access probability
%K Computer networks
%K Computer science
%K Educational institutions
%K Interference
%K Optimal scheduling
%K Peer to peer computing
%K probability
%K Processor scheduling
%K radio link
%K radio links
%K radio networks
%K Routing
%K scheduling
%K Throughput
%K throughput capacity
%K wireless channels
%K Wireless networks
%X We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question we answer is: how should we set the channel-access probability for each link in the network so that the network operates close to its optimal throughput capacity? We design simple and distributed channel-access strategies for random-access networks which are provably competitive with respect to the optimal scheduling strategy, which is deterministic, centralized, and computationally infeasible. We show that the competitiveness of our strategies are nearly the best achievable via random-access scheduling, thus establishing fundamental limits on the performance of random- access. A notable outcome of our work is that random access compares well with deterministic scheduling when link transmission durations differ by small factors, and much worse otherwise. The distinguishing aspects of our work include modeling and rigorous analysis of asynchronous communication, asymmetry in link transmission durations, and hidden terminals under arbitrary link-conflict based wireless interference models.
%B IEEE INFOCOM 2008. The 27th Conference on Computer Communications
%I IEEE
%P 1148 - 1156
%8 2008/04/13/18
%@ 978-1-4244-2025-4
%G eng
%R 10.1109/INFOCOM.2008.170
%0 Conference Paper
%B Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
%D 2006
%T Reliable broadcast in radio networks: the bounded collision case
%A Koo,Chiu-Yuen
%A Bhandari,Vartika
%A Katz, Jonathan
%A Vaidya,Nitin H.
%K broadcast
%K byzantine failure
%K Fault tolerance
%K radio networks
%X We study the problem of achieving global broadcast in a radio network where a node can multicast messages to all of its neighbors (that is, nodes within some given distance r), and up to t nodes in any single neighborhood may be corrupted. Previous work assumes that corrupted nodes can neither cause collisions nor spoof addresses of honest nodes. In this work, we eliminate these assumptions and allow each faulty node to cause a (known) bounded number of collisions and spoof the addresses of arbitrary other nodes. We show that the maximum tolerable t in this case is identical to the maximum tolerable t when collisions and address spoofing are not allowed. Thus, by causing collisions and spoofing addresses an adversary may be able to degrade the efficiency of achieving broadcast, but it cannot affect the feasibility of this task.
%B Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
%S PODC '06
%I ACM
%C New York, NY, USA
%P 258 - 264
%8 2006///
%@ 1-59593-384-0
%G eng
%U http://doi.acm.org/10.1145/1146381.1146420
%R 10.1145/1146381.1146420