For Project Enquiry +91 9962 067 067

 Joint Virtual MIMO and Data Gathering

               for Wireless Sensor Networks

        ABSTRACT

This paper studies energy-efficient data gathering in wireless sensor networks using vMIMO. We define the joint vMIMO and data gathering (vMDG) problem, which is NPhard. We also propose a distributed method called D-vMDG as an approximation algorithm. This algorithm first constructs a tree-like topology by taking the unique features of vMIMO into account. Then, an energy-efficient routing protocol based on dynamic programming is proposed for each node on the constructed topology. Our theoretical analysis shows that D-vMDG can achieve an approximation ratio of Oð1Þ. Our simulations show that D-vMDG decreases the energy consumption by 81 and 36 percent compared to the well-known MDT and MIMO-LEACH algorithms respectively.

EXISTING SYSTEM	PROPOSED SYSTEM
EXISTING SYSTEM:- Virtual multi-input multi-output (MIMO) or vMIMO is becoming an attractive technology to achieve spatial diversity in wireless networks without using additional antennas, and to reduce power consumption by cooperation among multiple nodes. As data gathering is one of the most important operations in many sensor network applications	PROPOSED SYSTEM:- This paper has studied the energy-efficient data gathering problem with vMIMO communication for wireless sensor networks. We have defined a new optimization problem called joint vMIMO and data gathering
EXISTING ALGORITHM :- D-vMDG algorithm	PROPOSED ALGORITHM :- MIMO-LEACH algorithm.
ALGORITHM   DEFINITION:- This algorithm first constructs a tree-like topology by taking the unique features of vMIMO into account. Then, an energy-efficient routing protocol based on dynamic programming is proposed for each node on the constructed topology. Our theoretical analysis shows that D-vMDG can achieve an approximation ratio.	ALGORITHM DEFINITION:- We first define the joint vMIMO and data gathering (vMDG) problem, and formally prove that this problem is NP-Hard. As the problem is difficult to solve optimally due to its high computational complexity, we propose a distributed and heuristic algorithm called D-vMDG
DRAWBACKS:- To solve optimally due to its high computational complexity, we propose a distributed and heuristic algorithm called D-vMDG.	ADVANTAGES:- An energy-efficient routing protocol based on dynamic programming is proposed for the constructed topology. Our theoretical analysis shows that the proposed algorithm.