LPTA: Location predictive and time adaptive data gathering scheme with mobile sink for wireless sensor networks

This paper exploits sink mobility to prolong the lifetime of sensor networks while maintaining the data transmission delay relatively low. A location predictive and time adaptive data gathering scheme is proposed. In this paper, we introduce a sink location prediction principle based on loose time synchronization and deduce the time-location formulas of the mobile sink. According to local clocks and the time-location formulas of the mobile sink, nodes in the network are able to calculate the current location of the mobile sink accurately and route data packets timely toward the mobile sink by multihop relay. Considering that data packets generating from different areas may be different greatly, an adaptive dwelling time adjustment method is also proposed to balance energy consumption among nodes in the network. Simulation results show that our data gathering scheme enables data routing with less data transmission time delay and balance energy consumption among nodes.The work is supported by the Science and Technology Pillar Program of Changzhou (Social Development), no. CE20135052. Joel J. P. C. Rodrigues's work has been supported by the Fundamental Research Funds for the Central Universities (Program no. HEUCF140803), by Instituto de Telecomunicacoes, Next Generation Networks and Applications Group (NetGNA), Covilha Delegation, by Government of Russian Federation, Grant 074-U01, and by National Funding from the FCT-Fundacao para a Ciencia e a Tecnologia through the Pest-OE/EEI/LA0008/2013 Project.Zhu, C.; Wang, Y.; Han, G.; Rodrigues, JJPC.; Lloret, J. (2014). LPTA: Location predictive and time adaptive data gathering scheme with mobile sink for wireless sensor networks. Scientific World Journal. https://doi.org/10.1155/2014/476253SHan, G., Xu, H., Jiang, J., Shu, L., Hara, T., & Nishio, S. (2011). Path planning using a mobile anchor node based on trilateration in wireless sensor networks. Wireless Communications and Mobile Computing, 13(14), 1324-1336. doi:10.1002/wcm.1192Zhu, C., Zheng, C., Shu, L., & Han, G. (2012). A survey on coverage and connectivity issues in wireless sensor networks. Journal of Network and Computer Applications, 35(2), 619-632. doi:10.1016/j.jnca.2011.11.016Han, G., Xu, H., Duong, T. Q., Jiang, J., & Hara, T. (2011). Localization algorithms of Wireless Sensor Networks: a survey. Telecommunication Systems, 52(4), 2419-2436. doi:10.1007/s11235-011-9564-7Guoliang Xing, Tian Wang, Zhihui Xie, & Weijia Jia. (2008). Rendezvous Planning in Wireless Sensor Networks with Mobile Elements. IEEE Transactions on Mobile Computing, 7(12), 1430-1443. doi:10.1109/tmc.2008.58Basagni, S., Carosi, A., Melachrinoudis, E., Petrioli, C., & Wang, Z. M. (2007). Controlled sink mobility for prolonging wireless sensor networks lifetime. Wireless Networks, 14(6), 831-858. doi:10.1007/s11276-007-0017-xWang, G., Wang, T., Jia, W., Guo, M., & Li, J. (2008). Adaptive location updates for mobile sinks in wireless sensor networks. The Journal of Supercomputing, 47(2), 127-145. doi:10.1007/s11227-008-0181-5Shin, K., & Kim, S. (2012). Predictive routing for mobile sinks in wireless sensor networks: a milestone-based approach. The Journal of Supercomputing, 62(3), 1519-1536. doi:10.1007/s11227-012-0815-5Lee, K., Kim, Y.-H., Kim, H.-J., & Han, S. (2013). A myopic mobile sink migration strategy for maximizing lifetime of wireless sensor networks. Wireless Networks, 20(2), 303-318. doi:10.1007/s11276-013-0606-9Sheu, J.-P., Sahoo, P. K., Su, C.-H., & Hu, W.-K. (2010). Efficient path planning and data gathering protocols for the wireless sensor network. Computer Communications, 33(3), 398-408. doi:10.1016/j.comcom.2009.10.011Yang, Y., Fonoage, M. I., & Cardei, M. (2010). Improving network lifetime with mobile wireless sensor networks. Computer Communications, 33(4), 409-419. doi:10.1016/j.comcom.2009.11.010Liang, W., Luo, J., & Xu, X. (2011). Network lifetime maximization for time-sensitive data gathering in wireless sensor networks with a mobile sink. Wireless Communications and Mobile Computing, 13(14), 1263-1280. doi:10.1002/wcm.1179Kinalis, A., Nikoletseas, S., Patroumpa, D., & Rolim, J. (2014). Biased sink mobility with adaptive stop times for low latency data collection in sensor networks. Information Fusion, 15, 56-63. doi:10.1016/j.inffus.2012.04.003Liu, C. H., Ssu, K. F., & Wang, W. T. (2011). A moving algorithm for non-uniform deployment in mobile sensor networks. International Journal of Autonomous and Adaptive Communications Systems, 4(3), 271. doi:10.1504/ijaacs.2011.040987Shi, L., Zhang, B., Mouftah, H. T., & Ma, J. (2012). DDRP: An efficient data-driven routing protocol for wireless sensor networks with mobile sinks. International Journal of Communication Systems, n/a-n/a. doi:10.1002/dac.2315Liu, X., Zhao, H., Yang, X., & Li, X. (2013). SinkTrail: A Proactive Data Reporting Protocol for Wireless Sensor Networks. IEEE Transactions on Computers, 62(1), 151-162. doi:10.1109/tc.2011.207Aioffi, W. M., Valle, C. A., Mateus, G. R., & da Cunha, A. S. (2011). Balancing message delivery latency and network lifetime through an integrated model for clustering and routing in Wireless Sensor Networks. Computer Networks, 55(13), 2803-2820. doi:10.1016/j.comnet.2011.05.023Liu, D., Zhang, K., & Ding, J. (2013). Energy-efficient transmission scheme for mobile data gathering in Wireless Sensor Networks. China Communications, 10(3), 114-123. doi:10.1109/cc.2013.648883

