Defense against misbehavior in anonymous vehicular ad hoc networks

Vehicular ad hoc network (VANET) can offer various services and benefits to VANET users and thus deserves deployment effort. Misusing such network could cause destructive consequences. It is therefore necessary to discourage misbehavior and defend VANET systems against it, in order to ensure correct and smooth operations of the network. In this paper, we review the techniques for handling misbehavior in VANETs, particularly where anonymous communications are desired to conserve user privacy since it adds more complexity to the defense against misbehavior. A new scheme is proposed to punish misbehaving users and can be employed in both inter-vehicle and vehicle-to-infrastructure anonymous communications. Our scheme leverages some threshold authentication technique that dynamically revokes a user’s credential, while providing the flexibility of whether to reveal the user’s identity and tolerating unintentional misbehavior such as hardware malfunctioning.     

ASPE: attribute-based secure policy enforcement in vehicular ad hoc networks

Vehicular ad hoc networks (VANETs) are usually operated among vehicles moving at high speeds, and thus their communication relations can be changed frequently. In such a highly dynamic environment, establishing trust among vehicles is difficult. To solve this problem, we propose a flexible, secure and decentralized attribute based secure key management framework for VANETs. Our solution is based on attribute based encryption (ABE) to construct an attribute based security policy enforcement (ASPE) framework. ASPE considers various road situations as attributes. These attributes are used as encryption keys to secure the transmitted data. ASPE is flexible in that it can dynamically change encryption keys depending on the VANET situations. At the same time, ASPE naturally incorporates data access control policies on the transmitted data. ASPE provides an integrated solution to involve data access control, key management, security policy enforcement, and secure group formation in highly dynamic vehicular communication environments. Our performance evaluations show that ASPE is efficient and it can handle large amount of data encryption/decryption flows in VANETs.     

动态无线传感器网络自组织协议的研究

目前多数移动自组织路由协议选择路径都是基于跳数最短的单径路由.从能量角度看,多数路由协议并没有充分利用网络资源.文章提出一种多径节能路由(Muhipath Saving Dynamic Source Routing,MSDR)协议.实验结果表明,该协议不仅提高了网络可靠性,而且还有效地延长了节点的工作时间和网络的整体寿命.     

移动Ad hoc网络中CBRP路由协议仿真分析

CBRP是移动Ad Hoc网络中一种基于分群的按需路由协议。它是一种面向中大网络规模的可扩展路由协议。文中首先概述了CBRP路由协议，然后简要分析了该协议的优点及存在的问题。最后利用ns-2．28网络仿真软件对其进行了仿真，并与应用较广泛的AODV路由协议进行了比较。结果表明该协议在大规模Ad Hoc网络中性能良好。     

无人机辅助车联网的网络传输链路优化

无人机(UAV)通信技术的快速发展与智能车联网应用需求的极速增长促进了无人机辅助车联网系统的产生与发展。在无人机辅助车联网系统中,如何节省能量的同时最大化系统性能对于能量有限的节点十分重要。基于此,本文主要考虑无人机辅助车联网通信过程中如何选择最优的通信网络链路,从而最大化能量效率的问题。首先建立通信网络链路选择问题为混合整数规划问题,然后提出基于能量效率最大化的网络传输链路优化算法获得最优的传输链路及对应的能量分配,最后通过数值实验仿真验证了所提算法的有效性。     

一维车载Ad Hoc网络连接度分析

In this paper we analyze connectivity of one-dimensional Vehicular Ad Hoc Networks where vehicle gap distribution can be approximated by an exponential distribution. The probabilities of Vehicular Ad Hoc Network connectivity for difference cases are derived. Furthermore we proof that the nodes in a sub-interval [z1,z1 +Δz] of interval [0, z], z>0 where all the nodes are independently uniform distributed is a Poisson process and the relationship of Vehicle Ad hoc Networks and one-dimensional Ad Hoc networks ...     

Markov model of link connectivity in mobile ad hoc networks

