Search

Broadcast is a fundamental activity in wireless sensor networks (WSNs) and many problems related to broadcast have been formulated and investigated in the literature. Among them, the minimum-transmission broadcast (MTB) problem, which aims to reduce broadcast redundancy, has been well studied in conventional wireless ad hoc networks, where network nodes are assumed to be active all the time. In this paper, we study the MTB problem in duty-cycled WSNs where sensor nodes operate under active/dormant cycle and propose a novel scheme to solve it efficiently. The proposed Level-Based Approximation Scheme first identifies the forwarding nodes and their corresponding receivers for all time slots; then constructs a broadcast backbone by connecting these forwarding nodes to the broadcast source. The backbone construction is accomplished by a two-stage traversal on all the forwarding nodes, which successfully exploits transmissions of each forwarding node to its receivers. We have also conducted extensive simulations to evaluate the performance of our proposed scheme. Simulation results indicate that our scheme significantly outperforms existing ones. The algorithm of finding covering nodes helps to reduce a number of transmissions.The concept of duty-transmission highlights the advantage of our scheme.Level-based traversal on covering nodes reduces a number of transmissions and the time complexity.Examining the impact of network density and duty cycle shows the advantage of our scheme.The trade-off between number of broadcast transmissions and broadcast delay is also disclosed.

A major challenge achieving scalable access control for a large number of subscribers in a public broadcast is to distribute key update messages reliably to all stateless receivers. However, in a public broadcast, the rekeying messages can be dropped or compromised during transmission over an insecure broadcast channel, or transmitted to receivers while they were off-line. In this study, we propose a novel group key management scheme. It features a mechanism to allow legitimate receivers to recover the current group key, even if they lose key update messages for long-term sessions. The scheme uses short hint messages and member computation. Performance analysis shows that the proposed scheme has the advantages of scalability and efficient rekeying compared to previous reliable group key distribution schemes. The proposed key management scheme targets a conditional access system in a media broadcast in which there is no feedback channel from receivers to the broadcasting station.

In vehicular ad hoc networks (VANETs), multi-hop wireless broadcast has been considered a promising technology to support safety-related applications that have strict quality-of-service (QoS) requirements such as low latency, high reliability, scalability, etc. However, in the urban transportation environment, the efficiency of multi-hop broadcast is critically challenged by complex road structure, severe channel contention, message redundancy, etc. In this paper, we propose an urban multi-hop broadcast protocol (UMBP) to disseminate emergency messages. To lower emergency message transmission delay and reduce message redundancy, UMBP includes a novel forwarding node selection scheme that utilizes iterative partition, mini-slot, and black-burst to quickly select remote neighboring nodes, and a single forwarding node is successfully chosen by the asynchronous contention among them. Then, bidirectional broadcast, multi-directional broadcast, and directional broadcast are designed according to the positions of the emergency message senders. Specifically, at the first hop, bidirectional broadcast or multi-directional broadcast conducts the forwarding node selection scheme in different directions simultaneously, and a single forwarding node is successfully chosen in each direction. Then, directional broadcast is adopted at each hop in the message propagation direction until the emergency message reaches an intersection area where multi-directional broadcast is performed again, which finally enables the emergency message to cover the target area seamlessly. Analysis and simulation results show that the proposed UMBP significantly improves the performance of multi-hop broadcast in terms of one-hop delay, message propagation speed, and message reception rate.

Each device in being mobile ad hoc network (MANET) is overcome to navigate independently in any direction of side. The key challenge in building a MANET is availing every device to frequently maintain the information using static and dynamic topology. When the mobility is high scalable broadcast algorithm (SBA) is used and when the mobility is low memory aided broadcast algorithm (MaBA) is used for broadcasting packets. The MaBA is the algorithm where hubs on their memory to choose whether to forward stream or backward stream. The fuzzy enabled environs aware broadcast algorithm; a host maintains the local mobility around itself and defined user to choose which of two broadcast mechanisms to use. The Fuzzy logic is a Boolean conventional logic which has been increased to handle the concept of partial values between "completely true" and "completely false". As its name convinced different logic underlying the modes of reasoning which are approximate rather than exact. The significance of fuzzy logic from the host derives. The fuzzy logic is going to work with the two algorithms SBA and MaBA and it divides the network into static, semi-static and dynamic.

In a disaster situation, mobile ad hoc networks can be considered as one of the communication methods when the communication infrastructure is unavailable. Under these circumstances, the number of redundant packets consuming power should be controlled to save battery power and prolong the life of the network. In this paper, we propose an efficient broadcast-based information transfer method using location data to reduce the redundant packets while achieving high data reachability.

Vehicular Ad hoc Networks (VANETs) have the potential to improve road safety and travel convenience, by providing self-organizing decentralized environments to disseminate traffic data, without requiring fixed infrastructure. The public interest of traffic data makes it appropriate for VANET data dissemination methods to rely on broadcasting. However, scalability issues arise when broadcasting under high density scenarios, where the high percentage of data redundancy and packet collisions may easily lead to the broadcast storm problem. Existing solutions either do not scale well under high density scenarios, or require extra overhead to estimate traffic density, so as to manage data dissemination accordingly. In this paper, we provide a novel approach for data dissemination in multi-hop VAENT that relies on traffic regime estimation to provide scalable broadcast, without extra communication overhead. Simulation results show the efficiency of our broadcasting approach in achieving low broadcasting overhead while maintaining the high data delivery ratio.

