Data Gathering in Correlated Wireless Sensor Networks with Cooperative Transmission Data Gathering in Correlated Wireless Sensor Networks with Cooperative Transmission

2012 ◽  
pp. 944-966
Author(s):  
Laxminarayana S. Pillutla ◽  
Vikram Krishnamurthy

This chapter considers the problem of data gathering in correlated wireless sensor networks with distributed source coding (DSC), and virtual multiple input and multiple output (MIMO) based cooperative transmission. Using the concepts of super and sub modularity on a lattice, we analytically quantify as how the optimal constellation size, and optimal number of cooperating nodes, vary with respect to the correlation coefficient. In particular, we show that the optimal constellation size is an increasing function of the correlation coefficient. For the virtual MIMO transmission case, the optimal number of cooperating nodes is a decreasing function of the correlation coefficient. We also prove that in a virtual MIMO based transmission scheme, the optimal constellation size adopted by each cooperating node is a decreasing function of number of cooperating nodes. Also it is shown that, the optimal number of cooperating nodes is a decreasing function of the constellation size adopted by each cooperating node. We also study numerically that for short distance ranges, SISO transmission achieves better energy-mutual information (MI) tradeoff. However, for medium and large distance ranges, the virtual MIMO transmission achieves better energy-MI tradeoff.

Author(s):  
Laxminarayana S. Pillutla ◽  
Vikram Krishnamurthy

This chapter considers the problem of data gathering in correlated wireless sensor networks with distributed source coding (DSC), and virtual multiple input and multiple output (MIMO) based cooperative transmission. Using the concepts of super and sub modularity on a lattice, we analytically quantify as how the optimal constellation size, and optimal number of cooperating nodes, vary with respect to the correlation coefficient. In particular, we show that the optimal constellation size is an increasing function of the correlation coefficient. For the virtual MIMO transmission case, the optimal number of cooperating nodes is a decreasing function of the correlation coefficient. We also prove that in a virtual MIMO based transmission scheme, the optimal constellation size adopted by each cooperating node is a decreasing function of number of cooperating nodes. Also it is shown that, the optimal number of cooperating nodes is a decreasing function of the constellation size adopted by each cooperating node. We also study numerically that for short distance ranges, SISO transmission achieves better energymutual information (MI) tradeoff. However, for medium and large distance ranges, the virtual MIMO transmission achieves better energy-MI tradeoff.


2017 ◽  
Vol 13 (1) ◽  
pp. 155014771668484 ◽  
Author(s):  
Huthiafa Q Qadori ◽  
Zuriati A Zulkarnain ◽  
Zurina Mohd Hanapi ◽  
Shamala Subramaniam

Recently, wireless sensor networks have employed the concept of mobile agent to reduce energy consumption and obtain effective data gathering. Typically, in data gathering based on mobile agent, it is an important and essential step to find out the optimal itinerary planning for the mobile agent. However, single-agent itinerary planning suffers from two primary disadvantages: task delay and large size of mobile agent as the scale of the network is expanded. Thus, using multi-agent itinerary planning overcomes the drawbacks of single-agent itinerary planning. Despite the advantages of multi-agent itinerary planning, finding the optimal number of distributed mobile agents, source nodes grouping, and optimal itinerary of each mobile agent for simultaneous data gathering are still regarded as critical issues in wireless sensor network. Therefore, in this article, the existing algorithms that have been identified in the literature to address the above issues are reviewed. The review shows that most of the algorithms used one parameter to find the optimal number of mobile agents in multi-agent itinerary planning without utilizing other parameters. More importantly, the review showed that theses algorithms did not take into account the security of the data gathered by the mobile agent. Accordingly, we indicated the limitations of each proposed algorithm and new directions are provided for future research.


2011 ◽  
Vol 135-136 ◽  
pp. 205-210
Author(s):  
Hui Yong Yuan ◽  
Ze Ping Liu ◽  
Si Qing Yang

One critical issue in wireless sensor networks is how to gather sensed information in an energy-efficient way since the energy is a scarce resource in a sensor node. Cluster-based architecture is an effective architecture for data-gathering in wireless sensor networks. In this paper, by taking the nodes energy consumption into account, we first derive the optimal number of clusters for data gathering in sensor networks. To balance the cluster heads energy consumption, we propose a mixed communication modes where the cluster heads can transmit data to the base station in either single-hop or multi-hop. We then develop a data gathering method based on the optimal number of clusters and mixed communication modes. The simulation results show that the proposed method outperforms LEACH and HEED in terms of network lifetime by balancing energy dissipation.


2015 ◽  
Vol 26 (4) ◽  
pp. 1034-1048 ◽  
Author(s):  
Hongli Xu ◽  
Liusheng Huang ◽  
Chunming Qiao ◽  
Weichao Dai ◽  
Yu-e Sun

2017 ◽  
pp. 252
Author(s):  
Mohammed A. Abuhelaleh ◽  
Tahseen A. Al-Ramadin ◽  
Bassam A. Alqaralleh ◽  
Moha'med Al-Jaafereh ◽  
Khaled Almi'ani

Sign in / Sign up

Export Citation Format

Share Document