Epidemic algorithms for reliable and efficient information dissemination in vehicular

Vehicular ad hoc networks (VANET), which are created by vehicles equipped with short- and mediumrange wireless communication, have an array of important applications in intelligent transport systems. Many of these applications require reliable, bandwidth-efficient dissemination of traffic and road information via ad hoc network technology. This is a difficult task since inter-vehicular networks often lack continuous end-to-end connectivity and are characterised by large variations in node density. A new epidemic algorithm for information dissemination in highly dynamic and intermittently connected VANET is introduced. It is shown through realistic simulations in highway traffic that the proposed algorithm is capable of reliable and efficient information dissemination in VANET in the face of frequent network fragmentation and large density variations.     

Jamming-based medium access control with dynamic priority adjustment in wireless ad-hoc networks

The paper presents a jamming-based MAC with dynamic priority adjustment (JMDPA) for multimedia services in wireless ad hoc networks. The proposed scheme differentiates multimedia traffic into classes with different priority levels. A mobile node is prioritised in frame transmissions by issuing a precalculated length of jamming noise: the one with the longest jamming length can win the frame transmission. The winner immediately broadcasts its current priority level (local priority) to update the global priorities of all the neighbouring nodes. The global priority is used as a contention baseline, which prevents any node with a local priority lower than the baseline from participating in the next contention. One of the innovative designs in the proposed scheme is right, in that the priority of a mobile node can be dynamically adjusted according to network conditions so that any possible starvation of low-priority traffic or any ineffective contention of high-priority traffic can be avoided. A multidimensional Markov model, together with the scalability analysis, is introduced to evaluate the performance of the proposed JMDPA. The analytical results provide very useful guidelines to tune the QoS parameters for supporting prioritised multimedia traffic in wireless ad hoc networks     

Distributed cooperative diversity methods for wireless ad hoc peer-to-peer file sharing

Peer-to-peer (P2P) networks are very popular for large-scale data sharing in today's internet. It is naturally envisioned that the file sharing would also be an important application for civil mobile ad hoc networks in the future. The authors propose the cooperative diversity download methods utilising the wireless medium and common file sources in wireless P2P networks. The designed protocols including multisource opportunistic direct downloading (MODD) and multi-source opportunistic decode-and-forward downloading (MODFD) can adaptively work in different file distribution scenarios. Both of them rely on the cooperation between the sources or receivers and the proposed distributed source-selection schemes. For the situation with one receiver and multi-source, MODD selects 'best' source with most favourite channel condition from available m sources. In the situation with multiple receivers and sources, the multiple receivers could form the cooperative pairs to receive the data from the selected source based on decode-and-forward transmission strategy. Compared with MODD, MODFD saves the source-selection time and provides incentives for the cooperation between the peers. A distributed collision solving scheme for the selection schemes is also proposed. The information theoretic analysis of outage probability shows that the proposed downloading methods can both obtain m times diversity gain.     

一种新的基于移动预测的MANET路由协议

移动自组网是一种由一系列可以自由移动的节点主机聚集而成的一个临时性动态网络。它没有固定基站，也没有作为控制管理中心的节点主机，由于其拓扑的动态性，其路由协议与其他传统网络有很大的区别。为了能更有效地移动自组网中实现数据的传送，本文提出了一种基于移动预测下的MANET路由协议，该协议综合考虑了传输路径的延时和稳定性，选择在延时限制下平均拥有最稳特性的传输路径，模拟结果表明，这种方法比基于移动预测量稳路径路由协议的传输时延要短，传送成功概率要高，而控制开销却相关不大。     

Reliability Analysis of Mobile Ad Hoc Networks Using Universal Generating Function

