Capacity Scaling Laws for Underwater Networks

The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency. Signals transmitted from one user to another over a distance $l$ are subject to a power loss of $l^{…

Authors: Daniel E. Lucani, Muriel Médard, Milica Stojanovic

Capacity Scaling La ws for Underwater Netw orks (In vited P aper) Daniel E. Lucani RLE, MIT Cambridge, Massachusetts, 02139 Email: dlucani@mit.edu Muriel M ´ edard RLE, MIT Cambridge, Massachusetts, 02139 Email: medard@mit.edu Milica Stojanovic Northeastern Univ ersity Boston, Massachusetts, 02115 Email: millitsa@mit.edu Abstract — The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency . Signals transmitted from one user to another over a distance l are subject to a power loss of l − α a ( f ) − l . Although a terrestrial radio channel can be modeled similarly , the underwater acoustic channel has different characteristics. The spreading factor α , related to the geometry of propagation, has values in the range 1 ≤ α ≤ 2 . The absorption coefficient a ( f ) is a rapidly increasing function of frequency: it is three orders of magnitude greater at 100 kHz than at a few Hz. Existing results for capacity of wireless networks correspond to scenarios for which a ( f ) = 1 , or a constant greater than one, and α ≥ 2 . These results cannot be applied to underwater acoustic networks in which the attenuation varies over the system bandwidth. W e use a water -filling argument to assess the minimum transmission power and optimum transmission band as functions of the link distance and desired data rate, and study the capacity scaling laws under this model. I . I N T RO D U C T I O N The seminal work by [1] studied wireless networks, mod- eled as a set of n nodes that exchange information, with the aim of determining what amount of information the source nodes can send to the destination as the number n gro ws. The original results obtained for nodes deployed in a disk of unit area motiv ated the study of capacity scaling laws in different scenarios, ranging from achiev ability results in ran- dom deployments using percolation theory [4] or cooperation between nodes [3], to the impact of node mobility over the capacity of the network, e.g. [2]. Reference [5] provides a good ov erview of the different assumptions and scaling laws for radio wireless networks. The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency [7]. Signals transmitted ov er a distance l are subject to a power loss of l − α a ( f ) − l . Although a terrestrial radio channel can be modeled similarly , the underwater acoustic channel has dif ferent characteristics. The spreading factor α , related to the geometry of propagation, has values in the range 1 ≤ α ≤ 2 , where α = 1 corresponds to cylindrical spreading. Also, the absorption coefficient a ( f ) is a rapidly increasing function of frequency , e.g. it is three orders of magnitude greater at 100 kHz than at a few Hz [7]. Finally , the po wer spectral density of the noise underwater is highly dependent on frequency . Existing capacity scaling laws for wireless radio networks correspond to scenarios for which a ( f ) = 1 , or a constant greater than one, and α ≥ 2 , e.g. [1], [4]. These results cannot be directly applied to underwater acoustic networks in which the attenuation varies over the system bandwidth and α ≤ 2 . W e study the scaling laws under a model that considers a water-filling argument to assess the minimum transmission power and optimum transmission band as functions of the link distance and desired data rate [8]. In particular , we study the case of arbitrarily deplo yed networks in a disk of unit area, and follow a similar procedure as in [1] to deriv e an upper bound on capacity . In this sense, we provide an extension of the work in [1] under a more complicated po wer loss model. W e show that the amount of information that can be ex- changed by each source-destination pair in underwater acous- tic networks goes to zero as the number of nodes n goes to infinity . This occurs at least at a rate n − 1 /α e − W 0 ( O ( n − 1 /α )) , where W 0 represents the branch zero of the Lambert func- tion. W e illustrate that this throughput per source-destination pair has two different regions. For small n , the throughput decreases very slowly as n increases. For large n , it decreases almost as n − 1 /α . Thus for large enough n , the throughput decreases more rapidly in underwater networks than in typical radio channels, because of the difference in the path loss exponent α . The paper is organized as follows. In Section II, we present the underwater channel model. In Section III, we analyze the scaling laws for the case of a network transmitting in an arbitrarily chosen narrow band. In Section IV , we study scaling laws for the lo w-power/narro w-band case, with optimal bandwidth allocation using a waterfilling argument. In section V , we consider the case in which the nodes can transmit at high power o ver a wide transmission band. Conclusions are summarized in Section VI. I I . U N D E RW A T E R C H A N N E L M O D E L An underwater acoustic channel is characterized by an attenuation that depends on the distance l and the signal frequency f as A ( l, f ) =  l l ref  α a ( f ) l (1) where l ref is a reference distance (typically 1 m). A common empirical model used for the absorption a ( f ) is Thorp’ s formula [7] which captures the dependence on the frequency . This absorption a ( f ) is an increasing function of f c (l) l l<<1 km f Δ (a) (b) Fig. 1. Relationship between transmission distance and center frequency in a narrow band system. f . The spreading factor describes the geometry of propagation and is typically 1 ≤ α ≤ 2 , e.g. α = 1 and α = 2 correspond to cylindrical and spherical spreading, respectiv ely . The noise in an acoustic channel can be modeled through four basic sources: turbulence, thermal noise, shipping, and wav es. It has a po wer spectral density (psd) which depends on the frequenc y , the shipping activity s , and the wind speed w in m/s [7]. The complete model for a colored Gaussian underwater link was presented in [8] where power was allocated through wa- terfilling. In the absence of multipath and channel fading, the relationship among capacity , transmission power , and optimal transmission band of a point-to-point link is giv en by [8] C = Z B ( l,C ) log 2  K ( l,C ) A ( l,f ) N ( f )  d f (2) where N ( f ) is the psd of the noise, B ( l , C ) is the optimum band of operation and K ( l, C ) is a constant. The transmission power associated with a particular choice of ( l , C ) is giv en by P ( l, C ) = Z B ( l,C ) S ( l , C, f ) d f (3) where the psd of the signal is S ( l, C , f ) = K ( l , C ) − A ( l, f ) N ( f ) , f ∈ B ( l , C ) . A distinguishing feature of the underwater acoustic channel is the dependence of the optimal transmission band on the link distance [8]. Fig. 1 illustrates the optimal center frequency f c ( l ) as a function of distance. The optimal center frequency is defined as the frequency at which A ( l , f ) N ( f ) is minimal. This implies that if the transmission po wer for a link is low , the transmission bandwidth will be low and around the optimal frequency . Thus, the optimal transmission band in the spectrum changes dramatically with the link distance. Fig. 1 also illustrates that a node transmitting over a short range will optimally be assigned a transmission band at high center frequency , as in case (a), while a node transmitting ov er a longer distance will be assigned a different transmission band at lower center frequency , as in case (b). For the case in which power av ailable for transmission is low , the bandwidth of the transmission band will also be small. When the bandwidth is low enough | B ( l , C ) | = ∆ f , such that the product A ( l, f ) N ( f ) does not change much o ver that band, one can make a T aylor series approximation around the center frequency f c ( l ) . This allows us to determine the po wer P for which the transmission band is narrow due to our waterfilling argument. The T aylor series approximation has the form A ( l, f ) N ( f ) ≈ A ( l , f c ) N ( f c ) + Υ ( f − f c ) 2 2 (4) ∀ f in the band, where Υ = ∂ 2 ∂ f 2 ( A ( l, f ) N ( f )) | f = f c . Substi- tuting the expression (4) into expression (3), and using the fact that K ( l , C ) = A ( l, f max ) N ( f max ) = A ( l , f min ) N ( f min ) , where f max and f min are the maximum and minimum fre- quencies of the transmission band, we obtain P ( l, C ) ≈ A ( l , f max ) N ( f max )∆ f − R f max f min  A ( l, f c ) N ( f c ) + Υ ( f − f c ) 2 2  d f (5) where ∆ f = f max − f min . Considering f max − f c ≈ ∆ f 2 and f c − f min ≈ ∆ f 2 giv en our quadratic T aylor series approximation of A ( l , f ) N ( f ) , the above expression reduces to P = Υ 12 ∆ f 3 (6) I I I . F I X E D N A R RO W - B A N D M O D E L Let us study the physical model [1] to obtain an upper bound to transport capacity for transmissions in a arbitrarily chosen narrow band in an underwater channel. The narrow band assumption allows us to consider the attenuation as a constant ov er that band. W e assume that the nodes are arbitrarily deployed in a disk of unit area as in [1], that each node has an intended destination node, and that the requirement for successful reception at node j of a transmission from node i is P i ( f ) A ( | X i − X j ( i ) | ,f ) N ( f ) + P k ∈ τ ,k 6 = i P k ( f ) A ( | X k − X j ( i ) | ,f ) ≥ β (7) where X i is the position of node i , X j ( i ) is the position of node j to which i is transmitting, and τ is the set of all nodes transmitting simultaneously in the same transmission sub-band and time slot. W e assume that all sub-bands are in the narrow band [1], so that the attenuation is only dependent on the central frequency of the narrow band. The parameter f is kept to keep in mind the frequency dependence, and to allow us to use these results in the following sections where we analyze more complex settings. W e consider that λ is the throughput of each node, the network transports λnT bits over T seconds, and that the average distance between source and destination of a bit is ¯ L . Finally , we define the transport capacity as λn ¯ L bits-meters per second [1]. Let us define W = 4 f log 2 (1 + β ) to be the transmission rate, where 4 f is the bandwidth of the narro w band chosen for transmission. Since | X k − X j ( i ) | ≤ 2 √ π , and a ( f ) ≥ 1 , ∀ f , then the path loss is A ( | X k − X j ( i ) | , f ) ≤  2 √ π l ref  α a ( f ) 2 / √ π ≡ γ . (8) Using a similar procedure as in [1], we hav e that A ( | X i − X j ( i ) | , f ) ≤ β + 1 β γ P i ( f ) P k ∈ τ P k ( f ) . (9) Let us sum over all transmitters i ∈ τ and use the definition of the path loss in expression (1): X i ∈ τ | X i − X j ( i ) | α a ( f ) | X i − X j ( i ) | ≤ γ α β + 1 β (10) where γ α = l α ref γ =  2 √ π  α a ( f ) 2 / √ π . Summing over all sub-bands and time slots and dividing both sides by H , we obtain 1 H λnT X b =1 h ( b ) X h =1 r A ( h, b ) ≤ γ α β + 1 β W T H (11) where h ( b ) represents the h -th hop of a bit b , and H is defined as the number of hops performed in T seconds, which can be bounded by H ≤ W T n 2 [1]. Finally , r A ( h, b ) = l ( h, b ) α a ( f ) l ( h,b ) , where l ( h, b ) represents the distance be- tween receiv er and transmitter for the h -th hop of bit b . Since the function r A ( l ) = l α a ( f ) l is increasing and con vex for l ≥ 0 , α ≥ 1 and a ( f ) ≥ 1 , then   ln a ( f ) H λnT X b =1 h ( b ) X h =1 l ( h, b )   α exp   ln a ( f ) H λnT X b =1 h ( b ) X h =1 l ( h, b )   ≤ (ln a ( f )) α γ α β + 1 β W T H . (12) Let us define ψ = (ln a ( f )) α γ α β +1 β W T H , and note that ψ ≥ 0 . The left hand side of the abov e inequality is a Lambert function of the form W α exp W , which is an increasing function when W ≥ 0 . Then, ln a ( f ) H λnT X b =1 h ( b ) X h =1 l ( h, b ) ≤ ψ 1 /α exp − W 0 ψ 1 /α α !! (13) where W 0 ( · ) is the branch zero of the Lambert function, using the nomenclature in [6]. This fact implies that λn ¯ L ≤ H T ln a ( f ) ψ 1 /α exp − W 0 ψ 1 /α α !! . (14) Substituting for ψ in (14), we obtain λn ¯ L ≤ H α − 1 α T α − 1 α  γ α β + 1 β W  1 /α exp − W 0 ψ 1 /α α !! . (15) Since H α − 1 α is an increasing function for α > 1 , and constant for α = 1 , then H α − 1 α ≤  W T n 2  α − 1 α . Considering that W 0 ( · ) is an increasing function, we hav e that W 0 ψ 1 /α α ! ≥ W 0   2 ln a ( f ) a ( f ) 2 α √ π α √ π  β + 1 β  1 /α 2 1 /α n 1 /α   . Using these inequalities into expression (15), we obtain the scaling law: λn ¯ L ≤ Φ W n α − 1 α exp − W 0 Φ 2 ln a ( f ) α  1 n  1 /α !! (16) where Φ = 2 1 /α √ π  β + 1 β  1 /α  a ( f ) 2 √ π  1 /α . Since the zero-branch of the Lambert function satis- fies W 0 ( x ) ≥ 0 , ∀ x ≥ 0 , then the exponential term exp  − W 0  O  n − 1 /α  has values between 0 and 1. Note that as n → ∞ , the exponential term in the scaling law goes to 1. This implies that the exponential term is important to determine the scaling for n small, while for large enough n the upper bound is O ( n α − 1 α ) . If we consider a ( f ) = 1 , i.e. the same path loss model as in [1], and recall that W 0 (0) = 0 , then λn ¯ L ≤ 1 √ π  2 β + 2 β  1 /α W n α − 1 α (17) which is the original result of [1]. W e have thus proved that the result in [1] is valid for α ≥ 1 . Fig. 2 illustrates the upper bound on λ ¯ L for dif ferent values of a ( f ) ranging from 1 to 10,000, which are characteristic of an underwater en vironment at different frequencies. For example, a ( f ) = 1,000 corresponds to a frequency of around 100 KHz. W e have used α = 1 and the parameters specified in the figure. W e also plot dashed lines proportional to n − 1 /α . As expected, as n is large enough the exponential term of the upper bound becomes negligible making the bound scale as O ( n − 1 /α ) . Howe ver , for small values of n the bound starts at a common point for the different a ( f ) values, and decays very slowly . Fig. 2 also illustrates that the value of a ( f ) determines the transition between these two operating regions: the larger a ( f ) , the greater n has to be before transitioning. Of course, if we use a transmission band with high a ( f ) each node will hav e to be able to transmit at higher power to reach its destination. In the underwater channel, it also means that a higher center frequency is required because a ( f ) is an increasing function. Finally , Fig. 2 shows that λ ¯ L remains almost constant for n ≤ 100 nodes, a ( f ) > 100 and a disk area of 1 km 2 , which corresponds to densities of up to 100 nodes per km 2 . Note that the expected density of nodes in an underwater network is usually much lo wer gi ven the applications for which they are deployed, e.g. en vironmental measurements. Thus, λ ¯ L is almost constant for practical purposes. 100 10000 1000000 1000 100000 10 −4 10 −3 10 −2 10 −1 10 0 10 1 Number of Nodes (n) λ L Upper Bound ∝ n −1/ α a(f) = 1,10,100,1000,10000 Fig. 2. Upper Bound on λ ¯ L for an arbitrarily chosen narrow band and different values of a ( f ) . Parameters used are W = 1 bps, α = 1, β = 2, area = 1 km 2 . I V . L O W P O W E R - N A R R OW B A N D C A S E As mentioned in the introduction, one of the characteristics of the underwater acoustic channel is that the optimal transmis- sion band using the waterfilling principle depends strongly on the distance of a link. In particular , if the transmission power of a node is v ery lo w , then nodes will optimally transmit in dif- ferent bands corresponding to different transmission distances. Thus, interference will come only from nodes transmitting in the same band. W e hav e derived an e xpression for the power under these assumptions in Section II. In order to assign disjoint transmission bands, we divide the total transmission band of the system into non-overlapping bands of bandwidth ∆ f . W e use f c ( l ) as the mapping between the transmission distance and the corresponding transmission band for a low- power/narro w-band scenario. Thus, if a node transmits to another node at a distance l , we assign the transmission band that contains the frequency f c ( l ) as in Fig. 1. The capacity analysis is similar as before if a ( f ) is replaced by a ( f m ) for each of the bands, where f m is the central frequency of transmission band m . Let us assume that each node is capable of transmitting at 4 W bps in each band, where 4 W = 4 f log 2 (1 + β ) , and 4 f is the bandwidth of each non-ov erlapping band. A. Multi-Node Hopping Note that the definition of H changes slightly when we allow multi-node hopping. In this case, H ≤ T | Γ |4 W n 2 = T W n 2 , where Γ is the set of sub-bands used by the network, and W = | Γ |4 W . For each of the different bands, the analysis is as before up to equation (10). At this point, let us define γ α ( f m ) as γ α for band m . Let us sum over all sub-bands and time slots to obtain X s ∈ S X m ∈ Γ X i ∈ τ | X i − X j ( i ) | α a ( f m ) | X i − X j ( i ) | ≤ β + 1 β 4 W T X m ∈ Γ γ α ( f m ) (18) where S is the set of time slots. W e can use the fact that a ( f m ) ≥ a min , where a min = min m ∈ Γ a ( f m ) . In the uncer- water scenario, a min = a ( f min ) because a ( f ) is an increasing function. Defining r A ( h, b, f min ) = l ( h, b ) α a ( f min ) l ( h,b ) , and following similar steps that lead to Eq. (11) we get 1 H λnT X b =1 h ( b ) X h =1 r A ( h, b, f min ) ≤ β + 1 β 4 W T H X m ∈ Γ γ α ( f m ) . Defining ψ = (ln a ( f min )) α β +1 β 4 W T H P m ∈ Γ γ α ( f m ) , we can use a similar procedure as in the previous section, to show that the scaling law now becomes λn ¯ L ≤ Φ W n α − 1 α exp − W 0 Φ 2 ln a ( f min ) α  1 n  1 /α !! where Φ = 2 1 /α √ π  β + 1 β  1 /α 1 | Γ | X m ∈ Γ a ( f m ) 2 √ π ! 1 /α . The scaling law is similar in structure to the one obtained in Section III. Howe ver , the constant Φ depends on the av erage of a function of the absorption coefficients at f m , ∀ m ∈ Γ instead of a particular value. Again, if a ( f ) = 1 , ∀ f the result reduces to that of [1]. B. Dir ect T ransmissions If we constrain our system to perform direct transmissions only , using the fact that there is an assignment of frequency bands in terms of the distance, we can consider that h ( b ) = 1 , ∀ b , i.e. only one hop. Giv en the distance-band separation, the problem can be thought of as solving for several networks that lie on top of each other, in different layers with no cross- layer interference. Membership to the layers is based on the distance of the connection. In other words, each transmission band m will hav e n m transmitters, where n = P m ∈ Γ n m constitutes the total number of nodes in the network since each transmitter has only one intended destination. This causes a dif ferent capacity scaling for each of the transmission bands, i.e. the scaling for each transmission band will have the form of expression (16) with 4 W instead of W and n m instead of n to obtain the scaling for band m . V . H I G H P O WE R - W I D E B A N D C A S E In this scenario, nodes have enough power to transmit in a wide transmission band B , which implies that the absorption cannot be considered to be a constant ov er the band. The band B is again chosen using a waterfilling argument. W e consider that the SINR requirement can depend on the frequency . That is P i ( f ) A ( | X i − X j ( i ) | ,f ) N ( f ) + P k ∈ τ ,k 6 = i P k ( f ) A ( | X k − X j ( i ) | ,f ) ≥ β ( f ) . (19) W e define W as the transmission data rate o ver the entire band, computed as W = Z f ∈ B log 2 (1 + β ( f )) d f . (20) If we assign a transmission rate to every sub-band d f of dW = log 2 (1 + β ( f )) d f , the analysis for each frequency is similar as in Section IV by letting 4 f → 0 , renaming 4 f as d f and replacing the sums by integrals. Then, we have that 1 H λnT X b =1 h ( b ) X h =1 W r A ( h, b, f min ) ≤ T H Z W β ( f ) + 1 β ( f ) γ α ( f ) dW = T H Z B β ( f ) + 1 β ( f ) γ α ( f ) log 2 (1 + β ( f )) d f (21) where f min = arg min f a ( f ) and H can be shown to have the bound H ≤ T W n 2 using the definition of W in expression (20). Follo wing the procedure of Section IV , we sho w that the scaling law for the high po wer - wide band case has the form λn ¯ L ≤ Θ W n α − 1 α exp − W 0 Θ 2 ln a ( f min ) α  1 n  1 /α !! where Θ = 2 1 /α √ π   1 W Z B ( β ( f ) + 1) a ( f ) 2 √ π log 2 (1 + β ( f )) β ( f ) d f   1 /α V I . C O N C L U S I O N This work presents upper bounds on the transport capacity of underwater acoustic networks with nodes deployed arbi- trarily in a unit area disk. W e study three cases of interest: an arbitrarily chosen narrow transmission band; the case of power limited nodes which transmit in disjoint narrow bands; and the case of nodes with high power capabilities that use of a wide transmission band. The choice of transmission band in the last two cases depends on the transmission distance and the physical characteristics of the channel, and is made in accordance with the waterfilling principle. W e ha ve shown that the amount of information that can be exchanged by each source-destination pair in an underwater acoustic network goes to zero as the number of nodes n goes to infinity , at least at rate n − 1 /α e − W 0 ( O ( n − 1 /α )) . This rule is valid for the dif ferent scenarios in general, requiring only changes in the scaling constants. The throughput per source- destination pair has two dif ferent regions. For small n , the throughput decreases very slowly as n increases. For large n , it decreases as n − 1 /α . Considering that 1 ≤ α ≤ 2 in an underwater channel, the av ailable throughput for large n decays more rapidly than in typical radio wireless networks. Howe ver , typical node densities in underwater correspond to the small n regime. In a narro w band example with v alues of a ( f ) characteristic of an underwater channel, we showed that the upper bound on the throughput remains almost constant for densities of less than 100 nodes per km 2 . Most under- water networks have node densities in this range due to the applications for which they are deployed. Finally , we have pointed out some important characteristics of the underwater acoustic channel useful in future studies. For example, we could allo w cooperation between nodes ` a la Ozgur et al [3] taking adv antage of the distance-band separa- tion. That is, instead of performing time di vision between long and short transmissions, we could simply transmit in dif ferent bands that do not interfere with one another . This is important because acoustic transmissions hav e long propagation delays due to the speed of sound underwater ( ∼ 1500 m/s), which reduces the usefulness of a time-division scheme. A C K N O W L E D G M E N T This work was supported in part by the National Science Foundation under grants No. 0520075, 0831728 and CNS- 0627021, by ONR MURI Grant No. N00014-07-1-0738, and subcontract # 060786 issued by B AE Systems National Secu- rity Solutions, Inc. and supported by the Defense Adv anced Research Projects Agency (DARP A) and the Space and Nav al W arfare System Center (SP A W ARSYSCEN), San Diego under Contract No. N66001-06-C-2020 (CBMANET). R E F E R E N C E S [1] Gupta, P . Kumar , P .R., “The Capacity of W ireless Networks”, IEEE T rans. Inf. Theory , vol 46, no 2, pp. 388-404, Mar . 2000 [2] Grossglauser , M., Tse, D. N. C., “Mobility Increases the Capacity of Ad Hoc W ireless Networks”, IEEE Trans. Inf. Theory , vol. 10, no. 4, pp. 477-486, Aug. 2002 [3] Ozgur ,A., Le veque, O., Tse, D. N. C., “Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks”, IEEE T rans. Inf. Theory , vol. 53, no. 10, pp. 3549-3672, Oct. 2007 [4] Franceschetti, M., Dousse, O., Tse, D. N. C., Thiran, P ., “Closing the Gap in the Capacity of W ireless Networks V ia Percolation Theory”, IEEE T rans. Inf. Theory , vol. 53, no. 3, pp. 1009-1018, Mar . 2007 [5] V u, M., Devroye, N., T arokh, V ., “ An Overview of Scaling Laws in Ad Hoc and Cognitiv e Radio Networks”, W ireless Pers. Comm., vol 45, no 3, May 2008 [6] Chapeau-Blondeau, F ., and Monir, A., “Numerical Evaluation of the Lambert W Function and Application to Generation of Generalized Gaussian Noise W ith Exponent 1/2”, IEEE Trans. on Signal Proc., V ol. 50, No. 9, Sept. 2002 [7] M. Stojanovic, “On the Relationship Between Capacity and Distance in an Underwater Acoustic Communication Channel, ” ACM SIGMOBILE MC2R , pp.34-43, vol.11, Issue 4, Oct. 2007 [8] Lucani, D. E., M ´ edard, M., Stojanovic, M., “On the Relationship between T ransmission Power and Capacity of an Underwater Acoustic Commu- nication Channel”, Proc. IEEE Oceans , 2008.

Original Paper

Loading high-quality paper...

Comments & Academic Discussion

Loading comments...

Leave a Comment