Multi -Layer Based Data Aggregation Algorithm for Convergence Platform of IoT and Cloud Computing

Sensor Networks (SN) are deployed in smart domain to sense the environment which is essential to provide the services according to the users need. Hundreds or sometimes thousands of sensors are involved in sensor networks for monitoring the target phenomenon. Large scale of sensory data have to be handle by the sensor network which create several problems such as waste of sensors energy, data redundancy. To overcome these deficiencies one most practice solution is data aggregation which can effectively decrease the massive amount of data generated in SNs by lessening occurrence in the sensing data. The aim of this method is to lessen the massive use of data generated by surrounding nodes, thus saving network energy and providing valuable information for the end user. The effectiveness of any data aggregation technique is largely dependent on topology of the network. Among the various network topologies clustering is preferred as it provides better controllability, scalability and network maintenance phenomenon. In this research, a data aggregation technique is proposed based on Periodic Sensor Network (PSN) which achieved aggregation of data at two layers: the sensor nodes layer and the cluster head layer. In sensor node layer set similarity function is used for checking the redundant data for each sensor node whereas Euclidean distance function is utilized in cluster head layer for discarding the redundancy of data between different sensor nodes. This aggregation technique is implemented in smart home where sensor network is deployed to capture environment related information (temperature, moisture, light, H2 level). Collected information is analyzed using ThinkSpeak cloud platform. For performance evaluation amount of aggregated data, number of pairs of redundant data, energy consumption, data latency, and data accuracy are analyzed and compared with the other state-of-art techniques. The result shows the important improvement of the performance of sensor networks

Routing Algorithm with Uneven Clustering for Energy Heterogeneous Wireless Sensor Networks

Aiming at the “hotspots” problem in energy heterogeneous wireless sensor networks, a routing algorithm of heterogeneous sensor network with multilevel energies based on uneven clustering is proposed. In this algorithm, the energy heterogeneity of the nodes is fully reflected in the mechanism of cluster-heads’ election. It optimizes the competition radius of the cluster-heads according to the residual energy of the nodes. This kind of uneven clustering prolongs the lifetime of the cluster-heads with lower residual energies or near the sink nodes. In data transmission stage, the hybrid multihop transmission mode is adopted, and the next-hop routing election fully takes account of the factors of residual energies and the distances among the nodes. The simulation results show that the introduction of an uneven clustering mechanism and the optimization of competition radius of the cluster-heads significantly prolonged the lifetime of the network and improved the efficiency of data transmission

SPARCO: Stochastic Performance Analysis with Reliability and Cooperation for Underwater Wireless Sensor Networks

Reliability is a key factor for application-oriented Underwater Sensor Networks (UWSNs) which are utilized for gaining certain objectives and a demand always exists for efficient data routing mechanisms. Cooperative routing is a promising technique which utilizes the broadcast feature of wireless medium and forwards data with cooperation using sensor nodes as relays. Here, we present a cooperation-based routing protocol for underwater networks to enhance their performance called Stochastic Performance Analysis with Reliability and Cooperation (SPARCO). Cooperative communication is explored in order to design an energy-efficient routing scheme for UWSNs. Each node of the network is assumed to be consisting of a single omnidirectional antenna and multiple nodes cooperatively forward their transmissions taking advantage of spatial diversity to reduce energy consumption. Both multihop and single-hop schemes are exploited which contribute to lowering of path-losses present in the channels connecting nodes and forwarding of data. Simulations demonstrate that SPARCO protocol functions better regarding end-to-end delay, network lifetime, and energy consumption comparative to noncooperative routing protocol—improved Adaptive Mobility of Courier nodes in Threshold-optimized Depth-based routing (iAMCTD). The performance is also compared with three cooperation-based routing protocols for UWSN: Cognitive Cooperation (Cog-Coop), Cooperative Depth-Based Routing (CoDBR), and Cooperative Partner Node Selection Criteria for Cooperative Routing (Coop Re and dth)

Chain-Based Communication in Cylindrical Underwater Wireless Sensor Networks

Appropriate network design is very significant for Underwater Wireless Sensor Networks (UWSNs). Application-oriented UWSNs are planned to achieve certain objectives. Therefore, there is always a demand for efficient data routing schemes, which can fulfill certain requirements of application-oriented UWSNs. These networks can be of any shape, i.e., rectangular, cylindrical or square. In this paper, we propose chain-based routing schemes for application-oriented cylindrical networks and also formulate mathematical models to find a global optimum path for data transmission. In the first scheme, we devise four interconnected chains of sensor nodes to perform data communication. In the second scheme, we propose routing scheme in which two chains of sensor nodes are interconnected, whereas in third scheme single-chain based routing is done in cylindrical networks. After finding local optimum paths in separate chains, we find global optimum paths through their interconnection. Moreover, we develop a computational model for the analysis of end-to-end delay. We compare the performance of the above three proposed schemes with that of Power Efficient Gathering System in Sensor Information Systems (PEGASIS) and Congestion adjusted PEGASIS (C-PEGASIS). Simulation results show that our proposed 4-chain based scheme performs better than the other selected schemes in terms of network lifetime, end-to-end delay, path loss, transmission loss, and packet sending rate