Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360881
Tong-Tao Li, M. Fei
To reduce the energy consumption and extend the network's survival time is the key research problem in the Wireless Sensor Network. Much research work has been done on the placement of nodes and routing protocol, eliminating data redundancy by density controlling and hierarchical clustering algorithm. In this paper, it is proposed that information fusion is an effective way to reduce the communication data, save the energy consumption and thereby extend the life of the network. With the specific analysis an information fusion algorithm based on rough set is designed.
{"title":"Information fusion in Wireless Sensor Network based on rough set","authors":"Tong-Tao Li, M. Fei","doi":"10.1109/ICNIDC.2009.5360881","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360881","url":null,"abstract":"To reduce the energy consumption and extend the network's survival time is the key research problem in the Wireless Sensor Network. Much research work has been done on the placement of nodes and routing protocol, eliminating data redundancy by density controlling and hierarchical clustering algorithm. In this paper, it is proposed that information fusion is an effective way to reduce the communication data, save the energy consumption and thereby extend the life of the network. With the specific analysis an information fusion algorithm based on rough set is designed.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"34 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":"133357195","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.5360884
Zhilong Zhang, Danpu Liu, Huarui Wu
Frame rate up-conversion (FRUC) is effective to enhance video quality at LCD TV. In this paper, a new method based on matching classification and dominant objects tracking is proposed. Blocks to be interpolated are classified into 4 types: matched, unmatched, uncertain and unrelated according to the results of bilateral block matching. Dominant object tracking helps to refine the results. Then an adaptive median motion vector (MV) filter based on the classification results is employed to smooth the MV field. Empirical results show that the proposed method provides high quality MV field and improves the performance of FRUC.
{"title":"Frame rate up-conversion based on matching classification and dominant object tracking","authors":"Zhilong Zhang, Danpu Liu, Huarui Wu","doi":"10.1109/ICNIDC.2009.5360884","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360884","url":null,"abstract":"Frame rate up-conversion (FRUC) is effective to enhance video quality at LCD TV. In this paper, a new method based on matching classification and dominant objects tracking is proposed. Blocks to be interpolated are classified into 4 types: matched, unmatched, uncertain and unrelated according to the results of bilateral block matching. Dominant object tracking helps to refine the results. Then an adaptive median motion vector (MV) filter based on the classification results is employed to smooth the MV field. Empirical results show that the proposed method provides high quality MV field and improves the performance of FRUC.","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":"124180094","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.5360848
Gang He, Feiyue Lu, Andong Guo, Xiaochun Wu
Stochastic Fairness Queuing scheduling scheme resolved the connection level fairness problem and are widely used in traditional network, however, with rapid development of P2P services in internet, this classical algorithms failed in maintaining fairness among hosts. In this paper we proposed an improved SFQ algorithm: Dual Class SFQ to ensure the fairness among hosts using different type of services. In DC SFQ, periodical perturbed hash functions originally used in SFQ are modified into Bloom Filter to identify the high load P2P hosts. DC SFQ uses 2 classes of queues to separate the P2P hosts and normal hosts to guarantee fairness among hosts. By adjusting the scheduling weight between these 2 classes of queues we can achieve an ideal balance between the traditional network services and P2P services. Analysis and simulation results show that DC SFQ can solve the packet scheduling problem for hybrid traffic at the cost of acceptable increase of complexity.
{"title":"DC-SFQ: An improved Stochastic Fairness Queuing algorithm","authors":"Gang He, Feiyue Lu, Andong Guo, Xiaochun Wu","doi":"10.1109/ICNIDC.2009.5360848","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360848","url":null,"abstract":"Stochastic Fairness Queuing scheduling scheme resolved the connection level fairness problem and are widely used in traditional network, however, with rapid development of P2P services in internet, this classical algorithms failed in maintaining fairness among hosts. In this paper we proposed an improved SFQ algorithm: Dual Class SFQ to ensure the fairness among hosts using different type of services. In DC SFQ, periodical perturbed hash functions originally used in SFQ are modified into Bloom Filter to identify the high load P2P hosts. DC SFQ uses 2 classes of queues to separate the P2P hosts and normal hosts to guarantee fairness among hosts. By adjusting the scheduling weight between these 2 classes of queues we can achieve an ideal balance between the traditional network services and P2P services. Analysis and simulation results show that DC SFQ can solve the packet scheduling problem for hybrid traffic at the cost of acceptable increase of complexity.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"59 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":"128913510","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.5360982
Feng Qiu, M. Xue, Yajuan Qin, Hongke Zhang
The future network will support global roaming seamless and service provider portability. An identifier locator (ID/Loc) separation solution can achieve such a goal. Nevertheless, this ID/Loc separation scheme implies the need of adding a mapping system to store and maintain the binding between locators and identifiers. And this approach may introduce large signaling of the location update and the call delivery into the mapping system. This paper proposed a scalable, robust and high-throughput mapping system. The proposed mapping system consists of a number of three-level tree subsystems, the top-level mapping servers of which constitute a Distributed Hash Table (DHT) ring. To evaluate the efficiency of the proposed distributed mapping system in terms of supporting mobility, we propose a location management mechanism, establish an analytical model, and formulate the location update and the call delivery cost. Numerical results demonstrate that the proposed mapping system can effectively reduce the burden of mapping systems as well as the signaling traffic and achieve greater scalability by supporting a high user density.
{"title":"A distributed mapping system to support mobility in identifier/locator separation architecture","authors":"Feng Qiu, M. Xue, Yajuan Qin, Hongke Zhang","doi":"10.1109/ICNIDC.2009.5360982","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360982","url":null,"abstract":"The future network will support global roaming seamless and service provider portability. An identifier locator (ID/Loc) separation solution can achieve such a goal. Nevertheless, this ID/Loc separation scheme implies the need of adding a mapping system to store and maintain the binding between locators and identifiers. And this approach may introduce large signaling of the location update and the call delivery into the mapping system. This paper proposed a scalable, robust and high-throughput mapping system. The proposed mapping system consists of a number of three-level tree subsystems, the top-level mapping servers of which constitute a Distributed Hash Table (DHT) ring. To evaluate the efficiency of the proposed distributed mapping system in terms of supporting mobility, we propose a location management mechanism, establish an analytical model, and formulate the location update and the call delivery cost. Numerical results demonstrate that the proposed mapping system can effectively reduce the burden of mapping systems as well as the signaling traffic and achieve greater scalability by supporting a high user density.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"357 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":"115852876","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.5360795
Chuan Wang, Bin Zhang, Guohui Li, Jin Zhou, Jun Guo
The paper focuses on implementation of association pattern between the network performances and the general network faults. We use network simulation tool, OPNET, to accomplish network simulations of different network faults and different situations based on VoIP. Network performance parameters such as end-to-end delay, jitter, traffic dropped, queuing delay, link throughout, link utilization are monitored and collected. The simulation results are processed using data mining software, Weka, to discover the association pattern.
{"title":"Analysis and research of association pattern between network performances and faults in voip network","authors":"Chuan Wang, Bin Zhang, Guohui Li, Jin Zhou, Jun Guo","doi":"10.1109/ICNIDC.2009.5360795","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360795","url":null,"abstract":"The paper focuses on implementation of association pattern between the network performances and the general network faults. We use network simulation tool, OPNET, to accomplish network simulations of different network faults and different situations based on VoIP. Network performance parameters such as end-to-end delay, jitter, traffic dropped, queuing delay, link throughout, link utilization are monitored and collected. The simulation results are processed using data mining software, Weka, to discover the association pattern.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"13 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":"116822693","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.5360935
Haiying Sun, Mingyong Pang
This paper gives a comprehensive introduction and analysis of MD2 file format, which is a general storing structure of animation data and is often used in computer video games. In this paper, the basic structure of the format is introduced and details of organization of animation data in the format are thoroughly discussed. A set of methods to access the constructed data in the files with the MD2 format are also scribed. A simple but representative animation file with MD2 the format is employed to help the discussion and understanding of the format. Our work in the paper provides game-developers a basic reference on how to access and control the animation models of the format.
{"title":"Analysis and application of MD2 file format","authors":"Haiying Sun, Mingyong Pang","doi":"10.1109/ICNIDC.2009.5360935","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360935","url":null,"abstract":"This paper gives a comprehensive introduction and analysis of MD2 file format, which is a general storing structure of animation data and is often used in computer video games. In this paper, the basic structure of the format is introduced and details of organization of animation data in the format are thoroughly discussed. A set of methods to access the constructed data in the files with the MD2 format are also scribed. A simple but representative animation file with MD2 the format is employed to help the discussion and understanding of the format. Our work in the paper provides game-developers a basic reference on how to access and control the animation models of the format.","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":"116856060","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.5360963
Shaosheng Li, Wenze Li, Jian-Chun Zhu
Considering that ordinary ZigBee based systems operate at a rate of 250kbps, which imposes various limitations on their applications, and that there are 16 independent channels at 2.4GHz, this paper presents a novel approach of FPGA controlled, ZigBee protocol based multi-frequency high speed wireless Ad Hoc network. The system employed five individual ZigBee modules around a FPGA controller, merging five sub-networks into a system with higher throughput, thus reaching a maximum one-way data rate of 1Mbps, which can be dynamically assigned to up-link and down-link. This system can maintain the Ad-Hoc feature of ZigBee technology, and at the same time sustain a higher capacity. This approach may expend the application of ZigBee technology to areas in demand of higher data transmission rates.
{"title":"A novel ZigBee based high speed Ad Hoc communication network","authors":"Shaosheng Li, Wenze Li, Jian-Chun Zhu","doi":"10.1109/ICNIDC.2009.5360963","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360963","url":null,"abstract":"Considering that ordinary ZigBee based systems operate at a rate of 250kbps, which imposes various limitations on their applications, and that there are 16 independent channels at 2.4GHz, this paper presents a novel approach of FPGA controlled, ZigBee protocol based multi-frequency high speed wireless Ad Hoc network. The system employed five individual ZigBee modules around a FPGA controller, merging five sub-networks into a system with higher throughput, thus reaching a maximum one-way data rate of 1Mbps, which can be dynamically assigned to up-link and down-link. This system can maintain the Ad-Hoc feature of ZigBee technology, and at the same time sustain a higher capacity. This approach may expend the application of ZigBee technology to areas in demand of higher data transmission rates.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"27 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":"114529905","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.5360987
Xian Zhang, Yongli Zhao, C. Phillips, Shanguo Huang, Jie Zhang
Generalized Multi-Protocol Label Switching (GMPLS) based optical networks are viewed as a promising network infrastructure for the next generation network (NGN) development. By pre-configuring the resources of dynamic optical networks, we can reconstruct the physical topology, thus increase the number of direct routes between potentially heavily loaded physical node pairs and optimize the performance of the optical networks. This article presents the introduction to the optical network topology pre-configuration schemes and verifies the effectiveness of the QoS (Quality of Service) routing algorithm in the pre-configured topology of GMPLS-based optical networks. Simulation results show that the implementation of the QoS routing algorithm in the pre-configured GMPLS-based optical networks is instrumental in shortening the average establishing time of the control plane whilst maintaining the low block probability.
基于通用多协议标签交换(GMPLS)的光网络被认为是下一代网络(NGN)发展的一种很有前途的网络基础设施。通过对动态光网络的资源进行预配置，可以重构物理拓扑，从而增加可能负载过重的物理节点对之间的直接路由数量，优化光网络的性能。本文介绍了光网络拓扑预配置方案，并验证了QoS (Quality of Service)路由算法在基于gmpls的光网络拓扑预配置中的有效性。仿真结果表明，在预配置的gmpls光网络中实施QoS路由算法有助于在保持低阻塞概率的同时缩短控制平面的平均建立时间。
{"title":"Pre-configuration based QoS routing in GMPLS-based optical networks","authors":"Xian Zhang, Yongli Zhao, C. Phillips, Shanguo Huang, Jie Zhang","doi":"10.1109/ICNIDC.2009.5360987","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360987","url":null,"abstract":"Generalized Multi-Protocol Label Switching (GMPLS) based optical networks are viewed as a promising network infrastructure for the next generation network (NGN) development. By pre-configuring the resources of dynamic optical networks, we can reconstruct the physical topology, thus increase the number of direct routes between potentially heavily loaded physical node pairs and optimize the performance of the optical networks. This article presents the introduction to the optical network topology pre-configuration schemes and verifies the effectiveness of the QoS (Quality of Service) routing algorithm in the pre-configured topology of GMPLS-based optical networks. Simulation results show that the implementation of the QoS routing algorithm in the pre-configured GMPLS-based optical networks is instrumental in shortening the average establishing time of the control plane whilst maintaining the low block probability.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"12 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":"115844141","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.5360906
Xuejun Li, Meng Xu
Water simulation has been a hot spot in the research of computer graphics, especially in 3D games and animations. In this paper, we propose a convenient method for simulating and rendering large bodies of water on the computer's graphic processing unit (GPU). This method can be implemented using high level shading language (HLSL) with high speed as the vertex processing is realized based on GPU hardware. Experimental results demonstrate that the simulation in this method is realistic, rapid and applicable in the real-time rendering applications.
{"title":"Water simulation based on HLSL","authors":"Xuejun Li, Meng Xu","doi":"10.1109/ICNIDC.2009.5360906","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360906","url":null,"abstract":"Water simulation has been a hot spot in the research of computer graphics, especially in 3D games and animations. In this paper, we propose a convenient method for simulating and rendering large bodies of water on the computer's graphic processing unit (GPU). This method can be implemented using high level shading language (HLSL) with high speed as the vertex processing is realized based on GPU hardware. Experimental results demonstrate that the simulation in this method is realistic, rapid and applicable in the real-time rendering applications.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"172 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":"114239302","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.5360877
Yubin Xu, Mu Zhou, Lin Ma
This paper proposes the WiFi indoor location determination method based on adaptive neuro-fuzzy inference system (ANFIS) with principal component analysis (PCA). It reduces the WiFi signal vectors dimensions and saves the storage cost and simplifies the fuzzy rules generated by subtractive clustering method for ANFIS training. In the off-line phase, the received signal strength (RSS) or signal to noise ratio (SNR) from multiple access points (APs) is recorded for the establishment of radio map. And in the on-line phase, two steps should be considered for the position determination. The first step is space transformation to principal component space with lower dimensions compared to original space for the signal vectors. And the second step is the estimation of real two or three dimensional coordinates of mobile terminal (MT). Feasibility and effectiveness of ANFIS system based on FCA method are verified according to the analysis of the iterative number of training and experimental comparison with K-nearest neighbor (KNN), probability, artificial neural network (ANN) and ANFIS indoor location system without FCA.
{"title":"WiFi indoor location determination via ANFIS with PCA methods","authors":"Yubin Xu, Mu Zhou, Lin Ma","doi":"10.1109/ICNIDC.2009.5360877","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360877","url":null,"abstract":"This paper proposes the WiFi indoor location determination method based on adaptive neuro-fuzzy inference system (ANFIS) with principal component analysis (PCA). It reduces the WiFi signal vectors dimensions and saves the storage cost and simplifies the fuzzy rules generated by subtractive clustering method for ANFIS training. In the off-line phase, the received signal strength (RSS) or signal to noise ratio (SNR) from multiple access points (APs) is recorded for the establishment of radio map. And in the on-line phase, two steps should be considered for the position determination. The first step is space transformation to principal component space with lower dimensions compared to original space for the signal vectors. And the second step is the estimation of real two or three dimensional coordinates of mobile terminal (MT). Feasibility and effectiveness of ANFIS system based on FCA method are verified according to the analysis of the iterative number of training and experimental comparison with K-nearest neighbor (KNN), probability, artificial neural network (ANN) and ANFIS indoor location system without FCA.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"43 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":"114923660","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
扫码关注我们
求助内容：
应助结果提醒方式：