Interest Broadcast Suppression Scheme for Named Data Wireless Sensor Networks

Named data networking (NDN) is one of the future networking architectures that communicates content using names, instead of the node addresses. It uses a very simple pull-based communication mechanism to retrieve content by sending an Interest message, and the node that has the required content or producer node replies with the data message. In wireless networks, the interest is flooded in the network to find the data provider node. The directional diffusion method is used to pull further content from the provider node. Due to broadcast nature and without node addresses, interest flooding causes network congestion and wastes network resources, especially bandwidth and battery power. These resources have prime importance in the case of wireless sensor networks (WSNs) because all WSN nodes operate on battery and have limited bandwidth. In this paper, we propose an interest broadcast suppression scheme that considers interest holding time using the distance between forwarder and receiver of the interest, energy, angle, and distance from the beeline between consumer and the spatial region, to avoid broadcasting of unnecessary copies of Interest. The simulation results show that the proposed scheme mitigates the interest broadcast and conserves battery power of the wireless nodes compared with the state-of-the-art scheme in the domain. © 2019 IEEE.1

An energy scaled and expanded vector-based forwarding scheme for industrial underwater acoustic sensor networks with sink mobility

Industrial Underwater Acoustic Sensor Networks (IUASNs) come with intrinsic challenges like long propagation delay, small bandwidth, large energy consumption, three-dimensional deployment, and high deployment and battery replacement cost. Any routing strategy proposed for IUASN must take into account these constraints. The vector based forwarding schemes in literature forward data packets to sink using holding time and location information of the sender, forwarder, and sink nodes. Holding time suppresses data broadcasts; however, it fails to keep energy and delay fairness in the network. To achieve this, we propose an Energy Scaled and Expanded Vector-Based Forwarding (ESEVBF) scheme. ESEVBF uses the residual energy of the node to scale and vector pipeline distance ratio to expand the holding time. Resulting scaled and expanded holding time of all forwarding nodes has a significant difference to avoid multiple forwarding, which reduces energy consumption and energy balancing in the network. If a node has a minimum holding time among its neighbors, it shrinks the holding time and quickly forwards the data packets upstream. The performance of ESEVBF is analyzed through in network scenario with and without node mobility to ensure its effectiveness. Simulation results show that ESEVBF has low energy consumption, reduces forwarded data copies, and less end-to-end delay

A Redundancy based Protocol for Safety Message Dissemination in Vehicular Ad Hoc Networks

International audienceThe diversity of applications types in vehicular ad hoc networks (VANETs) has spawned a large variety of messages that need to be disseminated in vehicle to vehicle (V2V) communication mode. The most critical messages are those dedicated for safety applications such as accident warning, road hazardous warning, signal violation warning, etc. The dissemination of this sort of messages is a challenging task in VANETs since they should be efficiently transmitted i.e. by achieving high packet delivery within a certain time limit and an acceptable overhead. In this work, we propose a robust and an original data dissemination protocol called Redundancy-based Protocol (RBP). Contrary to most of the density based protocols, the protocol is beaconless. It takes into account the surrounding vehicle density during the broadcasting process through a specific metric, named “packet redundancy ratio”, calculated locally at each vehicle. Based on this metric, each vehicle is able to dynamically determine the probability of rebroadcast in order to mitigate the broadcast storm problem. The simulation results prove that the proposed protocol outperforms the slotted 1- persistence scheme in terms of packet drop ratio, and network load while still maintaining a low End-to-End delay and high packet reachability. This scheme is suitable for safety applications, as well as for further kinds of application by saving the network capacity consumption

Design and analysis of a beacon-less routing protocol for large volume content dissemination in vehicular ad hoc networks

Largevolumecontentdisseminationispursuedbythegrowingnumberofhighquality applications for Vehicular Ad hoc NETworks(VANETs), e.g., the live road surveillance service and the video-based overtaking assistant service. For the highly dynamical vehicular network topology, beacon-less routing protocols have been proven to be efficient in achieving a balance between the system performance and the control overhead. However, to the authors’ best knowledge, the routing design for large volume content has not been well considered in the previous work, which will introduce new challenges, e.g., the enhanced connectivity requirement for a radio link. In this paper, a link Lifetime-aware Beacon-less Routing Protocol (LBRP) is designed for large volume content delivery in VANETs. Each vehicle makes the forwarding decision based on the message header information and its current state, including the speed and position information. A semi-Markov process analytical model is proposed to evaluate the expected delay in constructing one routing path for LBRP. Simulations show that the proposed LBRP scheme outperforms the traditional dissemination protocols in providing a low end-to-end delay. The analytical model is shown to exhibit a good match on the delay estimation with Monte Carlo simulations, as well

SEAD: A simple and efficient adaptive data dissemination protocol in vehicular ad-hoc networks

International audienceVehicular ad-hoc network (VANET) is becoming a promising technology for improving the efficiency and the safety of intelligent transportation systems by deploying a wide variety of applications. Smart vehicles are expected to continuously exchange a huge amount of data either through safety or non-safety messages dedicated for road safety or infotainment and passenger comfort applications, respectively. One of the main challenges posed by the study of VANET is the data dissemination design by which messages have to be efficiently disseminated in a high vehicular speed, intermittent connectivity, and highly dynamic topology. In particular, broadcast mechanism should guarantee fast and reliable data delivery within a limited wireless bandwidth in order to fit the real time applications’ requirements. In this work, we propose a simple and efficient adaptive data dissemination protocol called “SEAD”. On the one hand, the originality of this work lies in its simplicity and efficiency regardless the application’s type. Simplicity is achieved through a beaconless strategy adopted to take into account the surrounding vehicles’ density. Thanks to a metric locally measured, each vehicle is able to dynamically define an appropriate probability of rebroadcast to mitigate the broadcast storm problem. Efficiency is manifested by reducing excessive retransmitted messages and hence promoting the network capacity and the transmission delay. The simulation results show that the proposed protocol offers very low packet drop ratio and network load while still maintaining a low end-to-end delay and a high packet delivery. On the other hand, SEAD protocol presents a robust data dissemination mechanism which is suitable either for safety applications or for other kinds of application. This mechanism is able to adapt the protocol performance in terms of packet delivery ratio to the application’s requirements