# A New Energy-Efficient Data Transmission Scheme Based on DSC and Virtual MIMO for Wireless Sensor Network

Authors: Na Li; Liwen Zhang; Bing Li
Journal: Journal of Control Science and Engineering
 (2015)

---

## Abstract

Energy efficiency in wireless sensor network (WSN) is one of the primary performance parameters. For improving the energy efficiency of WSN, we introduce distributed source coding (DSC) and virtual multiple-input multiple-output (MIMO) into wireless sensor network and then propose a new data transmission scheme called DSC-MIMO. DSC-MIMO compresses the source data using distributed source coding before transmitting, which is different from the existing communication schemes. Data compression can reduce the length of the data and improve the energy efficiency. In addition, DSC-MIMO does not require the cluster heads to collect the data of the source nodes, which reduces the frequencies of data transmission and saves energy. In the simulation, we analyze the energy consumption of DSC-MIMO. The results indicate that DSC-MIMO can effectively reduce the energy consumption and improve the energy efficiency of the whole wireless sensor network.


---

## Body

## 1. Introduction

In recent years, wireless sensor network (WSN) has achieved great progress with more and more new technology being applied to it, which improves the suitability and diversity of WSN application. However, the limiting energy of WSN nodes is still not solved and energy saving is still a major problem. Energy consumption in WSN is mainly caused by the communication of the nodes; thus reducing the communication node is the primary means for energy saving. Particularly, in large-scale WSN, communication energy consumption increases dramatically with the increasing communication distance. If a certain number of nodes prematurely deplete their energy, they will segment the network into a lot of islands, which can seriously affect the reliability of wireless sensor networks. In order to enhance the reliability of WSN, it is necessary to increase the density of nodes. However, the correlation of data collected by adjacent nodes also increases with the increasing density of nodes. These high relevant data are transferred directly to the data gather node (DGN), which seriously reduces the energy efficiency of WSN.Numerous studies indicate that virtual MIMO technology can effectively save energy consumption of nodes communication and extend the communication range [1]. The researchers have made a lot of excellent virtual MIMO communication scheme. Cui et al. proposed a model of virtual MIMO communication in single-hop wireless sensor networks with Alamouti coding [2]. They analyzed the energy consumption of the network and the data propagation delay and then compared the energy consumption of virtual MIMO with SISO’s in the same bit error rate requirement. Their research indicated that the virtual MIMO was more suitable than SISO in the long-distance data transmission according to energy efficiency and data transfer delay. Jayaweera analyzed the effect of the modulation constellation size, the transmission distance, the increasing control overhead of the training sequence, and delay performance of virtual MIMO in wireless sensor networks [3]. The research further proved that the virtual MIMO communication was more energy efficient than SISO communication and significantly reduced the transmission delay with selecting the appropriate parameters. V-BLAST space-time coding was introduced into the virtual MIMO communication by Jayaweera [4], which could avoid the cooperating encoding process of the transmitting nodes and further improve energy efficiency. Bravos and Kanatas analyzed and compared the energy consumption of virtual MIMO and multihop SISO [5]. The results showed that energy efficiency of the two methods depends on the density of network nodes, wireless channel condition, and the distance to the sink node. The virtual MIMO was better than multihop SISO in certain condition. Rafique et al. combined virtual MIMO and multicarrier modulation and analyzed the effect of different virtual MIMO communication modulation schemes. The research verified that the BPSK-WOFDM was a very useful and energy-efficient modulation scheme for high-speed virtual MIMO transmission [6]. Krunz et al. proposed a novel virtual MIMO communication strategy, called CMIMO (cooperative MIMO) [7], which involved clustering the WSN into several clusters, and each cluster was managed by two cluster heads (CHs): a master CH (MCH) and a slave CH (SCH). CMIMO achieves energy-efficient multihop transmission, by proper selection of the MCHs and SCHs, adaptation of the antenna elements and power in the intercluster communications phase, and using a cross-layer MIMO-aware route selection algorithm. The experimental results showed that CMIMO could significantly reduce energy consumption and extend the network lifetime. Nasim et al. proposed an energy-efficient hierarchical cooperative clustering scheme for wireless sensor networks [8]. According to this protocol, nodes cooperated to form clusters at each level of network hierarchy ensuring maximal coverage and minimal energy expenditure with relatively uniform distribution of load within the network. Simulation results indicated that this protocol could effectively reduce the number of hops in multihop transmission and achieve energy-saving purpose.These virtual MIMO communication schemes can save the communication energy consumption, but they cannot solve energy efficiency problem in high-density WSN caused by high correlation source data. Aiming at this problem, we introduce distributed source coding (DSC), which can compress the high correlation source data before sending, into the virtual MIMO-based WSN and then propose a new communication scheme, called DSC-MIMO, which can improve energy efficiency and reduce communication energy consumption significantly. DSC-MIMO is based on cooperative group (CG) and DSC. Each CG, composed of two correlative source nodes, compresses the source data using DSC firstly and then sends the compressed data directly through virtual MIMO link to the next hop receiver without forwarding data to the cluster head (CH), which can reduce forwarding times of source data and improve the energy efficiency.DSC is based on the theorem proved by Slepian and Wolf in the 1970s [9]. The fascinating aspect of DSC is that efficient compression of two or more sources can be achieved by separate encoding and joint decoding. Slepian and Wolf give lossless compression theoretical limit of DSC for two related sources using information entropy, called S-W limit. For example, there are two related sources, X1 and X2, which are separately encoded according to Slepian and Wolf theories with the code rates being, respectively, RX1 and RX2. The region of RX1 and RX2, as shown in Figure 1, is bounded by the following inequalities:(1)RX1≥HX1∣X2,RX2≥HX2∣X1,RX1+RX2≥HX1,X2.Figure 1
Rate region for Slepian-Wolf coding (two sources).Due to the good performance in low coding complexity, good rate-distortion, and error resilience, DSC has been the widespread concern of scholars. There have also been a lot of excellent DSC schemes, which can be roughly divided into two categories: asymmetric DSC and symmetric DSC.For asymmetric DSC scheme, the most representative is distributed source coding using syndromes (DISCUS) [10]. In DISCUS, one source transmits its syndromes to achieve data compression; another source sends its raw data directly as side information. At the receiving end, the decoder recovers the compressed data through joint decoding, using the received the side information and the syndromes. On the basis of DISCUS, researchers have proposed a number of asymmetric DSC schemes using turbo codes and low-density parity check (LDPC) [11–14].For asymmetric DSC scheme, the most representative is the scheme proposed by Sartipi [15]. In Sartipi’s scheme, two sources are encoded using LDPC firstly. Then one source sends its corresponding parity bits and only the first half of the information bits, and the other sends its corresponding parity bits and the second half of the information bits. The decoder recombines the two parts of information bits and then uses message passing decoding algorithm to recover the original data. Later, Sartipi extends this scheme to achieve a different code rate [16].


