Lit Review 2 | Routing | Wireless Ad Hoc Network

Literature Review 2: Performance analysis of wireless networks

Jeffrey Mehlman, Arun Miduthuri, Adithya Rao Electrical Engineering Department, Stanford University Stanford, California 94305 jmehlman, arunm7, adithyar at stanford dot edu
Abstract In this literature review, we provide a brief summary of how some specially defined capacity and delay metrics have been used to analyze the performance of wireless networks with increasing number of nodes and varying mobility.

I. TOWARDS AN INFORMATION THEORY OF LARGE NETWORKS: AN ACHIEVABLE RATE REGION This paper [1] aims to define an achievable rate region for a general network structure. The exact information theoretic capacity region is not known even for simple channels. The networks have arbitrary size and topology, and the channel is assumed to be a discrete memoryless Gaussian channel. The scheme is essentially a successive decoding scheme. The analysis of the paper relies on constructing a feedforward flowgraph, where nodes are grouped into level sets relative to a source and destination node. Per-node rate bounds will be classified according to the level each node belongs to. The source and destination are designated level numbers 0 and M+1 respectively. Nodes in level k can receive information from all nodes at levels 1 through k-1, and transmit to all nodes in level k+1 to M+1. Such a graph is constructed for U source-destination pairs. Then an achievable rate-vector region is given by the convex hull of all rate vectors (R1, R2 … RU), where each rate vector’s elements are the rates at each level. The constrai nts for the rates at each level, described in Theorems 2.1, 3.1, and 4.1 in the paper, have the following intuition behind them. Level Lm can send information at rate Rm to each node at higher levels if  a node at the next level can receive information at rate Rm from the component of its received signal that is correlated with the transmitted signals from level m (hence the mutual information between the these two signals constrains the rate Rm from above), and at each subsequent level, nodes can receive additional information at rate Rm – Rm-1 from the component of its received signal that is correlated with the transmitted signal from the mth level node (mutual information between these two signals thus again forming an upper constraint).

The paper first presents an example that applies the theorem to find the capacity-achieving rate region of the two-level relay channel. It is shown that for the single-level relay channel, the maximum rate is exactly that found in the paper by Cover and El Gamal [4]. It then goes on to present more advanced versions of the theorem for a single user and multiuser Gaussian channel and considers the effect of availability of channel gains from each node in the network to receiving nodes alone, or to all nodes, under fading conditions. A nice outcome of the authors’ scheme is that the rate regions achieved for the physically degraded and reversely degraded relay channels, the Gaussian multiple-access channel, and the Gaussian broadcast channel are capacity-achieving rate regions. One interesting point to note is that in their single-user scheme, they assume the same information that was sent from source s reaches not just the destination, but also all the nodes in the intermediate levels, thus giving an achievable bound on multicast capacity. However, this may also be seen as a drawback, as the ability to send different information across different paths is not being exploited. A limitation in their multi-user scheme is the lack of network coding, which has been shown in [5] to increase the achievable multicasting rate, and may well do so in this case. Finally, the paper proposes a network of n nodes, where n/2 source nodes are placed around one center, and n/2 nodes placed around a center 1m away. Under these conditions, information exchange between sources, or between destinations, takes place in a short time. Hence they act as n/2 transmit and receive antennas. Noting that the S-D distance is of constant order,

