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 ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
102 E.W. Grundke and A.N. Z<strong>in</strong>cir-HeywoodFor m=3, from (10) the maximum p T is Q(1/R m N 1/ m ), which makes it especiallyimportant to keep the range small, while N can grow larger than was feasible <strong>in</strong> twodimensions.The R 2 factor <strong>in</strong> the power requirement is unchanged because it arises from thethree-dimensional spread<strong>in</strong>g of radio signals, regardless of m.8 ConclusionThe simple cont<strong>in</strong>uum model without edge effects has yielded a number of analyticresults. In two dimensions the user data traffic is Q(÷N/R), and rout<strong>in</strong>g traffic isQ(N/R 2 ), where N is the number of nodes and R is the transmission range. Themaximum (bandwidth-limited) user data traffic per node is Q(1/R÷N), and themaximum l<strong>in</strong>k event rate is Q(1/N). It will be <strong>in</strong>terest<strong>in</strong>g to see how closelysimulations and real networks follow these scal<strong>in</strong>g trends. Our results confirm thatthe design of flat ad-hoc networks should target small numbers of nodes (100's, not1000's), and should strive for short transmission ranges.This analysis has produced three dimensionless parameters that characterize anad-hoc network. The node behavior is characterized <strong>by</strong> a, the walk/talk ratio, whichis the ratio of the l<strong>in</strong>k event rate to the application packet rate. The network ischaracterized <strong>by</strong> b, the forward<strong>in</strong>g overhead, and <strong>by</strong> g, the rout<strong>in</strong>g overhead. Wef<strong>in</strong>d that the quantity ag/b characterizes the relative importance of rout<strong>in</strong>g traffic anduser data traffic; the two are equal when ag/b = 1. These dimensionless parametersmay prove useful to compare the results of various simulation studies and to scale adhocnetworks.References1. Am<strong>in</strong> K., Mayes J., Mikler A..: Agent-based Distance Vector Rout<strong>in</strong>g. IEEE/ACMMATA 2001: 3rd International Workshop on Mobile Agents for TelecommunicationsApplication, Canada, August (2001). Retrieved from http://students.csci.unt.edu/~am<strong>in</strong>/2. Brag<strong>in</strong>sky D., Estr<strong>in</strong> D.: Rumor Rout<strong>in</strong>g Algorithm for Sensor Networks, WSNA ’02September 28 (2002) Atlanta, Georgia, USA3. Celebi E.: Master’s Thesis: Performance Evaluation of Wireless Mobile AdHoc NetworkRout<strong>in</strong>g Protocols (2001). Retrieved May 16, 2003 from http://cis.poly.edu/~ecelebi/4. Contla, P. A.., Stojmenivoc, M.: Estimat<strong>in</strong>g Hop Counts <strong>in</strong> Position Based Rout<strong>in</strong>gSchemes for Ad Hoc Networks. Telecommunication Systems, Vol. 22 (2003) 109-1185. Corson, S., Macker, J.: Mobile Ad hoc Network<strong>in</strong>g (MANET): Rout<strong>in</strong>g ProtocolPerformance Issues and Evaluation Considerations. IETF RFC 2501 (1999) RetrievedMay 21, 2003, from http://www.ietf.org/rfc/rfc2501.txt6. Gupta P., Kumar P. R.: The Capacity of Wireless Networks. IEEE Transactions onInformation Theory, Vol. 46 Issue 2 (2000) 388-4047. Hong X., Xu K., Gerla M.: Scalable Rout<strong>in</strong>g Protocols for Mobile Ad Hoc Networks,IEEE Network, July/August (2002) 11-21
Change language