The proliferation of the wireless network over the last decade is one of the significant drivers for the increased deployment of mobile ad hoc networks (MANETs) in the battle field. It is not practically possible to build a fixed wired network infrastructure in battle field. But it is possible to create a mobile wireless network infrastructure because of the mobility of the soldiers. MANET is justified by the possibility of building a network where no infrastructure exists. MANET with group communication applications and multicasting can highly benefit from a networking environment such as military and emergency uses. In such applications, the used ad hoc networks need to be reliable and secure. In recent years, a specific technique called the universal generating function technique (UGFT) has been applied to determine the network reliability. The UGFT is based on an approach that is closely connected to generating functions that are widely used in probability theory. This work devotes to assess the MANET reliability using the UGFT. Reliability of the MANET is defined as the probability that the transformed message from the source can be passed successfully through the MANET and reached the target without any delay. Two kinds of UGFs are discussed in this work, and an algorithm has been proposed to execute the system reliability. This UGFT is illustrated with a case study in a battlefield environment. Copyright © 2014 John Wiley & Sons, Ltd.     

Cross-layer distributed approach for optimal rate allocation for homogeneous wireless multicast

Multicast-based data communication is an efficient communication scheme especially in multihop ad hoc networks where the MAC layer is based on one-hop broadcast from one source to multiple receivers. The problem of resource allocation for a set of homogeneous multicast sessions over multihop wireless network is addressed. An iterative algorithm is proposed that achieves the optimal rates for a set of multicast sessions such that the aggregate utility for all sessions is maximised. The authors demonstrate analytically and through simulations that the algorithm achieves optimal resource utilisation while guaranteeing fairness among multicast sessions. The algorithm in network environments with asynchronous distributed computations has been further analysed. Two implementations for the algorithm based on different network settings are presented and show that the algorithm not only converges to the optimal rates in all network settings but it also tracks network changing conditions, including mobility and dynamic channel capacity.     

IEEE 802.11b based ad hoc networking and its performance in mobile channels

It is widely believed that IEEE 802.11 standard is aimed mainly for fixed indoor wireless local area networks and is not suited for mobile applications, even though the IEEE 802.11b systems may work in either infrastructure mode or ad hoc mode. The impact of node mobility on ad hoc network performance has already been studied intensively, but these studies mostly do not consider temporal fluctuations of the mobile wireless channel due to the Doppler shift. An investigation of the mobility impact on the performance of IEEE 802.11b ad hoc systems with Rician/Rayleigh fading under different node velocities is presented. A comprehensive and in-depth analysis of the impacts of a multitude of different signal distortions on an IEEE 802.11b system performance is also presented. Specifically, the authors study the bit-error rate performances with respect to node velocities for different modulation schemes. The simulation results show that, owing to its extremely low implementation and deployment cost, the current IEEE 802.11b standard has its potential to be deployed in a mobile ad hoc environment if the line-of-sight path between transmitter and receiver exists.     

Impacts of impulse-based ultra-wideband data links on cooperative wireless ad hoc networks

The recently permitted unlicenced use of the regulated ultra-wideband (UWB) radio spectrum (regulated first by the US FCC in 2002 and subsequently by the standardisation bodies of EU and other major countries) provides wireless ad hoc networks a cheap and promising air-interface technology for their adopted wireless data links, thus offering the potential to greatly boost their applications. The impacts of such UWB data links, mainly the more likely adopted impulse-based UWB data links for low data rate applications, on the extensively developed cooperative wireless ad hoc networks are investigated. First, the authors investigate the diversity order of data transfer of each impulse-based UWB data link working in a corresponding fading channel, and give an approximate relationship between the diversity order and the channel model parameters (here the Saleh?Valenzuela model parameters); Secondly, the authors develop efficient cooperative and decentralised diversity schemes that can utilise the widely spread and independently distributed multiple paths of the fading UWB channels. Performance analysis and simulation studies show that proposed decentralised cooperative beamforming schemes can achieve full diversity and are more efficient than their decentralised cooperative routing counterparts.     

Compatibility of TCP Reno and TCP Vegas in wireless ad hoc networks

