One-hop broadcasting is the predominate form of network traffic in VANETs. Exchanging status information by broadcasting among the vehicles enhances vehicular active safety. Since there is no MAC layer broadcasting recovery for 802.11 based VANETs, efforts should be made towards more robust and effective transmission of such safety-related information. In this paper, a channel adaptive broadcasting method is proposed. It relies solely on channel condition information available at each vehicle by employing standard supported sequence number mechanisms. The proposed method is fully compatible with 802.11 and introduces no communication overhead. Simulation studies show that it outperforms standard broadcasting in term of reception rate and channel utilization.

With the rapid advances of cellular and DSRC communication technologies, vehicle to vehicle (V2V) and vehicle to infrastructure (V2I) communication will greatly improve the safety and mobility of future transportation systems. Nevertheless, current TCP/IP based networking services are too rigid to support large scale bandwidth-intensive content distribution. We focus on two challenging applications: distribution of real-time traffic information to all road vehicles and distribution of bandwidth-intensive media data. In this paper, we propose a Type-Based Content Distribution (TBCD) approach to support large scale data intensive content distribution in vehicular networks. It utilizes the Software-Defined Networking (SDN) technology to support efficient in-network replication and caching. According to the different types of the content, our method takes a push-and-pull pattern to transmit the content. Also, we take different policies based on the number of subscribers to utilize the push-and-pull pattern more efficiently. It aims to achieve the following points: (1) to balance reliability and redundancy of the content forwarding, and (2) to minimize the impact of disconnection when transmitting the content in a vehicular wireless network.

The majority of local IPv6 networks continue to remain insecure and vulnerable to neighbor spoofing attacks. The Secure Neighbor Discovery (SEND) standard and its concomitant Cryptographically Generated Addressing (CGA) scheme were accepted by large standard bodies to codify practical mitigations. SEND and CGA have never seen widespread adoption due to their complexities, obscurity, costs, compatibility issues, and continued lack of mature implementations. In light of their poor adoption, research since their standardization has continued to find new perspectives and proffer new ideas. The orthodox solutions for securing Neighbor Discovery have historically struggled to successfully harmonize three core ideals: simplicity, flexibility, and privacy preservation. This research introduces Voucher-Based Addressing, a low-configuration, low-cost, and high-impact alternative to IPv6 address generation methods. It secures the Neighbor Discovery address resolution process while remaining simple, highly adaptable, indistinguishable, and privacy-focused. Applying a unique concoction of cryptographic key derivation functions, link-layer address binding, and neighbor consensus on the parameters of address generation, the resolved address bindings are verifiable without the need for complex techniques that have hindered the adoption of canonical specifications.

Information-Centric Networking (ICN) is a new paradigm of network architecture that focuses on content rather than hosts as first-class citizens of the network. As part of these architectures, in-network storage devices are essential to provide end users with close copies of popular content, to reduce latency and improve the overall experience for the user but also to reduce network congestion and load on the content producers. To be effective, in-network storage devices, such as content storage routers, should maintain copies of the most popular content objects. Adversaries that wish to reduce this effectiveness can launch cache pollution attacks to eliminate the benefit of the in-network storage device caches. Therefore, it is crucial to protect these devices and ensure the highest hit rate possible. This paper demonstrates Per-Face Popularity approaches to reducing the effects of cache pollution and improving hit rates by normalizing assessed popularity across all faces of content storage routers. The mechanisms that were developed prevent consumers, whether legitimate or malicious, on any single face or small number of faces from overwhelmingly influencing the content objects that remain in the cache. The results demonstrate that per-face approaches generally have much better hit rates than currently used cache replacement techniques.

We present an optimistic approach for consistent, interactive steering of distributed computations. In contrast to conservative approaches, the optimistic steering approach assumes that next steerable points are consistent and invokes steering updates without concern for the state of any other process. This approach is expected to perform well since it eliminates the need for blocking processes. Furthermore, we introduce a novel transaction-based computation model. We view the local computation of a process as a sequence of local transactions and a distributed computation as a set of partially ordered global transactions. This abstraction not only gives users a simple and high-level view of distributed computation, but also simplifies reasoning about consistency problems by reducing the amount of information to be handled. Using the Higher KdV (HiKdV) equation simulation program, we evaluate the performance of the optimistic steering approach. Our experiments show that when the percentages of consistency on the first attempt are large enough, the optimistic approach will achieve better performance; otherwise, the conservative approach will be better.

The majority of local IPv6 networks continue to remain insecure and vulnerable to neighbor spoofing attacks. The Secure Neighbor Discovery (SEND) standard and its concomitant Cryptographically Generated Addressing (CGA) scheme were accepted by large standards bodies to codify practical mitigations. SEND and CGA have never seen widespread adoption due to their complexities, obscurity, costs, compatibility issues, and continued lack of mature implementations. In light of their poor adoption, research since their standardization has continued to find new perspectives and proffer new ideas. The orthodox solutions for securing Neighbor Discovery have historically struggled to successfully harmonize three core ideals: simplicity, flexibility, and privacy preservation. This research introduces Voucher-Based Addressing, a low-configuration, low-cost, and high-impact alternative to IPv6 address generation methods. It secures the Neighbor Discovery address resolution process while remaining simple, highly adaptable, indistinguishable, and privacy-focused. Applying a unique concoction of cryptographic key derivation functions, link-layer address binding, and neighbor consensus on the parameters of address generation, resolved address bindings are verifiable without the need for complex techniques that have hindered the adoption of canonical specifications.