Due to the independent sleep/wake scheduling of nodes in asynchronous wireless sensor networks (WSNs), a sender should send the same packet several times to make sure all the neighbor nodes can receive the packet in a broadcast process. Moreover, the order of the neighbor nodes receiving the packet has effect on the performance of broadcast. In this letter, we focus on the dynamics in the process of broadcast in WSNs and jointly consider the coverage knowledge, link quality, and sleep/wake scheduling information of neighbor nodes. We first choose a receiver with large newly added coverage area to accelerate the broadcast process. Then, we select the sender and its receiver or the coverage order for the nodes not being accommodated in the overlap coverage area to efficiently improve the broadcast performance. Simulation results have shown that our proposed protocol can reduce energy consumption and number of transmissions.

International audience; The main objective of VANET networks is to improve road safety as well as transportation efficiency through the use of wireless communications technologies and the emergence of low cost embedded sensors. Thus, the design of an efficient data dissemination protocol, that informs vehicles about interesting safety events, is of paramount importance. The thriving challenge would be to maximize the delivery ratio by avoiding as far as possible the broadcast storm problem. A scrutiny of the literature wealthy number of approaches highlights that all of them fail to fulfill with a critical requirements. In this paper and to palliate this shortage, we introduce a new infrastructure-less Geocast protocol that send messages only to vehicles in the Zone of Relevance (ZOR) with a minimum overhead cost. Our protocol stands in reaching a high delivery ratio as well as a high Geocast precision by only sending messages to vehicles in the Zone of Relevance (ZOR) with a minimum overhead cost. Carried out experiments show that our protocol outperforms its competitors in terms of effectiveness and efficiency.

Multimedia broadcast is the most efficient method to distribute identical content to multiple users in the Evolved Packet System (EPS). EPS enables efficient usage of network resources and provisioning of quality of service for every user. Third-party control allows applications in an enterprise domain to invoke network functions like multimedia broadcast. In this paper, an approach to modeling the behavior of Service Capability Server (SCS) for multimedia broadcast in EPS is presented. Third-party applications can access multimedia broadcasting capabilities by using Parlay X Web Service interfaces. The SCS for multimedia broadcast exposes Parlay X interfaces toward 3rd-party applications and control protocols toward the network. The SCS functional behavior has to be synchronized with the application view on message broadcast and the state of the network resources intended for the broadcast session. Models of multicast session, IP connectivity session, and bearers’ and charging session are proposed and formally described using the notation of Label Transition Systems. The concept of weak bisimilarity is used to prove that models expose equivalent behavior; that is, they are synchronized.

In recent years, the public safety community has been aligning behind Long Term Evolution (LTE) technology as the basis for next generation public safety networks. Correspondingly, the 3rd Generation Partnership Project (3GPP) standards body has started multiple technical work initiatives on LTE enhancements to better support public safety use cases and requirements. Of particular importance to the public safety community is the addition of direct device-to-device (D2D) broadcast capability that can enable off-network push-to-talk (PTT) group communications in a manner equivalent to existing public safety communication systems. In this paper, we briefly explore the design objectives for, and challenges associated with, providing a D2D broadcast service. We then present and analyze a new distributed media access control (MAC) scheme for interference-aware coordination of both unicast and broadcast transmission. System-level simulation results are provided to validate the performance and the effectiveness of our approach, using a CSMA-based approach as a basis for comparison.

This paper describes the architecture and functionality of a work zone traffic information system that uses vehicle-to-vehicle communication, based on dedicated short-range communications (DSRC), and a newly designed hopping algorithm. (“Hopping” involves transmitting traffic messages via intermediate hosts to a target designation. The term is commonly used in the radio and wireless communication industry.) The proposed hopping algorithm can deliver in-vehicle messages transmitted by a roadside unit installed at a work zone site to faraway vehicles traveling toward the work zone on predefined routes. This newly designed hopping algorithm uses rectangular regions to define a hopping route and can hop messages to vehicles on multiple routes at the same time without the risk of creating a broadcast storm. Although the messages hopped by the proposed hopping algorithm will generally be applicable to vehicles on only one side of the road (traveling toward the work zone), the DSRC-equipped vehicles present on both sides of the road will participate in hopping to maximize the number of available hopping nodes in situations with lighter traffic flow or low DSRC market penetration. Furthermore, the hopping algorithm increases message security by not requiring the hopping nodes (i.e., the DSRC-equipped vehicles) to modify the contents of the hopped message. Numerical simulations have been performed to evaluate the performance of the hopping algorithm. The simulation results show that the proposed hopping algorithm works as expected and successfully disseminates DSRC messages along a predefined route.

Motivated by the recent buffer-aided relaying protocol that selects the best available link at each time slot, we herein introduce an additional degree of freedom to the protocol by simultaneously exploiting multiple links between the source node and the multiple buffer-aided relay nodes, which is enabled owing to the broadcast nature of wireless channels. More specifically, the proposed schemes are designed to allow multiple relay nodes to receive a source packet through source-to-relay broadcast channels, resulting in multiple copies of the source packet, which are stored in relay node buffers. As the explicit benefits of its increased design degree of freedom, the proposed protocols attain a significantly lower end-to-end packet delay than the conventional buffer-aided relaying protocols, which is achieved without imposing any substantial penalty on the achievable outage probability. Furthermore, the proposed protocol is capable of reducing the overhead required for monitoring the available links and buffer statuses of the relay nodes. Based on the Markov chain model, we derive the theoretical bounds of the outage probabilities of the proposed protocols.

In vehicular networks, broadcast communications are critically important, as many safety-related applications rely on single-hop beacon messages broadcast to neighbor vehicles. However, it becomes a challenging problem to design a broadcast authentication scheme for secure vehicle-to-vehicle communications. Especially when a large number of beacons arrive in a short time, vehicles are vulnerable to computation-based Denial of Service (DoS) attacks that excessive signature verification exhausts their computational resources. In this paper, we propose an efficient broadcast authentication scheme called Prediction-Based Authentication (PBA) to not only defend against computation-based DoS attacks, but also resist packet losses caused by high mobility of vehicles. In contrast to most existing authentication schemes, our PBA is an efficient and lightweight scheme since it is primarily built on symmetric cryptography. To further reduce the verification delay for some emergency applications, PBA is designed to exploit the sender vehicle’s ability to predict future beacons in advance. In addition, to prevent memory-based DoS attacks, PBA only stores shortened re-keyed Message Authentication Codes (MACs) of signatures without decreasing security. We analyze the security of our scheme and simulate PBA under varying vehicular network scenarios. The results demonstrate that PBA fast verifies almost 99 percent messages with low storage cost not only in high-density traffic environments but also in lossy wireless environments.

Recently there has been a new emerging trend in integrating Named Data Networking (NDN) and wireless sensor networks (WSNs) together to implement real data-centric Internet of Things (IoT). However, the main solutions in current literature lack energy efficient design to meet the severely limited energy resources in WSNs. In this paper, we propose a dual mode Interest forwarding scheme (called DMIF in short) for NDN-based WSNs. The DMIF consists of two combined forwarding modes, in which several energy efficient mechanisms including flexible mode shift, flooding scope control, broadcast storm avoidance, packet suppression, and energy weight factors are designed to save and balance the energy consumption. We extend the ndnSIM to support wireless multihop communication to validate the proposed scheme. Simulation experiments show that the DMIF outperforms the baseline schemes in terms of total energy consumption, energy equilibrium rate, and network lifetime.

Broadcast is an important operation in Cognitive Radio Networks (CRNs). How to achieve broadcast in an energy-efficient way is important since users in CRNs are usually battery-powered. Existing single-channel broadcast mechanisms are not suitable for CRNs because multiple channels can be used in a CRN. Most existing multi-channel broadcast schemes rely on a common control channel (CCC) to support broadcast. However, finding such a CCC in a CRN is difficult because an unlicensed user's available channels are changed over time and space. In this paper, we focus on an environment where no broadcast structure or CCC is established in advance while a node is equipped with one CR transceiver and does not aware of the locations and distances to other nodes. We have defined the one-hop Minimum Multichannel Set Cover (MMSC) problem and the multi-hop Minimum Cost Broadcast (MCB) problem in such an environment. Both problems are NP-hard and we have proposed a heuristic solution, the Energy-Efficient Broadcast (EEB) protocol, to solve them. Considering the uncertain primary user occupancy issue, the EEB protocol features a distributed solution that uses only local information. Simulation results verify that EEB effectively reduces energy consumption and achieves high packet delivery ratio.

Recent work has shown that wireless links are not independent, and that transmissions from a transmitter to multiple receivers are correlated. This finding has profound implications for the performance of network protocols such as broadcast, multicast, opportunistic routing, and network coding. In this paper, we show how link correlation can significantly impact broadcast. We present the design and implementation of CorLayer, a general supporting layer for energy-efficient reliable broadcast that carefully blacklists certain poorly correlated wireless links. The design uses only one-hop information, which makes it work in a fully distributed manner and introduces minimal communication overhead. The highlight of our work is CorLayer's broad applicability and effectiveness. We integrate CorLayer transparently with 16 state-of-the-art broadcast protocols specified in 13 publications on three physical testbeds running TelosB, MICAz, and GreenOrbs nodes, respectively. The experimental results show that CorLayer significantly improves energy efficiency across a wide spectrum of broadcast protocols and that the total number of packet transmissions can be reduced consistently by 47% on average.

The vision of the Internet of Things (IoT) is that it connects all kinds of things by leveraging the creation of increasingly affordable and small devices that can be embedded for sensing, processing, wireless communication, and actuation. Named data networking (NDN) is a newly emerging Internet paradigm that may replace the current Internet architecture and that fulfills most of the expectations of the IoT. Software-defined networking (SDN) is an emerging paradigm of technology that is highly capable of managing overall networks efficiently and transforming complex network architectures into manageable, simple ones. The combination of the SDN controller, NDN, and IoT can be lethal in the overall performance of the network. Broadcast storms, due to the flooding nature of NDN&rsquo, s wireless channel, are a serious issue when it comes to forwarding interest and data packets. Energy consumption of sensor nodes in dense IoT scenarios causes problems in forwarding as well as unnecessary delays, decreases network performance, and increases the cost and packet delay for important packets. We took these problems as our baseline and proposed an energy-efficient, priority-based forwarding (EPF) in SDN-enabled NDN&ndash, IoT. Our scheme EPF used the efficient flow management of the SDN controller to control the broadcast storm and efficiently forward the priority-based packets. A defer timer mechanism was used to prioritized the packet upon its arrival to the node. An energy threshold mechanism was used to control energy consumption and improve overall energy efficiency. We compared our scheme with the traditional flooding mechanism and geographic interest forwarding, EPF outclassed the other schemes and produced the best results in terms of total number of interests and retransmissions, content retrieval time, total number of priority interests, energy consumption, and network lifetime.

High rates of road accidents have turned VANET to be a dynamic area of research, as it possibly enhances vehicle & road safety, traffic efficiency, and convenience. For such safety applications, VANET requires fast dissemination of messages to the nearby vehicles without any delay by rebroadcasting, which may lead to broadcast storm problem. To address this problem, the community detection algorithm is an efficient way of grouping similar vehicles into communities and selecting a few amongst them as forwarders. The existing research works forms the communities by considering the parameters like edge-betweenness, modularity gain, link stability, and neighbourhood similarity. Due to frequent switching between the communities these techniques suffer from ping-pong effect. Hence, a novel algorithm has been proposed which is based on modularity gain and degree of cohesion between vehicles to form stable communities. The proposed algorithm is unique amongst the state-of-the-art algorithms by selecting next forwarders of the safety messages by forming stable communities of vehicles considering their relative mobility. The simulation results confirm that the proposed algorithm forms stable communities and identifies less number of forwarders with reduced overhead and delay without reducing the percentage of vehicles that receives the message.

Vehicular networks, compared to other wireless networks, face particular challenges due to the rapidly changing topology and intermittent connections. By eliminating the need to establish and maintain an end-to-end connection, Content-Centric Network (CCN) model has recently become an appropriate solution to meet the challenging demands of vehicular network communications. In this kind of network, the basic method of forwarding interest packets is flooding. This approach will result in excessive redundancy, serious contention, and collision to which it is referred as the broadcast storm problem. In this article, a probabilistic strategy is proposed to alleviate the impact of the broadcast storm on interest forwarding in content-centric vehicular networks. In this density-aware approach, each vehicle dynamically computes the probabilities based on the number of existing neighbors. A local density approximation method is presented, which uses the information provided by the newly modified Pending Interest Table (PIT) entries. Moreover, some time-based techniques are employed to give priority to potential forwarders. The simulation results indicate that the proposed work outperforms the basic CCN. With on average 40% lower network load and 65% fewer interests compared to the basic CCN, it shows only an overall 6% decrease in reachability.

Incorporating vehicle-to-everything (V2X) and device-to-device (D2D) communication in a vehicular environment has become a research focus area due to the proliferation of fifth-generation (5G) technology. However, establishing V2X and D2D communication remains a challenging issue in urban scenarios because, by the nature of their role and usage, vehicles are subject to dynamic changes in their mobility and direction, as well as being affected by traffic congestion. Moreover, safety message dissemination over vehicular ad hoc networks (VANETs) without the introduction of a broadcast storm poses a considerable problem. This paper presents a design for a novel cellular-5G VANET architecture intended to address all prior problems in VANETs and improve quality of service (QoS). To this end, all vehicles in the field in focus are divided into clusters using an adaptive mobility aware path similarity (A-MAPS) algorithm. Cluster formation and cluster head (CH) selection are performed on the basis of a number of pivotal criteria, including future path similarity, which is vital for urban environments. To establish reliable vehicle-to-vehicle (V2V) and D2D communication, a Bayesian rule-based fuzzy logic (BRFL) algorithm is introduced that determines the optimal forwarder for V2V and the optimal device for D2D communication. Furthermore, vehicle-to-infrastructure (V2I) and vehicle-to-pedestrian (V2P) communication are handled with a novel two-fitness hypotrochoid spiral optimization (2F-HSO) algorithm that is derived using fitness functions. For safety message dissemination, two different message types (Accident and Traffic) are considered, and a safety aware hierarchical tree for dissemination (SA-HTD) is constructed to handle their dissemination. The proposed cellular-5G VANET is modeled in an OMNeT++ simulator. Results indicate improvement in packet delivery ratio (PDR), throughput, transmission delay, and dissemination delay.

Security applications in vehicular ad-hoc networks (VANETs) must guarantee reachability and an efficient transmission of emergency messages. The use of cognitive radio technology certainly enhance the performance of vehicular networks, giving rise to Vehicular Cognitive Radio Networks (COG-VANETS). In this paper, a MAC protocol for the transmission of emergency security messages (ESMs) in COG-VANETS is evaluated using both the TV white spaces (TVWS) band and the DSRC band following a spectrum sharing approach. Nevertheless, an scenario of broadcast storm is considered and hence a mitigation technique is incorporated to the MAC protocol with the objective of reducing the problem of broadcast storm which is presented in vehicular communication when the number of vehicles is high and all want to broadcast emergency messages.

This paper tackles the issue of efficient route request (RREQ) dissemination in reactive routing protocols targeting low-power and lossy wireless networks. It provides a novel mechanism to achieve expending ring propagation of route requests in an efficient manner by propagating an RREQ the highest distance possible and trying to stop its propagation when a route is found. It is designed to be stateless, local, and effective. The idea is to slightly delay request propagation in order to provide objective functions that locally decide on what to do next. If a route is discovered, aware nodes collaborate locally to disseminate such information and stop RREQ propagation. Smart ring is implemented and integrated to a LOADng implementation in Contiki. Simulation results showed the capacity of such a technique to reduce the cost of propagating route requests and hence minimize the effects of the broadcast storm problem at the expense of an additional route discovery time. The trade-offs between these two parameters is to be tailored depending on the application needs.

In this paper, we propose three mechanisms to reduce the broadcast storm problem in wireless mesh networks based on the Named-Data Network (NDN) architecture. The goal of our mechanisms is to reduce the number of content requests forwarded by nodes and consequently, increase the network efficiency. The first proposed mechanism, called Probabilistic Interest Forwarding (PIF), randomly forwards content requests. The second mechanism, called Retransmission-Counter-based Forwarding (ReCIF), decides to forward content requests based on the number of retransmissions by adding a counter to the header of requests. The third mechanism, called ReCIF+PIF, combines the features of PIF and ReCIF to suppress content requests. We compare the performance of our mechanisms with both the NDN default forwarding mechanism and the Listen First Broadcast Later (LFBL) mechanism. Our proposals outperform the default NDN forwarding mechanism by up to 21% regarding the data delivery rate in dense networks and provide a 25% lower delivery delay than the default NDN. Our mechanisms accomplish this performance by only reducing the number of content requests forwarded by nodes. One of our mechanisms, PIF, outperforms LFBL regarding the data delivery rate and delivery delay by up to 263% and 55%, respectively, for high network contention levels.

Vehicular ad hoc network performs crucial function in road safety, detection of traffic accidents and reduction of traffic congestion by disseminating messages among vehicles. An efficient broadcasting of emergency messages among vehicles in vehicular ad hoc network is proposed in this work. The main objective of the proposed broadcasting algorithm is to minimize the broadcast storm at the time of dissemination of emergency message among vehicles. The performance of the scheme is studied on the basis of emergency message dissemination delay, network overhead and reachability and it outperforms the existing schemes.

Flying Ad hoc Network (FANET) is a new resource-constrained breed and instantiation of Mobile Ad hoc Network (MANET) employing Unmanned Aerial Vehicles (UAVs) as communicating nodes. These latter follow a predefined path called &rsquo, mission&rsquo, to provide a wide range of applications/services. Without loss of generality, the services and applications offered by the FANET are based on data/content delivery in various forms such as, but not limited to, pictures, video, status, warnings, and so on. Therefore, a content-centric communication mechanism such as Information Centric Networking (ICN) is essential for FANET. ICN addresses the problems of classical TCP/IP-based Internet. To this end, Content-centric networking (CCN), and Named Data Networking (NDN) are two of the most famous and widely-adapted implementations of ICN due to their intrinsic security mechanism and Interest/Data-based communication. To ensure data security, a signature on the contents is appended to each response/data packet in transit. However, trusted communication is of paramount importance and currently lacks in NDN-driven communication. To fill the gaps, in this paper, we propose a novel trust-aware Monitor-based communication architecture for Flying Named Data Networking (FNDN). We first select the monitors based on their trust and stability, which then become responsible for the interest packets dissemination to avoid broadcast storm problem. Once the interest reaches data producer, the data comes back to the requester through the shortest and most trusted path (which is also the same path through which the interest packet arrived at the producer). Simultaneously, the intermediate UAVs choose whether to check the data authenticity or not, following their subjective belief on its producer&rsquo, s behavior and thus-forth reducing the computation complexity and delay. Simulation results show that our proposal can sustain the vanilla NDN security levels exceeding the 80% dishonesty detection ratio while reducing the generated end-to-end delay to less than 1 s in the worst case and reducing the average consumed energy by more than two times.

The development of Intelligent Transportation Systems (ITS) aims to enable the Vehicle-to-X (V2X) communication to deal with the road traffic and road safety problems, and to support the comfort applications. Vehicles move fast in Vehicular Ad-hoc Networks (VANETs) and are constrained by the layout of the roads. Furthermore, in urban areas, vehicles are facing the shadowing effects of buildings. These characteristics make the V2X communications in urban VANETs more challenging. According to European Telecommunications Standards Institute (ETSI) standards for ITS, communication between different communication endpoints might be realized by geoBroadcast. But performing geoBroadcast arises the broadcast storm problem that needs to be tackled. In this work, we introduce Unicast-Assisted GeoBroadcast (UAG) that selects several target positions within the geo-region and geoUnicasts a copy of the message from the source vehicle to each target position. UAG makes sure that these copies take different routes towards the geo-region to increase the chance of reaching it. Afterwards, some of the vehicles located in the geo-region are selected to broadcast the message within the geo-region. UAG applies the intersection-based or the road-based approach to select the target positions. Moreover, UAG implements the forwarding-zone breathing based on the road topology of the geo-region and its neighborhood, in order to increase the reachability. We compare our proposed protocol with simple flooding and Urban Geocast based on Adaptive Delay (UGAD), and show that UAG performs better in terms of reachability and scalability.

In Vehicular Ad-hoc Network (VANET), dissemination of emergency messages needs to be fast and robust as it makes the driver aware of the situation and gives time to take necessary actions. But information dissemination within vehicles in multi-hop broadcast scenario with multiple channel access suffers from problems like “Broadcast Storm”, “Re-Synchronization” and “Network Partition”. Many protocols have been proposed to achieve controlled flooding to mitigate broadcast storm and selects suitable carry forward agents to mitigate network partition. When an emergency incident occurs, all vehicles are not equally affected by that incident. So, the dissemination of message should be targeted only towards the relevant vehicles which are likely to be affected by the incident. But existing protocols are not usually concerned about the direction of dissemination and hence, message can get disseminated towards any arbitrary direction and may get suppressed for some important directions where vehicles need to be informed about the incident in priority. In this paper, we have proposed a data dissemination protocol (i.e. TAFDRV) where vehicles predict their own relevance for an emergency message in a purely distributed manner using a heuristic method and only relevant vehicles get chance to disseminate message with minimized delay and packet loss.

The peculiar characteristics of vehicular networks (e.g., high vehicular mobility, poor wireless link quality and short-lived and intermittent connectivity among vehicles) challenge host-centric content search and distribution in vehicular networking applications. In this regard, recent studies have proposed information-centric protocols to improve content distribution in vehicular networks. However, they are still severely impaired by the highly dynamic nature of vehicular network topologies and the broadcast storm problem due to uncontrolled Interest packet flooding for content discovery. In this paper, we tackle the broadcast storm problem of Interest packet transmissions for content discovery in vehicular named-data networks. We propose the location-based content distribution protocol (LOCOS) for oriented Interest packet transmissions towards the proximity area of a recently discovered content source vehicle. The LOCOS protocol leverages the recently discovered location of a vehicle content source to controlled transmit Interest packets to the area where the content source is located. Simulation results show that the LOCOS protocol improves content delivery rate in 10% and 28% when compared with related work, while it reduces the content delivery delay in 80%.

Loop avoidance is essential in switched networks to avoid broadcast storms. Logical Spanning Trees are constructed on the physical meshed topologies to overcome the broadcast storm problem. However, during topology changes, frame forwarding latency is introduced when re-converging and identifying new spanning tree paths. Meshed Tree algorithms (MTA) offer a new approach. Meshed Trees support multiple tree branches from a single root to cut down on re-convergence latency on link failures. A Meshed Tree Protocol (MTP) based on MTA is currently under development as an IEEE standard. In this article, MTP is evaluated for convergence delay in comparison with Rapid Spanning Tree Protocol (RSTP) on the GENI testbed.

Based on the characteristics of weak mobility in wireless Mesh network, this paper researched the Destination Sequenced Distance Vector (DSDV) routing and proposed Divide Cluster-DSDV protocol. This protocol introduces the clustering algorithm in the information redundancy problem for DSDV routing. Based on the existing clustering algorithm, the protocol also modifies the standard of evaluation link Metric in DSDV protocol which using the relay node to maximize the throughput of the network. Further this paper refers to the design idea of Mixed Routing Protocol (ZRP) to alleviate the problem of heavy load of cluster head in DC-DSDV. This paper adopts the wireless ad-hoc network on-demand plane distance vector routing protocol (AODV) routing lookup between clusters and proposes domain-AODV protocol to solve the problem of broadcast storm (BSP) which by means of probability radio avoid BSP.

In this work we tackle the problem of congestion and Interest broadcast storm problem in vehicular named data networks (VNDN) and propose a bio-inspired approach which makes the Interest forwarding self-adaptive and autonomous. The properties like scalability, self-adaptiveness, and simplicity are inherently available to the biological species. These properties are desirable in the VNDN environment, who face the daunting issue of Interest flooding and congestion. The proposed Bio-Inspired Distributed (BIRD) Interest forwarding scheme allows the on-road vehicles to make intelligent Interest forwarding decisions based on the simple rules followed birds in nature. The Interest packets are guided through multiple paths in a flock like manner towards the provider. Simulation results show that at the cost of additional packets for multiple paths we achieve an average of 20% higher Content satisfaction ratio from both RUFS and NAIF. Additionally, BIRD incurs 10% less delay as compared to the multi-path NIAF scheme in urban scenarios with varying network density.

International audience; Toward the growing number of the transport safety applications offered by VANET, a large amount of messages need to be efficiently disseminated between connected vehicles. The requirement for an efficient data dissemination in vehicular environment is ensuring the highest data reachability, using the minimum network resources within a short end to end delay. To meet these properties, researchers have addressed the data dissemination challenges, mainly the famous broadcast storm, which has lead to a wide variety of solutions. In this work, we present two Simple and Efficient Adaptive data Dissemination protocols called SEAD1 and SEAD2 that combine a probabilis-tic and a delay based approach. The originality of these protocols is that they can be adaptively tuned according to the VANET applications' requirements. Therefore, a rigorous performance evaluation of the protocols is proposed through an analytic model and a large set of NS3 simulations. The analytic results show excellent fits to the simulation results which confirm the accuracy of the proposed model. Moreover , based on our analytic model we became able to thoroughly study the protocols parameters' behavior and derive an accurate configuration. Thereby, a proper trade-off between the packet delivery ratio and the redundancy ratio is possible in attempt to tune the protocols performance according to the application criticality level.

Efficiently disseminating messages has been one of the most important issues in vehicular ad hoc networks (VANETs), and various solutions have been proposed. In this paper we extend the weighted persistence broadcast mitigation technique adjusted to be used for the dense suburban scenario, and study the effects of vehicles’ unintentional misbehavior in that network. We present the results of our study, and suggest a mitigation technique using fail-safe status to handle unintentionally misbehaving vehicles for the scenarios based on the weighted persistence intelligent flooding.

Directed diffusion is a data dissemination protocol for wireless sensor networks. In directed diffusion, interest and exploratory data are disseminated by flooding, which will bring broadcast storm resulting in substantial energy consumption of networks. Grid-based directed diffusion can improve the energy efficiency where geographic grids are constructed by self-organization of nodes using location information. The flooding of interest and exploratory data is limited in grid head nodes. To save more energy, a scheme of data aggregation based on wavelet sparseness is proposed. At the same time, to adapt to environments with high security requirements, secure schemes based on trust are added. The simulation experiments show that the proposed data aggregation scheme can obtain data aggregation results earlier and effectively extend lifetime of network. And experiments show that the proposed security schemes restrain malicious nodes when network is under attacks.

VANETs are the next uprising technology in automotive industry to promote safety and valuable information to make a better driving experience. This technology allows vehicle to communicate directly to the next vehicle and exchange data. The main purpose of VANETs is to improve traffic safety and to provide efficient traffic management on road via safety and non-safety message. Safety and non-safety messages are disseminated instantly among the vehicles through broadcasting protocol. By broadcasting, message can be delivered to multiple vehicles at the same time within vicinity. When too many vehicles broadcasting in dense traffic, VANETs suffer network congestion due to excessive amount of broadcast messages consume the bandwidth of communication channel. When broadcast storm occurs, message could not be delivered properly due to packet loss in the transmission. To address this issue, congestion control mechanism was proposed to alleviate the congestion in the communication channel during broadcast storm. In this research, the congestion control is applied to Service Channel communication (SCH) for non-safety message. The proposed congestion control was also tested using Taguchi method to optimize packet loss reduction in the network. The experiment was conducted with and without Taguchi method in urban area. The obtained results from the experiment show packet loss was greatly reduced when applying congestion control with Taguchi method. The results have proven that integrating Taguchi method in congestion control mechanism could improve packet loss reduction when broadcast storm take place in high-density traffic.

In order to suppress the broadcast storm, balance the energy consumption of the nodes and provide certain reliability, we propose a cooperative broadcast algorithm based on the successful broadcasting ratio and residual energy of neighbor nodes (BSRREN). In this algorithm, each node in a network calculates the broadcasting coefficient according to the successful broadcasting ratio and residual energy. Then, the broadcasting coefficient encapsulated in the broadcast packets is exchanged between neighbor nodes. Each node constructs a neighbor information table (NIT) to store the broadcasting coefficient. Each node dynamically selects up to four neighbor nodes which have the highest broadcast coefficients as the forwarding nodes. The addresses of the four forwarding nodes which are designated as the next hop forwarding nodes are encapsulated in the broadcast packet headers. The transmissions of each node are randomly delayed to reduce the probability of channel contention and message collision. The simulation results show the BSRREN algorithm has lower forwarding node ratio and higher network lifetime, which indicates the algorithm can effectively suppress broadcast storm and balance the energy consumption.

Ethernet is being expanded to many industrial automation applications, and the demand for high availability drives the adoption of High Availability Seamless Redundancy (HSR) due to its capability to achieve zero recovery time. A major challenge of HSR is long delay of large HSR network due to its ring architecture. A solution to this issue is to use QuadBox to design multiple rings which raise many design questions because of different architecture options. Our approach is to apply the concept of SS7 signaling to classify the links as A, B, C, and D from which we present a flexible and scalable architecture. We developed a simulation model to validate this architecture, and the results show that one-way delay is not negatively affected by network growth. Another contribution of this paper is to use a central controller, like Software Defined Network (SDN), to create MAC forwarding tables on individual HSR nodes. The proposed scheme prevents flooding and broadcast storm in this loop topology.

In view to reduce accident risks and improve safety on public roads, the vehicular Ad hoc network (VANET) standard was developed to enable inter-vehicular communication and facilitate safety message exchange among the involved nodes. Moreover, a successful message exchange can only be possible if the transmission medium is collision free. Under the Intelligent Transportation System (ITS), the cooperative Awareness messages (CAM) have to be transmitted at the rate of 10 Hz as per standard. To account for congestion management, the Distributed Congestion Control (DCC) mechanism was proposed. However, under higher node density, the DCC becomes inefficient and dramatically contribute to the deterioration of the VANET environment. The present work proposes a Dynamic Broadcast Storm Mitigation Algorithm (DBSMA) which can be used to combat the broadcast storm problem in a Vehicular Network (VN). The DBSMA is compared against the DCC and the Hi-CAST approach proposed in literature. Results from several simulations demonstrated the outperformance of the DBSMA over its peers by offering more than 150% improved efficiency against the Hi-CAST approach. Other advantage of the DBSMA is that it is simple to compute and easy to implement.

Vehicular Ad hoc Network (VANET) has become a very interesting technology for future generation vehicles. This is mainly due to its embedded and promising advantages which primarily include improvement of safety conditions on public road through exchange of critical safety messages amongst involved nodes. The success of VANET heavily relies on successful messages dissemination amongst involved vehicles. However, a successful message exchange can only be possible if the transmission medium is collision free. Under the Intelligent Transportation System (ITS), the cooperative Awareness messages (CAM) have to be transmitted at the rate of 10 Hz as per standard. To account for congestion management, the Distributed Congestion Control (DCC) mechanism was proposed. However, under higher node density, the DDC becomes inefficient and dramatically contribute to the deterioration of the VANET environment. The present work proposes a Dynamic Broadcast Storm Mitigation Algorithm (DBSMA) which can be used to combat the broadcast storm problem in a Vehicular Network (VN). Results from several simulations confirmed that the DBSMA has a potentiality to conquer the effect of broadcast storm by offering more than 150% improved efficiency against the DCC approach. Another advantage of the DBSMA is that it is simple to compute and easy to implement.

Among synchronization protocols applied in wireless sensor network, reference broadcast synchronization (RBS) is one prominent protocol achieving very high accuracy of synchronization given that the broadcasting medium is available. However, that the protocol lacks packet loss tolerance brings about degraded performance in severe conditions of wireless channel. Also, the instantaneous synchronization used in this protocol results in time discontinuity, which might cause serious faults in the distributed system. In this study, we propose a packet loss tolerance and continuous synchronization mechanism for RBS. Then we verified the result through simulations.

