共查询到20条相似文献,搜索用时 15 毫秒
1.
We show that there is a trade-off among mobility, capacity, and delay in ad hoc networks. More specifically, we consider two schemes for node mobility in ad hoc networks. We divide the entire network by cells whose sizes can vary with the total number of nodes n, or whose size is independent of the number of nodes. We restrict the movement of nodes within these cells, calculate throughput and delay for randomly chosen pairs of source–destination nodes, and show that mobility is an entity that can be exchanged with capacity and delay. We also investigate the effect of directional antennas in a static network in which packet relaying is done through the closest neighbor and verify that this approach attains better throughput than static networks employing omnidirectional antennas. 相似文献
2.
Wang Kang Proakis John G. Rao Ramesh R. 《International Journal of Wireless Information Networks》2002,9(2):105-118
Power consumption is an important issue in the wireless ad hoc networking environment. In this paper, we present several energy-efficient routing algorithms using directional antennas for wireless ad hoc networks. These algorithms are simple to implement and are distributed and can be applied to mobile environments. We evaluate how directional antennas improve system throughput. We study the influence of the battery recovery effect and mobility on the network throughput during a network lifetime. We also present an algorithm that exploits the broadcast nature of the wireless communication environment to improve end-to-end bit error performance for a Rayleigh fading channel. 相似文献
3.
Capacity of ad hoc wireless networks with infrastructure support 总被引:7,自引:0,他引:7
Zemlianov A. Gustavo de Veciana 《Selected Areas in Communications, IEEE Journal on》2005,23(3):657-667
We determine the asymptotic scaling for the per user throughput in a large hybrid ad hoc network, i.e., a network with both ad hoc nodes, which communicate with each other via shared wireless links of capacity W bits/s, and infrastructure nodes which in addition are interconnected with each other via high capacity links. Specifically, we consider a network model where ad hoc nodes are randomly spatially distributed and choose to communicate with a random destination. We identify three scaling regimes, depending on the growth of the number of infrastructure nodes, m relative to the number of ad hoc nodes n, and show the asymptotic scaling for the per user throughput as n becomes large. We show that when m /spl lsim/ /spl radic/n/logn the per user throughput is of order W//spl radic/n log n and could be realized by allowing only ad hoc communications, i.e., not deploying the infrastructure nodes at all. Whenever /spl radic/n/log n /spl lsim/ m /spl lsim/ n/log n, the order for the per user throughput is Wm/n and, thus, the total additional bandwidth provided by m infrastructure nodes is effectively shared among ad hoc nodes. Finally, whenever m /spl gsim/ n/log n, the order of the per user throughput is only W/log n, suggesting that further investments in infrastructure nodes will not lead to improvement in throughput. The results are shown through an upper bound which is independent of the routing strategy, and by constructing scenarios showing that the upper bound is asymptotically tight. 相似文献
4.
Neely M.J. Modiano E. Rohrs C.E. 《Selected Areas in Communications, IEEE Journal on》2005,23(1):89-103
We consider dynamic routing and power allocation for a wireless network with time-varying channels. The network consists of power constrained nodes that transmit over wireless links with adaptive transmission rates. Packets randomly enter the system at each node and wait in output queues to be transmitted through the network to their destinations. We establish the capacity region of all rate matrices (/spl lambda//sub ij/) that the system can stably support-where /spl lambda//sub ij/ represents the rate of traffic originating at node i and destined for node j. A joint routing and power allocation policy is developed that stabilizes the system and provides bounded average delay guarantees whenever the input rates are within this capacity region. Such performance holds for general arrival and channel state processes, even if these processes are unknown to the network controller. We then apply this control algorithm to an ad hoc wireless network, where channel variations are due to user mobility. Centralized and decentralized implementations are compared, and the stability region of the decentralized algorithm is shown to contain that of the mobile relay strategy developed by Grossglauser and Tse (2002). 相似文献
5.
In this letter, we consider the capacity of ad hoc networks with infrastructure support. Although Grossglauser-Tse mobile network model enables /spl Theta/(1) per-node throughput scaling, the mobility assumption may be too unrealistic to be accepted in some practical situations. One of the key observations we acquired is that the infrastructure support plays the same role played by the mobility in the Grossglauser-Tse model. We show that nodes can utilize the randomly located infrastructure support instead of mobility when nodes are nearly static. In this case, we show that the per-node throughput of /spl Theta/(1) is still achievable when the number of access points grows linearly with respect to the number of nodes. 相似文献
6.
In a regular wireless ad hoc network, the Medium Access Control (MAC) protocol coordinates channel access among nodes, and the throughput of the network is limited by the bandwidth of a single channel. The multi-channel MAC protocols can exploit multiple channels to achieve high network throughput by enabling more concurrent transmissions. In this paper, we propose a hybrid and adaptive protocol, called H-MMAC, which utilizes multi-channel resources more efficiently than other multi-channel MAC protocols. The main idea is to adopt the IEEE 802.11 Power Saving Mechanism and to allow nodes to transmit data packets while other nodes try to negotiate the data channel during the Ad hoc Traffic Indication Message window based on the network traffic load. The analytical and simulation results show that the proposed H-MMAC protocol improves the network performance significantly in terms of the aggregate throughput, average delay, fairness and energy efficiency. 相似文献
7.
Qian Zhang Qing Chen Fan Yang Xuemin Shen Zhisheng Niu 《IEEE network》2007,21(1):14-20
Moving toward 4G, wireless ad hoc networks receive growing interest due to users' provisioning of mobility, usability of services, and seamless communications. In ad hoc networks fading environments provide the opportunity to exploit variations in channel conditions, and transmit to the user with the currently "best" channel. In this article two types of opportunistic transmission, which leverage time diversity and multi-user diversity, respectively, are studied. Considering the co-channel interference and lack of a central controller in ad hoc networks, the "cooperative and opportunistic transmission" concept is promoted. For opportunistic transmission that exploits time diversity, it is observed that the inequality in channel contention due to the hidden terminal phenomenon tends to result in energy inefficiency. Under this design philosophy, we propose a distributed cooperative rate adaptation (CRA) scheme to reduce overall system power consumption. Taking advantage of the time-varying channel among different users/receivers and being aware of the potential contention among neighboring transmissions, we propose a QoS-aware cooperative and opportunistic scheduling (COS) scheme to improve system performance while satisfying QoS requirements of individual flows. Simulation results show that by leveraging node cooperation, our proposed schemes, CRA and COS, achieve higher network throughput and provide better QoS support than existing work 相似文献
8.
本论文利用双变量泊松点过程对无线ad hoc广播网络和非法窃听网络共存的网络场景进行建模,运用随机几何工具,研究了无线ad hoc网络的保密广播传输容量,其定义为未发生窃听中断的广播发送节点密度、广播发送节点的相邻接收节点数量的平均值与保密速率的乘积.针对一般衰落和瑞利衰落信道条件,论文推导了造成保密中断的相邻窃听节点数量的平均值和保密广播传输容量的表达式.分析结果表明,与不存在相关性的网络场景相比,广播网络和窃听网络间的相关性会带来的保密广播传输容量的损失. 相似文献
9.
Broadcast capacity of wireless networks 总被引:2,自引:0,他引:2
We present an upper bound on the broadcast capacity of arbitrary ad hoc wireless networks. The throughput obtainable by each node for broadcasting to-all-of the other nodes in a network consisting of n nodes with- fixed transmission ranges and C bits per second channel capacity is bounded by O(C/n), which is equivalent to the upper bound for per node capacity of a fully connected single-hop network. 相似文献
10.
Jakob Eriksson Michalis Faloutsos Srikanth V. Krishnamurthy 《Networking, IEEE/ACM Transactions on》2007,15(1):119-132
It is well known that the current ad hoc protocol suites do not scale to work efficiently in networks of more than a few hundred nodes. Most current ad hoc routing architectures use flat static addressing and thus, need to keep track of each node individually, creating a massive overhead problem as the network grows. Could dynamic addressing alleviate this problem? In this paper, we argue that the use of dynamic addressing can enable scalable routing in ad hoc networks. We provide an initial design of a routing layer based on dynamic addressing, and evaluate its performance. Each node has a unique permanent identifier and a transient routing address, which indicates its location in the network at any given time. The main challenge is dynamic address allocation in the face of node mobility. We propose mechanisms to implement dynamic addressing efficiently. Our initial evaluation suggests that dynamic addressing is a promising approach for achieving scalable routing in large ad hoc and mesh networks 相似文献
11.
We analyze a mobile multiple input multiple output wireless link with M transmit and N receive antennas operating in a spatially correlated Rayleigh flat fading environment. Only the correlations between the channel coefficients are assumed to be known at the transmitter and the receiver. The channel coefficients are correlated in space and uncorrelated in time from one coherence interval to another. These coefficients remain constant for a coherence interval of T symbol periods after which they change to another independent realization according to the spatial correlation model. For this system we characterize the structure of the input signal that achieves capacity. The capacity achieving transmit signal is expressed as the product of an isotropically distributed unitary matrix, an independent nonnegative diagonal matrix and a unitary matrix whose columns are the eigenvectors of the transmit fade covariance matrix. For the case where the number of transmit antennas M is larger than the channel coherence interval T, we show that the channel capacity is independent of the smallest M-T eigenvalues of the transmit fade covariance matrix. In contrast to the previously reported results for the spatially white fading model where adding more transmit antennas beyond the coherence interval length (M>T) does not increase capacity, we find that additional transmit antennas always increase capacity as long as their channel fading coefficients are spatially correlated with the other antennas. We show that for fast hopping or fast fading systems (T=1) with only channel covariance information available to the transmitter and receiver, transmit fade correlations are beneficial. Mathematically, we prove this by showing that capacity is a Schur-convex function of the vector of eigenvalues of the transmit fade correlation matrix. We also show that the maximum possible capacity gain due to transmitter fade correlations is 10logM dB. 相似文献
12.
Kaya O. Ulukus S. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2004,50(10):2449-2462
We specify the capacity region for a power-controlled, fading code-division multiple-access (CDMA) channel. We investigate the properties of the optimum power allocation policy that maximizes the information-theoretic ergodic sum capacity of a CDMA system where the users are assigned arbitrary signature sequences in a frequency flat-fading environment. We provide an iterative waterfilling algorithm to obtain the powers of all users at all channel fade levels, and prove its convergence. Under certain mild conditions on the signature sequences, the optimum power allocation dictates that more than one user transmit simultaneously in some nonzero probability region of the space of all channel states. We identify these conditions, and provide an upper bound on the maximum number of users that can transmit simultaneously at any given time. Using these properties of the sum capacity maximizing power control policy, we also show that the capacity region of the fading CDMA channel is not in general strictly convex. 相似文献
13.
The stochastic model assumed to govern the mobility of nodes in a mobile ad hoc network has been shown to significantly affect the network's coverage, maximum throughput, and achievable throughput-delay trade-offs. In this paper, we compare several mobility models, including the random walk, random waypoint, and Manhattan models on the basis of the number of states visited in a fixed time, the time to visit every state in a region, and the effect of the number of wandering nodes on the time to first enter a set of states. These metrics for a mobility model are useful for assessing the achievable event detection rates in surveillance applications where wireless-sensor-equipped vehicles are used to detect events of interest in a city. We also consider mobility models based on Correlated Random Walks, which can account for time dependency, geographical restrictions, and nonzero drift. We demonstrate that these models are analytically tractable by using a matrix-analytic approach to derive new, closed-form results in both the time and transform-domains for the probability that a node is at any location at any time for both semi-infinite and finite 1D lattices. We also derive first entrance time distributions for these walks. We find that a correlated random walk 1) covers more ground in a given amount of time and takes a smaller amount of time to cover an area completely than a random walk with the same average transition rate, 2) has a smaller first entrance time to small sets of states than the random waypoint and random walk models, and 3) leads to a uniform distribution of nodes (except at the boundaries) in steady state. 相似文献
14.
In this paper, we investigate the deficiency of uncontrolled asymmetrical transmission power over multiple channels in ad hoc environments. We further propose a novel distributed transmission power control protocol called the distributed power level (DPL) protocol for multi‐channel ad hoc networks without requiring clock synchronization. Specifically, different transmission power levels are assigned to different channels, and nodes search for an idle channel on the basis of the received power so that the maximum allowable power of the preferred data channel is larger than or equal to the received power. If the most preferred channel of the least maximum power is busy, the nodes are able to select the next channel and so forth. As a result, interference is reduced over channels because the nodes that require higher transmission power are separated from interfering with the nodes that require lower transmission power. Two transmission power control modes are introduced for DPL: symmetrical and asymmetrical. For the symmetrical DPL protocol (mode), nodes transmit at the same power level assigned to the selected channel. On the other hand, for the asymmetrical DPL protocol, nodes are allowed to transmit at a lower or equal power level that is assigned to the selected channel. Extensive ns‐2‐based simulation results are presented to demonstrate that the proposed protocols can enhance the network throughput compared with the existing uncontrolled asymmetrical transmission power protocol. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
15.
It has been proposed to upgrade the performance of medium access control (MAC) schemes through the use of beamforming directional antennas, to achieve better power and bandwidth utilization. In this paper, we consider a shared wireless medium as employed in a mobile ad hoc wireless network. We present and analyze a random access MAC algorithm that is combined with the use of directional beamforming formed by each transmitting mobile entity. Mathematical equations are derived to characterize the throughput performance of such a directional-ALOHA (D-ALOHA) algorithm. We describe the interferences occurring at each receiving node by considering both distance based and SINR based interference models. The D-ALOHA protocol includes the establishment of a (in-band or out-of-band) control sub-channel that is used for the transmission of location update messages. The latter is used for allowing mobile nodes to track the location of their intended destination mobiles. We present a separation property result that allows us to express the network throughput performance as a product of two factors: (1) a stationary factor that represents the system throughput performance under a perfect receiver location update process, and (2) a mobility factor that embeds the user mobility and location update processes in expressing the level of throughput degradation caused due to location update errors. We employ our derived mathematical equations, as well as carry out simulation evaluations, to present an extensive set of performance results. The throughput performance of such a beamforming based MAC protocol is characterized in terms of the system’s traffic loading conditions, the selected beamwidths of the antennas at the transmitting mobiles, the mobility levels of the nodal entities and the bandwidth capacity allocated to the control channel used for location update purposes. We show that the D-ALOHA protocol can provide a significant upgrade of network performance when the transmitting nodes adapt their beamwidth levels in accordance with our presented control scheme. The latter incorporates the involved tradeoff between the attained higher potential spatial reuse factors and the realized higher destination pointing process errors, and consequently uses nodal mobility levels and channel loading conditions as key parameters. 相似文献
16.
针对Ad Hoc网络和MIMO的有效结合,提出了适于多跳Ad Hoc网络的支持MIMO的分布式拓扑未知时分多址接入协议.该协议通过有限域无线网络设计算法在每帧给每个节点分配时隙且无需知道全网拓扑信息,这极大地减小了收集全网拓扑信息的开销.通过预约,每个节点在其分配的无干扰时隙并行发送MIMO链路的所有数据流,并在与其他节点共享的时隙发送MIMO链路的一部份数据流来解决传输冲突.同时推导出保证通过率和最佳帧长.结果显示动态分配MIMO的传输容量和抗干扰能力会极大地提高通过率. 相似文献
17.
Lizhong Zheng Tse D.N.C. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2002,48(2):359-383
We study the capacity of multiple-antenna fading channels. We focus on the scenario where the fading coefficients vary quickly; thus an accurate estimation of the coefficients is generally not available to either the transmitter or the receiver. We use a noncoherent block fading model proposed by Marzetta and Hochwald (see ibid. vol.45, p.139-57, 1999). The model does not assume any channel side information at the receiver or at the transmitter, but assumes that the coefficients remain constant for a coherence interval of length T symbol periods. We compute the asymptotic capacity of this channel at high signal-to-noise ratio (SNR) in terms of the coherence time T, the number of transmit antennas M, and the number of receive antennas N. While the capacity gain of the coherent multiple antenna channel is min{M, N} bits per second per Hertz for every 3-dB increase in SNR, the corresponding gain for the noncoherent channel turns out to be M* (1 - M*/T) bits per second per Hertz, where M*=min{M, N, [T/2]}. The capacity expression has a geometric interpretation as sphere packing in the Grassmann manifold 相似文献
18.
The capacity of mobile ad hoc networks is constrained by the intra-flow interference introduced by adjacent nodes on the same path, and inter-flow interference generated by nodes from neighboring paths. By assigning orthogonal channels to neighboring nodes, one can minimize both types of interferences and allow concurrent transmissions within the neighborhood, thus improving the throughput and delay performance of the ad hoc network. In this paper, we present three novel distributed channel assignment protocols for multi-channel mobile ad hoc networks. The proposed protocols combine channel assignment with distributed on-demand routing, and only assign channels to active nodes. They are shown to require fewer channels and exhibit lower communication, computation, and storage complexity, compared with existing approaches. Through simulation studies, we show that the proposed protocols can effectively increase throughput and reduce delay, as compared to several existing schemes, thus providing an effective solution to the low capacity problem in multi-hop wireless networks. 相似文献
19.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》2005,51(11):3947-3954
We study the capacity of ad hoc wireless networks with mobile nodes. The mobility model examined is one where the nodes are restricted to move along one-dimensional paths. We examine the scaling laws for the per-user throughput achievable over long time-scales, making this suitable for applications with loose delay constraints. We show that under this regime of restricted mobility, we attain a constant throughput (i.e.,$Theta(1)$ ) per user, which is significantly higher than the throughput of fixed networks, which decays as$O(1over sqrtn)$ with the number of nodes$n$ , as shown by Gupta and Kumar. 相似文献
20.
《Selected Areas in Communications, IEEE Journal on》2009,27(2):117-125
An optical network is too costly to act as a broadband access network. On the other hand, a pure wireless ad hoc network with n nodes and total bandwidth of W bits per second cannot provide satisfactory broadband services since the pernode throughput diminishes as the number of users goes large. In this paper, we propose a hybrid wireless network, which is an integrated wireless and optical network, as the broadband access network. Specifically, we assume a hybrid wireless network consisting of n randomly distributed normal nodes, and m regularly placed base stations connected via an optical network. A source node transmits to its destination only with the help of normal nodes, i.e., in the ad hoc mode, if the destination can be reached within L (L /spl geq/ 1) hops from the source. Otherwise, the transmission will be carried out in the infrastructure mode, i.e., with the help of base stations. Two transmission modes share the same bandwidth of W bits/sec. We first study the throughput capacity of such a hybrid wireless network, and observe that the throughput capacity greatly depends on the maximum hop count L and the number of base stations m. We show that the throughput capacity of a hybrid wireless network can scale linearly with n only if m = Ω(n), and when we assign all the bandwidth to the infrastructure mode traffics. We then investigate the delay in hybrid wireless networks. We find that the average packet delay can be maintained as low as Θ(1) even when the per-node throughput capacity is Θ(W). 相似文献