1. Dynamically configure roles (e.g., DNS Stub Name Server or SIP Proxy) Dynamically configure links (e.g., IP address of best root, forwarding or master NSs) Task 1.2 Autonomous Internetworking Prepared through collaborative participation in the Communications & Networks Consortium sponsored by the U. S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD-DAAD-19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U. S. Government. FY05 Plans  Task 1.2.1 New protocols to maintain reachability in large dynamic ad hoc networks Challenges:  Existing solutions poorly handle loss of root/home servers, brittle linkages (e.g., net splits), multi-homing, and HAIPE. Proposals:  Integrated location architecture (DNS SIP, Presence, IM) with autoconfigured, Efficient and Robust Inter-domain linkages. Challenges:  Balancing fast, simple distributed mechanisms with more optimal global mechanisms.  Quantifying the theoretical advantages of dividing a network into independent routing domains. Proposals:  Simultaneously optimizing large networks across multiple network functions, layers, and levels of hierarchy.  Faster Simulated Annealing and other techniques to optimize more complex cost functions over more nodes.  Better local maintenance algorithms based on the reclustering cost functions.  Optimize for specific routing metrics (e.g., maximum path length and percentage suboptimatily).  Task 1.2.2 Automatic domain generation for routing and other functions, using complex multi-function, cross-layer, and multi-level optimization Domain 3.X Domain 7.X Domain 5.X Domain 7.X Domain 3.X Domain 5.X Domain 4.X v@Z e@X v@Z e@X f@M c@L Domain 1.X d@L Domain 1.X d@L f@M N1 N2 N4 N3 N4 N3 N1 Dynamic “black” wireless network Manage IP address configuration Packet loss due to MAC collisions HAIPE N2 HAIPE a)Hierarchy Benefitsb) Hierarchy Drawbacks c) Local Maintenance  Task 1.2.3 Highly Adaptive Component Based Routing Protocols that are able to change all functional aspects in response to changes in environment and network demands Dr. Anthony McAuley, Telcordia, mcauley@research.telcordia.com Dr. Stephan Bohacek, University of Delaware, bohacek@udel.edu Routing protocols constructed from different components Classes of components The selection of components depends on the demands placed on the network and the operating environment. on demand flooding proactive topology discovery cluster- based topology discovery local repair flooding topology information flood to source tree route repair first found least hops route selection least power longest life low mobility low power low traffic delay tolerant high mobility delay intolerant large topology authentication game- theoretic security Components of routing protocols Task I. Taxonomy of components Find the elementary components of routing protocols Functional description of elementary components Component interaction and dependency graph Task 2. Performance analysis of components Identification of performance bottlenecks Performance of routing components Topology information dissemination Multicast Broadcast Topology discovery Protocol performance Security Scalability  A complete revision of MANET routing protocols.  Eight research groups jointly developing a single protocol.  Systematic analysis and development of MANET protocols.  Deep insight into the routing protocols. Dr. Ken Young, Telcordia, kcy@research.telcordia.com Mr. Hal Harrelson, ARL, hharrelson@arl.army.mil

2. a)Optimized domain creation using Simulated Annealing with complex cost functions and constraints b) Domain maintenance reassociation using the same cost functions used in domain generation Prepared through collaborative participation in the Communications & Networks Consortium sponsored by the U. S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD-DAAD-19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U. S. Government. FY04 Accomplishments Number of Sessions Unitary Plane Sr p = 1 Sr p = 100 Sr p = 10 K=10, l=5, m=med, d=20 Mobility Rate Indirect, through HA  Direct to CN  C p Cost to process packet/message at a node. C t Cost to transmit one message over one hop m, mobility rate p, packet arrival rate per session Sr, number of sessions w Number of LA registrations for each HA registration d Number of moves results are averaged over Mobile Node d = 0 d = 20 Unitary Plane p= m=Sr=1  Task 1.2.1 A new analytical framework for performance evaluation of mobility protocols ObjectiveCost Function Balanced Size Clusters (1) (2) Balanced Diameter Clusters (3) (4) Balanced Clusters with minimum Border Routers. (5) Cluster members move in a similar direction, so we expect longer durations of stable cluster membership (6) (7) Cluster members have similar velocity, so expect more stable cluster membership (8) Links among cluster members have long expiration time estimates. Improves the lifetime of the generated hierarchy (9) Cluster members move with similar direction and velocity. Like (6),(7),(8) capturing more node dynamics (e.g., direction and velocity) (10) n Border Router for MN Subnet Network m k p HA MN MN HA CN l Local Mobility Agent for MN LA MN q Home Agent for MN BR MN LA CN Subnet CN BR CN  Task 1.2.2 Improved automatic domain generation providing scalability, manageability and efficiency in large heterogeneous networks, such as FCS and WIN-T c) Domain maintenance beacon quickly detects constraint violations MIP 6 better MIP 4 better  Task 1.2.3 Routing Task 1.2 Autonomous Internetworking MIP 6 MIP 4 Dr. Anthony McAuley, Telcordia, mcauley@research.telcordia.com Dr. Stephan Bohacek, University of Delaware, bohacek@udel.edu Dr. Ken Young, Telcordia, kcy@research.telcordia.com Mr. Hal Harrelson, ARL, hharrelson@arl.army.mil Key observation –Idling consumes significant amount of energy –Unattended ground sensors (UGS): hard energy constraint To conserve energy: turn off the sensors – duty cycling Different types of duty cycling: Single radio and Dual radio Goal: reducing duty cycle while maintaining coverage Network Coverage with Low Duty Cycled Sensors Objective Analyze the applicability of recent research in authentication techniques for secure routing Results Traditional signature and new signature techniques outperform Zhang’s authentication schemes In our hop-by-hop authentication scenarios Zhang’s schemes are preferred at rates above 2 Mbps and communication energy costs below 4 mJ/kbps Evaluating the Trade-offs between Broadcasting and Multicasting Main results There is no clear winner between broadcasting and multicasting. The scenario in question dictates the choice. For large group sizes with a single multicast source, SBA (or broadcast) is preferable. For small group sizes with single source, ODMRP (or multicast) is a clear choice In high node mobility, SBA (or broadcast) is preferable With single source, ODMRP (or multicast) is preferable in dense networks Cost of Security for Tactical MANETS Tactical MANETS –Modular architecture facilitates customized configurations –OS abstraction for rapid development and testing –Smooth transition of shared code from simulation testbed to prototypes OPNET Off-line Analysis Logging Packbot Radio MAC Transceiver Duty Cycling Transmit Power Control Neighbor Discovery Routing Shared Network Layer Protocols IP Applications Multi-hop Routing Protocol Integration with Packbots Real-Time Network Monitoring and Management