Results 1  10
of
58
The capacity of wireless networks
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2000
"... When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally p ..."
Abstract

Cited by 2203 (31 self)
 Add to MetaCart
When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally placed in a disk of unit area, traffic patterns are optimally assigned, and each transmission’s range is optimally chosen, the bit–distance product that can be transported by the network per second is 2 @ A bitmeters per second. Thus even under optimal circumstances, the throughput is only 2 bits per second for each node for a destination nonvanishingly far away. Similar results also hold under an alternate physical model where a required signaltointerference ratio is specified for successful receptions. Fundamentally, it is the need for every node all over the domain to share whatever portion of the channel it is utilizing with nodes in its local neighborhood that is the reason for the constriction in capacity. Splitting the channel into several subchannels does not change any of the results. Some implications may be worth considering by designers. Since the throughput furnished to each user diminishes to zero as the number of users is increased, perhaps networks connecting smaller numbers of users, or featuring connections mostly with nearby neighbors, may be more likely to be find acceptance.
Adaptive clustering for mobile wireless networks
 IEEE Journal on Selected Areas in Communications
, 1997
"... This paper describes a selforganizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically reconfig ..."
Abstract

Cited by 413 (7 self)
 Add to MetaCart
This paper describes a selforganizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically reconfigured as nodes move. This network architecture has three main advantages. First, it provides spatial reuse of the bandwidth due to node clustering. Secondly, bandwidth can be shared or reserved in a controlled fashion in each cluster. Finally, the cluster algorithm is robust in the face of topological changes caused by node motion, node failure and node insertion/removal. Simulation shows that this architecture provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network. 1.
Critical Power for Asymptotic Connectivity in Wireless Networks
, 1998
"... : In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others ' packets, as is ..."
Abstract

Cited by 391 (16 self)
 Add to MetaCart
: In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others ' packets, as is the case in ad hoc wireless networks, each node should transmit with just enough power to guarantee connectivity in the network. Towards this end, we derive the critical power 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. It is shown that if n nodes are placed in a disc of unit area in ! 2 and each node transmits at a power level so as to cover an area of ßr 2 = (log n + c(n))=n, then the resulting network is asymptotically connected with probability one if and only if c(n) ! +1. 1 Introduction Wireless communication systems consist of nodes which share a common commu...
A Framework for Uplink Power Control in Cellular Radio Systems
 IEEE Journal on Selected Areas in Communications
, 1996
"... In cellular wireless communication systems, transmitted power is regulated to provide each user an acceptable connection by limiting the interference caused by other users. Several models have been considered including: (1) fixed base station assignment where the assignment of users to base stations ..."
Abstract

Cited by 385 (18 self)
 Add to MetaCart
In cellular wireless communication systems, transmitted power is regulated to provide each user an acceptable connection by limiting the interference caused by other users. Several models have been considered including: (1) fixed base station assignment where the assignment of users to base stations is fixed, (2) minimum power assignment where a user is iteratively assigned to the base station at which its signal to interference ratio is highest, and (3) diversity reception, where a user's signal is combined from several or perhaps all base stations. For the above models, the uplink power control problem can be reduced to finding a vector p of users' transmitter powers satisfying p I(p) where the jth constraint p j I j (p) describes the interference that user j must overcome to achieve an acceptable connection. This work unifies results found for these systems by identifying common properties of the interference constraints. It is also shown that systems in which transmitter powers ...
Channel Assignment Schemes for Cellular Mobile Telecommunication Systems
 IEEE Personal Communications
, 1996
"... This paper provides a detailed discussion of wireless resource and channel allocation schemes. We provide a survey of a large number of published papers in the area of fixed, dynamic and hybrid allocation schemes and compare their tradeoffs in terms of complexity and performance. We also investigat ..."
Abstract

Cited by 264 (1 self)
 Add to MetaCart
This paper provides a detailed discussion of wireless resource and channel allocation schemes. We provide a survey of a large number of published papers in the area of fixed, dynamic and hybrid allocation schemes and compare their tradeoffs in terms of complexity and performance. We also investigate these channel allocation schemes based on other factors such as distributed/centralized control and adaptability to traffic conditions. Moreover, we provide a detailed discussion on reuse partitioning schemes, effect of handoffs and prioritization schemes. Finally, we discuss other important issues in resource allocation such as overlay cells, frequency planning, and power control. 1 Introduction Technological advances and rapid development of handheld wireless terminals have facilitated the rapid growth of wireless communications and mobile computing. Taking ergonomics and economics factors into account, and considering the new trends in the telecommunications industry to provide ubiqui...
Joint Scheduling and Power Control for Wireless Adhoc Networks
, 2002
"... In this pape we introduce powe r control as a solution tothe multiple accel proble in conte tionbase wirenb adhocne works.The motivation for this study is two fold, limiting multiuse intej toincre single hop throughput, andrej powe r consumption to increj batte life We focus onne ne bor transmi ..."
Abstract

