{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:12:27Z","timestamp":1730272347073,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/iscc.2004.1358644","type":"proceedings-article","created":{"date-parts":[[2004,11,30]],"date-time":"2004-11-30T19:56:05Z","timestamp":1101844565000},"page":"834-839 Vol.2","source":"Crossref","is-referenced-by-count":3,"title":["Optimal solution of total routing table size for hierarchical networks"],"prefix":"10.1109","author":[{"given":"J.","family":"Lian","sequence":"first","affiliation":[{"name":"Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Naik","sequence":"additional","affiliation":[{"name":"Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.B.","family":"Agnew","sequence":"additional","affiliation":[{"name":"Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1997.635119"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/12.30862"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/263876.263885"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/49.622910"},{"key":"ref11","first-page":"193","article-title":"WCA: A Weighted Clustering Algorithm for Mobile Ad hoc Networks","volume":"5","author":"chatterjee","year":"2002","journal-title":"Journal of Cluster Computing (Special Issue on Mobile Ad hoc Networks)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665092"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200845"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13705"},{"key":"ref2","article-title":"Adaptive Routing Algorithms for Distributed Computer Networks","volume":"2831","author":"mcquillan","year":"1974","journal-title":"BBN Report 680"},{"key":"ref9","article-title":"Clustering and Routing in Wireless ad hoc Networks","author":"chen","year":"1999","journal-title":"Computer Science"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0376-5075(77)90002-2"}],"event":{"name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications","start":{"date-parts":[[2004,7,28]]},"location":"Alexandria, Egypt","end":{"date-parts":[[2004,7,1]]}},"container-title":["Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9388\/29799\/01358644.pdf?arnumber=1358644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T18:46:46Z","timestamp":1709923606000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1358644\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/iscc.2004.1358644","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}