11234364
Robust routing in wireless ad hoc networks
A wireless ad hoc network is a collection of mobile nodes with no fixed infrastructure. The absence of a central authorization facility in dynamic and distributed environments requires collaboration among nodes. When a source searches for a route to a destination, an intermediate node can reply with its cached entry. To strengthen correctness of such a routing discovery process, we propose a method in which the intermediate node requests its next hop to send a confirmation message to the source. After receiving both a route reply and confirmation message, the source determines the validity of a path according to its policy. As a result, this strategy discourages malicious nodes from intercepting packets. Simulation results show a remarkable improvement in throughput (30% higher delivery ratio and 10% less data transmission overhead) with a moderate increase of control messages.
15947479
A new wireless ad hoc multicast routing protocol
An ad hoc network is a multi-hop wireless network of mobile nodes without the intervention of fixed infrastructure. Limited bandwidth and mobility require that ad hoc routing protocols 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 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.
1965002
Resilient multicast using overlays
We introduce Probabilistic Resilient Multicast (PRM): a multicast data recovery scheme that improves data delivery ratios while maintaining low end-to-end latencies. PRM has both a proactive and a reactive components; in this paper we describe how PRM can be used to improve the performance of application-layer multicast protocols especially when there are high packet losses and host failures. Through detailed analysis in this paper, we show that this loss recovery technique has efficient scaling properties-the overheads at each overlay node asymptotically decrease to zero with increasing group sizes. As a detailed case study, we show how PRM can be applied to the NICE application-layer multicast protocol. We present detailed simulations of the PRM-enhanced NICE protocol for 10 000 node Internet-like topologies. Simulations show that PRM achieves a high delivery ratio (>97%) with a low latency bound (600 ms) for environments with high end-to-end network losses (1%-5%) and high topology change rates (5 changes per second) while incurring very low overheads (<5%).
6107286
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.
5490648
Cooperative peer groups in NICE
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.
38607714
Cooperative peer groups in NICE
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.
14591532
Responsive Multimedia System for Virtual Storytelling
In this paper, we propose Responsive Multimedia System (RMS) for a virtual storytelling. It consists of three key components; Multi-modal Tangible User Interface (MTUI), a Unified Context-aware Application Model for Virtual Environments (vr-UCAM), and Virtual Environment Manager (VEManager). MTUI allows users to interact with virtual environments (VE) through human’s senses by exploiting tangible, haptic and vision-based interfaces. vr-UCAM decides reactions of VE according to multi-modal input. VEManager generates dynamic VE by applying the reactions and display it through 3D graphics and 3D sounds, etc. To demonstrate an effectiveness of the proposed system, we implemented a virtual storytelling system which unfolds a legend of Unju Temple. We believe the proposed system plays an important role in implementing various entertainment applications.
10953963
Ad Hoc Routing with Early Unidirectionality Detection and Avoidance
This paper is motivated by the observation that current research in ad hoc networks mostly assumes a physically flat network architecture with the nodes having homogeneous characteristics, roles, and networking- and processing-capabilities (e.g., network resources, computing power, and transmission power). In real-world ad hoc networks however, node heterogeneity is inherent. New mechanisms at the network layer are required for effective and efficient utilization of such heterogeneous networks. We discuss the issues and challenges for routing protocol design in heterogeneous ad hoc networks, and focus on the problem of quickly detecting and avoiding unidirectional links. We propose a routing framework called Early Unidirectionality Detection and Avoidance (EUDA) that utilizes geographical distance and path loss between the nodes for fast detection of asymmetric and unidirectional routes. We evaluate our scheme through ns-2 simulation and compare it with existing approaches. Our results demonstrate that our techniques work well in these realistic, heterogeneous ad hoc networking environments with unidirectional links.
52861172
Allocation of Signature File on Parallel Device for WWW Index Servers
Signature files are widely used in information retrieval and database. They act as search filters for content-based retrieval. In a large database server, a parallel device is utilized to achieve concurrency access. Efficient allocation of signature files on parallel devices minimizes the query response time and is important in the design of access methods for large scale index servers. We have developed an algorithm to organize the storage of signatures in parallel secondary storage to reduce the query response time. First, signature file is clustered into signature pages. Then, the clustered signature pages are distributed among the disks using the parity check matrix of error correcting code in coding theory. Through the construction of error correcting code, the least frequently simultaneously accessed pages are allocated on the same disk. Performance analysis shows that this algorithm improves the efficiency of access.
9065684
NodeWiz: peer-to-peer resource discovery for grids
Efficient resource discovery based on dynamic attributes such as CPU utilization and available bandwidth is a crucial problem in the deployment of computing grids. Existing solutions are either centralized or unable to answer advanced resource queries (e.g., range queries) efficiently. We present the design of NodeWiz, a grid information service (CIS) that allows multi-attribute range queries to be performed efficiently in a distributed manner. This is obtained by aggregating the directory services of individual organizations in a peer-to-peer information service.
6659898
On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks
An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile ad hoc networks. ODMRP is a mesh-based, rather than a conventional tree-based, multicast scheme and uses a forwarding group concept; only a subset of nodes forwards the multicast packets via scoped flooding. It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation.