Data Dissemination Protocol Research Articles

DDDRC: decentralised data dissemination in VANET using raptor codes

The design of data dissemination protocol has been a great challenge due to the highly dynamic and unreliable wireless channel in vehicular ad hoc networks (VANET). In literature, several interesting solutions are proposed to perform data dissemination for this environment. But these solutions either use architectures requiring centralised coordination or global network knowledge or large intermediate buffers. In this paper, we propose a decentralised technique that overcomes above requirements and provides reliable and scalable communication in both dense and sparse traffic for VANET. Random walks are used in the proposed technique to disseminate data from one vehicle to other vehicles in the network. We use raptor codes to provide low decoding complexity and more scalability for data dissemination. Simulation results demonstrate that the proposed technique has better fault tolerance with lower complexity than general random-walk-based dissemination process and more scalability as compared to the other protocols.

Energy Aware Clustering Protocol (EACP) For Heterogeneous WSN

Energy saving to prolong the network life is an important design issue while developing a new routing protocol for wireless sensor network. Clustering is a key technique for this and helps in maximizing the network lifetime and scalability. Most of the routing and data dissemination protocols of WSN assume a homogeneous network architecture, in which all sensors have the same capabilities in terms of battery power, communication, sensing, storage, and processing. Recently, there has been an interest in heterogeneous sensor networks, especially for real deployments. This research paper has proposed a new energy aware clustering protocol (EACP) for heterogeneous wireless sensor networks. Heterogeneity is introduced in EACP by using two types of nodes: normal and advanced. In EACP cluster heads for normal nodes are elected with the help of a probability scheme based on residual and average energy of the normal nodes. This will ensure that only the high residual normal nodes can become the cluster head in a round. Advanced nodes use a separate probability based scheme for cluster head election and they will further act as a gateway for normal cluster heads and transmit their data load to base station when they are not doing the duty of a cluster head. Finally a sleep state is suggested for some sensor nodes during cluster formation phase to save network energy. The performance of EACP is compared with SEP and simulation result shows the better result for stability period, network life and energy saving than SEP.

A Survey of Wireless Sensor Network Routing Protocols based on SPIN

SPIN(Sensor Protocols for Information via Negotiation) comprises of a set of adaptive protocols that proficiently disseminate data in wireless sensor network(WSN).SPIN overcomes certain deficiencies associated with some of the data dissemination protocols & brings in more efficiency. WSNs have limited energy and hence efficiency of protocol has a significant impact on network‟s lifetime. Many protocols have been developed that are based on SPIN and are its modifications. This paper presents a survey on SPIN protocol and the various protocols devised which use SPIN as a base in one or another way.

Multiple mobile sink‐based routing algorithm for data dissemination in wireless sensor networks

SummaryIn recent years, many energy‐efficient algorithms and data dissemination protocols have been proposed for wireless sensor networks (WSNs). Because sensor nodes close to sink node have more traffic loads, they will quickly deplete their limited energy in practical implementation, and it will finally lead to energy hole and network partition problem. Adding sink mobility into sensor networks can bring in new opportunities to improve energy efficiency for WSNs. In this paper, we proposed our multiple mobile sink‐based routing algorithm for data dissemination to improve WSNs performance. Multiple mobile sinks will be utilized to collect the interested raw data. They will move back and forth along predetermined paths; one of which is the diameter of the circle, and the other two are fixed on arc lines. Mobile sinks will sojourn at some fixed points to collect raw data from relevant areas. Extensive simulation results show that our proposed algorithm can efficiently mitigate the hot spots problem and prolong the network lifetime of WSNs. Copyright © 2014 John Wiley & Sons, Ltd.

Rendezvous-based data dissemination for supporting mobile sinks in multi-hop clustered wireless sensor networks

In wireless sensor networks, a clustering-based technique is considered as an efficient approach for supporting mobile sinks without using position information. It exploits a Backbone-based Virtual Infrastructure (BVI) which uses only cluster heads (CHs) to construct routing structures. Since sensor nodes have constrained energy and are failure-prone, the effective design of both a clustering structure to construct a BVI and a routing protocol in the BVI is an important issue to achieve energy-efficient and reliable data delivery. However, since previous studies use one-hop clustering for a BVI, they are not robust against node and link failures and thus leading low data delivery ratio. They also use flooding-based routing protocols in a BVI and thus leading high energy consumption. Thus, in this paper, we propose a rendezvous-based data dissemination protocol based on multi-hop clustering (RDDM). Since RDDM uses a multi-hop clustering to provide enough backup sensor nodes to substitute a CH and enough backup paths between neighbor CHs, it can provide high robustness against node and link failures. By using a rendezvous CH, RDDM constructs routing paths from source nodes to mobile sinks without flooding in our BVI and thus can save energy of sensor nodes. By considering movement types of sinks, RDDM finds out a shorter path between a source node and a mobile sink through signaling only between neighbor CHs and thus can reduce the energy consumption. Analysis and simulation results show that RDDM provides better performance than previous protocols in terms of energy consumption and data delivery ratio.

Small data dissemination for wireless sensor networks: The security aspect

In wireless sensor networks small data dissemination protocols are used to adjust configuration parameters of sensors, or distribute management commands and queries to sensors. For security reasons every disseminated data item should be authenticated to prevent an adversary from installing malicious data items in the network. Unfortunately, security is not among the design considerations of existing small data dissemination protocols. In this article we identify the security vulnerabilities of these protocols and review a recently proposed solution addressing this issue. Furthermore, we suggest an enhancement to this solution to make the security function more efficient.

A BROADCAST BASED ROUTING PROTOCOL FOR INTER-CLUSTER DATA DISSEMINATION IN VEHICULAR COMMUNICATION

Vehicular communication is one of the fast growing and promising technologies for a safe and comfortable driving environment. These technologies do not end up with economic and safety ramifications, but also extended with other informational and entertainment oriented services. Data are being propagated multi-hop between source and destination vehicles for many real-life applications. Clustering is one of the effective and scalable solutions for data dissemination in wireless ad hoc networks. Though many cluster-based methods have been proposed for multi-hop data delivery in vehicular ad hoc networks, most of them do not consider the real-time changes in the network topology or imposes large penalties in routing such as unstable clusters, broken links, updating route tables. In order to address these issues, we propose a broadcast based routing protocol for inter-cluster data dissemination in this study that works on real-time vehicle information. Unlike, most existing routing algorithms, it only uses hello messages to obtain routing information without many other control messages. In addition, it alleviates the storage of routing information in every node, which largely reduces the overheads in routing. We performed extensive simulation to demonstrate the effectiveness and efficiency of the proposed routing protocol. Results show that the proposed protocol outperforms other approaches in terms of average delay, average delivery ratio and average number of hops.

An Autonomic Algorithm for Data Dissemination in Vehicular Ad Hoc Networks

A Vehicular Ad Hoc Network (VANET) is a subclass of Mobile Ad Hoc Networks, which provides wireless communication among vehicles as well as between vehicles and roadside units. Providing safety, traffic efficiency and user comfort for drivers and passengers are promising goals of these networks. Due to some inherent characteristics of VANETs, such as intermittent connectivity, highly dynamic topology, and diverse network densities, data dissemination is a challenging activity in this kind of network. Although data dissemination has been extensively studied in the literature, existing solutions do not effectively address the broadcast storm and network partition problems when considered together. To deal with both problems, we propose a network partition-aware geographical data dissemination protocol, which eliminates the broadcast storm and maximizes the data dissemination capability across network partitions with short delays and low overhead. The proposed algorithm is able to autonomically adjust message transmissions in the network. Simulation results show that our proposed approach provides good efficiency with respect to the coverage of event processing, delay and overhead.

Data Dissemination Protocol for Mobile Sink in Wireless Sensor Networks