## 2. Network Model

Before describing how DSC-MIMO works, we set up a wireless sensor network with the following features.(i)
The study object of this paper is WSN with high node density and large scale, which uses clustering approach to management and data collected by nodes of the same cluster are high correlation so that they can be compressed through DSC.(ii)
The data collected by network nodes are finally gathered together at the data gather node (DGN), which is a dual-antenna sending and receiving end with enough energy and a powerful processor.(iii)
All of the network nodes are evenly distributed in the assigned area in which any two neighbor nodes can form a virtual dual-antenna system and the wireless channel between the nodes is symmetric.(iv)
The maximum transmission power of each node is defined asPmax⁡. During communication, the nodes can adjust their communication distance by adjusting the transmission power.


## 3. The DSC-MIMO

DSC-MIMO clusters the wireless sensor network into several clusters and its clustering process is similar to CMIMO [7]. In the clustering process, the master cluster heads (MCHs) are generated through election and then, respectively, choose vice cluster heads (VCHs) from their neighbors. In DSC-MIMO, MCHs divide the source nodes into several cooperative groups, and each group, consisting of two adjacent source nodes, plays the role of a virtual dual-antenna transmitter, which can transmit the source data directly; VCH and MCH are always seen as a cooperative group, called master cooperative group (MCG), which can receive and forward the data from CGs of other clusters. MCGs are the foundation of multihop virtual MIMO transmission. After the clustering is completed, DSC-MIMO starts to build the routing table for the entire network. The routing table building algorithm of DSC-MIMO, similar to CMIMO, is based on Dijkstra algorithm, which can build the shortest routing path for each cluster. Then, DSC-MIMO officially enters periodic communication process. A communication cycle is divided into six phases: source nodes perception phase, cooperative groups’ allocation phase, intercluster communication resource allocation phase, broadcasting cooperative group allocation table phase, intracluster communication phase, and intercluster communication phase, which is shown in Figure 2.Figure 2
A communication cycle of DSC-MIMO.In source nodes perception phase, the source nodes of a cluster send “Data Coming” message to the MCH at different time slots through a competitive manner, telling the MCH their own IDs, locations, residual energy, and so on. If MCH or VCH is also the source node, it will participate in the coming cooperative groups allocation phase and constitute CGs with other general source nodes. However, it does not undermine the MCG which always exists. When MCG has to forward data from CGs of other clusters, it will be allocated the appropriate communication resources to finish the same communication process like the general CGs.In cooperative group allocation phase, MCH divides source nodes into several groups according to the cooperative group allocation algorithm proposed in this paper and then allots time slots for intracluster communication to each CG. When the allocation process completes, MCH generates a cooperative group allocation table which contains the group information and time slots allocation information for intracluster communication. Due to the randomness of locations and number of the source nodes in the cluster, there may be some source nodes which could not be assigned to any cooperative groups. If this happens, the source nodes without CGs will abandon this communication cycle and wait the new cycle coming. If MCH does not generate cooperative group allocation table, all the nodes in addition to the MCG of this cluster will give up this communication cycle and go into sleeping state.In intercluster communication resource allocation phase, the MCHs, having the cooperative group allocation table, start to apply intercluster communication slots for each CG according to routing table established before. Every MCH, using CSMA/CA, sends “Channel Request” message to the next hop MCH to request time slots for intercluster communication. “Channel Request” message contains the number of CGs and the occupied time slots. The MCHs, receiving the “Channel Request” message, allocate the intercluster communication resource on the basis of minimum energy consumption and reply with “Channel Response” message. “Channel Response” message contains the information of the assigned time slots. After the data exchange, each MCH establishes an intercluster communication resource allocation table for its own CGs. If a CG is not assigned time slot, the MCH will remove it from the cooperative group table. After that, MCH updates cooperative group allocation table, based on the intercluster communication resource allocation table and the routing table. Then cooperative group allocation table contains group information, intracluster communication resource allocation table, intercluster communication resource allocation table, and the routing information for next hop.In broadcasting cooperative group allocation table phase, every MCH broadcasts the table to its source nodes. According to information on the table, all the nodes, assigned cooperative groups, enter into the intracluster communication phase; others give up this communication cycle and go into sleeping status until the next cycle coming.In intracluster communication phase, the source nodes form cooperative groups based on cooperative group allocation table and finish the DSC using the scheme proposed in [15]. For example, the two nodes in a CG are, respectively, X and Y that both have k bits source data to transmit. The encoding process of X is as follows: X is fed into a systematic LDPC encoder with a rate R1. At the output of the encoder, it sends the corresponding parity bits PX and only the first half of the information bits. This results in source encoding rate of RX=(k/2+PX)/k, which imposes the rate of the systematic LDPC code to be equal to R1=k/(k+PX)=1/(RX+1/2). The compression process of the source node Y is similar to that of X, with the modification that for the second source we send the second half of the information bits along with the corresponding parity bits. Since the compression rates of both sources are the same, the rates of the corresponding systematic LDPC codes are identical. Therefore, we only need to design a single LDPC code for compressing two correlated sources at the symmetric rate with DSC. After finishing the DSC, the two source nodes in each CG exchange the compressed data adopting RTS/CTS/ACK approach in the assigned time slot and complete space-time coding. During data exchange, the source nodes can adjust their transmit power according to the distance information in the table. On the one hand power adjustment can reduce the data collision, and on the other hand it can save energy. CGs, completing the space-time coding, go into sleeping state until the intercluster communication phase coming. The intracluster communication process of a CG is shown in Figure 3.Figure 3
The intracluster communication process of a CG.In intercluster communication phase, every CG establishes virtual MIMO link with the next hop MCG and completes source data transmission when the assigned time slot comes. MCG, receiving the source data, forwards it to its next hop MCG and realizes the multihop virtual MIMO transmission in the new communication cycle. Figure4 shows a multihop virtual MIMO transmission link to DGN in DSC-MIMO. CGs, completing the intercluster communication, are dissolved and the nodes go into sleeping state until the arrival of new cycle. When the MCGs received the compressed data from the ordinary CGs, they do not decompress the data and forward it to the next hop MCG directly. The compressed data will be decoded at the DGN using the same decoding method in [15].Figure 4
A two-hop virtual MIMO transmission of DSC-MIMO.From the analysis above, DSC-MIMO has an important feature that source nodes in a CG exchange the data with each other and compete the space-time coding in intracluster communication phase. The source data are transmitted once. However, the source data are transmitted twice for completing the space-time coding in most existing virtual MIMO communication strategies. Therefore, DSC-MIMO can reduce the energy consumption of intracluster communication and improve the energy efficiency. DSC-MIMO makes the CGs and their next hop MCGs form virtual MIMO links for intercluster communication, which is similar to CMIMO. In addition, the two related source nodes in a CG can use the simple and efficient DSC scheme proposed in [15] directly, which can compress the source data and improve the energy efficiency.CG is the basic communication unit for DSC-MIMO. How to allocate cooperative groups is an important problem. Therefore, cooperative group allocation algorithm will be discussed in detail below.


