In this paper we study the problem of jointly performing scheduling and congestion control in mob... more In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flow rates satisfy an associated network utility maximization problem. In recent years a number of papers have presented theoretical solutions to this problem that are based on combining differential-backlog scheduling algorithms with utility-based congestion control. However, this work typically does not address a number of issues such as how signaling should be performed and how the new algorithms interact with other wireless protocols.
Recent years have seen tremendous growth in the deployment of Wireless Local Area Networks (WLANs... more Recent years have seen tremendous growth in the deployment of Wireless Local Area Networks (WLANs). An important design issue in such networks is that of distributed scheduling. The lack of centralized control leads to multiple users competing for channel access. This leads to significant throughput degradation. Existing approaches, such as the slotted Aloha protocol and IEEE 802.11 DCF, also fail to provide differentiated service to users. The upcoming IEEE 802.11e Enhanced DCF incorporates additional mechanisms to provide support for service differentiation. However, the level of differentiation achieved with these mechanisms is difficult to quantify. In this paper, we propose a class of distributed scheduling algorithms, Regulated Contention Medium Access Control (RCMAC), which provides dynamic prioritized access to users for service differentiation in a quantifiable manner. Furthermore, by regulating multi-user contention, RCMAC achieves higher throughput when traffic is bursty, as is typically the case. In addition to WLANs, the basic concepts of RCMAC have applications in ad hoc networks and emerging sensor networks.
We consider a model for random-access communication in networks of arbitrary topology. We charact... more We consider a model for random-access communication in networks of arbitrary topology. We characterize the efficient (Pareto) boundary of the network throughput region as the family of solutions optimizing weighted proportional fairness objective, parameterized by link weights. Based on this characterization we propose a general distributed scheme that uses dynamic link weights to "move" the link-throughput allocation within the Pareto boundary to a desired point optimizing a specific objective.
An ad hoc network consists of a number of mobile hosts who communicate with each other over a wir... more An ad hoc network consists of a number of mobile hosts who communicate with each other over a wireless channel without any centralized control. The basic problem is to obtain a distributed routing scheme so that under the network connectivity assumption any mobile host can transmit/receive data from any other host in the network. In this paper we propose a
In wireless data networks the range of each transmitter, and thus its power level, needs to be hi... more In wireless data networks the range of each transmitter, and thus its power level, needs to be high enough to reach the intended receivers, while being low enough to avoid generating interference for other receivers on the same channel. If the nodes in the network are assumed to cooperate, perhaps in a distributed and decentralized fashion, in routing each others'
Abstract. Consider n nodes located in a sphere of volume V cubic meters, each capable of transmit... more Abstract. Consider n nodes located in a sphere of volume V cubic meters, each capable of transmitting at a rate of W bits/sec. Under a protocol based model for successful receptions, the entire network can carry only (WV »3 n 23 ¿ bit-meters/sec, where 1 bit carried a distance of 1 meter is ...
We study communication networks of arbitrary size and topology and communicating over a general v... more We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel. We propose an information-theoretic constructive scheme for obtaining an achievable rate region in such networks. Many well-known capacity-defining achievable rate regions can be derived as special cases of the proposed scheme. A few such examples are the physically degraded and reverselydegraded relay channels, the Gaussian multiple-access channel, and the Gaussian broadcast channel. The proposed scheme also leads to inner bounds for the multicast and allcast capacities.
... 46, NO. 2, MARCH 2000 The Capacity of Wireless Networks ... Index Terms—Ad hoc networks, capa... more ... 46, NO. 2, MARCH 2000 The Capacity of Wireless Networks ... Index Terms—Ad hoc networks, capacity, multihop radio net- works, throughput, wireless networks. ...
In wireless data networks the range of each transmitter, and thus its power level, needs to be hi... more In wireless data networks the range of each transmitter, and thus its power level, needs to be high enough to reach the intended receivers, while being low enough to avoid generating interference for other receivers on the same channel. If the nodes in the network are assumed to cooperate, perhaps in a distributed and decentralized fashion, in routing each others' packets, as is the case in ad hoc wireless networks, then each node should transmit with just enough power to guarantee connectivity of the overall network. Towards this end, we determine the critical power at which a node in the network needs to transmit in order to ensure that the network is connected with probability one as the number of nodes in the network goes to infinity. Our main result is this: if n nodes are located randomly, uniformly i.i.d., in a disc of unit area in ℜ2 and each node transmits at a power level so as to cover an area of πr2=(log n + c(n))/n, then the resulting network is asymptotically connected with probability one if and only if c(n)→+∞
Piyush Gupta Bell Laboratories, Lucent Technologies 2C-374, 600 Mountain Avenue Murray Hill, NJ 0... more Piyush Gupta Bell Laboratories, Lucent Technologies 2C-374, 600 Mountain Avenue Murray Hill, NJ 07974 Email: p}upta@research . ell-la s . com ... Robert Gray Dartmouth College Thayer School of Engineering 8000 Cummings Hall Hanover, NH 03755 Email: ro ert . s . }ra @ ...
An ad hoc network consists of a number of mobile hosts who communicate with each other over a wir... more An ad hoc network consists of a number of mobile hosts who communicate with each other over a wireless channel without any centralized control. The basic problem is to obtain a distributed routing scheme so that under the network connectivity assumption any mobile host can transmit/receive data from any other host in the network. In this paper we propose a
In wireless data networks the range of each transmitter, and thus its power level, needs to be hi... more In wireless data networks the range of each transmitter, and thus its power level, needs to be high enough to reach the intended receivers, while being low enough to avoid generating interference for other receivers on the same channel. If the nodes in the network are assumed to cooperate, perhaps in a distributed and decentralized fashion, in routing each others'
An ad hoc network consists of a number of mobile hosts who communicate with each other over a wir... more An ad hoc network consists of a number of mobile hosts who communicate with each other over a wireless channel without any centralized control. The basic problem is to obtain a distributed routing scheme so that under the network connectivity assumption any mobile host can transmit/receive data from any other host in the network. In this paper we propose a
Abstract. Consider n nodes located in a sphere of volume V cubic meters, each capable of transmit... more Abstract. Consider n nodes located in a sphere of volume V cubic meters, each capable of transmitting at a rate of W bits/sec. Under a protocol based model for successful receptions, the entire network can carry only (WV »3 n 23 ¿ bit-meters/sec, where 1 bit carried a distance of 1 meter is ...
In wireless data networks the range of each transmitter, and thus its power level, needs to be hi... more In wireless data networks the range of each transmitter, and thus its power level, needs to be high enough to reach the intended receivers, while being low enough to avoid generating interference for other receivers on the same channel. If the nodes in the network are assumed to cooperate, perhaps in a distributed and decentralized fashion, in routing each others'
We study communication networks of arbitrary size and topology and communicating over a general v... more We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel. We propose an information-theoretic constructive scheme for obtaining an achievable rate region in such networks. Many well-known capacity-defining achievable rate regions can be derived as special cases of the proposed scheme. A few such examples are the physically degraded and reverselydegraded relay channels, the Gaussian multiple-access channel, and the Gaussian broadcast channel. The proposed scheme also leads to inner bounds for the multicast and allcast capacities.
Abstract. Consider n nodes located in a sphere of volume V cubic meters, each capable of transmit... more Abstract. Consider n nodes located in a sphere of volume V cubic meters, each capable of transmitting at a rate of W bits/sec. Under a protocol based model for successful receptions, the entire network can carry only (WV »3 n 23 ¿ bit-meters/sec, where 1 bit carried a distance of 1 meter is ...
... 46, NO. 2, MARCH 2000 The Capacity of Wireless Networks ... Index Terms—Ad hoc networks, capa... more ... 46, NO. 2, MARCH 2000 The Capacity of Wireless Networks ... Index Terms—Ad hoc networks, capacity, multihop radio net- works, throughput, wireless networks. ...
We study communication networks of arbitrary size and topology and communicating over a general v... more We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel. We propose an information-theoretic constructive scheme for obtaining an achievable rate region in such networks. Many well-known capacity-defining achievable rate regions can be derived as special cases of the proposed scheme. A few such examples are the physically degraded and reverselydegraded relay channels, the Gaussian multiple-access channel, and the Gaussian broadcast channel. The proposed scheme also leads to inner bounds for the multicast and allcast capacities.
In this paper we study the problem of jointly performing scheduling and congestion control in mob... more In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flow rates satisfy an associated network utility maximization problem. In recent years a number of papers have presented theoretical solutions to this problem that are based on combining differential-backlog scheduling algorithms with utility-based congestion control. However, this work typically does not address a number of issues such as how signaling should be performed and how the new algorithms interact with other wireless protocols.
Recent years have seen tremendous growth in the deployment of Wireless Local Area Networks (WLANs... more Recent years have seen tremendous growth in the deployment of Wireless Local Area Networks (WLANs). An important design issue in such networks is that of distributed scheduling. The lack of centralized control leads to multiple users competing for channel access. This leads to significant throughput degradation. Existing approaches, such as the slotted Aloha protocol and IEEE 802.11 DCF, also fail to provide differentiated service to users. The upcoming IEEE 802.11e Enhanced DCF incorporates additional mechanisms to provide support for service differentiation. However, the level of differentiation achieved with these mechanisms is difficult to quantify. In this paper, we propose a class of distributed scheduling algorithms, Regulated Contention Medium Access Control (RCMAC), which provides dynamic prioritized access to users for service differentiation in a quantifiable manner. Furthermore, by regulating multi-user contention, RCMAC achieves higher throughput when traffic is bursty, as is typically the case. In addition to WLANs, the basic concepts of RCMAC have applications in ad hoc networks and emerging sensor networks.
We consider a model for random-access communication in networks of arbitrary topology. We charact... more We consider a model for random-access communication in networks of arbitrary topology. We characterize the efficient (Pareto) boundary of the network throughput region as the family of solutions optimizing weighted proportional fairness objective, parameterized by link weights. Based on this characterization we propose a general distributed scheme that uses dynamic link weights to "move" the link-throughput allocation within the Pareto boundary to a desired point optimizing a specific objective.
An ad hoc network consists of a number of mobile hosts who communicate with each other over a wir... more An ad hoc network consists of a number of mobile hosts who communicate with each other over a wireless channel without any centralized control. The basic problem is to obtain a distributed routing scheme so that under the network connectivity assumption any mobile host can transmit/receive data from any other host in the network. In this paper we propose a
In wireless data networks the range of each transmitter, and thus its power level, needs to be hi... more In wireless data networks the range of each transmitter, and thus its power level, needs to be high enough to reach the intended receivers, while being low enough to avoid generating interference for other receivers on the same channel. If the nodes in the network are assumed to cooperate, perhaps in a distributed and decentralized fashion, in routing each others'
Abstract. Consider n nodes located in a sphere of volume V cubic meters, each capable of transmit... more Abstract. Consider n nodes located in a sphere of volume V cubic meters, each capable of transmitting at a rate of W bits/sec. Under a protocol based model for successful receptions, the entire network can carry only (WV »3 n 23 ¿ bit-meters/sec, where 1 bit carried a distance of 1 meter is ...
We study communication networks of arbitrary size and topology and communicating over a general v... more We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel. We propose an information-theoretic constructive scheme for obtaining an achievable rate region in such networks. Many well-known capacity-defining achievable rate regions can be derived as special cases of the proposed scheme. A few such examples are the physically degraded and reverselydegraded relay channels, the Gaussian multiple-access channel, and the Gaussian broadcast channel. The proposed scheme also leads to inner bounds for the multicast and allcast capacities.
... 46, NO. 2, MARCH 2000 The Capacity of Wireless Networks ... Index Terms—Ad hoc networks, capa... more ... 46, NO. 2, MARCH 2000 The Capacity of Wireless Networks ... Index Terms—Ad hoc networks, capacity, multihop radio net- works, throughput, wireless networks. ...
In wireless data networks the range of each transmitter, and thus its power level, needs to be hi... more In wireless data networks the range of each transmitter, and thus its power level, needs to be high enough to reach the intended receivers, while being low enough to avoid generating interference for other receivers on the same channel. If the nodes in the network are assumed to cooperate, perhaps in a distributed and decentralized fashion, in routing each others' packets, as is the case in ad hoc wireless networks, then each node should transmit with just enough power to guarantee connectivity of the overall network. Towards this end, we determine the critical power at which a node in the network needs to transmit in order to ensure that the network is connected with probability one as the number of nodes in the network goes to infinity. Our main result is this: if n nodes are located randomly, uniformly i.i.d., in a disc of unit area in ℜ2 and each node transmits at a power level so as to cover an area of πr2=(log n + c(n))/n, then the resulting network is asymptotically connected with probability one if and only if c(n)→+∞
Piyush Gupta Bell Laboratories, Lucent Technologies 2C-374, 600 Mountain Avenue Murray Hill, NJ 0... more Piyush Gupta Bell Laboratories, Lucent Technologies 2C-374, 600 Mountain Avenue Murray Hill, NJ 07974 Email: p}upta@research . ell-la s . com ... Robert Gray Dartmouth College Thayer School of Engineering 8000 Cummings Hall Hanover, NH 03755 Email: ro ert . s . }ra @ ...
An ad hoc network consists of a number of mobile hosts who communicate with each other over a wir... more An ad hoc network consists of a number of mobile hosts who communicate with each other over a wireless channel without any centralized control. The basic problem is to obtain a distributed routing scheme so that under the network connectivity assumption any mobile host can transmit/receive data from any other host in the network. In this paper we propose a
In wireless data networks the range of each transmitter, and thus its power level, needs to be hi... more In wireless data networks the range of each transmitter, and thus its power level, needs to be high enough to reach the intended receivers, while being low enough to avoid generating interference for other receivers on the same channel. If the nodes in the network are assumed to cooperate, perhaps in a distributed and decentralized fashion, in routing each others'
An ad hoc network consists of a number of mobile hosts who communicate with each other over a wir... more An ad hoc network consists of a number of mobile hosts who communicate with each other over a wireless channel without any centralized control. The basic problem is to obtain a distributed routing scheme so that under the network connectivity assumption any mobile host can transmit/receive data from any other host in the network. In this paper we propose a
Abstract. Consider n nodes located in a sphere of volume V cubic meters, each capable of transmit... more Abstract. Consider n nodes located in a sphere of volume V cubic meters, each capable of transmitting at a rate of W bits/sec. Under a protocol based model for successful receptions, the entire network can carry only (WV »3 n 23 ¿ bit-meters/sec, where 1 bit carried a distance of 1 meter is ...
In wireless data networks the range of each transmitter, and thus its power level, needs to be hi... more In wireless data networks the range of each transmitter, and thus its power level, needs to be high enough to reach the intended receivers, while being low enough to avoid generating interference for other receivers on the same channel. If the nodes in the network are assumed to cooperate, perhaps in a distributed and decentralized fashion, in routing each others'
We study communication networks of arbitrary size and topology and communicating over a general v... more We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel. We propose an information-theoretic constructive scheme for obtaining an achievable rate region in such networks. Many well-known capacity-defining achievable rate regions can be derived as special cases of the proposed scheme. A few such examples are the physically degraded and reverselydegraded relay channels, the Gaussian multiple-access channel, and the Gaussian broadcast channel. The proposed scheme also leads to inner bounds for the multicast and allcast capacities.
Abstract. Consider n nodes located in a sphere of volume V cubic meters, each capable of transmit... more Abstract. Consider n nodes located in a sphere of volume V cubic meters, each capable of transmitting at a rate of W bits/sec. Under a protocol based model for successful receptions, the entire network can carry only (WV »3 n 23 ¿ bit-meters/sec, where 1 bit carried a distance of 1 meter is ...
... 46, NO. 2, MARCH 2000 The Capacity of Wireless Networks ... Index Terms—Ad hoc networks, capa... more ... 46, NO. 2, MARCH 2000 The Capacity of Wireless Networks ... Index Terms—Ad hoc networks, capacity, multihop radio net- works, throughput, wireless networks. ...
We study communication networks of arbitrary size and topology and communicating over a general v... more We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel. We propose an information-theoretic constructive scheme for obtaining an achievable rate region in such networks. Many well-known capacity-defining achievable rate regions can be derived as special cases of the proposed scheme. A few such examples are the physically degraded and reverselydegraded relay channels, the Gaussian multiple-access channel, and the Gaussian broadcast channel. The proposed scheme also leads to inner bounds for the multicast and allcast capacities.
Uploads
Papers by Piyush Gupta