In wireless sensor networks, the sensor nodes find the route towards the sink to transmit the data. The sensor node transmits the data directly to the sink, or it relays the data through neighbor nodes. The nodes near to the sink transmit more data than other nodes. It results in the small lifetime of the network. To prolong the lifetime of the network, we use the mobile sink approach. The mobile sink makes the network dynamic. It is a challenging task to find the route in the dynamic network. In this paper, we have proposed a distributed tree-based data dissemination (TEDD) protocol with mobile sink. The protocol is validated through simulation and compared with the existing protocols using some metrics such as energy consumption, average end-to-end delay, and throughput. The experiment results show that the proposed protocol outperforms the existing protocols.

IGBDD: Intelligent Grid Based Data Dissemination Protocol for Mobile Sink in Wireless Sensor Networks

Lifetime and energy efficiency are important factors in the design of wireless sensor network. A critical issue during data collection is the formation of energy holes near the sink. Sensors which are located near the sink have to participate in relaying data on behalf of other sensors and thus their energy will be depleted very quickly. Mobile sink movement yields the significant performance gained by decreasing the amount of energy consumption. In this paper, we propose an Intelligent Grid Based Data Disseminating protocol for mobile sink in wireless sensor networks. We have utilized a virtual grid as the protocol's substructure. In our proposed method, cell heads (CHs) will be selected based on the locations of virtual cross points (CPs) and CPs selection is needless to transfer any required data between neighbor nodes. We have optimized CPs selection using linear programming technique in order to increase network lifetime. By selecting the CHs based on our proposed algorithm, data will be disseminated toward the sink. Our data dissemination protocol is simple and has low overhead to construct and maintain. Also, we have presented a new method for sink location update which leads to the least cost in data transfer. Simulation results illustrate that by utilizing hierarchical functionality and selecting appropriate CPs and consequently selecting CHs, energy consumption will be decreased in comparison with other presented methods which directly lead to network lifetime increment. Also by determining an optimal cell size, packet delivery rate will be improved noticeably.

Lightweight and Confidential Data Discovery and Dissemination for Wireless Body Area Networks

As a special sensor network, a wireless body area network (WBAN) provides an economical solution to real-time monitoring and reporting of patients' physiological data. After a WBAN is deployed, it is sometimes necessary to disseminate data into the network through wireless links to adjust configuration parameters of body sensors or distribute management commands and queries to sensors. A number of such protocols have been proposed recently, but they all focus on how to ensure reliability and overlook security vulnerabilities. Taking into account the unique features and application requirements of a WBAN, this paper presents the design, implementation, and evaluation of a secure, lightweight, confidential, and denial-of-service-resistant data discovery and dissemination protocol for WBANs to ensure the data items disseminated are not altered or tampered. Based on multiple one-way key hash chains, our protocol provides instantaneous authentication and can tolerate node compromise. Besides the theoretical analysis that demonstrates the security and performance of the proposed protocol, this paper also reports the experimental evaluation of our protocol in a network of resource-limited sensor nodes, which shows its efficiency in practice. In particular, extensive security analysis shows that our protocol is provably secure.

MEECDA: Multihop Energy Efficient Clustering and Data Aggregation Protocol for HWSN

Wireless sensor network consists of large number of inexpensive tiny sensors which are connected with low power wireless communications. Most of the routing and data dissemination protocols of WSN assume a homogeneous network architecture, in which all sensors have the same capabilities in terms of battery power, communication, sensing, storage, and processing. However the continued advances in miniaturization of processors and low-power communications have enabled the development of a wide variety of nodes. When more than one type of node is integrated into a WSN, it is called heterogeneous. Multihop short distance communication is an important scheme to reduce the energy consumption in a sensor network because nodes are densely deployed in a WSN. In this paper M-EECDA (Multihop Energy Efficient Clustering & Data Aggregation Protocol for Heterogeneous WSN) is proposed and analyzed. The protocol combines the idea of multihop communications and clustering for achieving the best performance in terms of network life and energy consumption. M-EECDA introduces a sleep state and three tier architecture for some cluster heads to save energy of the network. M-EECDA consists of three types of sensor nodes: normal, advance and super. To become cluster head in a round normal nodes use residual energy based scheme. Advance and super nodes further act as relay node to reduce the transmission load of a normal node cluster head when they are not cluster heads in a round.