## 4. Cooperative Group Allocation Algorithm

CG is the most basic communication unit in DSC-MIMO, so how to divide CGs has a great impact on the performance of communication in WSN. The cooperative croup allocation algorithm proposed in this paper divides the source nodes according to two conditions: communication range and communication quality.


### 4.1. Communication Range

In order to ensure the coverage of the WSN, the nodes need to have a large range of data transmission. However, energy consumption will increase so quickly that the nodes will die early because of their limited energy if the communication range is excessive. In order to balance energy consumption and communication range, we set a maximum transmission powerPmax⁡ for every node. Correspondingly, the maximum communication range of a node is limited to dmax⁡.As the two nodes constructing a CG need to exchange data in intracluster communication phase to complete space-time coding, the distance between the two nodes cannot exceed the maximum communication rangedmax⁡. Then, we get first qualification for cooperative group allocation algorithm:(2)d≤dmax⁡,where d is the distance between two nodes consisting a CG; dmax⁡ is the maximum communication range of the nodes, which can be changed by setting the maximum transmission power Pmax⁡.


### 4.2. Communication Quality

With the limitation in energy, computing, volume, and so forth, it is very difficult for nodes to know the exact channel state information during communication, especially intercluster communication. Therefore, the cooperative group allocation algorithm generates the CGs with the purpose of ensuring the quality of the virtual MIMO communication in the condition of not knowing channel state information.A CG is a virtual dual-antenna transmitter, and its transmission data arex=[x1,x2]; the receiving MCG is a virtual dual-antenna receiver, and its receiving data are y=[y1,y2]. The relationship between x and y can be expressed as(3)y=Hx+n,where H is a 2×2 matrix, indicating virtual MIMO communication channel gains; n is a vector, representing the noise in the channel. The larger the H is, the better the virtual MIMO communication quality is. Therefore, the second qualification of cooperative group allocation algorithm is as follows:(4)max⁡⁡{H}.However,H is not known when the channel state information is unknown. Therefore, (4) cannot be directly applied. According to the cooperative node selection algorithm in [17], it is effective that selecting the farthest neighbor node as cluster head’s cooperative node to ensure the quality of the virtual MIMO communication when the channel state information is unknown. Therefore, we can get the equivalent form of (4):(5)max⁡⁡{H}⟺max⁡⁡d,where d is the distance between two nodes consisting a CG.