Cited by 186 (5 self)
 Add to MetaCart
In this pape we introduce powe r control as a solution tothe multiple accel proble in conte tionbase wirenb adhocne works.The motivation for this study is two fold, limiting multiuse intej toincre single hop throughput, andrej powe r consumption to increj batte life We focus onne ne bor transmissions whes node are rej tose information packe  tothe re e e re e sub jej to a constraint on the signaltointealtoinjj ratio.The multiple acce  proble is solve via twoaltej phase name schej and powe r control.The sche algorithm isej tial to coordinate the transmissions ofinde ede t use inorde toejj strong intej (e.g selfinterference) that can not be ove by powe r control. On the othe hand, powe r control isej in adistribute fashion to dej the admissible powe r ve ifone ene that can be use bythe sche use to satisfy thei singlej transmissionrensmissi ts. This isdone for two type s ofne works, namej TDMA and TDMA/CDMA wire/CD adhocne works.
Optimal Routing, Link Scheduling and Power Control in Multihop Wireless Networks
, 2003
"... In this paper, we study the problem of joint routing, link scheduling and power control to support high data rates for broadband wireless multihop networks. We first address the problem of finding an optimal link scheduling and power control policy that minimizes the total average transmission powe ..."
Abstract

Cited by 129 (0 self)
 Add to MetaCart
In this paper, we study the problem of joint routing, link scheduling and power control to support high data rates for broadband wireless multihop networks. We first address the problem of finding an optimal link scheduling and power control policy that minimizes the total average transmission power in the wireless multihop network, subject to given constraints regarding the minimum average data rate per link, as well as peak transmission power constraints per node. Multiaccess signal interference is explicitly modeled. We use a duality approach whereby, as a byproduct of finding the optimal policy, we find the sensitivity of the minimal total average power with respect to the average data rate for each link. Since the minimal total average power is a convex function of the required minimum average data rates, shortest path algorithms with the link weights set to the link sensitivities can be used to guide the search for a globally optimum routing. We present a few simple examples that show our algorithm can find policies that support data rates that are not possible with conventional approaches. Moreover, we find that optimum allocations do not necessarily route traffic over minimum energy paths.
Critical Power for Asymptotic Connectivity
, 1998
"... 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 i ..."
Abstract

Cited by 95 (0 self)
 Add to MetaCart
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, ([5]), and [7]), then each node should transmit with just enough power to guarantee connectivity of the overall network. Towards this end, we determine the critical power 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 innity. 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 r 2 = (log n + c(n))=n, then the resulting network is asymptotical...
Capacity of Power Constrained AdHoc Networks
, 2004
"... Throughput capacity is a critical parameter for the design and evaluation of adhoc wireless networks. Consider n identical randomly located nodes, on a unit area, forming an adhoc wireless network. Assuming a fixed per node transmission capability of T bits per second at a fixed range, it has been ..."
Abstract

Cited by 73 (2 self)
 Add to MetaCart
Throughput capacity is a critical parameter for the design and evaluation of adhoc wireless networks. Consider n identical randomly located nodes, on a unit area, forming an adhoc wireless network. Assuming a fixed per node transmission capability of T bits per second at a fixed range, it has been shown that the uniform throughput capacity per node r(n) is .
QoS and Fairness Constrained Convex Optimization of Resource Allocation for Wireless Cellular and Ad Hoc Networks
 in Proc. IEEE Infocom
, 2002
"... For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput and minimize delay. The distinguishing characteristics of these resource allocation formulations is that, by using convex op ..."
Abstract

Cited by 68 (10 self)
 Add to MetaCart
For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput and minimize delay. The distinguishing characteristics of these resource allocation formulations is that, by using convex optimization, they accommodate a variety of realistic QoS and fairness constraints. Their globally optimal solutions can be computed efficiently through polynomial time interior point methods, even though they use nonlinear objectives and constraints.