|
1 Nov. 2004 14:15-17:15 Title: Scalable Ad Hoc Networks: routing, transport and testability challenges Mario Gerla, Computer Science Dept, UCLA Abstract: Ad hoc networks were first introduced to provide “instant” communications where an infrastructure did not exist, for example battlefield, search and rescue etc. Some of these applications have now become very sophisticated and complex, involving thousands of nodes with various degrees of mobility. The much broader scope poses now a host of new problems from design to evaluation and implementation. The first “challenge” we address is routing scalability in the face of mobility. We present several solutions, some of which actually exploit mobility itself, eg “group” mobility. Then, we move to scalable transport. We show the challenge of maintaining many TCP flows in large ad hoc networks, mobile as well as stationary, and outline preliminary solution proposals. Finally, we must verify that the proposed solutions work in a large scale testbed. We introduce WHYNET, the NSF funded wireless testbed at UCLA. WHYNET uses an innovative hybrid emulation scheme to scale realistic testability to thousands of nodes. Bio:
|