Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks

Development of many futuristic technologies, such as MANET, VANET, iThings, nano-devices, depend on efficient distributed communication protocols in multi-hop ad hoc networks. A vast majority of research in this area focus on design heuristic protocols, and analyze their performance by simulations on networks generated randomly or obtained in practical measurements of some (usually small-size) wireless networks. %some library. Moreover, they often assume access to truly random sources, which is often not reasonable in case of wireless devices. In this work we use a formal framework to study the problem of broadcasting and its time complexity in any two dimensional Euclidean wireless network with uniform transmission powers. For the analysis, we consider two popular models of ad hoc networks based on the Signal-to-Interference-and-Noise Ratio (SINR): one with opportunistic links, and the other with randomly disturbed SINR. In the former model, we show that one of our algorithms accomplishes broadcasting in $O(D\log^2 n)$ rounds, where $n$ is the number of nodes and $D$ is the diameter of the network. If nodes know a priori the granularity $g$ of the network, i.e., the inverse of the maximum transmission range over the minimum distance between any two stations, a modification of this algorithm accomplishes broadcasting in $O(D\log g)$ rounds. Finally, we modify both algorithms to make them efficient in the latter model with randomly disturbed SINR, with only logarithmic growth of performance. Ours are the first provably efficient and well-scalable, under the two models, distributed deterministic solutions for the broadcast task.Comment: arXiv admin note: substantial text overlap with arXiv:1207.673

Determining the representative factors affecting warning message dissemination in VANETs

In this paper, we present a statistical analysis based on the 2k factorial methodology to determine the representative factors affecting traffic safety applications in Vehicular ad hoc networks (VANETs). Our purpose is to determine what are the key factors affecting Warning Message Dissemination (WMD) in order to concentrate on such parameters, thus reducing the amount of required simulation time when evaluating VANETs. Simulation results show that the key factors affecting warning messages delivery are: (i) the transmission range, (ii) the radio propagation model used, and (iii) the density of vehicles. Based on this statistical analysis, we evaluate a compound key factor: neighbor density. This factor combines the above-mentioned factors into a single entity, reducing the number of factors that must be taken into account for VANET researchers to evaluate the benefits of their proposals.This work was partially supported by the Ministerio de Educacion y Ciencia, Spain, under Grant TIN2008-06441-C02-01, and by the Fundacion Antonio Gargallo, under Grant 2009/B001.Martínez Domínguez, FJ.; Toh, CK.; Cano Escribá, JC.; Tavares De Araujo Cesariny Calafate, CM.; Manzoni, P. (2012). Determining the representative factors affecting warning message dissemination in VANETs. Wireless Personal Communications. 67(2):295-314. https://doi.org/10.1007/s11277-010-9989-4S295314672Eichler, S. (2007). Performance evaluation of the IEEE 802.11p WAVE communication standard. In Proceedings of the vehicular technology conference (VTC-2007 Fall), USA.Fall, K., & Varadhan, K. (2000). ns notes and documents. The VINT Project. UC Berkeley, LBL, USC/ISI, and Xerox PARC. Available at http://www.isi.edu/nsnam/ns/ns-documentation.html .Fasolo, E., Zanella, A., & Zorzi, M. (2006). An effective broadcast scheme for alert message propagation in vehicular ad hoc networks. In Proceedings of the IEEE International Conference on Communications, Istambul, Turkey.Korkmaz, G., Ekici, E., Ozguner, F., & Ozguner, U. (2004). Urban multi-hop broadcast protocols for inter-vehicle communication systems. In Proceedings of First ACM Workshop on Vehicular Ad Hoc Networks (VANET 2004).Martinez, F. J., Toh, C.-K., Cano, J.-C., Calafate, C. T., & Manzoni, P. (2009). Realistic radio propagation models (RPMs) for VANET simulations. In IEEE wireless communications and networking conference (WCNC), Budapest, Hungary.Martinez, F. J., Cano, J.-C., Calafate, C. T., & Manzoni, P. (2008). CityMob: A mobility model pattern generator for VANETs. In IEEE vehicular networks and applications workshop (Vehi-Mobi, held with ICC), Beijing, China.Martinez, F. J., Cano, J.-C., Calafate, C. T., & Manzoni, P. (2009). A performance evaluation of warning message dissemination in 802.11p based VANETs. In IEEE local computer networks conference (LCN 2009), Zürich, Switzerland.Torrent-Moreno, M., Santi, P., & Hartenstein, H. (2005). Fair sharing of bandwidth in VANETs. In Proceedings of the 2nd ACM international workshop on vehicular ad hoc networks, Germany.Tseng Y.-C., Ni S.-Y., Chen Y.-S., Sheu J.-P. (2002) The broadcast storm problem in a mobile ad hoc network. Wireless Networks 8: 153–167Wisitpongphan N., Tonguz O., Parikh J., Mudalige P., Bai F., Sadekar V. (2007) Broadcast storm mitigation techniques in vehicular ad hoc networks. Wireless Communications IEEE 14(6): 84–94. doi: 10.1109/MWC.2007.4407231Yang, X., Liu, J., Zhao, F., & Vaidya, N. H. (2004). A vehicle-to-vehicle communication protocol for cooperative collision warning. In Proceedings of the first annual international conference on mobile and ubiquitous systems: Networking and services (MobiQuitous’04).Yoon, J., Liu, M., & Noble, B. (2003). Random waypoint considered harmful. Proceedings of IEEE INFOCOMM 2003, San Francisco, California, USA.Zang, Y., Stibor, L., Cheng, X., Reumerman, H.-J., Paruzel, A., & Barroso, A. (2007). Congestion control in wireless networks for vehicular safety applications. In Proceedings of the 8th European Wireless Conference, Paris, France