A survey on architectures, protocols, applications, and management in wireless sensor networks

With the recent technological advances in wireless communications, integrated digital circuits, and micro electro mechanical systems (MEMS); development of wireless sensor networks has been enabled and become dramatically feasible. Wireless sensor networks (WSNs) are large networks made of a numerous number of sensor nodes with sensing, computation, and wireless communications capabilities. Many various routing, power management, and data dissemination protocols have been designed for wireless sensor networks (WSNs) dependent on both the network architecture and the applications that it is designed for. In this paper, we present the state of the art of wireless sensor networks' architecture and design features. Also, in this paper, we introduce recent work on routing protocols for WSNs and their design goals and challenges. Also, an overview of the application that WSNs assist in is presented. Finally, several open research questions of wireless sensor networks management and issues are suggested and put forward.

An Analysis of Energy Optimization algorithm in Wireless Sensor Network

Wireless sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. Routing protocols in WSNs might differ depending on the application and network architecture. In this article we present a survey of state- of-the-art routing techniques in WSNs. We first outline the design challenges for routing protocols in WSNs followed by a comprehensive survey of routing techniques. Overall, the routing techniques are classified into three categories based on the underlying network structure: flit, hierarchical, and location-based routing. Furthermore, these protocols can be classified into multipath-based, query-based, negotiation-based, QoS- based, and coherent-based depending on the protocol operation. We study the design trade-offs between energy and communication overhead savings in every routing paradigm. We also highlight the advantages and performance issues of each routing technique. The article concludes with possible future research areas. Keyword: Quality of service, QOS-based protocol, Coherent based protocol, Routing protocol and Wireless Sensor Network

Analysis of Acceleration Effect in Data Dissemination in Vehicular Networks Using Rateless Codes

Mobility models of nodes have an important role in the evaluation of data dissemination protocols in vehicular ad hoc networks (VANETs). Many recent researches have used the constant velocity mobility models while vehicles have acceleration and their speeds change as they move. Because of the dynamic nature of VANETs, the network changes from a densely connected to the sparsely connected environment in a short time. In sparsely connected networks, it is said that vehicles move in clusters. In this paper, the constant acceleration mobility calculations for the sparsely connected network and its characteristics have been presented. These characteristics are usable for the evaluation of the data dissemination protocols in VANETs. The results show that acceleration affects the number of viewed clusters during the trip and the number of vehicles within a cluster. In fact, acceleration has a significant impact on the network sparsely connection. This matter shows that the appropriate data dissemination protocol should be used to study the acceleration effect which is applicable in sparse networks. The analysis in this research provides the necessary background for better understanding and accurate calculations for the evaluation of data dissemination in VANETs.

A scalable data dissemination protocol for both highway and urban vehicular environments

Vehicular ad hoc networks (VANETs) enable the timely broadcast dissemination of event-driven messages to interested vehicles. Especially when dealing with broadcast communication, data dissemination protocols must achieve a high degree of scalability due to frequent deviations in the network density. In dense networks, suppression techniques are designed to prevent the so-called broadcast storm problem. In sparse networks, protocols incorporate store-carry-forward mechanisms to take advantage of the mobility of vehicles to store and relay messages until a new opportunity for dissemination emerges. Despite numerous efforts, most related works focus on either highway or urban scenarios, but not both. Highways are mostly addressed with a single directional dissemination. For urban scenarios, protocols mostly concentrate on either using infrastructure or developing methods for selecting vehicles to perform the store-carry-forward task. In both cases, dense networks are dealt with suppression techniques that are not optimal for multi-directional dissemination. To fill this gap, we present an infrastructure-less protocol that combines a generalized time slot scheme based on directional sectors and a store-carry-forward algorithm to support multi-directional data dissemination. By means of simulations, we show that our protocol scales properly in various network densities in both realistic highway and urban scenarios. Most importantly, it outperforms state-of-the-art protocols in terms of delivery ratio, end-to-end delay, and number of transmissions. Compared to these solutions, our protocol presents up to seven times lower number of transmissions in dense highway scenarios.