This paper proposes a Markov model of link connectivity for mobile ad hoc networks. Under a random behavior, the model provides a unified approach to describe many different mobility models including entity mobility models and group mobility models. Using the model, we can predict the time dependence of link connectivity, and estimate a settling time for which node movements are considered in a transient state. We verify the model with the simulation results of four different mobility models using a global connectivity and a link duration distribution. This research was supported in part by the National Science Foundation under grant CCF-0514975. Seok K. Hwang received the B.S. degree in Control and Instrumentation Engineering from Korea University, Korea in 1998. He received the M.S. degreeand the Ph.D.degree in Electrical Engineering at POSTECH, Korea in 2000 and 2006, respectively.His research interests include intelligence controls and computational intelligence for multi-objective optimization problems. He is working on multimedia communication as a senior researcher at Korea Telecom since 2006. Dongsoo Stephen Kim received the B.S. degree from Korean University in 1987, the M.S. degree in computer science from the University of Texas in 1994, and the Ph.D. degree in computer science and engineering from the University of Minnesota in 1998. During 1986–2002, he was a Research Associate at Electronic and Telecommunication Research Institute, Taejon, Korea. In 1998–2000, he was a project manager at Megaxess Inc., Germantown, Maryland. He joined the Department of Electrical and Computer Engineering at Purdue School of Engineering and Technology, IUPUI in 2000. His current research interests include mobile wireless networks, mobility modeling, traffic modeling, and performance evaluation of communication networks.     

Performance analysis of IEEE 802.11 ad hoc networks in the presence of exposed terminals

The paper evaluates the performance effects of exposed terminals in IEEE 802.11 ad hoc networks in finite load conditions. It derives analytical models for the estimation of channel utilization and media access delay for IEEE 802.11 ad hoc networks in finite load conditions with and without exposed terminals. The simulation results show that the analytical estimated channel utilization and media access delay metrics are fairly accurate.     

Analysis of broadcasting delays in vehicular ad hoc networks

High mobility of nodes in vehicular ad hoc networks (VANETs) may lead to frequent breakdowns of established routes in conventional routing algorithms commonly used in mobile ad hoc networks. To satisfy the high reliability and low delivery‐latency requirements for safety applications in VANETs, broadcasting becomes an essential operation for route establishment and repair. However, high node mobility causes constantly changing traffic and topology, which creates great challenges for broadcasting. Therefore, there is much interest in better understanding the properties of broadcasting in VANETs. In this paper we perform stochastic analysis of broadcasting delays in VANETs under three typical scenarios: freeway, sparse traffic and dense traffic, and utilize them to analyze the broadcasting delays in these scenarios. In the freeway scenario, the analytical equation of the expected delay in one connected group is given based on statistical analysis of real traffic data collected on freeways. In the sparse traffic scenario, the broadcasting delay in an n‐vehicle network is calculated by a finite Markov chain. In the dense traffic scenario, the collision problem is analyzed by different radio propagation models. The correctness of these theoretical analyses is confirmed by simulations. These results are useful to provide theoretical insights into the broadcasting delays in VANETs. Copyright © 2010 John Wiley & Sons, Ltd.     

Zigbee路由协议在VANET监控系统中的应用分析

本文以VANET的应用需求为出发点,提出一种基于双层拓扑结构的网络模型,并使用Network Simulator 2．0版软件完成了模型仿真,分析了簇树、AODVjr以及ZBR三种路由协议在相同车联网环境下的性能表现。最终表明,ZBR路由协议能够在确保较短时延以及较高分组递交率的条件下,很好地实现网络开销的降低。     

无线自组网络在应急通信中的研究与应用

本文提出一种无线自组网络的应用和设计方法,目的是解决应急通信中存在的自动组网、自动修复、快速部署等困难,实现传送现场实时高清视频和语音通话。本文通过对无线自组网络的创新设计,在不依赖任何通信网络基础设施的情况下提供了一种通信支撑环境,在公安执法、森林防火、抢险救灾、军队演练、反恐特勤、野外考察、地下作业等领域有广泛的应用。     

Throughput guarantees for multi-priority traffic in ad hoc networks

In this paper, we present MPARC (Multi-Priority Admission and Rate Control), a novel joint admission control and rate policing protocol for multi-priority ad hoc networks. MPARC is based on our novel bandwidth allocation model, which captures the bandwidth allocation for saturated, unsaturated and semi-saturated networks. MPARC guarantees that the throughput of admitted realtime flows will not decrease due to later arriving realtime flows with equal or lower priorities or due to best effort flows. MPARC achieves this goal by performing accurate admission control on every newly arriving realtime flow and appropriate rate policing on all best effort traffic. Through simulation, we demonstrate that MPARC has better performance than existing approaches.     

Towards efficient data collection mechanisms in the vehicular ad hoc networks

Recently, the fast growth of communication technology has led to the design and implementation of different types of networks in different environments. One of these remarkable networks is vehicular ad hoc network (VANET). The ubiquitous connectivity among vehicles is possible through VANET in the absence of fixed infrastructure. Moreover, it provides safety and comfort to people sitting in the vehicles. In this regard, collecting information from vehicles that are moved constantly is an essential challenge. To develop an efficient method for data collection in the VANET, some parameters must be considered such as data aggregation, latency, packet delivery ratio, packet loss, scalability, security, transmission overhead, and vehicle density. Since data collection has a significant importance in the VANET, the aim of this study is to investigate the existing methods and describe the types of important issues and challenging problems that can be addressed in data collection in the VANET. The data collection techniques are investigated in four primary groups, namely, topology‐based, cluster‐based, geocast‐based, and fog‐based. Also, the mentioned parameters are important to compare all of the presented techniques.     