### 4.3. The Process of Cooperative Group Allocation

According to the above two conditions, MCH splits all sources’ nodes into groups. First, MCH randomly selects a source nodei. Then, MCH selects another source node j, whose distance to node i meets the conditions (1) and (4), to form a collaborative group with node i. If MCH cannot find the node j, node i will give up this collaborative group allocation phase. When MCH checks all of the source nodes, it can form a collaborative group allocation table. The execution of cooperative group allocation algorithm is shown in Algorithm 1.Algorithm 1:Cooperative group allocation algorithm.
(1)for all  i∈H  do  /*i represents a source node;
H represents all the source node
without traversal*/
(2)mark i as traversal, and update H;
(3)for all  j∈H  do   /*j represents a source node*/
(4)calculate the distance d between i and j;
(5)end for
(6)select the node k whose d satisfies Condition 1 and Condition 2;
/*Condition 1:d<dmax⁡;
Condition 2: max⁡{d}∘*/
(7)if  k not unique then
(8)     randomly select a node fromk and compose a CG with i;
(9)     store this CG in the allocation table;
(10)   mark this node as traversal, and updateH;
(11)else if  k unique then
(12)k and i compose a CG;
(13)   store this CG in the allocation table;
(14)   markk as traversal, and update H;
(15)else if  k none then
(16)   end this cycle;
(17)end if
(18)end for


