{"title":"组播CDMA网络中的动态软合并区域配置","authors":"Jae-Hoon Kim, Kwang-Soo Kim","doi":"10.1109/GLOCOM.2005.1578221","DOIUrl":null,"url":null,"abstract":"Focusing on multicast transmission in a CDMA based 3G system, we address a soft-combine zone configuration problem. The problem is to find a limited number of cells supporting soft-combine such that each cell has at least one neighboring cell, which also supports soft-combine, while the sum of traffic demands of the selected cells is maximized. We show that this problem is NP-hard, introduce an integer programming formulation, and develop an algorithm generating upper and lower bounds for the soft-combine zone configuration problem, which enables the optimal zone configuration easy to solve in real-time fashion","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Dynamic soft-combine zone configuration in a multicast CDMA network\",\"authors\":\"Jae-Hoon Kim, Kwang-Soo Kim\",\"doi\":\"10.1109/GLOCOM.2005.1578221\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Focusing on multicast transmission in a CDMA based 3G system, we address a soft-combine zone configuration problem. The problem is to find a limited number of cells supporting soft-combine such that each cell has at least one neighboring cell, which also supports soft-combine, while the sum of traffic demands of the selected cells is maximized. We show that this problem is NP-hard, introduce an integer programming formulation, and develop an algorithm generating upper and lower bounds for the soft-combine zone configuration problem, which enables the optimal zone configuration easy to solve in real-time fashion\",\"PeriodicalId\":319736,\"journal\":{\"name\":\"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-11-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2005.1578221\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2005.1578221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dynamic soft-combine zone configuration in a multicast CDMA network
Focusing on multicast transmission in a CDMA based 3G system, we address a soft-combine zone configuration problem. The problem is to find a limited number of cells supporting soft-combine such that each cell has at least one neighboring cell, which also supports soft-combine, while the sum of traffic demands of the selected cells is maximized. We show that this problem is NP-hard, introduce an integer programming formulation, and develop an algorithm generating upper and lower bounds for the soft-combine zone configuration problem, which enables the optimal zone configuration easy to solve in real-time fashion
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
