{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T21:13:23Z","timestamp":1648934003931},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2010,9]]},"abstract":"<jats:p> In sensor networks, it is an important task to periodically collect data from an area of interest for time-sensitive applications. The sensed data must be gathered and transmitted to a base station for further processing to meet the end-user queries. Since the network consists of low-cost nodes with limited battery power, it is a challenging task to design an efficient routing scheme that can minimize delay and offer good performance in energy efficiency, and long network lifetimes. In this paper, we propose a distance based multi-clustering in sensor networks using vertex subset degree preserving minimum spanning tree. <\/jats:p>","DOI":"10.1142\/s1793830910000668","type":"journal-article","created":{"date-parts":[[2010,10,12]],"date-time":"2010-10-12T08:44:00Z","timestamp":1286873040000},"page":"277-289","source":"Crossref","is-referenced-by-count":0,"title":["APPLICATION OF VERTEX SUBSET DEGREE PRESERVING SPANNING TREES IN SENSOR NETWORKS"],"prefix":"10.1142","volume":"02","author":[{"given":"K.","family":"SANGAVAI","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Applications, PSG College of Technology, Coimbatore-641004, Tamil Nadu, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"ANITHA","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Applications, PSG College of Technology, Coimbatore-641004, Tamil Nadu, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","first-page":"115","volume":"2","author":"Anitha R.","journal-title":"Int. J. Comput. Appl. Math."},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2004.1368893"},{"key":"rf12","first-page":"124","volume":"20","author":"Pandurangan M. K. G.","journal-title":"IEEE Trans. Parallel and Distrib. Syst."},{"key":"rf15","volume":"8","author":"Rajagopalan R.","journal-title":"IEEE Commun. Surveys Tuts."},{"key":"rf16","first-page":"8","author":"Muruganathan S. D.","journal-title":"IEEE Radio Commun. Mag."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830910000668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:34:38Z","timestamp":1565141678000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830910000668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":5,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.1142\/S1793830910000668"],"URL":"https:\/\/doi.org\/10.1142\/s1793830910000668","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}