Efficient geographic routing in multihop wireless networks
We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proximity and link cost. Coupled with the local next hop decision in geographic routing, NADV enables an adaptive and efficient cost-aware routing strategy. Depending on the objective or message priority, applications can use the NADV framework to minimize various types of link cost.We present efficient methods for link cost estimation and perform detailed simulations in diverse scenarios. Our results show that NADV outperforms current schemes in many aspects: for example, in high noise environments with frequent packet losses, the use of NADV leads to 81% higher delivery ratio. When compared to centralized routing under certain settings, geographic routing using NADV finds paths whose cost is close to the optimum.

title: Neighbor supporting ad hoc multicast routing protocol
abstract: An ad hoc network is a multi-hop wireless network formed by a collection of mobile nodes without the intervention of fixed infrastructure. Limited bandwidth and a high degree of mobility require that routing protocols for ad hoc networks be robust, simple, and energy-conserving. This paper proposes a new ad hoc multicast routing protocol called Neighbor-Supporting Multicast Protocol (NSMP). NSMP adopts a mesh structure to enhance resilience against mobility. And NSMP utilizes node locality to reduce the overhead of route failure recovery and mesh maintenance. NSMP also attempts to improve route efficiency and reduce data transmissions. Our simulation results show that NSMP delivers packets efficiently while substantially reducing control overhead in various environments.

title: The case for a multi-hop wireless local area network
abstract: We propose a multi-hop wireless LAN architecture and demonstrate its benefits to wireless clients. For this architecture, we define implementation paths that allow interoperation with existing wireless LANs which can lead to an incremental deployment of this system. We quantify the performance benefits of the proposed schemes through measurements in realistic wireless LAN environments. We also examine the performance of such multi-hop wireless LANs through detailed simulation studies. Our results show that these multi-hop extensions can significantly improve the wireless access experience (in terms of data throughput, latency, etc.) for clients who enable such mechanisms. More interestingly, when multi-hop extensions are enabled by some of the clients, it also positively impacts the performance at other clients that are completely unaware of these extensions.

title: Cooperative peer groups in NICE
abstract: We present a distributed scheme for trust inference in peer-to-peer networks. Our work is in the context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify non-cooperative users in NICE. We present a simulation-based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.

title: Scalable resilient media streaming
abstract: We present a low-overhead media streaming system, called SRMS (Scalable Resilient Media Streaming) that can be used to scalably deliver streaming data to a large group of receivers. SRMS uses overlay multicast for data distribution. to a large group of users. SRMS leverages a probabilistic loss recovery technique to provide high data delivery guarantees even under large network losses and overlay node failures. The clients in the SRMS system are able to interoperate with existing media streaming servers that use RTP for data transport. One of the interesting features of SRMS is that it can simultaneously support clients with disparate access bandwidths. It enables the necessary bandwidth adaptations using standard Real-time Transport Protocol (RTP) mechanisms, e.g. RTP translators. We have implemented and evaluated the SRMS system in detail on an emulated network as well as on a wide-area testbed with up to 128 clients. Our results show that clients using SRMS achieve high (97%) data delivery ratios with low overheads (<5%) even for a very dynamic network (up to five membership changes per minute).

title: Cooperative peer groups in NICE
abstract: A distributed scheme for trust inference in peer-to-peer networks is presented. Our work is in context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify noncooperative users in NICE. We present a simulation based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly, we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.

title: Fast determination of textural periodicity using distance matching function
abstract: The periodicity of a texture is one of its important visual characteristics. The inertias of co-occurrence matrices of the texture have been often used to detect the visual periodicity. However, it is time-consuming to explicitly construct these matrices. In this paper, we propose the distance matching function to avoid constructing the matrices due to our new interpretation of an inertia. For a texture of size m n, the inertias of all co-occurrence matrices can be obtained in OOmn log mnU time by simultaneously evaluating the function at all displacement vectors. This is a significant improvement over the previous method using the co-occurrence matrices, that requires OOm 2 n 2 U time. ” 1999 Elsevier Science B.V. All rights reserved.