An evolutionary game theory–based security model in vehicular ad hoc networks

The word population is growing on a daily basis; consequently, the growth of commute and transport, developing efficient and intelligent transportation systems (ITS), has become one of the most popular requirements and the most significant attempts in modern urban areas containing large population. A key component of intelligent transportation systems is a vehicular ad hoc network. Devising internet‐based practical programs such as awareness of climatic conditions, geographical location, practical programs like on‐line payment services in the vehicular ad hoc network has led to safer driving, prevention of deadly accidents, transportation improvement, more welfare and convenience for passengers, and even offering more commercial opportunities. The special features of vehicular ad hoc network, such as intense activity, constantly‐changing topology, the vehicles' high speed, etc, will lead to challenges in gaining security. Therefore, providing vehicular ad hoc networks with security is of extreme importance in terms of users' anonymity, identification, and data privacy. In this paper, a security model is presented using a method based on evolutionary games. This method, in every vehicle, is applied as a node in the network while interacting with other vehicles; it aims at distinguishing some common attacks and defending against attackers. In this method, defending (honest) vehicles and attacking vehicles take part in an asymmetrical game; each vehicle aims at gaining the most utility and achieving its goals. The proposed method is simulated using various scenarios. The simulation results reveal that the proposed method is efficient and it reaches equilibrium and convergence at the end of the game in each scenario.     

A group-based channel assignment protocol for rate separation in IEEE 802.11-based multi-radio multi-rate ad hoc networks

Today’s IEEE 802.11 devices support multiple channels and data rates. Utilizing multiple channels and data rates can increase the performance of IEEE 802.11 networks. However, the multi-channel design to exploit available channels is one of the challenging issues. Moreover, performance anomaly occurs in IEEE 802.11 multi-rate networks when high-rate and low-rate links share a common channel, which degrades the overall network capacity significantly. In this paper, we introduce an extension of conflict graph, called rate conflict graph (RCG), to understand the performance anomaly problem in IEEE 802.11 multi-rate networks. Then, we propose a group-based channel assignment (GCA) protocol for IEEE 802.11-based multi-radio multi-rate single-hop ad hoc networks. In GCA, each node is equipped with multiple IEEE 802.11 interfaces, and links are subdivided into multiple groups, called component groups, by obeying the interface constraints. Then, GCA utilizes RCG and a heuristic algorithm to separate different data rate links via multiple channels so that the performance anomaly problem is addressed. Our extensive simulation results reveal that GCA achieves improved performance over existing channel assignment protocols designed to consider performance anomaly.     

Relaying in mobile ad hoc networks: The Brownian motion mobility model

Mobile ad hoc networks are characterized by a lack of a fixed infrastructure and by node mobility. In these networks data transfer can be improved by using mobile nodes as relay nodes. As a result, transmission power and the movement pattern of the nodes have a key impact on the performance. In this work we focus on the impact of node mobility through the analysis of a simple one-dimensional ad hoc network topology. Nodes move in adjacent segments with reflecting boundaries according to Brownian motions. Communications (or relays) between nodes can occur only when they are within transmission range of each other. We determine the expected time to relay a message and compute the probability density function of relaying locations. We also provide an approximation formula for the expected relay time between any pair of mobiles.     

Connectivity in one-dimensional ad hoc networks: A queueing theoretical approach

