Wireless Sensor Network (WSN) has attracted researchers in recent years due to its wide scope of utility in a future era of automation and remote monitoring. Effective deployment of Sensor Nodes (SNs) is a major point of concern as performance and lifetime of any WSN primarily depends on it. Various models have been proposed by researchers to deploy SNs in large-scale open regions. This article aims at classification, working and comparative analysis of these models

NoC is a competent communication for on chip network architectures. It make more efficient the computational and high congestion communication on a single chip. In this paper, we are proposing a NoC topologies, i.e., Major Diagonal Mesh NoC called MD-Mesh NoC. In MD-Mesh NoC the corner of major diagonal linked with each other so that the efficiency of the communication among the corner can be increase. The internal semantic view and register transfer logic (RTL) View has been shown. As number of connections among the nodes increases and number of hopes decreases, performance of packet traversing will get increases. The synthesis and simulation has been done on Vertex 5 FPGA. The hardware parameters like number of slices and memory usage with respect to increase the number of nodes has been calculated on FPGA Vertex 5.

A Wireless Sensor Network (WSN) has very specific characteristics and unique requirements. The fundamental function of a wireless sensor network is the collection of information from an area of interest. Information collected by the sensor nodes deployed in the network is processed by Base Station (BS) according to the applications. Wireless sensor networks have raised tremendous research interests in recent years because of their tremendous potential in military and civil applications. Keeping these factors in mind, in this paper we proposed a Scalable Energy Efficient Deployment Scheme (SEEDS) for homogeneous WSN. In SEEDS the deployment area is logically divided into number of regular hexagons by BS and Mobile Sensor Nodes (MSNs) are instructed to place themselves at the centers of these regular hexagons (known as preferred locations) for optimal coverage. After their random deployment, MSNs in the deployment area start moving towards the preferred locations on the instruction provided by BS with an aim to minimize average movement. The proposed scheme is compared with Connectivity Preserved Virtual force scheme (CPVF) and Floor-based scheme (FLOOR). From simulation results we observed that the proposed scheme is better in terms of average movement required to setup the network. The proposed scheme is scalable because of its distributed nature.