A taxonomy of multicast protocols for Internet applications

The continuous growth in applications that require communications among a group of hosts or simultaneous dissemination of data to multiple sites on the Internet has led to considerable interest in multicast communication. These applications have different quality of service requirements such as deadlines to response time and tolerance to data loss. Internet multicast protocols provide a spectrum of services to cater for the needs of a wide array of multicast applications. The design alternatives of a multicast protocol for a particular application may lead to different performance characteristics, for example higher utilization of network bandwidth vs lower protocol processing requirements. Therefore a framework is required to various design choices available to design multicast protocols and evaluate the performance tradeoffs associated with these alternatives. Motivated by such a need and by the evolution of multicast applications over the Internet, this article presents a taxonomy of multicast protocols and a common framework to evaluate their performance.     

Contention-based forwarding with multi-hop connectivity awareness in vehicular ad-hoc networks

Recent vehicular routing proposals use real-time road traffic density estimates to dynamically select forwarding paths. Estimating the traffic density in vehicular ad hoc networks requires the transmission of additional dedicated messages increasing the communications load. These proposals are generally based on unicast sender-based forwarding schemes. The greedy nature of sender-based forwarding can result in the selection of forwarders with weak radio links that might compromise the end-to-end performance. To overcome these limitations, this paper presents TOPOCBF, a novel contention-based broadcast forwarding protocol that dynamically selects forwarding paths based on their capability to route packets between anchor points. Such capability is estimated by means of a multi-hop connectivity metric. The obtained results demonstrate that TOPOCBF can provide good packet delivery ratios while reducing the communications load compared to unicast sender-based forwarding schemes using road traffic density estimates.     

Performance evaluation of an efficient fault tolerant service discovery protocol for vehicular networks

Recently, vehicular networks and inter-vehicle communication have received attention from the research community and the automotive industry. In this context, many services are deployed in vehicular networks that are beneficial to drivers and passengers. Service discovery in vehicular networks is vital to make such services useful. However, due to the lack of communication reliability in vehicular ad hoc networks, it is necessary to implement fault-tolerant techniques during the discovery of service providers in vehicular networks. Very few service discovery protocols for vehicular networks have considered fault tolerant techniques, which are very important for the efficiency of service discovery. Fault tolerant techniques improve service request satisfaction and reduce dropped connections due to faulty components between the service provider and the service requester. In this paper, we propose a fault tolerant location based service discovery protocol for vehicular networks which can work well under service provider failures, communication link failures and roadside router failures. Our protocol permits the discovery of location based services where the requester specifies the region of interest within the request. Our protocol uses an infrastructure support consisting of clusters of roadside routers formed in specific regions in the vehicular network. In addition, service discovery messages are integrated into the network layer and use channel diversity in order to improve service discovery efficiency. We describe our fault tolerant location based vehicular service discovery protocol (FTLocVSDP) and discuss its proof of correctness and performance evaluation. We prove that the success rate is improved in the roadside router failure and in the communication link failure scenarios by 50% and 30%, respectively, compared to the location based service discovery protocol for vehicular networks (LocVSDP) which does not consider fault tolerant techniques.     

PAACP: A portable privacy-preserving authentication and access control protocol in vehicular ad hoc networks

Recently, several studies addressed security and privacy issues in vehicular ad hoc networks (VANETs). Most of them focused on safety applications. As VANETs will be available widely, it is anticipated that Internet services could be accessed through VANETs in the near future. Thus, non-safety applications for VANETs would rise in popularity. This paper proposes a novel portable privacy-preserving authentication and access control protocol, named PAACP, for non-safety applications in VANETs. In addition to the essential support of authentication, key establishment, and privacy preservation, PAACP is developed to provide sophisticated differentiated service access control, which will facilitate the deployment of a variety of non-safety applications. Besides, the portability feature of PAACP can eliminate the backend communications with service providers. Therefore, better performance and scalability can be achieved in PAACP.     

Position-based routing in vehicular networks: A survey

Routing in vehicular network is a challenging task due to network partitioning, high vehicular speed, and city environment characteristics. These characteristics results in degraded performance in traditional routing protocols. Traditional routing protocols, addressing the issues of mobile ad hoc network, are applicable for MANET applications. Position-based routing protocols, which are mostly based on greedy routing, are more suited to highly dynamic and mobile network. In this paper, we survey state of art routing protocols previously used in vehicular networks, present open research challenges and possible future direction. We categorize protocols into two categories based on their communicating mode (vehicle-to-vehicle, vehicle-to-infrastructure) irrespective of their simulating environment (highway, urban). Both vehicle-to-vehicle and vehicle-to-infrastructure communication provides connectivity based on multi-hop paradigm in a seamless way. We discuss pros and cons for routing protocols belonging to each category. By doing qualitative comparison of routing protocols, it is observed that hybrid communication would be the better choice for both communication mode operable in either a city environment or an open environment.     