Previous work has shown that TCP (transmission control protocol) Vegas outperforms the more widely deployed TCP Reno in both wired and wireless networks. It was also shown that when both TCP variants coexist on the same wired links, Reno dominates because of its more aggressive behaviour. This paper examines for the first time the compatibility between Reno and Vegas in wireless IEEE 802.11 ad hoc networks. It is shown that Vegas generally dominates in the heterogeneous Reno/Vegas network scenario; a startling result that is inconsistent with what is seen in wired networks. It is shown that the wireless ad hoc network environment does not reward the aggressive behaviour of Reno. On the other hand, Vegas, with its more accurate yet more conservative mechanisms, is able to capture most of the bandwidth. This is found to be true when using the on-demand routing protocols of dynamic source routing (DSR) or ad hoc on-demand distance vector (AODV): the failure of a node to reach a next-hop node because of media access control (MAC)-sublayer repeated collisions is reported to the routing protocol, which then declares a route error that impacts Reno in a more serious way than Vegas. When the table-driven routing protocol destination-sequenced distance vector (DSDV) is used, Reno and Vegas share the network bandwidth in a fairer manner. Generally, fairness in this environment can be improved by reducing the TCP maximum window size.     

Assigning channels by link directionality in a medium access control protocol for IEEE 802.11 ad hoc networks

This study attempts to exploit the potential of link directionality to increase the achievable capacities of ad hoc networks. When an IEEE 802.11 ad hoc network achieves capacity C by using a single channel, the targeted capacity by using two channels should be 2C. However, most of the dual-channel 802.11 protocols proposed in the literature appear only to be able to achieve less than 60% of the 2C targeted capacity. The authors thus propose a link-directionality-based dual-channel medium access control protocol in an attempt to double the capacities of networks using the single-channel IEEE 802.11 protocol. The main idea is to assign channels according to link directionality to allow a link to transmit simultaneously within the carrier-sensing region of another link provided that these transmissions do not interfere with each other. Simulations show that our proposed scheme can achieve more than 85% of our targeted capacities, 0.85 X 2C = 1.7C, in large-scale random topologies. In lattice and irregular topologies, the throughput is boosted up to 2.83C and 2.13C, respectively. An approach for capacity analysis is also introduced to determine the throughput improvements that can be achieved by our proposed protocol. We believe using link directionality for channel allocations is a key step that yields significant potential for multiplying the capacity of ad hoc networks.     

MAC-layer channel utilisation enhancements for wireless mesh networks

The authors focus on a wireless mesh network, that is, an ad hoc IEEE 802.11-based network whose nodes are either user devices or Access Points providing access to the mesh network or to the Internet. By relying on some work done within the IEEE 802.11s TG, the network nodes can use one control channel and one or more data channels, each on separate frequencies. Then, some problems related to channel access are identified and a MAC scheme is proposed that specifically addresses the problem of hidden terminals and the problem of coexisting control and data traffic on different frequency channels. An analytical model of the MAC scheme is presented and validated by using the Omnet++ simulator. Through the developed model, we show that our solution achieves very good performance both in regular and in very fragmented mesh topologies, and it significantly outperforms the standard 802.11 solution.     

Two-terminal reliability analyses for a mobile ad hoc wireless network

Reliability is one of the most important performance measures for emerging technologies. For these systems, shortcomings are often overlooked in early releases as the cutting edge technology overshadows a fragile design. Currently, the proliferation of the mobile ad hoc wireless networks (MAWN) is moving from cutting edge to commodity and thus, reliable performance will be expected. Generally, ad hoc networking is applied for the flexibility and mobility it provides. As a result, military and first responders employ this network scheme and the reliability of the network becomes paramount. To ensure reliability is achieved, one must first be able to analyze and calculate the reliability of the MAWN. This work describes the unique attributes of the MAWN and how the classical analysis of network reliability, where the network configuration is known a priori, can be adjusted to model and analyze this type of network. The methods developed acknowledge the dynamic and scalable nature of the MAWN along with its absence of infrastructure. Thus, the methods rely on a modeling approach that considers the probabilistic formation of different network configurations in a MAWN. Hence, this paper proposes reliability analysis methods that consider the effect of node mobility and the continuous changes in the network's connectivity.     

Inter-vehicle mobile ad hoc network for road transport systems

