13.07.2015 Views

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

A Uniform Cont<strong>in</strong>uum Model for Scal<strong>in</strong>g of Ad Hoc Networks 101is bp T + gp W £ b/g. Relative to transmitt<strong>in</strong>g p T packets of user data per unit time, anode <strong>in</strong>curs an overhead of b + ag.Depend<strong>in</strong>g on whether a, the walk/talk ratio, is greater or less than b/g, rout<strong>in</strong>gtraffic or forward<strong>in</strong>g traffic, respectively, dom<strong>in</strong>ates <strong>in</strong> the network. This suggestsus<strong>in</strong>g values of ag/b <strong>in</strong> order to compare the results of various simulation studies; see,for example, [1-3,8,10]. In the previous sections, a low (high) walk/talk ratio shouldbe taken to mean ag/b 1).Assum<strong>in</strong>g that the range R is limited <strong>by</strong> a threshold of received signal strength, theaverage antenna power is proportional to R 2 and to the rate of packet transmission.The average power requirement per node isP = kR 2 (bp T + g p W ) (7)where k is a constant. (The antenna power for cont<strong>in</strong>uous transmission is kR 2 b.) Thepower is Q(N), with the lead<strong>in</strong>g term aris<strong>in</strong>g from mobility. P is the radiated antennapower only, and does not <strong>in</strong>clude the power consumption of the node's circuitry itself.7 Other DimensionsThis model has been built for the most practical case of two dimensions, although wecould equally well have chosen m dimensions. For m=1 we have a model of N nodesspread <strong>in</strong> a l<strong>in</strong>e (e.g. nodes <strong>in</strong> vehicle on a road), and for m=3 we have a model of Nnodes spread <strong>in</strong> a volume (e.g. nodes carried <strong>by</strong> users <strong>in</strong> a multi-storied build<strong>in</strong>g).In m dimensions, the node density is measured <strong>in</strong> units of nodes per (unit length) m .The total number of nodes, N, and the network diameter (a distance), D, are related <strong>by</strong>Nd 1 m =(D+d 1 ) m . The number of nodes <strong>in</strong> a radio group is g =(R+r 1 ) m /r 1 m . The datatransmission overhead b becomesthe rout<strong>in</strong>g overhead g becomesb = r 1R (m N -1) , (8)g =2N( R . (9)+1) m - 1r 1The bandwidth constra<strong>in</strong>ts <strong>in</strong> m dimensions becomep T £br 1 m -1 R(R+ r 1 ) m 1mN-1(10)andr 1 mp W £ b2N [1- (R+r 1 ) m ] . (11)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!