## 4.1. Communication Range

In order to ensure the coverage of the WSN, the nodes need to have a large range of data transmission. However, energy consumption will increase so quickly that the nodes will die early because of their limited energy if the communication range is excessive. In order to balance energy consumption and communication range, we set a maximum transmission powerPmax⁡ for every node. Correspondingly, the maximum communication range of a node is limited to dmax⁡.As the two nodes constructing a CG need to exchange data in intracluster communication phase to complete space-time coding, the distance between the two nodes cannot exceed the maximum communication rangedmax⁡. Then, we get first qualification for cooperative group allocation algorithm:(2)d≤dmax⁡,where d is the distance between two nodes consisting a CG; dmax⁡ is the maximum communication range of the nodes, which can be changed by setting the maximum transmission power Pmax⁡.


## 4.2. Communication Quality

With the limitation in energy, computing, volume, and so forth, it is very difficult for nodes to know the exact channel state information during communication, especially intercluster communication. Therefore, the cooperative group allocation algorithm generates the CGs with the purpose of ensuring the quality of the virtual MIMO communication in the condition of not knowing channel state information.A CG is a virtual dual-antenna transmitter, and its transmission data arex=[x1,x2]; the receiving MCG is a virtual dual-antenna receiver, and its receiving data are y=[y1,y2]. The relationship between x and y can be expressed as(3)y=Hx+n,where H is a 2×2 matrix, indicating virtual MIMO communication channel gains; n is a vector, representing the noise in the channel. The larger the H is, the better the virtual MIMO communication quality is. Therefore, the second qualification of cooperative group allocation algorithm is as follows:(4)max⁡⁡{H}.However,H is not known when the channel state information is unknown. Therefore, (4) cannot be directly applied. According to the cooperative node selection algorithm in [17], it is effective that selecting the farthest neighbor node as cluster head’s cooperative node to ensure the quality of the virtual MIMO communication when the channel state information is unknown. Therefore, we can get the equivalent form of (4):(5)max⁡⁡{H}⟺max⁡⁡d,where d is the distance between two nodes consisting a CG.


## 4.3. The Process of Cooperative Group Allocation

According to the above two conditions, MCH splits all sources’ nodes into groups. First, MCH randomly selects a source nodei. Then, MCH selects another source node j, whose distance to node i meets the conditions (1) and (4), to form a collaborative group with node i. If MCH cannot find the node j, node i will give up this collaborative group allocation phase. When MCH checks all of the source nodes, it can form a collaborative group allocation table. The execution of cooperative group allocation algorithm is shown in Algorithm 1.Algorithm 1:Cooperative group allocation algorithm.
(1)for all  i∈H  do  /*i represents a source node;
H represents all the source node
without traversal*/
(2)mark i as traversal, and update H;
(3)for all  j∈H  do   /*j represents a source node*/
(4)calculate the distance d between i and j;
(5)end for
(6)select the node k whose d satisfies Condition 1 and Condition 2;
/*Condition 1:d<dmax⁡;
Condition 2: max⁡{d}∘*/
(7)if  k not unique then
(8)     randomly select a node fromk and compose a CG with i;
(9)     store this CG in the allocation table;
(10)   mark this node as traversal, and updateH;
(11)else if  k unique then
(12)k and i compose a CG;
(13)   store this CG in the allocation table;
(14)   markk as traversal, and update H;
(15)else if  k none then
(16)   end this cycle;
(17)end if
(18)end for


## 5. Energy Consumption of DSC-MIMO

