Excellence in Research and Innovation for Humanity

International Science Index


Select areas to restrict search in scientific publication database:
10004879
Secure and Efficient Transmission of Aggregated Data for Mobile Wireless Sensor Networks
Abstract:
Wireless Sensor Networks (WSNs) are suitable for many scenarios in the real world. The retrieval of data is made efficient by the data aggregation techniques. Many techniques for the data aggregation are offered and most of the existing schemes are not energy efficient and secure. However, the existing techniques use the traditional clustering approach where there is a delay during the packet transmission since there is no proper scheduling. The presented system uses the Velocity Energy-efficient and Link-aware Cluster-Tree (VELCT) scheme in which there is a Data Collection Tree (DCT) which improves the lifetime of the network. The VELCT scheme and the construction of DCT reduce the delay and traffic. The network lifetime can be increased by avoiding the frequent change in cluster topology. Secure and Efficient Transmission of Aggregated data (SETA) improves the security of the data transmission via the trust value of the nodes prior the aggregation of data. Since SETA considers the data only from the trustworthy nodes for aggregation, it is more secure in transmitting the data thereby improving the accuracy of aggregated data.
Digital Article Identifier (DAI):

References:

[1] H. Karl and A. Willig, “Protocols Architectures for Wireless Sensor Networks”, New York, NY, USA: Wiley, 2000.
[2] R. Velmani and B. Kaarthick, “An Efficient Cluster-Tree Based Data Collection Scheme for Large Mobile Wireless Sensor Networks”, IEEE Sensors Journal, Vol. 15, No. 4, April 2015.
[3] Davood Izadi, Jemal Abawajy and Sara Ghanavati, “An Alternative Clustering Scheme in WSN”, IEEE Sensors Journal, Vol. 15, No. 7, July 2015.
[4] Chuan Zhu, Guangjie Han, “A Tree-Cluster-Based Data-Gathering Algorithm for Industrial WSNs with a Mobile Sink”, Access, IEEE (Volume: 3), May 2015.
[5] Jenq-Shiou Leu, Tung-Hung Chiang, Min-Chieh Yu, and Kuan-Wu Su, “Energy Efficient Clustering Scheme for Prolonging the Lifetime of Wireless Sensor Network with Isolated Nodes”, IEEE communications letters, vol. 19, no. 2, February 2015.
[6] Xu Jian, Yang Geng, Chen Zhengyu, Wang Qianqian, “A Survey on the Privacy-Preserving Data Aggregation in Wireless Sensor Networks”, Communications, China (Volume: 12, Issue: 5), May 2015.
[7] Zhixin Liu, Yazhou Yuan, Xinping Guan, and Xinbin Li, “An Approach of Distributed Joint Optimization for Cluster-based Wireless Sensor Networks”, IEEE/CAA Journal of automaticasinica, vol. 2, no. 3, July 2015.
[8] Liu Xiang, Jun Luo, and Catherine Rosenberg, “Compressed Data Aggregation: Energy-Efficient and High-Fidelity Data Collection”, IEEE/ACM Transactions on Networking, Vol.21, No.6, and December 2013.
[9] Zaixin Lu, Wei Wayne Li and Miao Pan, “Maximum Lifetime Scheduling for Target Coverage and Data Collection in Wireless Sensor Networks”, IEEE Transactions On Vehicular Technology, Vol. 64, No. 2, February 2015.
[10] K. Akkaya and M. Younis, “A survey on routing protocols for wireless sensor networks”, Ad Hoc Netw., vol. 3, no. 3, pp. 325–349, 2005.
[11] Q. Mamun, “A qualitative comparison of different logical topologies for wireless sensor networks”, Sensors, vol. 12, no. 11, pp. 14887–14913, 2012.
[12] Mohsen Rezvani and Sanjay Jha, “Secure Data Aggregation Technique for Wireless Sensor Networks in the Presence of Collusion Attacks”, IEEE Transactions On Dependable And Secure Computing, Vol. 12, No. 1, January/February 2015.
[13] Guoxing Zhan, Weisong Shi and Julia Deng, “Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs”, IEEE Transactions On Dependable And Secure Computing, Vol. 9, No. 2, March/April 2012.
[14] Adnan Ahmed, Kamalrulnizam Abu Bakar, Muhammad Ibrahim Channa, Khalid Haseeb and Abdul Waheed Khan, “TERP: A Trust and Energy Aware Routing Protocol for Wireless Sensor Network”, IEEE Sensors Journal, Vol. 15, No. 12, December 2015.
Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007