Energy-efficient Data Dissemination Research Articles

SEEDI: Sink-Mobility-Based Energy-Efficient Data Dissemination in the Internet of Medical Things

SEEDI: Sink-Mobility-Based Energy-Efficient Data Dissemination in the Internet of Medical Things

A novel and optimized computational framework for energy efficient data dissemination in wireless sensor network

Wireless sensor network (WSN) is an integral part of internet-of-things (IoT), where a large scale of data transmission and various complex services are identified to be delivered. In order to facilitate these services, energy efficiency is one critical demand for resource-constraint sensor nodes. Carrier sense multiple access (CSMA) has been considered for effective traffic management for high-end data delivery services. A review of existing literature on CSMA-based schemes shows that it has not yet achieved an optimal case of energy efficiency. Hence, the proposed study presents a novel computational framework in order to address this research gap. The prime contribution of the proposed study is towards presenting an optimal computational model for maximized fairness in data dissemination services in WSN especially focusing on energy efficiency. The presented study model also contributes towards optimizing route buffer and buffer power, which facilitates towards availability of energy-efficient path information. The study also introduces a mobile auxiliary node that aggregates the data from sensor nodes and delivers it to the sink node considering dynamic location updates for seamless transmission. Scripted in MATLAB, the proposed scheme exhibited 70% energy saving compared to conventional schemes of CSMA in WSN.

Toward Green Communication in 6G-Enabled Massive Internet of Things

The sixth generation (6G) is envisioned to be a spawned key technology that will support the ubiquitous and seamless connection of a massive number of Internet-of-Things (IoT) devices. The extremely high data rate, low end-to-end delay, high mobility of IoT devices propel the desideratum of extenuating the concern of reducing the energy consumption, i.e., green communication. Hence, in this article, we address the concern of green communication in 6G-enabled massive IoT devices by following the cluster-based data dissemination in the network. We propose a novel hybrid whale spotted hyena optimization (HWSHO) algorithm by synthesizing the whale optimizer algorithm (WOA) with exploitation capabilities of spotted hyena optimizer (SHO). We perform a simulation experimental study that shows the supreme performance of our proposed technique over the most recent proposed energy-efficient data dissemination methods. The proposed technique is an exemplary solution that could be pertinent to various hostile applications seeking green communication of 6G-enabled IoT devices.

Energy Efficient Two-Tier Data Dissemination Based on Q-Learning for Wireless Sensor Networks

Green communication for different kinds of wireless networks has begun to receive significant research attention recently. Green communication focuses mainly on the issue of improving energy efficiency substantially. A wireless sensor network (WSN) consists of a large number of randomly and widely deployed sensor nodes, and these nodes themselves have the ability to wireless communicate, detect and process data. Sensor nodes can thus detect their surrounding environment, and transmit related data to a sink via wireless communication. This study proposes two two-tier data dissemination schemes based on Q-learning for wireless sensor networks. In the proposed schemes, a source node uses Q-learning to find the most energy efficient data dissemination path from the source node to the sink. The first scheme is called TTDD-QL, and the second scheme is called TTDD-QL-A which is an advanced version of TTDD-QL. In TTDD-QL, the reward is determined by the distance between the current dissemination node and the sink. In each iteration, the proposed scheme will update the Q values. After multiple learning iterations, the Q values are converged, and the data dissemination path is found according to the Q values. In TTDD-QL-A, the reward is determined not only by the distance between the current dissemination node and the sink but also by the remaining energy of the current dissemination node. Simulation results show that TTDD-QL and TTDD-QL-A can reduce sensor node energy consumption and extend the lifetime of the WSN.

Energy Efficient and Secured Data Dissemination in Wsn