In order to analyze energy consumption of DSC-MIMO, we must establish energy consumption model of wireless sensor network node firstly. In data transmission, the total power consumption can be divided into two main components [2, 3, 7]: the power consumption of all the power amplifiers PPA and the power consumption of all other circuit blocks PC.P
PA can be expressed as(6)PPAd=1+αPoutd,where d is the distance of nodes; α is a factor related to the drain efficiency; Pout(d) can be calculated using the following formula:(7)Poutd=E-bRb4π2dkMlNfGtGrλ2,where k is the path loss; Gt and Gr are the antenna gains; λ is the wavelength; Ml is the link margin for compensating the hardware process variations and the other additive background noise or interference; Nf is the receiver noise figure; Rb is the bit rate; E-b is the average energy per bit required for a given bit-error rate (BER), which can be calculated using the following equation:(8)P-b=12NTNR1-11+2N0/E-bNTNR×∑k=0NTNR-112kNTNR-1+kk1+11+2N0/E-bk,where P-b is the given BER; NT and NR are the numbers of the sending node and the receiving node; N0 is the noise power density.P
C can be expressed as(9)PC≈NT(PDAC+Pmix+Pfilt)+2Psynth+NRPLNA+Pmix+PIFA+Pfilr+PADC,where PDAC, Pmix, PLNA, PIFA, Pfilt, Pfilr, PADC, and Psynth are the power consumption values for the digital-to-analog converter (DAC), the mixer, the low-noise amplifier (LNA), the intermediate frequency amplifier (IFA), the active filters at the transmitter side, the active filters at the receiver side, the analog-to-digital converter (ADC), and the frequency synthesizer, respectively.Finally, the total energy consumption per bit can be expressed as(10)Epbd=PPAd+PCRb.The energy consumption of DSC-MIMO focuses on the transmission of source data, which happens in intracluster communication phase and intercluster communication phase. Next, we use (9) to analyze the energy consumption of the two phases.


### 5.1. Intracluster Communication Phase

According to the previous description, the nodes, belonging to a CG, exchange their data after DSC using SISO mode. Therefore, the energy consumption for transmitting 1-bit original source data is(11)Epb_DSCSISOd=RDSCEpbdNT=NR=1,where RDSC is the compressing rate of DSC; we can set it the same as [15], 75%.


### 5.2. Intercluster Communication Phase

In the intercluster communication phase, every CG communicates with the next hop MCG through a 2 × 2 virtual MIMO link. Therefore, the energy consumption for transmitting 1-bit original source data is(12)EpbMIMO(d)=RbeffRb[Epb(d)NT=2,NR=2]RDSC,where Rbeff is the effective bit rate, which is expressed as(13)Rbeff=(F-pNT)FRb,where F is the block size of space-time coding and p is the training overhead factor.


## 5.1. Intracluster Communication Phase

According to the previous description, the nodes, belonging to a CG, exchange their data after DSC using SISO mode. Therefore, the energy consumption for transmitting 1-bit original source data is(11)Epb_DSCSISOd=RDSCEpbdNT=NR=1,where RDSC is the compressing rate of DSC; we can set it the same as [15], 75%.


## 5.2. Intercluster Communication Phase

In the intercluster communication phase, every CG communicates with the next hop MCG through a 2 × 2 virtual MIMO link. Therefore, the energy consumption for transmitting 1-bit original source data is(12)EpbMIMO(d)=RbeffRb[Epb(d)NT=2,NR=2]RDSC,where Rbeff is the effective bit rate, which is expressed as(13)Rbeff=(F-pNT)FRb,where F is the block size of space-time coding and p is the training overhead factor.


## 6. Simulation Analyses

