Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 13 of 13

Full-Text Articles in Physical Sciences and Mathematics

The Capacity Of Multi-Hop Wireless Networks With Tcp Regulated Traffic, Sorav Bansal, Rajeev Shorey, Shobhit Chugh, Anurag Goel, Kapil Kumar, Archan Misra Nov 2002

The Capacity Of Multi-Hop Wireless Networks With Tcp Regulated Traffic, Sorav Bansal, Rajeev Shorey, Shobhit Chugh, Anurag Goel, Kapil Kumar, Archan Misra

Research Collection School Of Computing and Information Systems

We study the dependence of the capacity of multi-hop wireless networks on the transmission range of nodes in the network with TCP regulated traffic. Specifically, we examine the sensitivity of the capacity to the speed of the nodes and the number of TCP connections in an ad hoc network. By incorporating the notion of a minimal acceptable QoS metric (loss) for an individual session, we argue that the QoS-aware capacity is a more accurate model of the TCP-centric capacity of an ad-hoc network. We study the dependence of capacity on the source application (Telnet or FTP) and on the choice …


Predicting Bottleneck Bandwidth Sharing By Generalized Tcp Flows, Archan Misra, Teunis Ott, John Baras Nov 2002

Predicting Bottleneck Bandwidth Sharing By Generalized Tcp Flows, Archan Misra, Teunis Ott, John Baras

Research Collection School Of Computing and Information Systems

The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottleneck buffer is assumed to perform congestion feedback via randomized packet marking or drops. We first present a fixed point-based analytical technique to compute the mean congestion window sizes, the mean queue occupancy and the individual throughputs when the TCP flows perform idealized congestion avoidance. We subsequently extend the technique to analyze the case where TCP flows perform generalized congestion avoidance and demonstrate the use of this technique under the Assured Service model, where each …


Safe Robot Driving, Chuck Thorpe, Romuald Aufrere, Justin David Carlson, David Duggins, Terrence W. Fong, Jay Gowdy, John Kozar, Robert Maclachlan, Colin Mccabe, Christoph Mertz, Arne Suppe, Chieh Chih Wang, Teruko Yata Sep 2002

Safe Robot Driving, Chuck Thorpe, Romuald Aufrere, Justin David Carlson, David Duggins, Terrence W. Fong, Jay Gowdy, John Kozar, Robert Maclachlan, Colin Mccabe, Christoph Mertz, Arne Suppe, Chieh Chih Wang, Teruko Yata

Research Collection School Of Computing and Information Systems

The Navlab group at Carnegie Mellon University has a long history of development of automated vehicles and intelligent systems for driver assistance. The earlier work of the group concentrated on road following, cross-country driving, and obstacle detection. The new focus is on short-range sensing, to look all around the vehicle for safe driving. The current system uses video sensing, laser rangefinders, a novel light-stripe rangefinder, software to process each sensor individually, and a map-based fusion system. The complete system has been demonstrated on the Navlab 11 vehicle for monitoring the environment of a vehicle driving through a cluttered urban environment, …


A Label-Switching Packet Forwarding Architecture For Multi-Hop Wireless Lans, Arup Acharya, Archan Misra, Sorav Bansal Sep 2002

A Label-Switching Packet Forwarding Architecture For Multi-Hop Wireless Lans, Arup Acharya, Archan Misra, Sorav Bansal

Research Collection School Of Computing and Information Systems

A router in wired network typically requires multiple network interfaces to act as a router or a forwarding node. In an ad-hoc multi-hop wireless network on the other hand, any node with a wireless network interface card can operate as a router or a forwarding node, since it can receive a packet from a neighboring node, do a route lookup based on the packet's destination IP address, and then transmit the packet to another neighboring node using the same wireless interface. This paper investigates a combined medium access and next-hop address lookup based on fixed length labels (instead of IP …


The Case For Cyber Foraging, Rajesh Balan, Jason Flinn, Mahadev Satyanarayanan, Shafeeq Sinnamohideen, Hen-I Yang Jul 2002