Data dissemination is a high level application service, provided to WSN to update the configuration parameter to make the node perform intended services. The configuration parameters of the nodes are updated by means of reprogramming and reconfiguration through over air programming. In data dissemination, the data are so sensitive that even a small change in a data will lead to data corruption and nodes will not perform intended services. In most of the existing systems, providing energy efficient secured data dissemination is a major concern. The attackers can interrupt the process data dissemination and launch various types of attacks, In-order to overcome these challenges. In this paper, a novel Secure Based Dissemination protocol is proposed which can provide energy efficient data dissemination. The proposed protocol ensures better authentication during data dissemination. The proposed protocol is implemented in NS2 simulator. Simulation results justifies that, proposed protocol output forms the existing techniques and has better Packet Delivery Ratio, throughput , network life time, energy consumption, end to end delay and routing overhead .

Energy-efficient data dissemination algorithm based on virtual hexagonal cell-based infrastructure and multi-mobile sink for wireless sensor networks

In a wireless sensor network, reducing the energy consumption of sensor nodes and increasing energy conservation can be considered as two significant factors to prolong the network longevity. In this scheme, we proposed an energy-efferent data dissemination algorithm for the sensor nodes by making a virtual hexagonal cell-based infrastructure and multi-mobile sink to create a balance in energy consumption and to mitigate the energy-hole problem. The basic idea of the algorithm is to provide the ability for some of the sensing nodes that are elected by the virtual hexagonal backbone to inform other sensing nodes about the latest location of the nearest mobile sinks to decrease the overhead of updating the mobile sink location for the sensing nodes. Moreover, the sensor nodes can benefit considerably from these specified nodes as a relay node in the multi-hop routing process to send the data to the closest mobile sink based on the latest sink position information, which in turn leads to high energy conservation and low communication overhead between the sensing nodes and the mobile sinks in the network. According to the simulation results, the performance of the proposed scheme is better than the existing data transmission approaches in terms of total energy consumption, delay, and network longevity.

Energy-efficient data dissemination strategy for roadside infrastructure in VCPS

In vehicular cyber-physical system (VCPS), beaconing mechanism is commonly deployed for the solar-powered roadside infrastructure to detect available passing-by vehicles for data dissemination. The traditional beaconing mechanism would cause a higher energy consumption due to the periodical beaconing procedure. To tackle this problem, we propose a new data dissemination strategy for roadside infrastructures by adjusting the beaconing interval to reduce the energy consumption. We model the beaconing procedure as a Markov model by observing the periodical beaconing results and then using the modeling result to obtain the relationship between the beaconing interval and the expectation of the single-vehicle discovery time. Then, with the average data transmission rate requirement, we can calculate the maximum beaconing interval. We also introduce a satisfaction degree based on the Sigmoid function to combine the decreased energy consumption and the decreased data rate. The satisfaction degree function allows the roadside infrastructure to obtain the optimal beaconing interval based on the required quality of service. The analysis of the results show that careful tuning of key parameters leads to improved energy efficiency and increased data rate of the data dissemination strategy.

Energy Efficient Data Dissemination in Multi-UAV Coordinated Wireless Sensor Networks

With the requirement of better connectivity and enhanced coverage, collaborative networks are gaining a lot of popularity these days. One of such collaborative networks is formed between the wireless sensor networks (WSNs) and the unmanned aerial vehicles (UAVs). WSNs comprise static nodes arranged in a flat grid topology which may be randomly deployed or by some particular distribution. With the sensors operating on batteries, WSNs face a crucial issue of energy depletion during network operations. Integration of WSNs with UAVs can provide a solution to this excessive utilization of energy resources. UAVs provide a maneuvering support by playing a pivotal role of a manager node in these networks. However, integration of these networks demands an improved approach for data dissemination for effective utilization of network resources. For this, we propose a new data dissemination approach, which utilizes the attraction properties of fire fly optimization algorithm to provide energy efficient relaying. The proposed approach provides continuous connectivity, better lifetime, and improved coverage in the UAV coordinated WSNs. The performance of the proposed model is presented in terms of significant gains attained for parameters, namely, throughput, coverage, mean hops, lifetime, and delays, in comparison with the EEGA, ERIDSR, and I-ERIDSR approaches.

