Energy Cost Of Data Transmission Research Articles

Energy-Efficient Resource Allocation and User Scheduling for Collaborative Mobile Clouds With Hybrid Receivers

In this paper, we study the resource allocation and user scheduling algorithm for minimizing the energy cost of data transmission in the context of OFDMA collaborative mobile cloud (CMC) with simultaneous wireless information and power transfer (SWIPT) receivers. The CMC, which consists of several collaborating MTs offers one potential solution for downlink content distribution and for the energy consumption reduction at the terminal side. Meanwhile, as RF signal can carry both information and energy simultaneously, the induced SWIPT has gained much attention for energy efficiency design of mobile nodes. Previous work on the design of CMC system mainly focused on the cloud formulation or energy efficiency investigation, while how to allocate the radio resource and schedule user transmission lacks attention. With the objective to minimize the system energy consumption, an optimization problem which jointly considers subchannel assignment, power allocation and user scheduling for a group of SWIPT receivers has been presented. The formulated problem is addressed through the convex optimization technique. Simulation results demonstrate that the proposed user scheduling and resource allocation algorithms can achieve significant energy saving performance.

On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms

In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, it is important to collect these data efficiently, that is, to reduce the energy cost of data transmission. Under such applications, a tree is usually adopted as the routing structure to save the computation costs for maintaining the routing tables of sensors. In this paper, we work on the problem of constructing a data aggregation tree that minimizes the total energy cost of data transmission in a wireless sensor network. In addition, we also address such a problem in the wireless sensor network where relay nodes exist. We show these two problems are NP-complete, and propose O(1)-approximation algorithms for each of them. Simulations show that the proposed algorithms each have good performance in terms of the energy cost.

On the Construction of Data Aggregation Tree With Maximizing Lifetime in Large-Scale Wireless Sensor Networks

Data aggregation protocols are generally utilized to extend the lifetime of sensor networks by reducing the communication cost. Traditionally, tree-based structured approaches that are a basic operation for the sink to periodically collect reports from all sensors were concerned about many applications. Since the data aggregation process usually proceeds for many rounds, it is important to collect these data efficiently, that is, to reduce the energy cost of data transmission. Under such applications, a tree is usually adopted as the routing structure to save the computation costs when maintaining the routing tables of sensors. In our previous work, we have demonstrated that multiple trees, as well as split trees, can provide additional lifetime extensions when certain nodes are deployed in a wireless sensor network. In this paper, we explore how the number of the family-set of trees influences the lifetime gain, and we work on the problem of constructing data aggregation trees that minimizes the total energy cost of data transmission under diverse set of scenarios and network query region. Through dividing query area, the sensory and aggregation data have been returned through a number of different forwarding trees within each sub query area, which reduces the network hot spots. To evaluate the performance of the proposed approach, we have compared and analyzed an angular division routing algorithm and query region division routing with LEACH. Theoretical and experimental results illustrate that the query region division algorithm based on angle leads to lower energy cost in comparison with the models reported in the literature.

Clustering Based Optimal Data Storage Strategy Using Hybrid Swarm Intelligence in WSN

In most wireless sensor network applications a large amount of data has been continuously collected for future data query and analysis. Data storage management becomes an important challenge in wireless sensor networks. A popular application of sensor networks is event monitoring. In such applications, the observers may not be interested in the sensors or the raw data from the sensors, but more interested in the events. To address the issues of data storage for event monitoring, an optimal data storage scheme is proposed specifically for Fire detection event. In this work, mainly storage node position problem is considered. Hybrid particle swarm optimization is integrated with FCM clustering to attain the suitable positions for k storage nodes in WSN based on the energy cost of data transmission which in turn assists in the detection of the fire event. To reduce data access energy consumption, FCM clustering based on data storage (CBDS) algorithm has been proposed. CBDS has appropriately adapted to adjust the location of data storage through the process of data storage and query access cost calculations respectively. This paper is focused on monitoring the fire event detection in WSN based on the hybrid PSO with FCM clustering.

Hybrid swarm intelligence optimization approach for optimal data storage position identification in wireless sensor networks.

The current high profile debate with regard to data storage and its growth have become strategic task in the world of networking. It mainly depends on the sensor nodes called producers, base stations, and also the consumers (users and sensor nodes) to retrieve and use the data. The main concern dealt here is to find an optimal data storage position in wireless sensor networks. The works that have been carried out earlier did not utilize swarm intelligence based optimization approaches to find the optimal data storage positions. To achieve this goal, an efficient swam intelligence approach is used to choose suitable positions for a storage node. Thus, hybrid particle swarm optimization algorithm has been used to find the suitable positions for storage nodes while the total energy cost of data transmission is minimized. Clustering-based distributed data storage is utilized to solve clustering problem using fuzzy-C-means algorithm. This research work also considers the data rates and locations of multiple producers and consumers to find optimal data storage positions. The algorithm is implemented in a network simulator and the experimental results show that the proposed clustering and swarm intelligence based ODS strategy is more effective than the earlier approaches.

Spatial–temporal compression and recovery in a wireless sensor network in an underground tunnel environment

In an exciting new application, wireless sensor networks (WSNs) are increasingly being deployed to monitor the structure health of underground subway tunnels, promising many advantages over traditional monitoring methods. As a result, ensuring efficient data communication, transmission, and storage have become a huge challenge for these systems as they try to cope with ever increasing quantities of data collected by ever growing numbers of sensor nodes. A key approach of managing big data in WSNs is through data compression. Reducing the volume of data traveling between sensor nodes can reduce the high energy cost of data transmission, as well as save space for storage of big data. In this paper, we propose an algorithm for the compression of spatial---temporal data from one data type of sensor node in a WSN deployed in an underground tunnel. The proposed algorithm works efficiently because it considers temporal as well as spatial features of sensor data. A recovery process is required for recovering the data with a close approximation to the original data form nodes. We validate the proposed recovery technique through computational experiments carried out using the data acquired from a real WSN.

An efficient UE cluster head selection algorithm in wireless sensor networks and cellular networks

Wireless Sensor Networks (WSNs) have been applied in many different areas. Energy efficient algorithms and protocols have become one of the most challenging issues for WSN. Many researchers focused on developing energy efficient clustering algorithms for WSN, but less research has been concerned in the mobile User Equipment (UE) acting as a Cluster Head (CH) for data transmission between cellular networks and WSNs. In this paper, we propose a cellular-assisted UE CH selection algorithm for the WSN, which considers several parameters to choose the optimal UE gateway CH. We analyze the energy cost of data transmission from a sensor node to the next node or gateway and calculate the whole system energy cost for a WSN. Simulation results show that better system performance, in terms of system energy cost and WSNs life time, can be achieved by using interactive optimization with cellular networks.