具有局部特性的传感网链路质量估计方法

重编程是实现无线传感器网络中软件更新的重要手段。传统的重编程协议性能评价方法仍然存在通过实验床和仿真平台评价其性能的优劣。目前,通过对重编程协议的软件更新过程建模并建立分析模型的性能评价方法,相对于传统的实验床和仿真平台,既能准确灵活地评价大规模部署的网络的性能,又能快速高效地给出性能分析结果,是当前重编程协议性能评价方法的新领域。然而,这一分析模型依赖于传感网链路质量的估计值。当前的传感网链路质量估计方法没有考虑到软件更新过程存在的局部特性,因而网络适应性差,无法广泛使用。提出了一种具有局部特性的网络链路质量估计方法,将软件更新过程中任一节点的局部邻居区域的链路质量期望作为这一节点的局部链路质量,能够更准确地反映软件更新过程的网络特征。使用这一具有局部特性的网络链路质量估计方法计算的估计值,将使得分析模型所计算出的重编程性能指标即完成时间与实验床运行时间的吻合度提高。将这一估计方法应用于分析模型,对线型和网格型网络的分析结果显示,分析结果与实验床的运行结果的误差低于5%。因此,与现有的估计方法相比,提出的方法在线型和网格型网络中适用性更强。     

车载自组织网络中的数据分发机制

车载自组织网络（vehicular ad-hoc network,简称VANET）作为一种新型的移动自组织网络,应用前景广阔.鉴于长距离数据分发机制是支撑VANET应用的一个不可或缺的机制,提出了一种VANET下路边单元（roadsideunit,简称RSU）辅助的数据分发机制Ara,并在不同的交通场景下对其性能进行了评估.实验结果表明,即使在有RSU出现故障的情况下,Ara也可以保证较高的数据到达率、较小的延迟和较低的消息开销.同时,通过建立分析模型对Ara的数据传递延迟进行了理论分析.该分析模型建立在车辆的微观流模型之上,可以推导出不同RSU 部署场景下的数据传递延迟.模拟实验结果验证了模型的正确性,因此该分析模型可以对Ara数据传递的性能进行预测.     

Mutual anonymous overlay multicast

Multicast services are demanded by a variety of applications. Many applications require anonymity during their communication. However, there has been very little work on anonymous multicasting and such services are not available yet. Due to the fundamental differences between multicast and unicast, the solutions proposed for anonymity in unicast communications cannot be directly applied to multicast applications. In this paper we define the anonymous multicast system, and propose a mutual anonymous multicast (MAM) protocol including the design of a unicast mutual anonymity protocol and construction and optimization of an anonymous multicast tree. MAM is self-organizing and completely distributed. We define the attack model in an anonymous multicast system and analyze the anonymity degree. We also evaluate the performance of MAM by comprehensive simulations.     

Private set intersection: A systematic literature review

Secure Multi-party Computation (SMPC) is a family of protocols which allow some parties to compute a function on their private inputs, obtaining the output at the end and nothing more. In this work, we focus on a particular SMPC problem named Private Set Intersection (PSI). The challenge in PSI is how two or more parties can compute the intersection of their private input sets, while the elements that are not in the intersection remain private. This problem has attracted the attention of many researchers because of its wide variety of applications, contributing to the proliferation of many different approaches. Despite that, current PSI protocols still require heavy cryptographic assumptions that may be unrealistic in some scenarios. In this paper, we perform a Systematic Literature Review of PSI solutions, with the objective of analyzing the main scenarios where PSI has been studied and giving the reader a general taxonomy of the problem together with a general understanding of the most common tools used to solve it. We also analyze the performance using different metrics, trying to determine if PSI is mature enough to be used in realistic scenarios, identifying the pros and cons of each protocol and the remaining open problems.     

An overview of vertical handover techniques: Algorithms, protocols and tools

Wireless technologies, under the “Anywhere, Anytime” paradigm, offer users the promise of being always attached to the network. Mobile devices enabled with multiple wireless technologies make possible to maintain seamless connectivity in highly dynamic scenarios such as vehicular networks (VNs), switching from one wireless network to another by using vertical handover techniques (VHO). In this paper we present an overview of VHO techniques, along with the main algorithms, protocols and tools proposed in the literature. In addition we suggest the most appropriate VHO techniques to efficiently communicate in VN environments considering the particular characteristics of this type of networks.     

An optimistic fair exchange protocol with active intermediaries