SECURE AND PRIVACY PRESERVING DATA CENTRIC SENSOR NETWORKS WITH MULTI-QUERY OPTIMIZATION

In large-scale Wireless Sensor Networks the effective use of the vast amounts of data gathered will require scalable, selforganizing, and energy-efficient data dissemination and data retrieval techniques. Data Centric Sensor (DCS) networks is a better approach in which the sensor nodes send the sensed data to a designated sensor node whose name is associated with sensed data. However, due to unattended nature of Wireless Sensor Networks, these sensor nodes are susceptible to different types of attacks. The attacker may compromise these storage nodes and get data of his interest. In this paper we propose a Secure and Privacy Preserving Data Centric Sensor Networks that includes security and privacy support to DCS networks. We use multi level key structure and cryptographic algorithms to provide security. In addition, we propose a multi-query optimization technique that aggregates similar queries for a small periodic time and construct a query message. This reduces the number of messages required to serve multiple similar queries. Simulation and experimental results show that our work provides a secure privacy preserving data centric sensor network based on cryptographic keys and reduces the message overhead and incurs a minimum communication cost compared to previous works

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.

An Energy-Efficient Data Dissemination Scheme in Large-Scale Wireless Sensor Networks

In wireless sensor networks, due to limited energy, how to disseminate the event data in an energy-efficient way to allow sinks quickly querying and receiving the needed event data is a practical and important issue. Many studies about data dissemination have been proposed. However, most of them are not energy-efficient, especially in large-scale networks. Hence, in this paper the authors proposed an energy-efficient data dissemination scheme in large-scale wireless sensor networks. First, the authors design a data storage method which disseminates only a few amount event data by dividing the network into regions and levels, and thus reducing the energy consumption. Then, the authors develop an efficient sink query forwarding strategy by probability analysis so that a sink can query events easily according to its location to reduce the delay time of querying event data, as well as energy consumption. In addition, a simple and efficient maintenance mechanism is also provided. The simulation results show that the proposed scheme outperforms TTDD and LBDD in terms of the energy consumption and control overhead.

Metadata-guided evaluation of resource-constrained queries in content caching based wireless networks

Recent years have witnessed the emergence of data-centric storage that provides energy-efficient data dissemination and organization in mobile wireless environments. However, limited resources of wireless devices bring unique challenges to data access and information sharing. To address these challenges, we introduce the concept of content caching networks, in which the collected data will be stored by its contents in a distributed manner, while the data in the network is cached for a certain period of time before it is sent to a centralized storage space for backup. Furthermore, we propose a metadata-guided query evaluation approach to achieve query efficiency in content caching networks. By this approach, each cache node will maintain the metadata that summarizes the data content on itself. Queries will be evaluated first on the metadata before on the cached data. By ensuring that queries will only be evaluated on relevant nodes, the metadata-guided query evaluation approach can dramatically improve the performance of query evaluation. We design efficient algorithms to construct metadata for both numerical and categorical data types. Our theoretical and empirical results both show that our metadata-guided approach can accelerate query evaluation significantly, while achieving the memory requirements on wireless devices.

무선 센서 네트워크에서 이동 싱크 그룹을 위한 에너지 효율적인 데이터 전달 프로토콜

