{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:00:58Z","timestamp":1729609258282,"version":"3.28.0"},"reference-count":55,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ipdps.2003.1213411","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"8","source":"Crossref","is-referenced-by-count":1,"title":["Quality of service in wireless networks"],"prefix":"10.1109","author":[{"given":"V.","family":"Bilo","sequence":"first","affiliation":[]},{"given":"A.","family":"Di Pasquale","sequence":"additional","affiliation":[]},{"given":"F.","family":"Fioravanti","sequence":"additional","affiliation":[]},{"given":"M.","family":"Flammini","sequence":"additional","affiliation":[]},{"given":"L.","family":"Forlizzi","sequence":"additional","affiliation":[]},{"given":"F.","family":"Lo Presti","sequence":"additional","affiliation":[]},{"given":"G.","family":"Melideo","sequence":"additional","affiliation":[]},{"given":"E.","family":"Nardelli","sequence":"additional","affiliation":[]},{"given":"A.","family":"Navarra","sequence":"additional","affiliation":[]},{"given":"G.","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191891"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1147"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.11.002"},{"journal-title":"Optimal MST maintenance for transient deletion of every node in planar graphs","year":"2002","author":"gaibisso","key":"ref32"},{"journal-title":"Polynomial time algorithms for edge-connectivity augmentation problems Algorithmica","year":"0","author":"galluccio","key":"ref31"},{"key":"ref30","first-page":"617","volume":"7","author":"gr\u00f6tschel","year":"1995","journal-title":"Design of survivable networks in Handbooks in OR and MS"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BFb0023473","article-title":"Power consumption in packet radio networks","volume":"1200","author":"kirousis","year":"0","journal-title":"Proc STACS 97"},{"key":"ref36","first-page":"245","article-title":"Power efficient filtering of data on air","author":"imielinski","year":"0","journal-title":"Proceedings EDBT '94"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009225"},{"key":"ref34","first-page":"235","article-title":"The virtual path layout problem in fast networks","author":"gerstel","year":"0","journal-title":"Proceedings PODC '94"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61550-4_163"},{"key":"ref27","first-page":"319","author":"forlizzi","year":"2000","journal-title":"A data model and data structures for moving objects databases"},{"journal-title":"The Mobile Communications Handbook","year":"1999","author":"gibson","key":"ref29"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICUPC.1996.557930"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SAINT.2003.1183057"},{"key":"ref20","article-title":"An improved upper bound for scalable distributed search trees","author":"di pasquale","year":"0","journal-title":"Proceedings of the workshop on distributed data and structures (WDAS 2002)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/0221070"},{"key":"ref21","article-title":"Allocation problems in scalable distributed data structures","author":"di pasquale","year":"0","journal-title":"Proceedings of the workshop on distributed data and structures (WDAS 2002)"},{"journal-title":"Dynamic layouts for wireless ATM Technical Report 4616 MASCOTTE Project","year":"2002","author":"flammini","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626498000225"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008929"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2003.1213403"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/26.58754"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/49.64909"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916310"},{"key":"ref54","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/62.2160","article-title":"Worst-case analysis of set union algorithms","volume":"31","author":"van leeuwen","year":"1984","journal-title":"J Assoc Comput Mach"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321884"},{"key":"ref52","article-title":"A survey of wireless ATM MAC protocols","author":"sobirk","year":"1997","journal-title":"Proc of the International Conference on the Performance and Management of Complex Communication Networks (PMCCN '97)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1994.337618"},{"key":"ref11","first-page":"103","article-title":"A context-aware approach to infer trust in public key infrastructures","author":"di vito","year":"0","journal-title":"Proc of the International Workshop on Certification and Security in E-Services (CSES'02)"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/BF00140950"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916660"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.971737"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916283"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44472-6_19"},{"key":"ref16","article-title":"An amortized lower bound for distributed searching of k-dimensional data","author":"di pasquale","year":"0","journal-title":"Proc WDAS 2000"},{"key":"ref17","article-title":"Scalable distributed data structures: a survey","author":"di pasquale","year":"0","journal-title":"Proc WDAS 2000"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44759-8_20"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45627-9_18"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/35.90492"},{"article-title":"Addressing and balancing issues in distributed B+ -trees","year":"0","author":"breitbart","key":"ref3"},{"key":"ref6","first-page":"209","article-title":"A scalable approach to routing in ATM networks","volume":"857","author":"cidon","year":"0","journal-title":"Proc WDAG '94"},{"key":"ref5","first-page":"34","article-title":"A survey of wireless ATM handover issues","author":"chrysostomou","year":"2001","journal-title":"Proc Int Symp 3G Infrastructure and Services"},{"key":"ref8","first-page":"143","article-title":"The minimum range assignment problem on linear radio networks","volume":"1879","author":"clementi","year":"0","journal-title":"Proc ESANN 2000"},{"key":"ref7","first-page":"197","article-title":"Hardness results for the power range assignment problem in packet radio networks","volume":"1671","author":"clementi","year":"0","journal-title":"Proc APPROX'99"},{"journal-title":"Wireless Information Networks","year":"1995","author":"pahvalan","key":"ref49"},{"key":"ref9","first-page":"121","article-title":"On the complexity of computing minimum energy consumption broadcast subgraphs","volume":"2010","author":"clementi","year":"0","journal-title":"Proc STACS'01"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00039"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35696-9"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45253-2_32"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48686-0_14"},{"key":"ref42","first-page":"342","article-title":"RP*-A family of order-preserving scalable distributed data structure","author":"litwin","year":"0","journal-title":"Proc VLDB'94"},{"key":"ref41","first-page":"327","article-title":"LH*-Linear hashing for distributed files","author":"litwin","year":"0","journal-title":"Proc SIGMOD-93"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1428"},{"key":"ref43","article-title":"The GSM System for Mobile Communications","author":"mouly","year":"1993","journal-title":"Cell & Sys"}],"event":{"name":"International Parallel and Distributed Processing Symposium (IPDPS 2003)","acronym":"IPDPS-03","location":"Nice, France"},"container-title":["Proceedings International Parallel and Distributed Processing Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8608\/27277\/01213411.pdf?arnumber=1213411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:26:03Z","timestamp":1497572763000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1213411\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2003.1213411","relation":{},"subject":[]}}