Neighbour coverage: a dynamic probabilistic route discovery for mobile ad hoc networks

Blind flooding is extensively use in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. Such a phenomenon induces what is known as broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput

A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

An efficient counter-based broadcast scheme for mobile ad hoc networks

In mobile ad hoc networks (MANETs), broadcasting plays a fundamental role, diffusing a message from a given source node to all the other nodes in the network. Flooding is the simplest and commonly used mechanism for broadcasting in MANETs, where each node retransmits every uniquely received message exactly once. Despite its simplicity, it however generates redundant rebroadcast messages which results in high contention and collision in the network, a phenomenon referred to as broadcast storm problem. Pure probabilistic approaches have been proposed to mitigate this problem inherent with flooding, where mobile nodes rebroadcast a message with a probability p which can be fixed or computed based on the local density. However, these approaches reduce the number of rebroadcasts at the expense of reachability. On the other hand, counter-based approaches inhibit a node from broadcasting a packet based on the number of copies of the broadcast packet received by the node within a random access delay time. These schemes achieve better throughput and reachability, but suffer from relatively longer delay. In this paper, we propose an efficient broadcasting scheme that combines the advantages of pure probabilistic and counter-based schemes to yield a significant performance improvement. Simulation results reveal that the new scheme achieves superior performance in terms of saved-rebroadcast, reachability and latency

Neighbourhood-aware counter-based broadcast scheme for wireless ad hoc networks

Broadcasting is a vital operation in mobile ad hoc networks (MANETs) and it is crucial to enhance its efficiency to ensure successful deployment. Although flooding is ideal for broadcast operations due to its simplicity and high reachability it suffers from high packet collision which can degrade network performance severely. Counter-based broadcast schemes have been introduced to alleviate the limitations of flooding. This study introduces an enhancement to counter-based broadcast by adjusting the threshold value and the Random Assessment Delay (RAD) using minimal neighbourhood information

Making On-Demand Routing Efficient with Route-Request Aggregation

In theory, on-demand routing is very attractive for mobile ad hoc networks (MANET), because it induces signaling only for those destinations for which there is data traffic. However, in practice, the signaling overhead of existing on-demand routing protocols becomes excessive as the rate of topology changes increases due to mobility or other causes. We introduce the first on-demand routing approach that eliminates the main limitation of on-demand routing by aggregating route requests (RREQ) for the same destinations. The approach can be applied to any existing on-demand routing protocol, and we introduce the Ad-hoc Demand-Aggregated Routing with Adaptation (ADARA) as an example of how RREQ aggregation can be used. ADARA is compared to AODV and OLSR using discrete-event simulations, and the results show that aggregating RREQs can make on-demand routing more efficient than existing proactive or on-demand routing protocols