최근 무선 센서 네트워크에서, 이동 싱크 그룹에 효과적으로 데이터를 전송하기 위한 데이터 전달이 제안되었다. 이동 싱크 그룹은 다수의 싱크들이 센서 필드를 함께 움직이면서 센서로부터 정보를 수집하여 임무를 수행하는 특성을 갖는다. 제안된 그룹 통신 프로토콜들은 주로 플러딩 기술을 이용하여 데이터 전송을 보장하는 메커니즘이다. 하지만 이러한 플러딩 기반 연구들은 이동 싱크 그룹 영역에 존재하는 모든 센서 노드들이 데이터의 전송에 참여하여야 하며, 또한 이동 싱크 그룹 영역에 비례하여 무선 센서 네트워크의 에너지 소비가 증가하는 문제점이 있다. 본 논문에서는 이러한 플러딩 문제를 해결하기 위하여 효율적인 데이터 전송 기법을 제안한다. 이동 싱크 그룹이 위치하는 지역에 가상 구조 '데이터 파이프'를 구축하여, 소스 노드와 이동 싱크 그룹 간의 데이터 전송을 위한 랑데부 지역으로 이용함으로써 센서 노드의 에너지 소비를 줄이고자 한다. 본 논문에서 제안된 방안이 기존의 플러딩을 기반으로 하는 그룹 통신 프로토콜에 비하여 에너지 소비 측면에서 월등히 우수하다는 것을 시뮬레이션을 통하여 제시하였다. In wireless sensor networks, data dissemination protocols have been proposed for mobile sink groups that are characterized by geographically staying closely and collective movement. They usually exploit flooding technology for mobility supporting and data delivery guarantee. However, it causes the excessive energy consumption of all sensor nodes in the group region due to data delivery participation. Moreover, the costs of the flooding would become higher in proportional to the group region. In this paper, we propose an energy efficient data dissemination scheme that resolves these problems. The virtual infrastructure called a 'pipe' is used as a rendezvous area. A source delivers data to the pipe, from which member sinks in the group retrieve it directly. Simulation results showed that this solution has better performance than existing protocols in terms of energy consumption as it reduces the number of regional flooding and eliminates unnecessary data flooding.

Cluster-Based Communication for Mobile Sink Groups in Large-Scale Wireless Sensor Networks

SUMMARY In large-scale wireless sensor networks, in order to support group mobility of mobile sinks, this letter proposes a novel strategy for energy-efficient and robust data dissemination to the sinks based on cluster-based communication. The novel strategy is composed of two major mechanisms for reduction of structure construction overhead and routing state maintenance overhead: 1) a virtual infrastructure construction through grid-referred clustering and 2) inter-cluster communication by geographic routing relying on recursive location search. Based on the two major mechanisms, the strategy provides representative location management per sink group, distributed data collection, and per-cluster foot-print chaining in order to effectively adapt the traditional strategy for individual mobile sinks. Simulation results prove the proposed strategy shows better performances

A holistic sensor network design for energy conservation and efficient data dissemination

One important application of wireless sensor networks is to track mobile elements in the field, where the sensor network generally consists of a large number of sensor nodes deployed in an unattended environment and the sensor nodes are unlikely to be recharged. Redundant sensor nodes are often deployed to increase network robustness and extend network lifetime. There is a big challenge to distribute information and conserve energy in resource-constrained, densely populated sensor networks. Target and inquirer mobility brings further challenges to large-scale sensor networks. Frequent location updates for multiple inquirers and targets can drain the limited on-board energy excessively. We propose a holistic system design across media access control, network and application layers to optimize the performance of large-scale sensor networks by taking into account the interactions and tradeoffs between different design objectives. Our system includes a two-level node activity scheduling scheme for energy conservation and a scenario-aware data dissemination scheme to efficiently distribute query and event data and handle inquirer and target mobility. Furthermore, we analyze the system delay and introduce an adaptive scheduling scheme to reduce the initial sensing delay. The simulation results show that our system can save more than six times of the energy with reduced transmission delay and increased data delivery ratio.

A Reinforcement Learning Based Framework for Prediction of Near Likely Nodes in Data-Centric Mobile Wireless Networks

Data-centric storage provides energy-efficient data dissemination and organization for the increasing amount of wireless data. One of the approaches in data-centric storage is that the nodes that collected data will transfer their data to other neighboring nodes that store the similar type of data. However, when the nodes are mobile, type-based data distribution alone cannot provide robust data storage and retrieval, since the nodes that store similar types may move far away and cannot be easily reachable in the future. In order to minimize the communication overhead and achieve efficient data retrieval in mobile environments, we propose a reinforcement learning-based framework called PARIS, which utilizes past node trajectory information to predict the near likely nodes in the future as the best content distributee. Our framework can adaptively improve the prediction accuracy by using the reinforcement learning technique. Our experiments demonstrate that our approach can effectively and efficiently predict the future neighborhood.

