{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:30:44Z","timestamp":1761647444423},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T00:00:00Z","timestamp":1161129600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T00:00:00Z","timestamp":1161129600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1007\/s00500-006-0138-7","type":"journal-article","created":{"date-parts":[[2006,10,17]],"date-time":"2006-10-17T18:40:59Z","timestamp":1161110459000},"page":"865-872","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["VLSI implementation of greedy-based distributed routing schemes for ad hoc networks"],"prefix":"10.1007","volume":"11","author":[{"given":"Alberto","family":"Aloisio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Izzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"Rampone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,18]]},"reference":[{"key":"138_CR1","doi-asserted-by":"crossref","unstructured":"Aloisio A, Izzo V, Rampone S (2005) FPGA implementation of a greedy algorithm for set cover. In: Proceedings of 14th IEEE-NPSS real time conference (IEEE RT2005)","DOI":"10.1109\/RTC.2005.1547493"},{"key":"138_CR2","doi-asserted-by":"crossref","unstructured":"Alzoubi KM, Wan P, Frieder O (2002) New distributed algorithm for connected dominating set in wireless ad hoc networks. In: Proceedings of 35th Hawaii international conference on system sciences","DOI":"10.1145\/513800.513820"},{"key":"138_CR3","unstructured":"Amis AD, Prakash R (2000) Load-balancing clusters in wireless ad hoc networks. In: Proceedings of 3rd IEEE symposium on application specific systems and software engineering technology, pp 25\u201332"},{"key":"138_CR4","unstructured":"Amis AD, Prakash R, Vuong THP, Huynh DT (2000) Max\u2013Min D-cluster formation in wireless ad hoc networks. In: Proceedings of IEEE conference on computer communications (INFOCOM) Tel Aviv"},{"issue":"3","key":"138_CR5","first-page":"462","volume":"83","author":"T Asano","year":"2000","unstructured":"Asano T, Iwama K, Tadaka H, Yamashita Y (2000) Designing high-quality approximation algorithms for combinatorial optimization problems. IEICE Trans Inf Syst E83(3): 462\u2013479","journal-title":"IEICE Trans Inf Syst E"},{"key":"138_CR6","doi-asserted-by":"crossref","unstructured":"Chen YP, Liestman AL (2002) Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In: 3rd ACM international symposium on mobile ad hoc networking and computing (MobiHoc\u201902), Lausanne, Switzerland, pp 157\u2013164","DOI":"10.1145\/513800.513821"},{"key":"138_CR7","doi-asserted-by":"crossref","unstructured":"Clausen T, Jacquet P, Laouiti A, Minet P, Muhlethaler P, Viennot L (2003) Optimized link state routing protocol, IETF Internet Draft, http:\/\/hipercom.inria.fr\/olsr\/rfc3626.txt","DOI":"10.17487\/rfc3626"},{"key":"138_CR8","unstructured":"Das B, Bharghavan V (1997) Routing in ad hoc networks using minimum connected dominating sets. In: Proceedings of IEEE international conference on communications (ICC 97), Montreal, Canada"},{"key":"138_CR9","doi-asserted-by":"crossref","unstructured":"Dhar S, Rieck MQ, Pai S, Kim EJ (2003) Various distributed shortest path routing strategies for wireless ad hoc networks. In: Proceedings of the 5th international workshop on distributed computing (IWDC 2003). Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York","DOI":"10.1007\/978-3-540-24604-6_25"},{"issue":"8","key":"138_CR10","first-page":"427","volume":"28","author":"S Dhar","year":"2004","unstructured":"Dhar S, Rieck MQ, Pai S, Kim EJ (2004) Distributed routing schemes for ad hoc networks using d-SPR sets. J Microprocess Microsyst Spec Issue Resour Manage Wireless ad hoc Mobile Netw 28(8):427\u2013437","journal-title":"J Microprocess Microsyst Spec Issue Resour Manage Wireless ad hoc Mobile Netw"},{"key":"138_CR11","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H.Freeman New York"},{"issue":"4","key":"138_CR12","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374\u2013387","journal-title":"Algorithmica"},{"key":"138_CR13","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/3-540-60294-1_136","volume-title":"Field-Programmable Logic and Applications.","author":"BL Hutchings","year":"1995","unstructured":"Hutchings BL, Wirthlin MJ (1995) Implementation approaches for reconfigurable logic applications. In: Moore W, Luk W, (eds) Field-Programmable Logic and Applications. Springer, Oxford, pp 419\u2013428"},{"key":"138_CR14","doi-asserted-by":"crossref","unstructured":"Johansson P, Larsson T, Hedman N, Mielczarek B, Degermark M (1999) Scenario-based performance analysis of routing protocols for mobile ad hoc networks. In: Proceedings of the 5th annual ACM\/IEEE international conference on mobile computing and networking (MOBICOM), Seattle, pp 195\u2013206","DOI":"10.1145\/313451.313535"},{"key":"138_CR15","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D Johnson","year":"1974","unstructured":"Johnson D (1974) Approximation algorithms for combinatorial problems. J Comput Syst Sci 9:256\u2013278","journal-title":"J Comput Syst Sci"},{"key":"138_CR16","unstructured":"Johnson DB, Maltz DA, Hu Y-C, Jetcheva JG (2004) The dynamic source routing protocol for mobile ad hoc networks. IETF Internet Draft, http:\/\/www.ietf.org\/internet-drafts\/draft-ietf-manet-dsr-10.txt"},{"key":"138_CR17","doi-asserted-by":"crossref","unstructured":"Liang B, Haas ZJ (2000) Virtual backbone generation and maintenance in ad hoc network mobility management. In: Proceedings of IEEE conference on computer communications (INFOCOM), vol. 3, pp. 1293\u20131302","DOI":"10.1109\/INFCOM.2000.832522"},{"issue":"12","key":"138_CR18","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/2.642810","volume":"30","author":"W Mangione-Smith","year":"1997","unstructured":"Mangione-Smith W, Hutchings B, Andrews D, DeHone A, Ebeling C, Hartenstein R, Mencer O, Morris J, Prasanna V, Spaanenburg H (1997) Seeking solutions in configurable computing. IEEE Comput 30(12):38\u201343","journal-title":"IEEE Comput"},{"key":"138_CR19","doi-asserted-by":"crossref","unstructured":"Ni S-Y, Tseng Y-C, Chen Y-S, Sheu J-P (1999) The broadcast storm problem in a mobile ad hoc network. In: Proceedings of the 5th annual ACM\/IEEE international conference on mobile computing and networking (MOBICOM), Seattle, pp 151\u2013162","DOI":"10.1145\/313451.313525"},{"key":"138_CR20","doi-asserted-by":"crossref","unstructured":"Perkins CE, Royer EM, Das SR (2003) Ad hoc on-demand distance vector (AODV) routing. IETF Internet Draft, http:\/\/tools.ietf.org\/html\/rfc3561","DOI":"10.17487\/rfc3561"},{"key":"138_CR21","unstructured":"Rampone S (2001) Probability-driven Greedy algorithms for set Cover. In: Proceedings of VIII SIGEF congress \u201cNew Logics for the New Economy\u201d Naples, Italy"},{"key":"138_CR22","unstructured":"Rieck MQ, Pai S, Dhar S (2002) Distributed routing algorithms for wireless ad hoc networks using d-hop connected d-hop dominating sets. In: Proceedings of the 6th international conference on high performance computing: Asia Pacific, Bangalore, 16\u201319 December 2002"},{"key":"138_CR23","doi-asserted-by":"crossref","unstructured":"Sinha P, Sivakumar R, Bharghavan V (2001) Enhancing ad hoc routing with dynamic virtual infrastructures. In: Proceedings of IEEE conference on computer communications (INFOCOM), vol 3, pp 1763\u20131772","DOI":"10.1109\/INFCOM.2001.916674"},{"issue":"8","key":"138_CR24","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1109\/49.779926","volume":"17","author":"R Sivakumar","year":"1999","unstructured":"Sivakumar R, Sinha P, Bharghavan V (1999) CEDAR: a core-extraction distributed ad hoc routing algorithm. IEEE J Selected Areas Commun 17(8):1454\u20131465","journal-title":"IEEE J Selected Areas Commun"},{"issue":"9","key":"138_CR25","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/TPDS.2002.1036062","volume":"13","author":"J Wu","year":"2002","unstructured":"Wu J (2002) Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links. IEEE Trans Parallel Distrib Syst 13(9):866\u2013881","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"138_CR26","doi-asserted-by":"crossref","unstructured":"Wu J, Dai F (2003) Broadcasting in ad hoc networks based on self-pruning. In: Proceedings of IEEE conference on computer communications (INFOCOM) 2003","DOI":"10.1142\/S0129054103001686"},{"key":"138_CR27","doi-asserted-by":"crossref","unstructured":"Wu J, Li H (1999) On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the 3rd international workshop on discrete algorithms and methods for MOBILE computing and communications, Seattle, WA USA, pp 7\u201314","DOI":"10.1145\/313239.313261"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-006-0138-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-006-0138-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-006-0138-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-006-0138-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T20:22:27Z","timestamp":1652818947000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-006-0138-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,18]]},"references-count":27,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["138"],"URL":"https:\/\/doi.org\/10.1007\/s00500-006-0138-7","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,18]]},"assertion":[{"value":"18 October 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}