title: ARMS: An Authenticated Routing Message in Sensor Networks
abstract: In wireless sensor networks, a sensor node broadcasts its data (such as routing information, beacon messages or meta-data) to all its neighbors, which is called local broadcast. A general case for a sensor node to use a local broadcast is to advertise its routing information. Considering that sensor networks are vulnerable to a variety of attacks and current routing protocols are insecure, a sensor node's broadcast message should be authenticated by all its neighbors. Unfortunately, the previous work on broadcast authentication in sensor networks mainly concentrates on broadcast messages from a base station which has greater capabilities, not from a sensor node. Those schemes' properties are not appropriate for broadcast authentication of sensor node's routing messages. In this paper, we present ARMS, a protocol for broadcast authentication of sensor node's routing messages. It requires only a small memory space, authenticates routing messages without delay (thus, no buffering is needed), needs no time synchronization among sensor nodes, and mitigates the effect of packet loss. These ARMS' properties are suitable for a sensor node to broadcast an authenticated routing message.

title: Handheld routers: intelligent bandwidth aggregation for mobile collaborative communities
abstract: Multi-homed, mobile wireless computing and communication devices can spontaneously form communities to logically combine and share the bandwidth of each other's wide-area communication links using inverse multiplexing. But membership in such a community can be highly dynamic, as devices and their associated WAN links randomly join and leave the community. We identify the issues and tradeoffs faced in designing a decentralized inverse multiplexing system in this challenging setting, and determine precisely how heterogeneous WAN links should be characterized, and when they should be added to, or deleted from, the shared pool. We then propose methods of choosing the appropriate channels on which to assign newly-arriving application flows. Using video traffic as a motivating example, we demonstrate how significant performance gains can be realized by adapting allocation of the shared WAN channels to specific application requirements. Our simulation and experimentation results show that collaborative bandwidth aggregation systems are, indeed, a practical and compelling means of achieving high-speed Internet access for groups of wireless computing devices beyond the reach of public or private access points.

title: Selecting a routing strategy for your ad hoc network
abstract: In this paper we investigate the performance of routing strategies in ad hoc networks. An ad hoc network operates without a central entity or infrastructure, and is composed of highly mobile network hosts. In this environment, routes tend to be multihop and routing protocols are faced with host mobility and bandwidth constraints. In recent years, numerous routing protocols of different styles have been proposed. Traditional table-driven protocols (distance vector, link state), reactive on-demand protocols, and location-based protocols that use position information provided by GPS are the most commonly used strategies. Using PARSEC, we simulate protocols that represent these various routing strategies. The protocols are evaluated in different network scenarios. Relative strengths, weaknesses, and applicability to various situations of each routing protocol are studied and discussed.

title: Grid services for earthquake science
abstract: We describe an information system architecture for the ACES (Asia–Pacific Cooperation for Earthquake Simulation) community. It addresses several key features of the field—simulations at multiple scales that need to be coupled together; real-time and archival observational data, which needs to be analyzed for patterns and linked to the simulations; a variety of important algorithms including partial differential equation solvers, particle dynamics, signal processing and data analysis; a natural three-dimensional space (plus time) setting for both visualization and observations; the linkage of field to real-time events both as an aid to crisis management and to scientific discovery. We also address the need to support education and research for a field whose computational sophistication is rapidly increasing and spans a broad range. The information system assumes that all significant data is defined by an XML layer which could be virtual, but whose existence ensures that all data is object-based and can be accessed and searched in this form. The various capabilities needed by ACES are defined as grid services, which are conformant with emerging standards and implemented with different levels of fidelity and performance appropriate to the application. Grid Services can be composed in a hierarchical fashion to address complex problems. The real-time needs of the field are addressed by high-performance implementation of data transfer and simulation services. Further, the environment is linked to real-time collaboration to support interactions between scientists in geographically distant locations.