The study of business transactions is a topic of interest in the field of electronic commerce. Fair Exchange protocols deal with the problem of how the different parties involved in a transaction can exchange their parts securely, i.e., with assurance that the other parties will carry on with the transaction. Fair Exchange is a field of research that has been extensively studied, but we have found that previous proposals have failed to address one problem that concerns electronic commerce, i.e., transactions with active intermediaries. Previous Fair Exchange protocols deal with scenarios where only 2 parties are involved or scenarios where N known parties have to reach a common agreement, omitting scenarios where active intermediaries are involved. In this paper, we present an Optimistic Fair Exchange protocol for transactions with active intermediaries, which, to the best of our knowledge, is the first of its kind.     

A directional data dissemination protocol for vehicular environments

This paper presents a simple and robust dissemination protocol that efficiently deals with data dissemination in both dense and sparse vehicular networks. Our goal is to address highway scenarios where vehicles equipped with sensors detect an event, e.g., a hazard and broadcast an event message to a specific direction of interest. In order to deal with broadcast communication under diverse network densities, we design a dissemination protocol in such a way that: (i) it prevents the so-called broadcast storm problem in dense networks by employing an optimized broadcast suppression technique; and (ii) it efficiently deals with disconnected networks by relying on the store-carry-forward communication model. The novelty of the protocol lies in its simplicity and robustness. Simplicity is achieved by only considering two states (i.e., cluster tail and non-tail) for vehicles. Furthermore, vehicles in both directions help disseminating messages in a seamlessly manner, without resorting to different operation modes for each direction. Robustness is achieved by assigning message delivery responsibility to multiple vehicles in sparse networks. Our simulation results show that our protocol achieves higher delivery ratio and higher robustness when compared with DV-CAST under diverse road scenarios.     

移动分组无线网路由协议分类研究

移动分组无线网(MPRN)是建立军事和民用快速通信系统的理想技术,网络路由协议是其设计的关键。由于传统的路由协议不能很好地适应快速变化的拓扑结构,许多新的MPRN路由算法被提出来。文章从不同的角度对MPRN路由算法进行分类,并对每一类协议的共性进行了分析和研究。对MPRN协议进行系统的分类有助于加深对路由协议的理解。     

基于国密SM2的高效范围证明协议

在范围证明这类特殊的零知识证明协议中,证明者无需提供具体元素信息即可向验证者证明某一承诺的元素在指定集合内.范围证明已被广泛应用于区块链、匿名证书、电子现金、群/环签名等需要身份/数据隐私保护的场景.范围证明协议的设计方法包括平方分解(Square Decomposition)、签名基(Signature-based)、内积(Innerproduct Argument)等,其中使用较为广泛的是Camenisch等在ASIACRYPT 2008会议上提出的签名基方法.然而,Camenisch等提出的范围证明协议不仅需要高耗时的双线性对运算,还涉及繁琐的证书管理,实用性还有待提高.虽然何德彪等(专利申请公布号:CN110311776A)利用国密SM9数字签名算法设计新的协议,避免了证书管理,但仍需要双线性对运算,所以协议的计算开销还较高.为了进一步减少计算量,丰富国产密码的应用,本文采用签名基方法,利用基于国密SM2的标识数字签名算法设计新的集合关系证明协议,有效解决证书管理和双线性对开销问题,在此基础上构造新的数值范围证明协议,支持更大范围的零知识证明.为了证明所设计协议的安全性,本文先证明基于国密SM2的标识数字签名算法在自适应选择消息和身份攻击下具有存在不可伪造性(EUF-CMID-A),在此基础上证明所设计协议满足完备性、可靠性和诚实验证者零知识性.与Camenisch等和何德彪等提出的协议相比,在相同优化参数情况下,本文协议的主要通信带宽约为1568字节,分别减少了41.66%和78.12%;主要计算开销约为491.5075毫秒,分别减少了85.93%和85.85%.这说明了本文设计的协议具有更强的实用性,更能满足前述场景的身份/数据隐私保护与有效性验证需求.     

车联网城市交通移动多场景建模仿真及分析

本文针对车载自组织网络环境中的城市交通车辆移动应用场景进行了分析,在VanetMobiSim交通仿真器和NS-2网络仿真器协同仿真环境中,对城市智能交通中的两类典型应用场景交叉路口和双向快速四车道进行了模型构建,同时在这两类应用场景中对AODV和DSDV路由协议进行了仿真和分析.通过端到端时延、抖动率、丢包率和控制包开销四个评价指标对比不同协议在同一场景下的表现效果.此外,针对AODV协议,分析了车辆速度、车辆密度、最大联机数和单位时间内发送封包数等环境因子对协议通信效果的影响.仿真结果表明,选取合适的移动场景模型有助于客观评价协议性能,不同的协议对不同的场景的表现性和适应性不同.DSDV应用于简单稳定的移动场景时表现较优,而AODV面对复杂多变的移动场景时有更好的适应性,且AODV协议受网络拓扑复杂程度和结构变化频率影响较大.     

