Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360966
Caihong Zhang, Li Guo
This paper focuses on pre-coding schemes for the downlink of multiple user multi-input multi-output (MU-MIMO) system in cognitive radio (CR) network. The spectrum band can be utilized by allowing a number of cognitive users to coexist with primary users (PUs) through a pre-coding scheme. The capacity problems maximize the sum rate of CUs subject to the interference constraint for PUs and total transmitted power constraint can be solved with high complexity. To simplify the problem, this paper presents two suboptimal pre-coding schemes that pre-cancel the co-channel interference to PUs as well as mitigate interference between cognitive users (CUs). Simulation results show that the two suboptimal algorithms are able to achieve high sum rate throughput with low complexity.
{"title":"BD precoding schemes for cognitive MIMO system","authors":"Caihong Zhang, Li Guo","doi":"10.1109/ICNIDC.2009.5360966","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360966","url":null,"abstract":"This paper focuses on pre-coding schemes for the downlink of multiple user multi-input multi-output (MU-MIMO) system in cognitive radio (CR) network. The spectrum band can be utilized by allowing a number of cognitive users to coexist with primary users (PUs) through a pre-coding scheme. The capacity problems maximize the sum rate of CUs subject to the interference constraint for PUs and total transmitted power constraint can be solved with high complexity. To simplify the problem, this paper presents two suboptimal pre-coding schemes that pre-cancel the co-channel interference to PUs as well as mitigate interference between cognitive users (CUs). Simulation results show that the two suboptimal algorithms are able to achieve high sum rate throughput with low complexity.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129723297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360902
Fuan Wen, Jian Zhang, Yan-ming Tian
This paper designs and implements an individualized multimedia e-learning platform, multi systems based on one platform are published for various learning groups such as primary and middle school students, college students, or students of adult education. It based on J2EE and adopts the popular open source architectures SSH (struts, spring and hibernate). The philosophy of the question and test driven (QTD) are realized in the platform. A set of function for learner guide, the process control and teaching evaluation is provided. The application turns out that the platform is reasonably designed and can fully meet the requirements of school or individual learners.
{"title":"Notice of RetractionDesign and application of an E-learning platform for various learning groups","authors":"Fuan Wen, Jian Zhang, Yan-ming Tian","doi":"10.1109/ICNIDC.2009.5360902","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360902","url":null,"abstract":"This paper designs and implements an individualized multimedia e-learning platform, multi systems based on one platform are published for various learning groups such as primary and middle school students, college students, or students of adult education. It based on J2EE and adopts the popular open source architectures SSH (struts, spring and hibernate). The philosophy of the question and test driven (QTD) are realized in the platform. A set of function for learner guide, the process control and teaching evaluation is provided. The application turns out that the platform is reasonably designed and can fully meet the requirements of school or individual learners.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130114540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360964
Yun Liu, Wenjie Li, Ran Cai, Qiong Sun, Xiaohua Huang, Yan Ma
Packet classification (PC) is one of the core technologies for next generation network service. The goal is to classify packet into different “flow” and classification result can be applied in Differentiated Service. Though many multi-dimensional classifications have been put forward, few of them could accomplish fast search speed, low storage requirements and fast updates at the same time, especially when these algorithms are revised from IPv4 to IPv6. In this paper, we present an innovative packet classification algorithm, called Partial Paralleled algorithm based on Plus Bits (P3). P3 algorithm begins by two paralleled single-field engines and followed by hash table of the remained 3 fields. A novel structure, Plus Bits, is introduced to reduce hash memory accesses. For a 4k filterset, P3 algorithm can achieve about 9 memory accesses on average, taking 326 KB of memory for its data structure and supporting incremental update. We show that our P3 algorithm can meet the demand of current PC requirements.
{"title":"An innovative paralleled packet algorithm with Plus Bits","authors":"Yun Liu, Wenjie Li, Ran Cai, Qiong Sun, Xiaohua Huang, Yan Ma","doi":"10.1109/ICNIDC.2009.5360964","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360964","url":null,"abstract":"Packet classification (PC) is one of the core technologies for next generation network service. The goal is to classify packet into different “flow” and classification result can be applied in Differentiated Service. Though many multi-dimensional classifications have been put forward, few of them could accomplish fast search speed, low storage requirements and fast updates at the same time, especially when these algorithms are revised from IPv4 to IPv6. In this paper, we present an innovative packet classification algorithm, called Partial Paralleled algorithm based on Plus Bits (P3). P3 algorithm begins by two paralleled single-field engines and followed by hash table of the remained 3 fields. A novel structure, Plus Bits, is introduced to reduce hash memory accesses. For a 4k filterset, P3 algorithm can achieve about 9 memory accesses on average, taking 326 KB of memory for its data structure and supporting incremental update. We show that our P3 algorithm can meet the demand of current PC requirements.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128031973","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360977
Yuanxin Jiang, Doohyun Kim, S. Cho
In this paper, we propose a method to save energy consumption for the rejoin procedure of ZigBee networks. By skipping the active scan process, a rejoining node and its neighbors are able to save a large amount of energy. In addition, the rejoining node chooses the suitable potential parent by reserving and utilizing original neighbor table. This method is capable of reducing the number of rejoin request command frames, thus reducing the network traffic to some extent. Simulation results demonstrate that the proposed rejoin procedure contributes to more effective and efficient energy consumption.
{"title":"An improved rejoin procedure in ZigBee networks","authors":"Yuanxin Jiang, Doohyun Kim, S. Cho","doi":"10.1109/ICNIDC.2009.5360977","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360977","url":null,"abstract":"In this paper, we propose a method to save energy consumption for the rejoin procedure of ZigBee networks. By skipping the active scan process, a rejoining node and its neighbors are able to save a large amount of energy. In addition, the rejoining node chooses the suitable potential parent by reserving and utilizing original neighbor table. This method is capable of reducing the number of rejoin request command frames, thus reducing the network traffic to some extent. Simulation results demonstrate that the proposed rejoin procedure contributes to more effective and efficient energy consumption.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126024354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360871
Mengyang Chen, Aidong Men, Peng Fan, Bo Yang
Bad weather, such as fog and haze can significantly degrade the visibility of a scene. In order to overcome it, some approaches have been proposed. In this paper, we proposed a novel defogging algorithm just based on a single image. Firstly, we employ the method of dark channel prior as a foundation of our algorithm. After experimental analysis about the dark channel prior haze removal, we find that although dark channel prior behaves well in most situations, it also results in larger saturation values in some specific situations. Then, focusing on these situations, we propose an iterative algorithm to adjust the color distortion effected by higher saturation. Actually, this kind of global or local rectification can achieve a relatively ideal compromise between natural color and image definition. Experiments show that the algorithm proposed in this paper is good at dealing with the similarity-to-atmospheric-light objects defogging problem.
{"title":"Single image defogging","authors":"Mengyang Chen, Aidong Men, Peng Fan, Bo Yang","doi":"10.1109/ICNIDC.2009.5360871","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360871","url":null,"abstract":"Bad weather, such as fog and haze can significantly degrade the visibility of a scene. In order to overcome it, some approaches have been proposed. In this paper, we proposed a novel defogging algorithm just based on a single image. Firstly, we employ the method of dark channel prior as a foundation of our algorithm. After experimental analysis about the dark channel prior haze removal, we find that although dark channel prior behaves well in most situations, it also results in larger saturation values in some specific situations. Then, focusing on these situations, we propose an iterative algorithm to adjust the color distortion effected by higher saturation. Actually, this kind of global or local rectification can achieve a relatively ideal compromise between natural color and image definition. Experiments show that the algorithm proposed in this paper is good at dealing with the similarity-to-atmospheric-light objects defogging problem.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114061865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360806
Zhichao Yang, Bin Zhang, Guohui Li, Yan Li, Xuesong Gao
NETCONF is a new network management protocol, based on the XML encoding method, which was proposed by IETF in 2006. It aims to overcome the shortcomings of SNMP predominantly used for configuration tasks at present. In the NETCONF protocol, subtree filtering mechanism and XPath capability is defined, both used to allow a client to select particular XML subtrees of the data model of the server. In this paper, we describe how we implement the two mechanisms and evaluate them from two aspects of functionality and performance. We find that the subtree filtering is not as flexible as XPath capability, but has better performance.
{"title":"The implementation and comparison analysis of subtree filtering and Xpath capability in NETCONF","authors":"Zhichao Yang, Bin Zhang, Guohui Li, Yan Li, Xuesong Gao","doi":"10.1109/ICNIDC.2009.5360806","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360806","url":null,"abstract":"NETCONF is a new network management protocol, based on the XML encoding method, which was proposed by IETF in 2006. It aims to overcome the shortcomings of SNMP predominantly used for configuration tasks at present. In the NETCONF protocol, subtree filtering mechanism and XPath capability is defined, both used to allow a client to select particular XML subtrees of the data model of the server. In this paper, we describe how we implement the two mechanisms and evaluate them from two aspects of functionality and performance. We find that the subtree filtering is not as flexible as XPath capability, but has better performance.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114055391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360951
Bin Sun, Wenzhi Zhang, Bin Yu
In this paper, we modify OLSR for MANET nodes to achieve full connection to Internet through multiple mobile gateways. We present a proactive mobile IP approach using Hello message and TC message to maintain the MANET nodes movement. The Mobile Gateway Multiple Metrics Selection algorithm can select the best one among the active multiple mobile gateways. The simulation result shows that our approach keeps the Mobile IP overhead costs lower than the existing schemes.
{"title":"Modify OLSR for MANET/Internet interconnecting with mobile gateways","authors":"Bin Sun, Wenzhi Zhang, Bin Yu","doi":"10.1109/ICNIDC.2009.5360951","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360951","url":null,"abstract":"In this paper, we modify OLSR for MANET nodes to achieve full connection to Internet through multiple mobile gateways. We present a proactive mobile IP approach using Hello message and TC message to maintain the MANET nodes movement. The Mobile Gateway Multiple Metrics Selection algorithm can select the best one among the active multiple mobile gateways. The simulation result shows that our approach keeps the Mobile IP overhead costs lower than the existing schemes.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"289 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122823491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360981
Xiaoli Wu, Bo Xiao, Zhiqing Lin
User recommendation problem is important for mobile operators when they provide some new service to users. The traditional methods provide a low success rate. In this paper, we present a novel user selection method of advertising recommendation according to the maximal frequent items discovery theory. The experimental results demonstrate that our method can improve the success rate dramatically and reduce the amount of garbage advertisements.
{"title":"A user selection method in advertising recommendations","authors":"Xiaoli Wu, Bo Xiao, Zhiqing Lin","doi":"10.1109/ICNIDC.2009.5360981","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360981","url":null,"abstract":"User recommendation problem is important for mobile operators when they provide some new service to users. The traditional methods provide a low success rate. In this paper, we present a novel user selection method of advertising recommendation according to the maximal frequent items discovery theory. The experimental results demonstrate that our method can improve the success rate dramatically and reduce the amount of garbage advertisements.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120896686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360783
Li He, Jieming Wu, Xiao-Ling Fu
With the development of GPS, GIS and mobile network communication technology, it has been becoming possible for mobile phone users to acquire the geographical information anytime and anywhere. This paper proposes a novel solution of embedded navigation system based on GPS/GIS that realizes some functions such as PDA data enquiry and parsing, terminal communication service, map application service, geographic information collection, embedded navigation electronic map etc. In this paper, we discuss the system topology architecture, technical scheme and the key realization technologies. At last, test results prove that the solution of embedded navigation system based on GPS/GIS is feasible and valid, and it can be installed in PDA, mobile phones and other portable information terminals.
{"title":"Design and implementation of GPS&GIS -based mobile navigation system","authors":"Li He, Jieming Wu, Xiao-Ling Fu","doi":"10.1109/ICNIDC.2009.5360783","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360783","url":null,"abstract":"With the development of GPS, GIS and mobile network communication technology, it has been becoming possible for mobile phone users to acquire the geographical information anytime and anywhere. This paper proposes a novel solution of embedded navigation system based on GPS/GIS that realizes some functions such as PDA data enquiry and parsing, terminal communication service, map application service, geographic information collection, embedded navigation electronic map etc. In this paper, we discuss the system topology architecture, technical scheme and the key realization technologies. At last, test results prove that the solution of embedded navigation system based on GPS/GIS is feasible and valid, and it can be installed in PDA, mobile phones and other portable information terminals.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126826811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360854
Shiguo Wang
In single relay non-cooperative amplify-and-forward (AaF) system, taking into account both long-term path loss and short-term Rayleigh fading, a closed form expression to distribute total power optimally among source and relay is obtained, which minimize end-to-end BER. The simulation results under various channel conditions and scenarios show that it is consistent with theoretical analysis, and optimal power allocation is realized to minimize BER in a simple way.
{"title":"BER-optimized power allocation for amplify-and-forward in single relay system","authors":"Shiguo Wang","doi":"10.1109/ICNIDC.2009.5360854","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360854","url":null,"abstract":"In single relay non-cooperative amplify-and-forward (AaF) system, taking into account both long-term path loss and short-term Rayleigh fading, a closed form expression to distribute total power optimally among source and relay is obtained, which minimize end-to-end BER. The simulation results under various channel conditions and scenarios show that it is consistent with theoretical analysis, and optimal power allocation is realized to minimize BER in a simple way.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127849213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：