Huaqun Guo

Embedded info-security solutions for vehicular networks

The emerging vehicular networks in the forms of intra-car, car-to-car, and car-to-infrastructure communications will enable a variety of applications for safety, traffic efficiency, driver assistance, as well as infotainment to be incorporated into future automotive designs. However, the availability of these exciting automotive applications can also lead to formidable set of exploits and vulnerable to attacks, as more and more data is being exchanged and communicated in and out of a car. In this paper, we present our initial works on embedded info-security solutions to protect the critical data for car communications via vehicular networks. We describe an info-security framework, system design, and the first solution prototype in this paper. The initial prototype shows that the proposed solution is feasible.

An Anonymous DoS-Resistant Password-Based Authentication, Key Exchange and Pseudonym Delivery Protocol for Vehicular Networks

Vehicular networks are gaining popularity because vehicularcommunications are able to help minimize accidents, improvetraffic conditions and provide infotainment services. Security and privacy are important challenges in the deployment of vehicular networks. Authentication, key exchange and pseudonym delivery protocols can be used to provide security and privacy in vehicular networks. However, two important aspects of security and privacy,namely protection against DoS attacks and vehicle node anonymity, are currently not being addressed in existing authentication, key exchange and pseudonym delivery protocols for vehicular networks. In this paper, we propose an anonymous DoS-resistant password-based AUthentiCation, Key Exchange and Pseudonym delivERy(AUCKEPER) Protocol for vehicular networks that provides both protection against DoS attacks and vehicle node anonymity. A security and complexity analysis shows that the proposed AUCKEPER protocol is secure, more efficient and has advantages over a recently proposed state-of-the-art authentication, key exchange and pseudonym delivery protocol.

DINCast: a hop efficient dynamic multicast infrastructure for P2P computing

Efficient communications among computers participating in peer-to-peer (P2P) computing remains a problem when they are geographically distributed across multiple network domains. In this paper, we propose DINCast to support group communications required in P2P computing. DINCast is built on top of an existing P2P multicast tree and results in a hop efficient dynamic multicast infrastructure. We show that DINCast is able to reduce communications delay compared with the original tree-based multicast. DINCast is also advantageous since it can achieve load balance and data persistency.

Comparison of in-network versus Staggered Multicast video distribution models

This paper proposes a new video distribution service: Video-In-Network (VIN). In VIN, videos are continuously circulating in an optical network where they can be easily retrieved by VIN Nodes. A mathematical model of the VIN system was derived and used to explore the performance of VIN in terms of the maximum number of concurrent video streams which can be supported by the system. We then compared VIN with Staggered Multicast. We found that VIN has a number of advantages over Staggered Multicast. First, VIN is more scalable in terms of the number of streams/channels. Second, the startup latency of VIN is shorter than that of Staggered Multicast. Third, Staggered Multicast is a near-VOD system and the video clients usually have no specific channels to the server to request for video. In the VIN system, the video clients can request the VIN Node for particular videos for multicast or unicast on demand.

A DINloop-based inter-domain multicast using MPLS

To overcome scalability and control overhead problems existing in inter-domain multicast, DINloop (data-in-network loop) based multicast with MPLS is proposed. DINloop is a special logical path formed using MPLS label switched paths and it consists of multiple DIN nodes which are core routers that connect to each intra-domain. We use DINloop to manage inter-domain multicast group membership. Facilitated by the DINloop, multiple DIN nodes in the core network easily form a Steiner tree for multicast traffic. Furthermore, traffic for different multicast groups sharing the same path are aggregated through a label stack. Simulations demonstrate that DINloop-based multicast results in less message load needed to form the multicast structure. In addition, the routing table size in other core routers does not increase as the number of multicast group increases, and therefore routing scalability is improved. Finally, the inter-domain multicast delay in DINloop-based multicast is lower than that of a unidirectional tree.

DINloop based inter-domain multicast with MPLS

To overcome the existing scalability problems, DINloop (Data-in-Network loop) based multicast with MPLS (multiprotocol label switching) is proposed to optimize inter-domain multicast. In our approach, multiple DIN Nodes in the core network form the DINloop using MPLS so that multiple multicast sessions share a single DINloop. We adopts a label stack method to use fewer labels and label switch paths (LSPs) are established between DIN Nodes to create the DINloop. Packet processing module analyzes the coming multicast packet and MPLS Manager assigns a label stack to it. Simulations show that DINloop based multicast uses the least message load needed to form the multicast architecture. In addition, the routing table size in the core router does not increase as the number of multicast group increases, and therefore DINloop based multicast increases the routing scalability for inter-domain multicast. Finally, the multicast delay in DINloop based multicast is moderate lager than other protocols.

Optimizing inter-domain multicast through DINloop with GMPLS

This paper proposes DINloop (Data-In-Network loop) based multicast with GMPLS (generalizedmultiprotocol label switching) to overcome the scalability problems existing in current inter-domain multicast protocols. In our approach, multiple multicast sessions share a single DINloop instead of constructing individual multicast trees. DINloop is a special path formed using GMPLS to establish LSPs (Label Switched Paths) between DIN Nodes, which are core routers that connect to each intra-domain. We adopt link bundling method to use fewer labels. Packet Processing Module analyzes the coming multicast message and GMPLS Manager assigns a label to it. Then the multicast packet is fast forwarded using label. Simulations show that DINloop-based multicast uses the smallest message number needed to form the multicast structure compared with conventional inter-domain multicast protocols. In addition, the routing table size in core routers does not increase as the number of multicast group increases, and therefore the routing scalability is achieved.

Application-Level multicast using DINPeer in p2p networks

In this paper, we propose a DINPeer middleware to overcome limitations in current peer-to-peer (P2P) overlay systems. DINPeer exploits a spiral-ring method to discover an inner ring with relative largest bandwidth to form a DINloop (Data-In-Network loop). DINPeer further integrates DINloop with P2P overlay network. The key features of DINPeer include using DINloop to replace a multicast rendezvous point and turning DINloop into a cache to achieve application data persistency. Simulations show that DINPeer is able to optimize application-level multicast that when the size of the DINloop is capped within a limit, it can achieve a better performance than native IP multicast and P2P overlay multicast systems.

DINPeer: optimized P2P communication network

In this paper, we propose DINPeer middleware to overcome limitations in current peer-to-peer (P2P) overlay systems. DINPeer exploits a spiral-ring method to discover an inner ring with relative largest bandwidth to form a DINloop (Data-In-Network loop). DINPeer further integrates DINloop with P2P overlay network via node state and routing algorithm. The key features of DINPeer include using DINloop to replace a multicast rendezvous point and turning DINloop into a cache to achieve data persistency. Simulations show that DINPeer is able to optimize P2P communication in a number of ways, such as when the size of the DINloop is capped within a limit, it can achieve a better performance than native IP multicast and P2P overlay multicast systems.