To verify the energy conservation effect of DSC-MIMO, we establish a simulation platform to compare the energy consumption with CMIMO in different communication phases. The main simulation parameters are shown in Table1, which are the same as [7]. In addition, we set the rate of DSC as 75% which is the same as [15].Table 1
Simulation parameters.
λ = 0.125 m
α = 0.47
G
t
G
r = 5 dBi
N
0 = −174 dBm/Hz
B = 10 KHz
P
mix = 30.3 mW
P
IFA = 20 mW
P
syn = 50 mW
P
filt = Pfilr = 2.5 mW
P
LNA = 20 mW
N
f = 10 dB
M
l = 40 dBFigure5 shows the communication energy consumption of DSC-MIMO and CMIMO in the intracluster communication phase. To be fair, the control overhead of DSC-MIMO is counted to the energy consumption of intracluster communication during the simulation. The result shows that DSC-MIMO consumes less energy than CMIMO when transmitting the same source data in intracluster communication phase. The gap between DSC-MIMO and CMIMO is growing with the increasing of source nodes. There are two reasons causing this increasing gap. One is that DSC-MIMO improves the intracluster communication process and makes the source data forwarded only once, while CMIMO has to forward source data twice. Although DSC-MIMO increases some control overhead, the energy consumption of source data transmission is still the main part in this phase. The other is that the DSC is used in DSC-MIMO which can compress the related source data and reduce the transmission data. Therefore, DSC-MIMO is more energy-saving than CMIMO in intracluster communication, and the performance is growing with the increasing number of CGs (source nodes).Figure 5
The energy consumption of DSC-MIMO and CMIMO in intracluster communication phase.Figure6 shows the communication energy consumption of DSC-MIMO and CMIMO in the intercluster communication phase which reflects the energy consumption of one-hop virtual MIMO transmission. The result shows that DSC-MIMO consumes less energy than CMIMO when transmitting the same source data in intercluster communication phase. The gap between DSC-MIMO and CMIMO is growing with the increasing of source nodes which is not as big as intracluster communication. This is because the intercluster communication phase of DSC-MIMO is similar to CMIMO. However, the MCGs transmit the compressed data but do not decompress the data so it can reduce the energy consumption. Therefore, DSC-MIMO is more energy-saving than CMIMO in intercluster communication, and the performance is growing with the increasing number of CGs (source nodes).Figure 6
The energy consumption of DSC-MIMO and CMIMO in intercluster communication phase.Figure7 shows the communication energy consumption of DSC-MIMO and CMIMO in multihop virtual MIMO communication. During the simulation, we observe communication energy consumption of one CG (two source nodes) each time and then calculate the average energy consumption after the multirepeated observation. The simulation result shows that energy consumption of DSC-MIMO is less than CMIMO. The gap is growing with the increasing number of hops because of the importing of DSC. This energy consumption gap is produced in both intracluster communication and intercluster communication. Therefore, DSC-MIMO is more energy-saving in multihop virtual MIMO communication than CMIMO.Figure 7
The energy consumption of DSC-MIMO and CMIMO in multihop transmission.Figure8 shows the energy efficiency of DSC-MIMO and CMIMO in different transmission modes. We define the energy efficiency as the total energy consumption for transmitting 1-bit original source data. SISO is the transmission mode of intracluster communication and MIMO is the transmission mode of intercluster communication. The simulation result shows that the SISO of DSC-MIMO is more efficient than CMIMO and the MIMO of DSC-MIMO is also more efficient than CMIMO. It is mainly because of the DSC in DSC-MIMO which compresses the related source data and reduces the length of transmission data. Therefore, the DSC can improve the energy efficiency of high node density WSN.Figure 8
The energy efficiency of DSC-MIMO and CMIMO in different transmission modes.


## 7. Conclusion

Based on the existing virtual MIMO strategies for wireless sensor networks, we propose DSC-MIMO, which is very suitable for WSN with high node density and high scale, by improving intracluster communication and importing the DSC. Different to the existing virtual MIMO communication strategies, DSC-MIMO uses cooperative groups constituted by source nodes to transmit the data directly and the process of source data collecting and forwarding by cluster heads is removed, which can reduce the forwarding times of source data and energy consumption. The DSC can compress the related source data collected by adjacent nodes and improve the energy efficiency. The MCGs in DSC-MIMO can help WSN to realize the multihop virtual MIMO transmission by receiving and forwarding the data from CGs of other clusters. CG is the most basic communication unit in DSC-MIMO, so how to divide CGs has a great impact on the effectiveness of communication in WSN. The cooperative group allocation algorithm proposed in this paper can easily select the best allocation scheme enabling WSN to achieve the best communication performance.Finally, by comparing the energy efficiency of DSC-MIMO with CMIMO in simulation experiment, we prove that DSC-MIMO is more energy-saving and has higher energy efficiency.



---

*Source: 904274-2015-03-04.xml*