An Authentic Key Management Scheme for Hierarchical Wireless Sensor Networks

Key Management is a critical security service in wireless sensor networks (WSNs). It is an essential cryptographic primitive upon which other security primitives are built. The most critical security requirements in WSNs include authentication and confidentiality. These security requirements can be provided by a key management but it is difficult due to the ad hoc nature, intermittent connectivity, and resource limitations of the sensor networks. In this paper we propose an authenticated key management (AKM) scheme for hierarchical networks based on the random key pre-distribution. Further, a secure cluster formation algorithm is proposed. The base station periodically refreshes the network key, which provides the following: a) the authenticated network communication, and b) a global and continuous authentication of each network entity. Multiple level of encryption is provided by using two keys: 1) a pair-wise shared key between nodes, and 2) a network key. The AKM scheme is more resilient to node capture as compared to other random key pre-distribution schemes. The proposed key management scheme can be applied for different routing and energy efficient data dissemination techniques for sensor networks.

SCODE: A Secure Coordination-Based Data Dissemination to Mobile Sinks in Sensor Networks

For many sensor network applications such as military, homeland security, it is necessary for users (sinks) to access sensor networks while they are moving. However, sink mobility brings new challenges to secure routing in large-scale sensor networks. Mobile sinks have to constantly propagate their current location to all nodes, and these nodes need to exchange messages with each other so that the sensor network can establish and maintain a secure multi-hop path between a source node and a mobile sink. This causes significant computation and communication overhead for sensor nodes. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. In this paper, we propose a secure and energy-efficient data dissemination protocol — Secure COodination-based Data dissEmination (SCODE) — for mobile sinks in sensor networks. We take advantages of coordination networks (grid structure) based on Geographical Adaptive Fidelity (GAF) protocol to construct a secure and efficient routing path between sources and sinks. Our security analysis demonstrates that the proposed protocol can defend against common attacks in sensor network routing such as replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Our performance evaluation both in mathematical analysis and simulation shows that the SCODE significantly reduces communication overhead and energy consumption while the latency is similar compared with the existing routing protocols, and it always delivers more than 90 percentage of packets successfully.

Sprinkler: A Reliable and Energy Efficient Data Dissemination Service for Extreme Scale Wireless Networks of Embedded Devices

We present Sprinkler, a reliable data dissemination service for wireless embedded devices which are constrained in energy, processing speed, and memory. Sprinkler embeds a virtual grid over the network whereby it can locally compute a connected dominating set of the devices to avoid redundant transmissions and a transmission schedule to avoid collisions. Sprinkler transmits O(1) times the optimum number of packets in O(1) of the optimum latency; its time complexity is O(1). Sprinkler is tolerant to fail-stop and state corruption faults. Thus, Sprinkler is suitable for resource-constrained wireless embedded devices. We evaluate the performance of Sprinkler in terms of the number of packet transmissions and the latency, both in an outdoor and indoor environment. The outdoor evaluation is based on data from project ExScal, which deployed 203 extreme scale stargazer (XSS). Our indoor evaluation is based on an implementation in the Kansei testbed, which houses 210 XSSs whose transmission power is controllable to even low ranges. We compare Sprinkler with the existing reliable data dissemination services, analytically or using simulations also. Our evaluations show that Sprinkler is not only energy efficient as compared to existing schemes, but also has less latency. Further, the energy consumption of nodes and the latency grows linearly as a function of newly added nodes as the network grows larger.

A robust and energy-efficient data dissemination framework for wireless sensor networks

Wireless sensor networks (WSNs) are appealing in obtaining fine-granular observations about the physical world. Due to the fact that WSNs are composed of a large number of low-cost and energy-const...