{"title":"多媒体蜂窝网络中可行信道分配的带宽下界","authors":"G. K. Audhya, K. Sinha, B. Sinha","doi":"10.1109/IMSAA.2008.4753927","DOIUrl":null,"url":null,"abstract":"We derive lower bounds on the bandwidth requirement for feasible channel assignment in a hexagonal cellular network for multimedia communications. An understanding of such bounds would greatly enhance the ability of service providers to offer multimedia based applications over cellular networks. For simplicity, we consider only two types of multimedia signals, with single demand for each type at each node in a 2-band buffering environment, where interference does not extend beyond two cells. Our approach considers the feasibility of assignment at each node, based on all previously assigned channels to its neighbors. The derived lower bounds are tighter than the one reported in the literature, with an improvement of the bounds by about 17% under typical situations.","PeriodicalId":393607,"journal":{"name":"2008 2nd International Conference on Internet Multimedia Services Architecture and Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Lower bound on bandwidth for feasible channel assignment in multimedia cellular networks\",\"authors\":\"G. K. Audhya, K. Sinha, B. Sinha\",\"doi\":\"10.1109/IMSAA.2008.4753927\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We derive lower bounds on the bandwidth requirement for feasible channel assignment in a hexagonal cellular network for multimedia communications. An understanding of such bounds would greatly enhance the ability of service providers to offer multimedia based applications over cellular networks. For simplicity, we consider only two types of multimedia signals, with single demand for each type at each node in a 2-band buffering environment, where interference does not extend beyond two cells. Our approach considers the feasibility of assignment at each node, based on all previously assigned channels to its neighbors. The derived lower bounds are tighter than the one reported in the literature, with an improvement of the bounds by about 17% under typical situations.\",\"PeriodicalId\":393607,\"journal\":{\"name\":\"2008 2nd International Conference on Internet Multimedia Services Architecture and Applications\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 2nd International Conference on Internet Multimedia Services Architecture and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMSAA.2008.4753927\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 2nd International Conference on Internet Multimedia Services Architecture and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMSAA.2008.4753927","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Lower bound on bandwidth for feasible channel assignment in multimedia cellular networks
We derive lower bounds on the bandwidth requirement for feasible channel assignment in a hexagonal cellular network for multimedia communications. An understanding of such bounds would greatly enhance the ability of service providers to offer multimedia based applications over cellular networks. For simplicity, we consider only two types of multimedia signals, with single demand for each type at each node in a 2-band buffering environment, where interference does not extend beyond two cells. Our approach considers the feasibility of assignment at each node, based on all previously assigned channels to its neighbors. The derived lower bounds are tighter than the one reported in the literature, with an improvement of the bounds by about 17% under typical situations.