LEACH Routing Algorithm Optimization through Imperialist Approach

Routing is an important challenge in WSN due to the presence of hundreds or thousands of sensor nodes. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical routing and data dissemination protocol. LEACH divides a network domain into several sub-domains that are called clusters. Non-uniformity of cluster distr ibution and cluster heads (CHs) selection without considering the positions of other sensors may reduce the quality of cluster selection. Sensor nodes send data packets over long distances. Imperialist Competitive Algorithm (ICA) is an optimization algorithm inspired by social phenomenon. It considers colonization process as a stage of socio-political evolution. We improve performance of the LEACH algorithm using imperiali st approach and study its efficacy in terms of energy consumption, coverage and cluster uniformity and compare with those of the LEACH algorithm. Selection of suitable value for radio communication radius over the network lifetime is a trade-off between connectivity and sensors energy consumption. Empowering LEACH with ICA helps to find the best location of a CH in every cluster, conserve energy significantly, increase network lif etime, and maintain network connectivity. It can significantly reduce the number of active sensors going out of range over the lifetime of a network.

A Secure and Energy Efficient Data Dissemination Protocol for Wireless Sensor Networks.

Data dissemination is important concept in wireless sensor networks (WSN). In this paper, we propose a secure and energy efficient data dissemination protocol for WSN. A routing metric is defined to choose the best route from the available routes. This metric guides those routes to be chosen that consume less energy. Moreover, for secure data dissemination, a session key is established between different parties to be communicated. This session key is then used for secure communication among nodes for data dissemination. The performance of proposed protocol is evaluated using NS-2 simulator with respect to the metrics like control overhead, network lifetime, and throughput. It is found that the proposed protocol is quite effective in comparison to the existing protocols with respect to these metrics.

Secrecy-Enhanced Data Dissemination Using Cooperative Relaying in Vehicular Networks

Due to the potentials in promoting the driving safety and easing the traffic congestion, vehicular networks, especially vehicle-to-vehicle (V2V) communications, have recently been receiving much attention. The data dissemination protocol for V2V applications should not only provide end-to-end transmissions with low error probability and high throughput but also offer antieavesdropping capabilities. To achieve this goal, we in this paper propose a secrecy-enhanced relaying protocol for vehicular environments. Based on the network topology and the velocity of the moving vehicles, the proposed scheme first generates the relay candidate set, from which a single relay is then selected opportunistically to assist the source. By using the superposition coding strategy, the selected relay jointly sends the source message and the artificial interference to enable secure communications. We derive the tight closed-form expressions for the upper and lower bounds of the secrecy outage probability, based on which we analyze the diversity order of the system. The method to generate the interference signal is introduced, and the choice of superposition weight factor is also given. The analytical and simulation results show that the proposed relay-aided protocol yields a better performance than the competing alternatives in terms of both the secrecy performance and the implementation complexity.

An Efficient Data Dissemination Protocol with Roadside Parked Vehicles' Assistance in Vehicular Networks

Data dissemination is a challenging problem in vehicular ad hoc networks (VANETs) due to the characteristics of VANETs such as highly dynamic topology, intermittent connectivity, and the road-constrained mobility. Observed from the fact that on-street parking is a common phenomenon in the city, the parked vehicles at roadside can also contribute their resources to the communications in network. In this paper, an efficient data dissemination protocol (EDP) for VANETS is proposed. Different from the existing works which consider mainly mobile vehicles or some expensive roadside infrastructure, EDP leverages the resources of parked vehicles at roadside to help in forwarding data. EDP groups the parked vehicles at roadside into a cluster, which buffers and relays data from mobile vehicles and manages the duplicates of data. Simulation results based on a real city map show that EDP achieves a higher delivery ratio and lower delivery delay.