A Benchmarking Algorithm for Maximum Bottleneck Node Trust Score-based Data Gathering Trees in Wireless Sensor Networks

Publisher： IGI Global_journal

E-ISSN： 1941-8671|7|3|13-35

ISSN： 1941-8663

Source： International Journal of Interdisciplinary Telecommunications and Networking (IJITN), Vol.7, Iss.3, 2015-07, pp. : 13-35

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Data Gathering Algorithm Based on Energy-Aware Connected Dominating Sets to Minimize Energy Consumption and Maximize Node Lifetime in Wireless Sensor Networks

By  

International Journal of Interdisciplinary Telecommunications and Networking (IJITN), Vol. 2, Iss. 3, 2010-07 ,pp. : 1-17

IGI Global_journal

Access to resources Recommend Favorite

GMCA: a greedy multilevel clustering algorithm for data gathering in wireless sensor networks

By Kumar Manish  

International Journal of Communication Networks and Distributed Systems, Vol. 11, Iss. 2, 2013-07 ,pp. : 198-213

Inderscience Publishers

Access to resources Recommend Favorite

Neighborhood Overlap-based Stable Data Gathering Trees for Mobile Sensor Networks

By  

International Journal of Wireless Networks and Broadband Technologies (IJWNBT), Vol. 5, Iss. 1, 2016-01 ,pp. : 1-23

IGI Global_journal

Access to resources Recommend Favorite

Correlated data gathering in wireless sensor networks based on distributed source coding

By Hua Guogang   Chen Chang Wen  

International Journal of Sensor Networks, Vol. 4, Iss. 1-2, 2008-07 ,pp. : 13-22

Inderscience Publishers

Access to resources Recommend Favorite

Approximation algorithm for maximum lifetime in wireless sensor networks with data aggregation

By Stanford Jeffrey   Tongngam Sutep  

International Journal of Sensor Networks, Vol. 6, Iss. 1, 2009-08 ,pp. : 44-50

Inderscience Publishers

Access to resources Recommend Favorite