17,322 research outputs found
Advances on Network Protocols and Algorithms for Vehicular Ad Hoc Networks
Vehicular Ad Hoc Network (VANET) is an emerging area of
wireless ad hoc networks that facilitates ubiquitous connectivity
between smart vehicles through Vehicle-to-Vehicle
(V2V) or Vehicle-to-Roadside (V2R) and Roadside-to-
Vehicle (R2V) communications. This emerging field of technology
aims to improve safety of passengers and traffic flow,
reduces pollution to the environment and enables in-vehicle
entertainment applications. The safety-related applications
could reduce accidents by providing drivers with traffic information
such as collision avoidances, traffic flow alarms and
road surface conditions. Moreover, the passengers could exploit
an available infrastructure in order to connect to the
internet for infomobility and entertainment applications.Lloret, J.; Ghafoor, KZ.; Rawat, DB.; Xia, F. (2013). Advances on Network Protocols and Algorithms for Vehicular Ad Hoc Networks. Mobile Networks and Applications. 18(6):749-754. doi:10.1007/s11036-013-0490-7S749754186Lloret J, Canovas A, CatalĂĄ A, Garcia M (2013) Group-based protocol and mobility model for VANETs to offer internet access. J Netw Comput Appl 36(3):1027â1038. doi: 10.1016/j.jnca.2012.02.009Khokhar RH, Zia T, Ghafoor KZ, Lloret J, Shiraz M (2013) Realistic and efficient radio propagation model for V2X communications. KSII Trans Internet Inform Syst 7(8):1933â1953. doi: 10.3837/tiis.2013.08.011Ghafoor KZ (2013) Routing protocols in vehicular ad hoc networks: survey and research challenges, Netw Protocol Algorithm 5(4). doi: 10.5296/npa.v5i4.4134Ghafoor KZ, Bakar KA, Lloret J, Ke C-H, Lee KC (2013) Intelligent beaconless geographical routing for urban vehicular environments. Wirel Netw 19(3):345â362. doi: 10.1007/s11276-012-0470-zGhafoor KZ, Bakar KA, Lee K, AL-Hashimi H (2010) A novel delay- and reliability- aware inter-vehicle routing protocol. Netw Protocol Algorithms 2(2):66â88. doi: 10.5296/npa.v2i2.427Dias JAFF, Rodrigues JJPC, Isento JN, Pereira PRBA, Lloret J (2011) Performance assessment of fragmentation mechanisms for vehicular delay-tolerant networks. EURASIP J Wirel Commun Netw 2011(195):1â14. doi: 10.1186/1687-1499-2011-195Zhang D, Yang Z, Raychoudhury V, Chen Z, Lloret J (2013) An energy-efficient routing protocol using movement trend in vehicular Ad-hoc networks. Comput J 58(8):938â946. doi: 10.1093/comjnl/bxt028Ghafoor KZ, Lloret J, Bakar KA, Sadiq AS, Mussa SAB (2013) Beaconing approaches in vehicular Ad Hoc networks: a survey. Wirel Pers Commun. doi: 10.1007/s11277-013-1222-9Sadiq AS, Bakar KA, Ghafoor KZ, Lloret J (2013) An intelligent vertical handover scheme for audio and video streaming in heterogeneous vehicular networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0465-8Khamayseh YM (2013) Network size estimation in VANETs. Netw Protocol Algorithm 5(3):136â152. doi: 10.5296/npa.v5i6.3838Rawat DB, Popescu DC, Yan G, Olariu S (2011) Enhancing VANET performance by joint adaptation of transmission power and contention window size. IEEE Trans Parallel Distrib Syst 22(9):1528â1535Yan G, Rawat DB, Bista BB. Provisioning vehicular ad hoc networks with quality of services. Int J Space-Based Situated Comput 2(2):104â111Rawat DB, Bista BB, Yan G, Weigle MC (2011) Securing vehicular ad-hoc networks against malicious drivers: a probabilistic approach, International Conference on Complex, Intelligent, and Software Intensive Systems Pp. 146â151. June 30, 2011Sun W, Xia F, Ma J, Fu T, Sun Y. An optimal ODAM-based broadcast algorithm for vehicular Ad-Hoc Networks. KSII Trans Internet Inform Syst 6(12): 3257â3274Vinel AV, Dudin AN, Andreev SD, Xia F (2010) Performance modeling methodology of emergency dissemination algorithms for vehicular ad-hoc networks, 6th Communication Systems, Networks & Digital Signal Processing (CSNDSP 2010), Pp. 397â400AL-Hashimi HN, Bakar KA, Ghafoor KZ (2010) Inter-domain proxy mobile IPv6 based vehicular network. Netw Protocol Algorithm 2(4):1â15. doi: 10.5296/npa.v2i4.488Ghafoor KZ, Bakar KA, Mohammed MA, Lloret J (2013) Vehicular cloud computing: trends and challenges, in the book âmobile computing over cloud: technologies, services, and applicationsâ. IGI GlobalYan G, Rawat DB, Bista BB (2012) Towards secure vehicular clouds, Sixth International Conference on Complex, Intelligent and Software Intensive Systems (CISIS 2012), Pp. 370â375FernĂĄndez H, Rubio L, Reig J, Rodrigo-Peñarrocha VM, Valero A (2013) Path loss modeling for vehicular system performance and communication protocols evaluation. Mobile Netw Appl. doi: 10.1007/s11036-013-0463-xAllouche Y, Segal M (2013) A cluster-based beaconing approach in VANETs: near optimal topology via proximity information. Mobile Netw Appl. doi: 10.1007/s11036-013-0468-5Merah AF, Samarah S, Boukerche A, Mammeri A (2013) A sequential patterns data mining approach towards vehicular route prediction in VANETs. Mobile Netw Appl. doi: 10.1007/s11036-013-0459-6Zhang D, Huang H, Zhou J, Xia F, Chen Z (2013) Detecting hot road mobility of vehicular Ad Hoc Networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0467-6El Ajaltouni H, Boukerche A, Mammeri A (2013) A multichannel QoS MAC with dynamic transmit opportunity for. Mobile Netw Appl. doi: 10.1007/s11036-013-0475-6Reñé S, Esparza O, Alins J, Mata-DĂaz J, Muñoz JL (2013) VSPLIT: a cross-layer architecture for V2I TCP services over. Mobile Netw Appl. doi: 10.1007/s11036-013-0473-8Blanco B, Liberal F (2013) Amaia Aguirregoitia, application of cognitive techniques to adaptive routing for VANETs in city environments. Mobile Netw Appl. doi: 10.1007/s11036-013-0466-7Kim J, Krunz M (2013) Spectrum-aware beaconless geographical routing protocol for cognitive radio enabled vehicular networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0476-5Dias JAFF, Rodrigues JJPC, Isento JNG, Niu J (2013) The impact of cooperative nodes on the performance of vehicular delay-tolerant networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0464-9Sadiq AS, Bakar KA, Ghafoor KZ, Lloret J, Khokhar R (2013) An intelligent vertical handover scheme for audio and video streaming in heterogeneous vehicular networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0465-8Machado S, OzĂłn J, GonzĂĄlez AJ, Ghafoor KZ (2013) Structured peer-to-peer real time video transmission over vehicular Ad Hoc networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0461-zLin C, Wu G, Xia F, Yao L (2013) Enhance the attacking efficiency of the node compromise attack in vehicular Ad-hoc network using connected dominating set. Mobile Netw Appl. doi: 10.1007/s11036-013-0469-
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
Message and time efficient multi-broadcast schemes
We consider message and time efficient broadcasting and multi-broadcasting in
wireless ad-hoc networks, where a subset of nodes, each with a unique rumor,
wish to broadcast their rumors to all destinations while minimizing the total
number of transmissions and total time until all rumors arrive to their
destination. Under centralized settings, we introduce a novel approximation
algorithm that provides almost optimal results with respect to the number of
transmissions and total time, separately. Later on, we show how to efficiently
implement this algorithm under distributed settings, where the nodes have only
local information about their surroundings. In addition, we show multiple
approximation techniques based on the network collision detection capabilities
and explain how to calibrate the algorithms' parameters to produce optimal
results for time and messages.Comment: In Proceedings FOMC 2013, arXiv:1310.459
Design and Analysis of SD_DWCA - A Mobility based clustering of Homogeneous MANETs
This paper deals with the design and analysis of the distributed weighted
clustering algorithm SD_DWCA proposed for homogeneous mobile ad hoc networks.
It is a connectivity, mobility and energy based clustering algorithm which is
suitable for scalable ad hoc networks. The algorithm uses a new graph parameter
called strong degree defined based on the quality of neighbours of a node. The
parameters are so chosen to ensure high connectivity, cluster stability and
energy efficient communication among nodes of high dynamic nature. This paper
also includes the experimental results of the algorithm implemented using the
network simulator NS2. The experimental results show that the algorithm is
suitable for high speed networks and generate stable clusters with less
maintenance overhead
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
GCP: Gossip-based Code Propagation for Large-scale Mobile Wireless Sensor Networks
Wireless sensor networks (WSN) have recently received an increasing interest.
They are now expected to be deployed for long periods of time, thus requiring
software updates. Updating the software code automatically on a huge number of
sensors is a tremendous task, as ''by hand'' updates can obviously not be
considered, especially when all participating sensors are embedded on mobile
entities. In this paper, we investigate an approach to automatically update
software in mobile sensor-based application when no localization mechanism is
available. We leverage the peer-to-peer cooperation paradigm to achieve a good
trade-off between reliability and scalability of code propagation. More
specifically, we present the design and evaluation of GCP ({\emph Gossip-based
Code Propagation}), a distributed software update algorithm for mobile wireless
sensor networks. GCP relies on two different mechanisms (piggy-backing and
forwarding control) to improve significantly the load balance without
sacrificing on the propagation speed. We compare GCP against traditional
dissemination approaches. Simulation results based on both synthetic and
realistic workloads show that GCP achieves a good convergence speed while
balancing the load evenly between sensors
- âŠ