{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:07:35Z","timestamp":1648674455804},"reference-count":43,"publisher":"Oxford University Press (OUP)","issue":"2","funder":[{"name":"Clarkson Aerospace\/US Air Force Research Lab","award":["15-S7700-02-C2","88ABW-2016\u201316"],"award-info":[{"award-number":["15-S7700-02-C2","88ABW-2016\u201316"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,2,1]]},"DOI":"10.1093\/comjnl\/bxx050","type":"journal-article","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T19:09:30Z","timestamp":1494961770000},"page":"199-222","source":"Crossref","is-referenced-by-count":1,"title":["Complex Network Analysis-Based Graph Theoretic Metrics to Determine Stable Data Gathering Trees for Mobile Sensor Networks"],"prefix":"10.1093","volume":"61","author":[{"given":"Natarajan","family":"Meghanathan","sequence":"first","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2017,5,16]]},"reference":[{"key":"key\n\t\t\t\t20180213073650_bxx050C1","author":"Hull","year":"2006"},{"key":"key\n\t\t\t\t20180213073650_bxx050C2","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1109\/TPDS.2002.1036066","article-title":"Data gathering algorithms in sensor networks using energy metrics","volume":"13","author":"Lindsey","year":"2002","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"key\n\t\t\t\t20180213073650_bxx050C3","author":"Heinzelman","year":"2000"},{"key":"key\n\t\t\t\t20180213073650_bxx050C4","first-page":"1","article-title":"A comprehensive review and performance analysis of data gathering algorithms for wireless sensor networks","volume":"4","author":"Meghanathan","year":"2012","journal-title":"Int. J. Interdiscip. Telecommun. Netw."},{"key":"key\n\t\t\t\t20180213073650_bxx050C5","first-page":"1","article-title":"A data gathering algorithm based on energy-aware connected dominating sets to minimize energy consumption and maximize node lifetime in wireless sensor networks","volume":"2","author":"Meghanathan","year":"2010","journal-title":"Int. J. Interdiscip. Telecommun. Netw."},{"key":"key\n\t\t\t\t20180213073650_bxx050C6","doi-asserted-by":"crossref","first-page":"18","DOI":"10.5296\/npa.v7i3.7961","article-title":"A generic algorithm to determine maximum bottleneck node weight-based data gathering trees for wireless sensor networks","volume":"7","author":"Meghanathan","year":"2015","journal-title":"Netw. Protoc. Algorithms"},{"key":"key\n\t\t\t\t20180213073650_bxx050C7","first-page":"196","article-title":"Link expiration time and minimum distance spanning trees based distributed data gathering algorithms for wireless mobile sensor networks","volume":"4","author":"Meghanathan","year":"2012","journal-title":"Int. J. Commun. Netw. Inf. Secur."},{"key":"key\n\t\t\t\t20180213073650_bxx050C8","author":"Su","year":"1999"},{"key":"key\n\t\t\t\t20180213073650_bxx050C9","volume-title":"Recent Advances in Ad Hoc Networks Research","author":"Meghanathan","year":"2014"},{"key":"key\n\t\t\t\t20180213073650_bxx050C10","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1504\/IJMNDI.2012.054463","article-title":"Routing protocols to determine stable paths and trees using the inverse of predicted link expiration times for mobile ad hoc networks","volume":"4","author":"Meghanathan","year":"2012","journal-title":"Int. J. Mob. Netw. Des. Innov."},{"key":"key\n\t\t\t\t20180213073650_bxx050C11","first-page":"18","article-title":"Exploring the performance tradeoffs among stability-oriented routing protocols for mobile ad hoc networks","volume":"2","author":"Meghanathan","year":"2010","journal-title":"Netw. Protocol Algorithms"},{"key":"key\n\t\t\t\t20180213073650_bxx050C12","volume-title":"Wireless Global Positioning System: Theory and Practice","author":"Hofmann-Wellenhof","year":"2013"},{"key":"key\n\t\t\t\t20180213073650_bxx050C13","volume-title":"Wireless Communications: Principles and Practice","author":"Rappaport","year":"2002"},{"key":"key\n\t\t\t\t20180213073650_bxx050C14","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0378-8733(02)00016-3","article-title":"Egocentric and sociocentric measures of network centrality","volume":"24","author":"Marsden","year":"2002","journal-title":"Soc. Netw."},{"key":"key\n\t\t\t\t20180213073650_bxx050C15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets: Reasoning about a Highly Connected World","author":"Easley","year":"2010"},{"key":"key\n\t\t\t\t20180213073650_bxx050C16","doi-asserted-by":"crossref","first-page":"046105","DOI":"10.1103\/PhysRevE.72.046105","article-title":"Spectral measures of bipartivity in complex networks","volume":"72","author":"Estrada","year":"2005","journal-title":"Phys. Rev. E"},{"key":"key\n\t\t\t\t20180213073650_bxx050C17","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"Fiedler","year":"1973","journal-title":"Czechoslov. Math. J."},{"key":"key\n\t\t\t\t20180213073650_bxx050C18","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(92)90288-Q","article-title":"Laplace eigenvalues of graphs\u2014a survey","volume":"109","author":"Mohar","year":"1992","journal-title":"Discrete Math."},{"key":"key\n\t\t\t\t20180213073650_bxx050C19","author":"Jamakovic","year":"2007"},{"key":"key\n\t\t\t\t20180213073650_bxx050C20","author":"Tao","year":"2012"},{"key":"key\n\t\t\t\t20180213073650_bxx050C21","doi-asserted-by":"crossref","first-page":"1476","DOI":"10.1109\/TPDS.2007.1070","article-title":"SenCar: an energy-efficient data gathering mechanism for large-scale multihop sensor networks","volume":"18","author":"Ma","year":"2007","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"key\n\t\t\t\t20180213073650_bxx050C22","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.adhoc.2013.01.001","article-title":"Opportunistic data collection for disconnected wireless sensor networks by mobile mules","volume":"11","author":"Tseng","year":"2013","journal-title":"Ad Hoc Netw."},{"key":"key\n\t\t\t\t20180213073650_bxx050C23","doi-asserted-by":"crossref","first-page":"23218","DOI":"10.3390\/s150923218","article-title":"Adaptive data gathering in mobile sensor networks using speedy mobile elements","volume":"15","author":"Lai","year":"2015","journal-title":"Sensors"},{"key":"key\n\t\t\t\t20180213073650_bxx050C24","author":"Banerjee","year":"2007"},{"key":"key\n\t\t\t\t20180213073650_bxx050C25","author":"Santhosh Kumar","year":"2008"},{"key":"key\n\t\t\t\t20180213073650_bxx050C26","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1049\/iet-wss.2010.0084","article-title":"Mobility-based clustering protocol for wireless sensor networks with mobile nodes","volume":"1","author":"Deng","year":"2011","journal-title":"IET Wirel. Sens. Syst."},{"key":"key\n\t\t\t\t20180213073650_bxx050C27","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1016\/j.jpdc.2007.06.010","article-title":"Distributed clustering algorithms for data gathering in wireless mobile sensor networks","volume":"67","author":"Liu","year":"2007","journal-title":"J. Parallel Distrib. Comput."},{"key":"key\n\t\t\t\t20180213073650_bxx050C28","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/JSYST.2015.2410592","article-title":"E2R2: energy-efficient and reliable routing for mobile wireless sensor networks","volume":"10","author":"Sarma","year":"2015","journal-title":"IEEE Syst. J."},{"key":"key\n\t\t\t\t20180213073650_bxx050C29","first-page":"10","article-title":"An energy efficient data gathering in dense mobile wireless sensor networks","volume":"2014","author":"Velmani","year":"2014","journal-title":"Int. Sch. Res. Not. Sensor Netw."},{"key":"key\n\t\t\t\t20180213073650_bxx050C30","doi-asserted-by":"crossref","first-page":"7188","DOI":"10.3390\/s110707188","article-title":"Data collection method for mobile sensor networks based on the theory of thermal fields","volume":"11","author":"Macuha","year":"2011","journal-title":"Sensors"},{"key":"key\n\t\t\t\t20180213073650_bxx050C31","first-page":"315","article-title":"A benchmarking algorithm to determine the sequence of stable data gathering trees for wireless mobile sensor networks","volume":"37","author":"Meghanathan","year":"2013","journal-title":"Inf. Int. J. Comput. Inf."},{"key":"key\n\t\t\t\t20180213073650_bxx050C32","first-page":"13","article-title":"A benchmarking algorithm for maximum bottleneck node trust score-based data gathering trees in wireless sensor networks","volume":"7","author":"Meghanathan","year":"2015","journal-title":"Int. J. Interdiscip. Telecommun. Netw."},{"key":"key\n\t\t\t\t20180213073650_bxx050C33","author":"Buccafurri","year":"2013"},{"key":"key\n\t\t\t\t20180213073650_bxx050C34","author":"Meghanathan","year":"2014"},{"key":"key\n\t\t\t\t20180213073650_bxx050C35","author":"Abramov","year":"2015"},{"key":"key\n\t\t\t\t20180213073650_bxx050C36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/a9010008","article-title":"A greedy algorithm for neighborhood overlap-based community detection","volume":"9","author":"Meghanathan","year":"2016","journal-title":"Algorithms"},{"key":"key\n\t\t\t\t20180213073650_bxx050C37","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/2629438","article-title":"On facebook, most ties are weak","volume":"57","author":"Meo","year":"2014","journal-title":"Commun. ACM"},{"key":"key\n\t\t\t\t20180213073650_bxx050C38","volume-title":"Introduction to Algorithms","author":"Cormen","year":"2009"},{"key":"key\n\t\t\t\t20180213073650_bxx050C39","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.adhoc.2014.02.007","article-title":"Stability-based and energy-efficient distributed data gathering algorithms for mobile sensor networks","volume":"19","author":"Meghanathan","year":"2014","journal-title":"Ad Hoc Netw."},{"key":"key\n\t\t\t\t20180213073650_bxx050C40","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1023\/B:WINE.0000036458.88990.e5","article-title":"Stochastic properties of the random-way point mobility model","volume":"10","author":"Bettstetter","year":"2004","journal-title":"Wirel. Netw."},{"key":"key\n\t\t\t\t20180213073650_bxx050C41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S1570-8705(03)00043-X","article-title":"A review of routing protocols for mobile ad hoc networks","volume":"2","author":"Abolhasan","year":"2004","journal-title":"Ad Hoc Netw."},{"key":"key\n\t\t\t\t20180213073650_bxx050C42","volume-title":"CDMA: Principles of Spread Spectrum Communication","author":"Viterbi","year":"1995"},{"key":"key\n\t\t\t\t20180213073650_bxx050C43","doi-asserted-by":"crossref","first-page":"435","DOI":"10.3390\/a8030435","article-title":"A benchmarking algorithm to determine minimum aggregation delay for data gathering trees and an analysis of the diameter-aggregation delay tradeoff","volume":"8","author":"Meghanathan","year":"2015","journal-title":"Algorithms"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/61\/2\/199\/23912652\/bxx050.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T22:05:46Z","timestamp":1602108346000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/61\/2\/199\/3861966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,16]]},"references-count":43,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2017,5,16]]},"published-print":{"date-parts":[[2018,2,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxx050","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,2]]},"published":{"date-parts":[[2017,5,16]]}}}