No abstract

No abstract

We synthesize and animate general texture patterns over arbitrary 3D mesh surfaces. The animation is controlled by flow fields over the target mesh, and the texture can be arbitrary user input as long it satisfies the MarkovRandom-Field assumptions. We achieve this by extending the texture optimization framework over 3D mesh surfaces. We propose an efficient discrete solver inspired by k-coherence search, allowing interactive flow texture animation while avoiding the blurry blending problem for the least square solver in previous work. Our technique has potential applications ranging from simulation, visualization, and special effects.

No abstract

In a vehicular ad hoc network (VANET), high mobility and uneven distribution of vehicles are important factors affecting the performance of routing protocols. The high mobility may cause frequent changes of network topology, while the uneven distribution of vehicles may lead to routing failures due to network partition, and even high density of vehicles may cause severe wireless channel contentions in an urban environment. In this paper, we propose a novel concept called the micro topology (MT), which consists of vehicles and wireless links among vehicles along a street as a basic component of routing paths and even the entire network topology. We abstract the MT model reflecting the dynamic routing-related characteristics in practical urban scenarios along streets, including the effect of mobility of vehicles, signal fading, wireless channel contention and existing data traffic. We first analyze the endside-to-endside routing performance in an MT as a basis of routing decision. Then we propose a novel Street-centric Routing Protocol based on Micro Topology (SRPMT) along the streets for VANETs. Simulation results show that our proposed SRPMT protocol achieves higher data delivery rate and shorter average end-to-end delay compared with the performance of the GPSR and GyTAR.

Most load aware protocols for ad hoc networks use queue size as the main traffic load metric. However, this metric does not reflect the impact of channel contention from neighbor nodes. In this paper, we propose a load-aware routing protocol using two load metrics for route selection, which include MAC layer channel contention information, and the number of packets in the interface queue. MAC layer contention information provides an accurate estimation of neighbor nodes' state, and queue length provides a measurement of traffic load at the mobile node itself. This load-aware routing protocol can effectively balance the load and improve the performance of the ad hoc network. Impacts of these load metrics on the routing performance are studied, and simulations are conducted to evaluate our proposed scheme.

No abstract

No abstract