MoVES: A framework for parallel and distributed simulation of wireless vehicular ad hoc networks

In this paper, we illustrate a Mobile Wireless Vehicular Environment Simulation (MoVES) framework for the parallel and distributed simulation of vehicular wireless ad hoc networks (VANETs). The proposed framework supports extensible, module-based and layered modeling, and scalable, accurate and efficient simulation of vehicular scenarios integrated with wireless communication and mobile services/applications. The vehicular layer includes models for vehicles, synthetic and trace-driven mobility, driver behavior, GPS-based street maps, intersection policies and traffic lights. The wireless communication layer currently includes models for physical propagation, and a network protocol stack including IEEE 802.11 Medium Access Control, up to the Application layer. MoVES provides a platform for microscopic modeling and simulation-based analysis of wireless vehicular scenarios and communication-based services and applications, like Intelligent Transportation Systems, communication-based monitoring/control and info-mobility services. The framework includes design solutions for scalable, accurate and efficient parallel and distributed simulation of complex, vehicular communication scenarios executed over cost-effective, commercial-off-the-shelf (COTS) simulation architectures. Dynamic model partition and adaptation-based load balancing solutions have been designed by exploiting common assumptions and model characteristics, in a user-transparent way. Test-bed performance evaluation for realistic scenarios has shown the effectiveness of MoVES in terms of simulation efficiency, scalability, adaptation and simulation accuracy.     

Island Multicast: Combining IP Multicast With Overlay Data Distribution

Traditional overlay protocols use unicast connections to form delivery trees. While it can achieve global multicast across the Internet, it is not as efficient as IP multicast. In this paper, we integrate IP multicast into overlay data distribution to improve delivery efficiency. We investigate island multicast where unicast connections are used to connect multicast domains and IP multicast is used within multicast domains. We first explore a centralized island multicast protocol (termed CIM), which relies on a central server to construct a delivery tree. We then study a distributed protocol (termed DIM), where hosts can distributedly join islands and form a delivery tree. We study the key issues in both protocols. We also discuss how to apply these protocols to media streaming applications. We have evaluated both protocols on Internet-like topologies. We have also implemented a prototype for CIM and tested it on PlanetLab. The results show that our approaches can significantly im prove network performance as compared to pure overlay protocols. Our study shows that it is important to consider local multicast capability when designing overlay protocols.     

Characterizing application scheduling on edge,fog, and cloud computing resources

Cloud computing has grown to become a popular distributed computing service offered by commercial providers. More recently, edge and fog computing resources have emerged on the wide-area network as part of Internet of things (IoT) deployments. These three resource abstraction layers are complementary, and offer distinctive benefits. Scheduling applications on clouds has been an active area of research, with workflow and data flow models offering a flexible abstraction to specify applications for execution. However, the application programming and scheduling models for edge and fog are still maturing, and can benefit from learnings on cloud resources. At the same time, there is also value in using these resources cohesively for application execution. In this article, we offer a taxonomy of concepts essential for specifying and solving the problem of scheduling applications on edge, fog, and cloud computing resources. We first characterize the resource capabilities and limitations of these infrastructure and offer a taxonomy of application models, quality-of-service constraints and goals, and scheduling techniques, based on a literature review. We also tabulate key research prototypes and papers using this taxonomy. This survey benefits developers and researchers on these distributed resources in designing and categorizing their applications, selecting the relevant computing abstraction(s), and developing or selecting the appropriate scheduling algorithm. It also highlights gaps in literature where open problems remain.     

An efficient hybrid multicast transport protocol for collaborative virtual environment with networked haptic

In recent years, we have witnessed a growing interest in the synchronous collaboration based class of applications. Several techniques for collaborative virtual environments (CVE), haptic, audio and visual environments (C-HAVE) have been designed. However, several challenging issues remain to be resolved before CVE and C-HAVE become a common place. In this paper, we focus on applications that are based on closely coupled and highly synchronized haptic tasks that require a high-level of coordination among the participants. Four main protocols have been designed to resolve the synchronization issues in such environments: the synchronous collaboration transport protocol, the selective reliable transmission protocol, the reliable multicast transport protocol and the scalable reliable multicast. While these four protocols have shown good performance for CVE and C-HAVE class of applications, none of these protocols has been able to meet all of the basic CVE requirements, i.e., scalability, reliability, synchronization, and minimum delay. In this paper, we present a hybrid protocol that is able to satisfy all of the CVE and C-HAVE requirements and discuss its implementation and results in two tele-surgery applications. This work is partially supported by Grants from Canada Research Chair Program, NSERC, OIT/Ontario Distinguished Researcher Award, Early Research Award and ORNEC Research Grant.