Access to information services while on the move is becoming increasingly prevalent within transport systems. Whereas Internet access is now common place in trains, it still remains a challenge for vehicles, particularly when travelling through high speed motorways. Motorway vehicles equipped with wireless communication nodes form an ad hoc network have been examined by which data can be exchanged among them without the need for a pre-installed infrastructure. The main challenge with such an infrastructure-less network is developing communications and protocols that can deliver robust and reliable ad hoc communications between vehicles, when the relative speed between vehicles that can be extremely high under opposite traffic conditions. To address this opposite direction effect, a solution has been presented by minimising the effect of opposite traffic on routing packets. Firstly, a router direction index is introduced to enhance the performance of ad hoc on demand distance vector protocol in updating its routing table and secondly, a new queue priority mechanism is proposed which is based on cross-layer collaboration. Simulations were performed for an ad hoc network consisting of 200 vehicles driving with speeds between 90 and 120 km/h on a two-way motorway for different traffic loads sent through a Gateway adjacent to the motorway. The results obtained demonstrate a performance increase in the average data goodput and less routing overhead for the proposed solution     

Performance analysis of multipath transmission over 802.11-based multihop ad hoc networks: a cross-layer perspective

Data transmission in ad hoc networks involves interactions between medium access control (MAC)-layer protocols and data forwarding along network-layer paths. These interactions have been shown to have a significant impact on the performance of a system. This impact on multipath data transmission over multihop IEEE 802.11 MAC-based ad hoc networks is assessed; analysis is from a cross-layer perspective. Both MAC layer protocols and network-layer data forwarding are taken into account in the system models. The frame service time at source in a 802.11 MAC-based multipath data transmission system under unsaturated conditions is studied. Analytical models are developed for two packet generation schemes (round robin and batch) with a Poisson frame arrival process. Moreover, an analytical model is developed to investigate the throughput of a multipath transmission system in 802.11-based multihop wireless networks. Two methods are proposed to estimate the impact of cross-layer interactions on the frame service time in such a system. Two bounds of the system throughput are obtained based on these estimation methods. These models are validated by means of simulation under various scenarios.     

On physical layer-oriented routing with power control in ad hoc wireless networks

Routing in ad hoc wireless networks does not simply consist in finding a route with shortest length (as in wired networks with virtually error-free communication links), but it requires the creation of a stable and good quality communication route to avoid any unnecessary packet loss. In this paper,we discuss physical layer-oriented routing in ad hoc wireless networks, and we analyse the potential advantages of combining the use of power control (PC) with the chosen routing strategy. More precisely, we propose a modified ad hoc on-demand distance vector (MAODV) routing protocol, with and without PC, derived from the AODV-routing protocol by considering the bit error rate at the end of a multi-hop path as the metric to be minimised for route selection. In other words, we consider routing with a physical layer-oriented quality of service criterion, and we analyse the system performance in scenarios with either strong line-of-sight (LOS) or shadowed communications. Although in a scenario with strong LOS communications there are a few cases where the MAODV-PC protocol offers the best performance, in the presence of shadowed communications the proposed physical layer-oriented strategy is not attractive.     

An Energy Based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks

In recent years, with the rapid development of the Internet and wireless communication technology, wireless Ad hoc networks have received more attention. Due to the limited transmission range and energy of nodes in Ad hoc networks, it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks. This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol, which has the following two aspects of improvement: (1) In the route discovery process, a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a “Mark” bit that representing remaining energy of a node. (2) Based on (1), a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively. Simulation results demonstrate that compared with AODV and other existing routing protocols, proposed algorithm can reduce network energy consumption and balance node energy, thus extending the network lifetime.     

acSB: Anti-Collision Selective-Based Broadcast Protocol in CR-AdHocs