and (ii) mobile-delay. By using an adaptation of the first scheme. even though the authors consider a special case. and v ( n ) denotes the scaling of velocity with nodes. The time spent in each hop is shown to be constant. This scheme uses hops along sub-cells and mobile relay nodes chosen at random to achieve the optimal throughput. na ( n ) log n ). the time a packet spends at a relay while it is moving. fo r T ( n )   (1) . Some of the observations from this work are: (i) In a fixed random network. where a random network model was introduced to observe throughput scaling in wireless networks for fixed nodes. This scheme provides the optimal throughput-delay trade-off for a fixed wireless network. In the cellular setting with n cells. constant and independent of n. In this case. the optimal order of delay. achieves rate regions previously shown to be equal to their capacity regions. this paper describes a scheme that varies the number of hops. II. Finally. The queues are modeled and the inter arrival and inter departure times are characterized to get a bound on the average delay. This is an improvement over the previous Θ(n1/2) bound derived in [6]. the paper provides an achievable rate region that. but increases interference and reduces the throughput as well. This paper describes a scheme that achieves for any given throughput. it certainly opens the door. The third scheme achieves throughput delay tradeoff for a mobile network. The first scheme considers the Gupta-Kumar fixed random network model [6] and bounds the average number of hops. 3. delay can be decreased by increasing the size of the neighborhood of each node. for T ( n )  O (1 / n log n ) . due to node mobility and queuing at the relay is shown to be: D ( n )  O ( n / v ( n )). and the degree of node mobility to achieve the optimal throughput-delay trade-off. AWGN. The obvious limitation of this favorable scaling law is that the location of the nodes is not random. which uses mobility to increase throughput and uses multiple hops cleverly to obtain lower delay. and the delay then depends on the node velocity. The results are derived for a unit torus but hold for a unit square as well. although the paper does not address the challenging derivation of the capacity achieving regions in a general network setting. A larger neighborhood increases interference and results in lower throughput leading to a tradeoff. However. For a mobile wireless network. and also on the work of Grossglauser and Tse (2001) who showed that with mobile nodes it is possible to have constant throughput scaling per source-destination pair. Another variation of the scheme is presented. CSIRT version of its theorem to obtain a Θ(n) bound on transport capacity. It builds on the work of Gupta and Kumar (2000). parameterized by the average distance per hop. In summary. a ( n ) . THROUGHPUT-DELAY TRADE-OFF IN WIRELESS NETWORKS This paper [2] characterizes the delay and determines the throughput-delay trade-off for both fixed and mobile ad hoc networks. and D (n )   (1 / v (n ) a (n ) ): . 2. One of the main contributions of this paper is that it gives a meaningful definition of delay that makes derivations possible for ad-hoc networks. the transmission range. for some channels. The proofs presented here also use simpler tools and a more unified framework as compared to previous work. using zero-forcing beamforming. This paper introduces three schemes for fixed and mobile random networks: 1. and the dependence of the optimal delay on throughput is shown to be D ( n )   ( nT ( n )). The delay. A node in the source cluster is assumed to send independent information to each node in the destination cluster. The second scheme considers nodes moving according to independent Brownian motions and using a single relay as in [7].the paper uses the rate-constraints of the multiuser. This work primarily focuses on the network delay and assumes the Relaxed Protocol model. The delay is shown to have two components: (i) hop-delay. the implication is that using smarter multiuser coding schemes in some large wireless network settings can increase transport capacity. The throughput and delay in this case are given by T ( n )   (1 / . A separate result derived from this region is a more feasible transport capacity for a specific wireless topology and more advanced receiver operations. independent of n. D(n). this model on a torus yields a symmetric random walk. multi-hopping leads to high delays (ii) Mobility allows nodes to approach one another closely. increasing the transmission range reduces the number of hops and delay.

Additionally. The point Q where a(n) = Θ(1) corresponds to the model in [6]. Each protocol is tested on a five-node testbed where the nodes are randomly distributed over a 20m x 20m box. while the point R where a(n) = Θ((log n)/n) corresponds to the model in [7]. and multi-hop routing with spatial reuse. communication overhead for this exchange is entirely ignored. which describes the complete information flow at any point in time. for the latter case. the authors formally introduce the concept of rate matrices and transmission schemes. such that their fractional use-time adds up to 1 over the entire course of communication. and the underlying scheme is TDMA.Figure 1 summarizes these tradeoffs. and also by combining these results with other metrics such as those described in [1] and [3]. We see that as the protocols get more complex. they restrict the nodes to have only the ability to transmit with discrete rate adaptation schemes. (d) Two level power control added to (c). in the presence of continuous-rate adaptation does not yield . and their impact on rate regions. no spatial reuse. CAPACITY REGIONS FOR WIRELESS AD HOC NETWORKS In this paper [3]. There are a number of basic assumptions made across all of the models. A transmission scheme is described by a rate matrix. based on a variety of different assumptions regarding the communication system itself. (c) Multihop routing with spatial reuse. Throughput-delay scaling trade-off for a wireless network assuming v(n) = Θ(n1/2). III. For their system. they review a number of different transmission protocols and assumptions. uniform capacity. Each node is capable of transmitting with a continuous-rate adaptation scheme. noise. the authors develop achievable rate regions for wireless ad hoc networks in arbitrary topologies and number of nodes. Fig. Finally. One interesting point is that power control. and interference is considered for all nodes which transmit simultaneously. Next. It is the maximum aggregate communication rate for which all nodes transmit at the same rate. 2. and power vectors for the entire system. The results from these tests can be partially summarized with figure 2. the tradeoff being the line segment QR. every communication is unicast (no broadcasts). With these tools in hand. The work in this paper was the first that considered the delay in random networks and is therefore important for a practical implementation. Noise is modeled as AWGN. Fig. Capacity region slices of the example ad hoc network along the plane R 12 – R34 plane. Additionally. This shows a 2 dimensional rate region slice for the rates from node 1 to 2 and from 3 to 4 with all other links given zero rate. weighted by their use-times. The work in this paper can be further extended by considering constraints in terms of queuing delay. Nodes are considered half-duplex at any point in time. multi-hop routing without spatial reuse. One important assumption is that all nodes are considered to be omniscient at all times. Schemes can be scheduled. all communications utilize the entire system bandwidth. as well as the transmission schedule. the rate region is expanded. They know the channel gain matrix. (b) Multihop routing. the rate matrices are determined by the channel gain and power vectors through Shannon capacity. (a) Single hop routing. the authors define the central metric for this paper. Additionally. the rate matrices. 1. no spatial reuse. The marks on the axes represent the orders asymptotically in n. (e) Successive interference cancellation added to (c). It also built on previous work and provided a simpler framework to characterize delay and throughput. they also consider systems where the nodes can control their output power and have the complexity required to perform successive interference cancellation. They consider a number of different communication protocols: single-hop routing without spatial reuse. can be added up to yield the entire throughput for a given schedule. In this way.

One common thread joining them is the description of behavior these metrics exhibit under different network topologies and sizes. [3] introduced rate matrices defined under a specific transmission scheme. Among the three. the rate region resembles the shape of the Gaussian MAC channel capacity with SIC. In the mobility example. and all different from the Shannon capacity definition. The metrics used vary from [2]’s asymptotic bounds on throughput. It is also interesting to note that with SIC. Further work would hopefully incorporate more complex network structures and node cooperation. The authors make a very important assumption for this calculation: nodes do not care about delay. [1] and [2] are more theoretical. the sum of products of bits and the distances over which they are carried. the capacity region can be increased significantly. [3] analyzed a specific time-division multiple access scenario. they discuss the idea of finding a subset of rate matrices which approximate the entire capacity region. The authors note that with an appropriately simple rate-matrix determination scheme. In not taking delay into consideration. [2] goes further by using node velocity as a parameter of mobility. one can derive achievable rate regions under these schemes. The asymptotic analysis of this quantity provides a better idea than throughput of how multihop routing can improve performance in carrying bits to further destinations. They consider only the case where a single node is the data sink (i. In order to study larger node populations. the uniform capacity increased from 3. and [3] and [2] characterize the behavior of their respective capacity metrics as nodes become mobile.7MBps to 11. Both [1] and [3] describe achievable rate regions which are possibly suboptimal. [1] uses the the notion of transport capacity introduced in [6].any significant gains. It would be interesting to see if we could somehow accommodate delay in this framework. Providing that the nodes know the entire schedule and channel gains. delay. The three papers also exhibit a progression wherein [1] analyzes only fixed networks. Note that these metrics are relatively new. The authors also discuss the fact that calculation of every single rate matrix is a computationally complex task which gets harder as the number of nodes increase. and no broadcast is allowed. These two cases can be considered very similarly. since nodes can utilize the channel only when its very good and send a lot of data at a high rate. throughput scales with allowable delay.e. they could possibly extend this framework to deal with MAC and routing protocol designs as well. With no delay constraint. . By adding the appropriate mathematical assumptions which demand that each node’s energy consumption remain below some total energy value. changing the scheduling across spatial configurations causes an increase in throughput. [3] assumes no delay constraints and a Brownian motion model for simulating mobility instead of directly incorporating node velocity. Discussion The above papers are typical of the many different techniques proposed in characterizing network performance and capacity. Some of the limitations preventing this scheme from being capacity achieving in a general network setting may have involved the lack of network coding and the redundancy of sending the same information to different nodes all finally sending back the information to the same destination. though it is not clear if that would be possible. It would be interesting to consider what kinds of real-world protocol design hints we can gain from this paper. this assumption is made through the entire paper but is of greater impact for time-varying channel gains. A major assumption in this paper was that end-to-end delay was of no concern. a basestation). Its findings do however show that if nodes are willing to tolerate large delay. This would be an interesting avenue for research. the authors show that energy constrained networks can be considered in this framework. As discussed in the Gupta/Kumar paper. However. [1] tried a formal information theoretic approach to a general network setting by slicing the network into various layers of node interaction and finding rate constraints along those slices. their rate regions are inherently larger for every case. one would expect that time varying channel gain would increase capacity. in general. [2] discussed delay as a function of node velocity and as a tradeoff against throughput. The next portion of the paper considers mobility and time-varying fading channels. and examining the tradeoff between delay and throughput. Finally. while [3] has some focus on simulation results. and their constraints under asymptotic node velocity. to protocol specific capacity regions in [3] to rate regions in the information theoretic sense in [1]. The authors of [3] also defined uniform capacity under time division routing and a given transmission protocol as the maximum aggregate of equal rates at which nodes communicate if all the nodes wish to communicate with all other nodes. In fact. where full CSI knowledge is assumed at all nodes.1Mbps.

“Capacity Theorems for the relay channel. vol. “Towards an Information Theory of Large Networks. 49.R. pp. Goldsmith.R. P.” IEEE Transactions on Information Theory. R. [4] T.. Vol. [6] P.” IEEE Transactions on Wireless Communications. 46. 2003. Gupta.” IEEE Infocom. P. vol IT-25. No. Li. Gupta. No. 2004. Cai. 736-748. [7] Matthias Grossglauser and David N. Vol. “Mobility Increases the Capacity of Ad Hoc Wireless Networks. pp. July 2000. 1204-1216. “Throughput-Delay Trade-off in Wireless Networks. [5] R. 46. 10. vol. Ahlswede. 4. Tse. 388404. Kumar. El Gamal et al.” IEEE Transactions on Information Theory . Sept 1979. [3] S. “Capacity Regions for Wireless Networks. El Gamal.” IEEE/ACM Transactions on Networking. Yeung. 2000. C. S. Mar. .” IEEE Transactions on Information Theory.References [1] P. Toumpis. A. August 2003 [2] A. 8.M.” IEEE Transactions on Information Theory. R. 572-584. N. August 2002. Cover and A. pp. pp. “Network information flow. “The capacity of wireless networks. Kumar.

Sign up to vote on this title
UsefulNot useful