Multihop clustering algorithm for load balancing in wireless sensor networks

The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach

Multihop clustering algorithm for load balancing in wireless sensor networks

The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach

AM-DisCNT: Angular Multi-hop DIStance based Circular Network Transmission Protocol for WSNs

The nodes in wireless sensor networks (WSNs) contain limited energy resources, which are needed to transmit data to base station (BS). Routing protocols are designed to reduce the energy consumption. Clustering algorithms are best in this aspect. Such clustering algorithms increase the stability and lifetime of the network. However, every routing protocol is not suitable for heterogeneous environments. AM-DisCNT is proposed and evaluated as a new energy efficient protocol for wireless sensor networks. AM-DisCNT uses circular deployment for even consumption of energy in entire wireless sensor network. Cluster-head selection is on the basis of energy. Highest energy node becomes CH for that round. Energy is again compared in the next round to check the highest energy node of that round. The simulation results show that AM-DisCNT performs better than the existing heterogeneous protocols on the basis of network lifetime, throughput and stability of the system.Comment: IEEE 8th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA'13), Compiegne, Franc

Optimal coverage multi-path scheduling scheme with multiple mobile sinks for WSNs

Wireless Sensor Networks (WSNs) are usually formed with many tiny sensors which are randomly deployed within sensing field for target monitoring. These sensors can transmit their monitored data to the sink in a multi-hop communication manner. However, the ‘hot spots’ problem will be caused since nodes near sink will consume more energy during forwarding. Recently, mobile sink based technology provides an alternative solution for the long-distance communication and sensor nodes only need to use single hop communication to the mobile sink during data transmission. Even though it is difficult to consider many network metrics such as sensor position, residual energy and coverage rate etc., it is still very important to schedule a reasonable moving trajectory for the mobile sink. In this paper, a novel trajectory scheduling method based on coverage rate for multiple mobile sinks (TSCR-M) is presented especially for large-scale WSNs. An improved particle swarm optimization (PSO) combined with mutation operator is introduced to search the parking positions with optimal coverage rate. Then the genetic algorithm (GA) is adopted to schedule the moving trajectory for multiple mobile sinks. Extensive simulations are performed to validate the performance of our proposed method

SINK MOBILITY MODEL FOR WIRELESS SENSOR NETWORKS USING KOHONEN SELF-ORGANIZING MAP

Wireless sensor networks are expected to operate in an unattended manner for long periods of time. As a result, different mobility models were proposed by many research papers in order to improve the performance and extend the lifetime of the network. In this paper a new sink mobility model that is based on kohonen self-organizing maps is proposed in order to provide a mobile sink node with the ability to collect data from static sensor nodes. Moreover, the performance of the proposed mobility model was studied using NS-2 simulator under different network sizes and movement speeds of the mobile sink. Finally, the performance of the proposed model was evaluated based on different performance metrics namely, end-to-end delay, packet delivery ratio and throughput

Review Paper Opportunistics Routing Protocol For Performance Enhancement In Wsn

In Remote Sensor Network, sensor hub are sent in application territory to shape organize. Data about the physical and synthetic marvel are gathered by sensor hub and exchange to the sink hub for additionally preparing. Sharp Routing convention is required to fulfill the errand of exchanging data. Opportunistic routing is used for wireless multi-hop network .The main features of Opportunistic routing is coordination and selection of forwarding node to transfer the packets to the sink node. Opportunistic routing enables the multiple paths and dynamics the relay selection in wireless multihop networks with higher node density .In order to enhance the performance of relay node Opportunistic routing collaborates all the sensor nodes in the path while forwarding the data packets