As a fundamental operation in ad hoc networks, broadcast could achieve efficient message propagations. Particularl y in the cognitive radio ad hoc network where unlicensed users have different sets of available channels, broadcasts are carried out on multiple channels. Accordingly, channel selection and collision avoidance are challenging issues to balance the efficiency against the reliability of broadcasting. In this paper, an anti-collision selective broadcast protocol, called acSB, is proposed. A channel selection algorithm based on limited neighbor information is considered to maximize success rates of transmissions once the sender and receiver have the same channel. Moreover, an anti-collision scheme is adopted to avoid simultaneous rebroadcasts. Consequently, the proposed broadcast acSB outperforms other approaches in terms of smaller transmission delay, higher message reach rate and fewer broadcast collisions evaluated by simulations under different scenarios.     

Trust-based hexagonal clustering for efficient certificate management scheme in mobile ad hoc networks

The wireless and dynamic nature of mobile ad hoc networks (MANET) render them more vulnerable to security attacks. However, providing a security mechanism implicitly has been a major challenge in such an ad-hoc environment. Certificate management plays an important role in securing an ad-hoc network. Certificate assignment, verification, and revocation complexity associated with the Public Key Infrastructure (PKI) framework is significantly large. Smaller the size of the network lesser will be the certificate management complexity. However, smaller the size, large will be the overall infrastructural cost, and also larger will be the overall redundant certificates due to multiple certificate assignment at the boundary regions, that in turn affects the prompt and accurate certificate revocation. By taking these conflicting requirements into consideration, we propose the trust-based hexagonal clustering for an efficient certificate management (THCM) scheme, to bear an absolutely protected MANET Disparate to the existing clustering techniques, we present a hexagonal geographic clustering model with Voronoi technique where trust is accomplished. In particular, to compete against attackers, we initiate a certificate management strategy in which certificate assignment, verification, and revocation are carried out efficiently. The performance of THCM is evaluated by both simulation and empirical analysis in terms of effectiveness of revocation scheme (with respect to revocation rate and time), security, and communication cost. Besides, we conduct a mathematical analysis of measuring the parameters obtained from the two platforms in multiple times. Relevant results demonstrate that our design is efficient to guarantee a secured mobile ad hoc network.     

A tutorial survey of topics in wireless networking: Part I

In this two part paper, we provide a survey of recent and emerging topics in wireless networking. We view the area of wireless networking as dealing with problems of resource allocation so that the various connections that utilise the network achieve their desired performance objectives. In the first part of the paper, we first survey the area by providing a taxonomy of wireless networks as they have been deployed. Then, we provide a quick tutorial on the main issues in the wireless ‘physical’ layer, which is concerned with transporting bits over the radio frequency spectrum. Then, we proceed to discuss some resource allocation formulations in CDMA(code division multiple access) cellular networks and OFDMA(orthogonal frequency division multiple access) networks. In the second part of the paper, we first analyse random access wireless networks and pay special attention to 802·11 (Wi-Fi) networks.We then survey some topics in ad hoc multihop wireless networks, where we discuss arbitrary networks, as well as some theory of dense random networks. Finally, we provide an overview of the technical issues in the emerging area of wireless sensor networks.     

A tutorial survey of topics in wireless networking: Part II

This is the second part of the survey of recent and emerging topics in wireless networking. We provide an overview of the area of wireless networking as that of dealing with problems of resource allocation so that the various connections that utilise the network achieve their desired performance objectives. In Part I we provided a taxonomy of wireless networks as they have been deployed. We then provided a quick survey of the main issues in the wireless ‘physical’ layer. We then discussed some resource allocation formulations in CDMA (code division multiple access) cellular networks and OFDMA (orthogonal frequency division multiple access) networks. In this part we begin with a discussion of random access wireless networks. We first provide an overview of the evolution of random access networks from Aloha to the currently popular 802·11 (Wi-Fi) networks. We then analyse the performance of the 802· 11 random access protocol. We briefly discuss the problem of optimal association of nodes to Wi-Fi access points. Next, we consider topics in ad hoc multihop wireless networks. We first discuss topology and cross layer control. For the latter, we describe the important maximum weight link scheduling algorithm. The connectivity and capacity of randomly deployed networks are then analysed. Finally, we provide an overview of the technical issues in the emerging area of wireless sensor networks.