skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Routing Protocols for Robust Encrypted Networks.


Abstract not provided.

Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
Report Number(s):
DOE Contract Number:
Resource Type:
Resource Relation:
Conference: Proposed for presentation at the Milcom 2007 held October 29-31, 2007 in Orlando, FL.
Country of Publication:
United States

Citation Formats

Brenkosh, Joseph Peter. Routing Protocols for Robust Encrypted Networks.. United States: N. p., 2007. Web.
Brenkosh, Joseph Peter. Routing Protocols for Robust Encrypted Networks.. United States.
Brenkosh, Joseph Peter. Thu . "Routing Protocols for Robust Encrypted Networks.". United States. doi:.
title = {Routing Protocols for Robust Encrypted Networks.},
author = {Brenkosh, Joseph Peter},
abstractNote = {Abstract not provided.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Thu Mar 01 00:00:00 EST 2007},
month = {Thu Mar 01 00:00:00 EST 2007}

Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • Abstract not provided.
  • We study the effect of routing protocols on the performance of media access control (MAC) protocols in wireless radio networks. Three well known MAC protocols: 802.11, CSMA, and MACA are considered. Similarly three recently proposed routing protocols: AODV, DSR and LAR scheme 1 are considered. The experimental analysis was carried out using GloMoSim: a tool for simulating wireless networks. The main focus of our experiments was to study how the routing protocols affect the performance of the MAC protocols when the underlying network and traffic parameters are varied. The performance of the protocols was measured w.r.t. five important parameters: (i)more » number of received packets, (ii) average latency of each packet, (iii) throughput (iv) long term fairness and (v) number of control packets at the MAC layer level. Our results show that combinations of routing and MAC protocols yield varying performance under varying network topology and traffic situations. The result has an important implication; no combination of routing protocol and MAC protocol is the best over all situations. Also, the performance analysis of protocols at a given level in the protocol stack needs to be studied not locally in isolation but as a part of the complete protocol stack. A novel aspect of our work is the use of statistical technique, ANOVA (Analysis of Variance) to characterize the effect of routing protocols on MAC protocols. This technique is of independent interest and can be utilized in several other simulation and empirical studies.« less
  • We empirically study the effect of mobility on the performance of protocols designed for wireless ad-hoc networks. An important objective is to study the interaction of the Routing and MAC layer protocols under different mobility parameters. We use three basic mobility models: grid mobility model, random waypoint model, and exponential correlated random model. The performance of protocols is measured in terms of (i) latency, (ii) throughput, (iii) number of packets received, (iv) long term fairness and (v) number of control packets at the MAC and routing layer level. Three different commonly studied routing protocols are used: AODV, DSR and LAR1.more » Similarly three well known MAC protocols are used: MACA, 802.1 1 and CSMA. Our main contribution is simulation based experiments coupled with rigorous statistical analysis to characterize the interaction of MAC layer protocols with routing layer protocols in ad-hoc networks. From the results, we can conclude the following: e No single MAC or Routing protocol dominated the other protocols in their class. Probably more interestingly, no MAURouting protocol combination was better than other combinations over all scenarios and response variables. 0 In general, it is not meaningful to speak about a MAC or a routing protocol in isolation. Presence of interaction leads to trade-offs between the amount of control packets generated by each layer. The results raise the possibility of improving the performance of a particular MAC layer protocol by using a cleverly designed routing protocol or vice-versa. Thus in order to improve the performanceof a communication network, it is important to study the entire protocol stack as a single algorithmic construct; optimizing individual layers in the seven layer OS1 stack will not yield performance improvements beyond a point. A methodological contribution of this paper is the use of statistical methods such as analysis of variance (ANOVA), to characterize the interaction between the protocols, mobility patterns and speed. Such methods allow us to analyze complicated experiments with large input space in a systematic manner.« less
  • In this paper we present a deterministic protocol for routing arbitrary permutations in arbitrary networks. The protocol is analyzed in terms of the size of the network and the routing number of the network. Given a network H of size n, the routing number of H is defined as the maximum over all permutations {pi} on [n] of the minimal number of steps to route {pi} offline in H. We can show that for any network H of size n with routing number R our protocol needs O(log{sub R} n {center_dot} R) time to route any permutation in H usingmore » only constant size edge buffers. This significantly improves all previously known results on deterministic routing. In particular, our result yields optimal deterministic routing protocols for arbitrary networks with diameter P(n{sup {epsilon}}) or bisection width O(n{sup 1-{epsilon}}), {epsilon} > 0 constant. Furthermore we can extend our result to deterministic compact routing. This yields, e.g., a deterministic routing protocol with runtime O(log n/log log n R) for arbitrary bounded degree networks if only O(log n) bits are available at each node for storing routing information. Our proofs use a new protocol for routing arbitrary r {center_dot} s-relations in r-replicated s-ary Multibutterflies in optimal time O(log{sub s} n).« less
  • Abstract not provided.