In this paper we analyze connectivity issues in one-dimensional ad hoc networks. Starting with a deterministic channel model, we show how an equivalent GI|D|∞ queueing model may be used to address network connectivity. In this way, we obtain exact results for the coverage probability, the node isolation probability and the connectivity distance for various node placement statistics. We then show how a GI|G|∞ model may be used to study broadcast percolation problems in ad hoc networks with general node placement in the presence of fading channels. In particular, we obtain explicit results for the case of nodes distributed according to a Poisson distribution operating in a fading/shadowing environment. In the latter case, heavy traffic theorems are applied to derive the critical transmission power for connectivity and broadcast percolation distance in highly dense networks. The impact of signal processing schemes able to exploit the diversity provided by small-scale fading by means of multiple antennas is considered. The analysis is then extended to the case of unreliable ad hoc networks, with an in-depth discussion of asymptotic results. This work was partially supported by the EURO NGI Network of Excellence. The work of D. Miorandi was partially supported by Fond. A. Gini. This work has been done while D. Miorandi, at that time with University of Padova (Italy), was visiting the MAESTRO project at INRIA Sophia Antipolis. Daniele Miorandi received his “Laurea” (summa cum laude) and Ph.D. degrees from Univ. of Padova (Italy) in 2001 and 2005, respectively. He currently holds a post-doc position at CREATE-NET, Trento (Italy). In 2003/04 he spent 12 months of his doctoral thesis visiting the MAESTRO team at INRIA Sophia Antipolis (France). His research interests include stochastic modelling, performance evaluation and protocols design for wireless networks. Eitan Altman received the B.Sc. degree in electrical engineering (1984), the B.A. degree in physics (1984) and the Ph.D. degree in electrical engineering (1990), all from the Technion-Israel Institute, Haifa. In (1990) he further received his B.Mus. degree in music composition in Tel-Aviv university. Since 1990, he has been with INRIA (National research institute in informatics and control) in Sophia-Antipolis, France. His current research interests include performance evaluation and control of telecommunication networks and in particular congestion control, wireless communications and networking games. He is in the editorial board of several scientific journals: Stochastic Models, JEDC, COMNET, SIAM SICON and WINET. He has been the (co)chairman of the program committee of several international conferences and workshops (on game theory, networking games and mobile networks). More informaion can be found at http://www.inria.fr/mistral/personnel/Eitan.Altman/me.html     

Analytical modeling of MAC protocol in ad hoc networks

In ad hoc networks, CSMA/CA is a widely used MAC layer protocol. There has been considerable work on the performance evaluation of this protocol. But most work is confined to saturation performance of single‐hop ad hoc networks. In this paper, we employ a linear feedback model to evaluate the performance for CSMA/CA according to the Poisson distributed traffic in both single‐hop and multi‐hop ad hoc networks. To the best of our knowledge, this is the first attempt to analytically evaluate the performance for CSMA/CA protocol under a general assumption about the traffic. This paper also gives analytical results, showing the impact of RTS/CTS. Although RTS/CTS do add the overhead to the system, they become essential when either the hidden terminal problem is dominant, or the traffic is heavy, or the packet length is very large. This paper also shows that the performance degrades dramatically in multi‐hop ad hoc networks when the number of competing nodes increases, which implies that the scalability is still a major problem in ad hoc networks. To validate our analytical results, we have done extensive simulations, and it is observed that the simulation results match the analytical results very well. Copyright © 2006 John Wiley & Sons, Ltd.     

A column generation method for spatial TDMA scheduling in ad hoc networks

An ad hoc network can be set up by a number of units without the need of any permanent infrastructure. Two units establish a communication link if the channel quality is sufficiently high. As not all pairs of units can establish direct links, traffic between two units may have to be relayed through other units. This is known as the multi-hop functionality. In military command and control systems, ad hoc networks are also referred to as multi-hop radio networks.

Spatial TDMA (STDMA) is a scheme for access control in ad hoc networks. STDMA improves TDMA by allowing simultaneous transmission of multiple units. In this paper, we study the optimization problem of STDMA scheduling, where the objective is to find minimum-length schedules. Previous work for this problem has focused on heuristics, whose performance is difficult to analyze when optimal solutions are not known. We develop novel mathematical programming formulations for this problem, and present a column generation solution method. Our numerical experiments show that the method generates a very tight bound to the optimal schedule length, and thereby enables optimal or near-optimal solutions. The column generation method can be used to provide benchmarks when evaluating STDMA scheduling algorithms. In particular, we use the bound obtained in the column generation method to evaluate a simple greedy algorithm that is suitable for distributed implementations.     

Analysis of area-congestion-based DDoS attacks in ad hoc networks

Increased instances of distributed denial of service (DDoS) attacks on the Internet have raised questions on whether and how ad hoc networks are vulnerable to such attacks. This paper studies the special properties of such attacks in ad hoc networks. We examine two types of area-congestion-based DDoS attacks – remote and local attacks – and present in-depth analysis on various factors and attack constraints that an attacker may use and face. We find that (1) there are two types of congestion – self congestion and cross congestion – that need to be carefully monitored; (2) the normal traffic itself causes significant packet loss in addition to the attack impacts in both remote and local attacks; (3) the number of flooding nodes has major impacts on remote attacks while, the load of normal traffic and the position of flooding nodes are critical to local attacks; and (4) given the same number of flooding nodes and attack loads, a remote DDoS attack can cause more damage to the network than a local DDoS attack.