Display Omitted We formulate the problem as a mixed integer quadratically constrained program.We use a three-step method to build a broadcast tree and schedule transmissions.We show the effectiveness of our method by simulation. In this paper, we address the problem of broadcast routing and scheduling of video streaming for delay-sensitive applications in backbone wireless mesh networks. Given a source node and a set of destinations, we aim to build a broadcast tree and compute an optimal schedule such that the throughput for the source to broadcast streaming data to all the destinations is maximized. We divide the whole period for video broadcast into identical time frames and prove that maximizing the throughput can be converted into minimizing the length of a time frame. We propose a three-step method as a solution. Firstly, we build the broadcast tree by defining a new routing metric to select relay nodes. Then we use local search method to adjust the tree structure. Last, we propose a greedy method to schedule concurrent transmissions. Simulations have demonstrated that our method can improve the performance significantly compared with existing methods.

Gateway discovery is a fundamental process in interconnecting mobile ad hoc network with the Internet. Traditional gateway discovery algorithms adopt the method of periodically broadcast advertisements with a time interval. However, this method does not fulfill the actual requirements from the source nodes and produces some unnecessary overhead. To solve this problem, this paper adopts a novel adaptive scheme, in which every gateway broadcasts advertisements only on demand instead of simultaneous periodic emissions of all gateway nodes. To support the on-demand gateway broadcast strategy, the network’s actual demands for advertisements are obtained by monitoring the status of routes to the gateway. In particular, if a route is going to break, the corresponding gateway will be triggered to broadcast in order to help the source nodes update routes. Furthermore, we propose another strategy of deferring each gateway broadcast operation, comprising a route stability evaluation model. Stable routes can defer route breakage and consequently further reduce the frequency of gateway broadcast. This paper also designs a new gateway selection method to cope with the problems caused by asynchronous on-demand broadcast strategy. The performance of the proposed scheme is studied by a comparison approach. The results show that the proposed scheme significantly outperforms the conventional solutions: it is capable of achieving higher packet delivery ratio and lower end-to-end delay, while minimizing the routing overhead.

In wireless push-based systems traffic is asymmetric meaning that the server has much more bandwidth available, as compared to the clients. Since it is often not possible or desirable for the clients to send any requests, the server should broadcast the data periodically. The performance of this system relies heavily on the proper scheduling of the broadcast data. The well known algorithm proposed by Vaidya and Hameed battles this challenge and achieves state-of-the-art performance. However, this performance comes with a computational complexity linear to the number of data items that are broadcast. Furthermore, Vaidya’s and Hameed’s proposed solution for this time complexity degenerates performance. This paper proposes a scheduling algorithm for wireless push-based data broadcasting systems, which performs near optimal and has low computational complexity. Performance evaluation results are presented to demonstrate its efficient performance despite its low computational demands.

Vehicular Content-Centric Network (VCCN) has emerged as a future network technology for vehicular networks, where the focus of communication is shifted from the host to information centric. However, VCCN faces several challenges, including interest/data packet(s) flooding, provider/consumer mobility, and so on. In this letter, we propose a scheme named RobUst Forwarder Selection (RUFS) to mitigate the interest broadcast storm. In RUFS, each vehicle shares its satisfied interest(s) statistics with neighbors. All neighbors store this information in their Neighbors Satisfied List (NSL), which helps to select the potential interest forwarder. Simulation results show that RUFS outperforms the recently proposed NAIF, DR based and basic interest forwarding in VCCN.

The broadcast service spreads a message m among all processes of a distributed system, such that each process eventually delivers m. A basic broadcast service does not impose any delivery guarantee in a system with failures. Fault-tolerant broadcast is a fundamental problem in distributed systems that adds certainty in the delivery of messages when crashes can happen in the system. Traditionally, the fault-tolerant broadcast service has been studied in classical distributed systems when each process has a unique identity. However, very recently have appeared new distributed systems, such as sensor networks, where unique identity is not always possible to be included in each sensor node (due to small storage capacity, reduced computational power, a huge number of elements to be identified, etc.). In this paper, we study the definition and implementability of the fault-tolerant broadcast service in anonymous asynchronous systems, that is, in asynchronous systems where all processes have the same identity, and, hence, they are indistinguishable (they may have the same code).

Among Many fundamental communication primitives in wireless ad hoc network, flooding in wireless ad hoc network reduces the number of transmission in network and it plays a significant role in which every node transmits the message after receiving it for the first time. To successfully reducing the number of transmissions of broadcast that are required to achieve full delivery and constant approximation to the optimum solution without using exact position information of node. This paper presents two main approaches such as static and dynamic to broadcast algorithm in wireless ad hoc network. In static approach node status depends on local topology and priority function of node using this approach it can’t guarantee both full delivery and constant approximation if node exact position information isn’t available. On other hand in dynamic approach if node exact position information is available or not they can achieve both full delivery and constant approximation to their optimum solution using their partial 2-hop hybrid algorithm.

Broadcasting is a fundamental and essential data dissemination mechanism in Mobile Ad hoc NETworks (MANETs). This paper presents an efficient probability-based broadcast scheme. In the scheme, to accelerate the packets propagation, the nodes with higher velocity are selected with higher probability to rebroadcast the received packet. Moreover, to reduce transmission redundancy and collisions without decreasing packet delivery ratio, the rebroadcast probability at each node is dynamically and adaptively adjusted according to neighbor density. The velocity and neighbor density-based rebroadcast mechanism keeps the scheme insensitive to the ever-changing network environment, even to the high mobility environment. The theoretical analysis and the simulations show that the proposed scheme outperforms the existing broadcast schemes in packet delivery ratio and normalized broadcast overhead, especially in average end-to-end delay.