Institute for Systems Research Technical Reports
Permanent URI for this collectionhttp://hdl.handle.net/1903/4376
This archive contains a collection of reports generated by the faculty and students of the Institute for Systems Research (ISR), a permanent, interdisciplinary research unit in the A. James Clark School of Engineering at the University of Maryland. ISR-based projects are conducted through partnerships with industry and government, bringing together faculty and students from multiple academic departments and colleges across the university.
Browse
Search Results
Item QoS Routing for Mobile Ad Hoc Networks(2001) Zhu, Chenxi; Corson, M. Scott; ISR; CSHCNA Quality-of-Service (QoS) routing protocol is developed for mobile ad hoc networks. It can establish QoS routes with reserved bandwidth in a network employing TDMA. An efficient algorithmfor calculating the end-to-end bandwidth on a path is developed and usedtogether with the route discovery mechanism of AODV to setup QoS routes.Simulations show that the QoS routing protocol can produce higher throughputand lower delay than its best-effort counterpart.Item On Satellite Multicast to Heterogeneous Receivers(2001) Tunpan, Apinun; Corson, M. Scott; ISR; CSHCNWe propose a framework for single-source, satellite-based multicast disseminationof bulk files. The framework trades off between reception delay andbandwidth usage and coexists with terrestrial background networktraffic; specifically TCP traffic utilizing a short-termcongestion control mechanism.The framework consists of two major components: 1) a multicastrate scheduling mechanism that uses long-term, end-to-end multicast packet survival statisticsin order to deal with the bandwidth-delay trade-off issue, and 2) afair queueing algorithm that regulates the points where multicast traffic fromthe satellite meets terrestrial background traffic. We show throughsimulation the performance of this framework under a number ofscenarios.The research content in this material will appear in IEEE ICC 2001. Item A New Protocol for Scheduling TDMA Transmissions in Mobile Ad Hoc Networks(2001) Zhu, Chenxi; Corson, M. Scott; ISR; CSHCNA new protocol for scheduling TDMA transmission in a mobile ad hoc network isdeveloped. With this protocol, nodes reserve time slots for unicast, multicastor broadcast transmission. The protocol uses contention for nodes to reservetransmission time slots, its operation is distributed and concurrent; thereforeit is independent of the network size and can be used in large or dynamicnetworks. Its performance is studied with simulation and compared with IEEE 802.11 protocol.Item Bandwidth Calculation in a TDMA-based Ad Hoc Network(2000) Zhu, Chenxi; Corson, M. Scott; Corson, M. Scott; ISR; CSHCNBandwidth calculation for Quality-of-Service (QoS) routing in an ad hocnetwork employing Time-Division-Multiple-Access (TDMA) is studied.Certain constraints of TDMA transmission in a wireless network requirescareful scheduling among the nodes in order to achieve conflict-free operations. These constraints also make the calculation of the end-to-end bandwidth along a path non-trivial. These calculationsare essential for QoS routing which requires a certain amount of bandwidth available on a route.
We prove the problem of calculating the maximal end-to-end bandwidth along a given a path in a TDMA network is NP-complete, and develop an efficient bandwidth calculation scheme. We also show how the bandwidth calculation scheme can be usedwith the Ad-hoc On-demand Distance Vector protocol (AODV) to perform QoSrouting.
Item Dynamic ElGamal Public Key Generation with Tight Binding(1999) Poovendran, R.; Corson, M. Scott; Baras, John S.; ISR; CSHCNWe present a new distributed, group ElGamal public key generation algorithm which also permits maintenance of a group-specific, dynamic,individual ElGamal public key infrastructure.We parameterize the group with a time-varying quantity that servesas a distributed mechanism for controlling key generation privilege.
Our scheme can be viewed as an alternative to polynomial schemes where, at the time of the secret construction step, there has to be a third party or a black box to combine the shares. Also, in polynomial schemes, at the time of combining, the individual shares of the secret have to be revealed to the third party. In our scheme, the common secret can be generated without ever exposing the individual shares constructing it.
We note that many of the recently proposed distributed key management~[2-4] schemes need such group keys for certification and signing purposes.
Item Dynamic Elgamal Public Key Generation with Tight Binding(1999) Poovendran, R.; Corson, M. Scott; Baras, John S.; Baras, John S.; ISR; CSHCNWe present a new distributed, group ElGamal public key generation algorithm which also permits maintenance of a group-specific, dynamic, individual ElGamal public key infrastructure. We parameterize the group with a time-varying quantity that serves as a distributed mechanism for controlling key generation privilege.Our scheme can be viewed as an alternative to polynomial schemes where, at the time of the secret construction step, there has to be a third party or a black box to combine the shares. Also, in polynomial schemes, at the time of combining,the individual shares of the secret have to be revealed to the third party.
In our scheme, the common secret can be generated without ever exposing the individual shares constructing it. We note that many of the recently proposed distributed key management schemes need such group keys for certification and signing purposes.
3rd Annual Conference on Advanced Telecommunications and Information Distribution Research Program (ATIRP)