HMP: hotspot mitigation protocol for mobile ad hoc networks
"Hotspots" represent transient but highly congested regions in wireless ad hoc networks that result in increased packet loss, end-to-end delay, and out-of-order packets delivery. We present a simple, effective, and scalable Hotspot Mitigation Protocol (HMP) where mobile nodes independently monitor local buffer occupancy, packet loss, and MAC contention and delay conditions, and take local actions in response to the emergence of hotspots, such as, suppressing new route requests and rate controlling TCP flows. HMP balances resource consumption among neighboring nodes, and improves end-to-end throughput, delay, and packet loss. Our results indicate that HMP can also improve the network connectivity preventing premature network partitions. We present analysis of hotspots, and detail the design of HMP. We evaluate the protocol's ability to effectively mitigate hotspots in mobile ad hoc networks that are based on best effort on-demand routing protocols, such as, AODV and DSR.

title: A hotspot mitigation protocol for ad hoc networks
abstract: Hotspots represent transient but highly congested regions in wireless ad hoc networks that result in increased packet loss, end-to-end delay, and out-of-order packets delivery. We present a simple, effective, and scalable hotspot mitigation protocol (HMP) where mobile nodes independently monitor local buffer occupancy, packet loss, and MAC contention and delay conditions, and take local actions in response to the emergence of hotspots, such as, suppressing new route requests and rate controlling TCP flows. We use analysis, simulation, and experimental results from a wireless testbed to demonstrate the effectiveness of HMP in mobile ad hoc networks. HMP balances resource consumption among neighboring nodes, and improves end-to-end throughput, delay, and packet loss. Our results indicate that HMP can also improve the network connectivity preventing premature network partitions. We present analysis of hotspots, and the detailed design of HMP. We evaluate the protocol’s ability to effectively mitigate hotspots in mobile ad hoc networks that are based on on-demand and proactive routing protocols.

title: Real-time pencil rendering
abstract: This paper presents a real-time technique for rendering 3D meshes in the pencil drawing style. We analyze the characteristics of pencil drawing and incorporate them into the rendering process, which is fully implemented on a GPU. For object contours, we propose a multiple contour drawing technique that imitates trial-and-errors of human in contour drawing. For interior shading, we present a simple approach for mapping oriented textures onto an object surface. To improve the quality of pencil rendering, we generate and map pencil textures that reflect the properties of graphite pencils and paper. We show several rendering examples that demonstrate the high performance of the proposed technique in terms of speed and quality.

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: RITA: receiver initiated just-in-time tree adaptation for rich media distribution
abstract: Application-level multicast networks overlaid on unicast IP networks are increasingly gaining in importance. While there have been several proposals for overlay multicast networks, very few of them focus on the stringent requirements of real-time applications such as streaming media. We propose RITA (Receiver Initiated Timely Adaptation) framework for an efficient overlay multicast infrastructure. RITA is based on a combination of landmark clustering and RTT measurements, and is particularly suitable for multimedia real-time applications. Our goal is to balance the network-oriented goals of building an efficient multicast tree with the application-oriented goals of providing good QoS with minimal disruptions. Using accurate global soft state information tables, our approach promptly constructs and reconfigures high quality trees. A distinguishing feature of our approach is that the tree reconfiguration is initiated just-in-time by the application client at the receiver when the media quality falls below a specific threshold. The goal is to achieve dynamic tree reconfiguration with very low switching delay such that end users do not perceive any application performance degradation.

title: Image Metamorphosis with Scattered Feature Constraints
abstract: This paper describes an image metamorphosis technique to handle scattered feature constraints specified with points, polylines, and splines. Solutions to the following three problems are presented: feature specification, warp generation, and transition control. We demonstrate the use of snakes to reduce the burden of feature specification. Next, we propose the use of multilevel free-form deformations (MFFD) to compute C/sup 2/-continuous and one-to-one mapping functions among the specified features. The resulting technique, based on B-spline approximation, is simpler and faster than previous warp generation methods. Furthermore, it produces smooth image transformations without undesirable ripples and foldovers. Finally, we simplify the MFFD algorithm to derive transition functions to control geometry and color blending. Implementation details are furnished and comparisons among various metamorphosis techniques are presented.

title: A new wireless ad hoc multicast routing protocol
abstract: 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.