The Case For Cyber Foraging, Rajesh Balan, Jason Flinn, Mahadev Satyanarayanan, Shafeeq Sinnamohideen, Hen-I Yang

Research Collection School Of Computing and Information Systems

In this paper, we propose cyber foraging: a mechanism to augment the computational and storage capabilities of mobile devices. Cyber foraging uses opportunistically discovered servers in the environment to improve the performance of interactive applications and distributed file systems on mobile clients. We show how the performance of distributed file systems can be improved by staging data at these servers even though the servers are not trusted. We also show how the performance of interactive applications can be improved via remote execution. Finally, we present VERSUDS: a virtual interface to heteregeneous service discovery protocols that can be used to discover …


Energy Efficiency And Throughput For Tcp Traffic In Multi-Hop Wireless Networks, Sorav Bansal, Rajeev Gupta, Rajeev Shorey, Imran Ali, Ashu Razdan, Archan Misra Jun 2002

Energy Efficiency And Throughput For Tcp Traffic In Multi-Hop Wireless Networks, Sorav Bansal, Rajeev Gupta, Rajeev Shorey, Imran Ali, Ashu Razdan, Archan Misra

Research Collection School Of Computing and Information Systems

We study the performance metrics associated with TCP regulated traffic in multi-hop, wireless networks that use a common physical channel (e.g., IEEE 802.11). In contrast to earlier analyses, we focus simultaneously on two key operating metrics– the energy efficiency and the session throughput. Using analysis and simulations, we show how these metrics are strongly influenced by the radio transmission range of individual nodes. Due to tradeoffs between the individual packet transmission energy and the likelihood of retransmissions, the total energy consumption is a convex function of the number of hops (and hence, of the transmission range). On the other hand, …


Idmp: An Intradomain Mobility Management Protocol For Next-Generation Wireless Networks, Subir Das, Anthony Mcauley, Ashutosh Dutta, Archan Misra, Sajal K. Das Jun 2002

Idmp: An Intradomain Mobility Management Protocol For Next-Generation Wireless Networks, Subir Das, Anthony Mcauley, Ashutosh Dutta, Archan Misra, Sajal K. Das

Research Collection School Of Computing and Information Systems

This paper describes a lightweight Intra-domain Management Protocol (IDMP) for managing mobility within a domain, commonly known as micro-mobility management, for next generation wireless networks. IDMP is modular and simple because it leverages existing protocols, such as Mobile IP or SIP (Session Initiated Protocol) as global mobility management, for locating roaming nodes. Unlike other proposed intra-domain mobility management schemes, IDMP uses two dynamically autoconfigured care-of addresses (CoAs) for routing the packets destined to mobile nodes. The global care-of address (GCoA) is relatively stable and identifies the mobile node’s attachment to the current domain, while the local care-of address (LCoA) changes …


Avoiding Congestion Collapse On The Internet Using Tcp Tunnels, Boon Peng Lee, Rajesh Krishna Balan, Jacob Lillykutty, Winston Seah, A. L. Ananda Jun 2002

Avoiding Congestion Collapse On The Internet Using Tcp Tunnels, Boon Peng Lee, Rajesh Krishna Balan, Jacob Lillykutty, Winston Seah, A. L. Ananda

Research Collection School Of Computing and Information Systems

This paper discusses the application of TCP tunnels on the Internet and how Internet traffic can benefit from the congestion control mechanism of the tunnels. Primarily, we show the TCP tunnels offer TCP-friendly flows protection from TCP-unfriendly traffic. TCP tunnels also reduce the many flows situation on the Internet to that of a few flows. In addition, TCP tunnels eliminate unnecessary packet loss in the core routers of the congested backbones, which waste precious bandwidth leading to congestion collapse due to unresponsive UDP flows. We finally highlight that the use of TCP tunnels can, in principle, help prevent certain forms …


Minimum Energy Paths For Reliable Communication In Multi-Hop Wireless Networks, Suman Banerjee, Archan Misra Jun 2002

Minimum Energy Paths For Reliable Communication In Multi-Hop Wireless Networks, Suman Banerjee, Archan Misra

Research Collection School Of Computing and Information Systems

Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has the same cost and the minimum-hop path is selected. In situations where the transmission power can be varied with the distance of the link, the link cost is higher for longer hops; the energy-aware routing algorithms select a path with a large number of small-distance hops. In this paper, we argue that such a formulation based solely on the energy spent in a single transmission is misleading --- the proper metric should include the total energy …


Multi-Level Modeling Of Software On Hardware In Concurrent Computation, Joann M. Paul, Arne Suppe, Henele I. Adams, Donald E. Thomas Apr 2002

Multi-Level Modeling Of Software On Hardware In Concurrent Computation, Joann M. Paul, Arne Suppe, Henele I. Adams, Donald E. Thomas

Research Collection School Of Computing and Information Systems

The fundamental modeling differences between hardware and software modeling can be thought of as reasoning about connectedness vs. reasoning about interleaved (shared) access to resources. A natural design hierarchy for physical systems is component-based because of the existence of a consistent basis for interconnect between design levels. However, performance modeling and design of concurrent, programmable systems require new ways of thinking about what it means to abstract detail, add detail and partition a model of software executing on hardware. We motivate frequency interleaving (FI) as a common simulation foundation for these systems because it resolves flow and partitioning with software …


Mrpc: Maximizing Network Lifetime For Reliable Routing In Wireless Environments, Archan Misra, Suman Banerjee Mar 2002

Mrpc: Maximizing Network Lifetime For Reliable Routing In Wireless Environments, Archan Misra, Suman Banerjee

Research Collection School Of Computing and Information Systems

We propose MRPC, a new power-aware routing algorithm for energy-efficient routing that increases the operational lifetime of multi-hop wireless networks. In contrast to conventional power-aware algorithms, MRPC identifies the capacity of a node not just by its residual battery energy, but also by the expected energy spent in reliably forwarding a packet over a specific link. Such a formulation better captures scenarios where link transmission costs also depend on physical distances between nodes and the link error rates. Using a max-min formulation, MRPC selects the path that has the largest packet capacity at the 'critical' node (the one with the …


Idmp-Based Fast Handoffs And Paging In Ip-Based 4g Mobile Networks, Archan Misra, Subir Das, Anthony Mcauley, Sajal K. Das Mar 2002

Idmp-Based Fast Handoffs And Paging In Ip-Based 4g Mobile Networks, Archan Misra, Subir Das, Anthony Mcauley, Sajal K. Das

Research Collection School Of Computing and Information Systems

We consider the use of our previously proposed Intra-Domain Mobility Management Protocol (IDMP) in fourth-generation mobile networks. On evaluating the heterogeneous access technologies, cellular layouts, and application characteristics of 4G environments, we realize a need to reduce both handoff latency and the frequency of mobility-related signaling. We first present IDMP's fast intradomain handoff mechanism that uses a duration-limited proactive packet multicasting solution. We quantify the expected buffering requirements of our proposed multicasting scheme for typical 4G network characteristics and compare it with alternative IP-based fast handoff solutions. We also present a paging scheme under IDMP that replicates the current cellular …


Smil Vs Mpeg-4 Bifs, Lai-Tee Cheok, Alexandros Eleftheriadis Feb 2002

Smil Vs Mpeg-4 Bifs, Lai-Tee Cheok, Alexandros Eleftheriadis

Research Collection School Of Computing and Information Systems

We present the results of a comparative analysis between the Synchronized Multimedia Integration Language (SMIL) and MPEG-4 BInary Format for Scenes (BIFS). SMIL is a language developed by the W3C consortium for expressing media synchronization among objects of various media types. MPEG-4 BIFS is the scene description scheme of MPEG-4, an international standard for communicating interactive audiovisual scenes. They are both facilities for representing and synchronizing multimedia content, and have a wide range of support for interactivity, animation and object composition features, etc. We compare their scope and purposes, the level of support for the multimedia features and investigate the …