Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360802
Zehua Gao, Feng Gao, Bing Zhang, Fan Ning, Guo-an Zhao
The Optical Integrative Switching (OIS) networks supporting 3G is proposed in this paper. In this OIS networks which supporting 3G, four different classes of service traffic is introduced to meet the demand of 3G. We construct architecture of WDM OIS ring network which utilizes M-token signaling scheme. In the M-token access protocol, the token can be captured according to the service class. The performance is analyzed by simulation. It can be seen from the simulation, the OIS ring network using this token access protocol can efficiently support the 3G's services transporting.
{"title":"The Optical Integrative Switching networks supporting 3G mobile communications","authors":"Zehua Gao, Feng Gao, Bing Zhang, Fan Ning, Guo-an Zhao","doi":"10.1109/ICNIDC.2009.5360802","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360802","url":null,"abstract":"The Optical Integrative Switching (OIS) networks supporting 3G is proposed in this paper. In this OIS networks which supporting 3G, four different classes of service traffic is introduced to meet the demand of 3G. We construct architecture of WDM OIS ring network which utilizes M-token signaling scheme. In the M-token access protocol, the token can be captured according to the service class. The performance is analyzed by simulation. It can be seen from the simulation, the OIS ring network using this token access protocol can efficiently support the 3G's services transporting.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"193 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":"133199292","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.5360820
Y. Zeng, Dezheng Wang, Wei Liu, Ao Xiong
In order to plan the network construction reasonable and ensure the quality of network service, it is important to measure the Link-bandwidth utilization and get the flow information. One of the methods to monitor network efficiently is based on flow-conservation, and the problem of searching a solution for this method could be deduced to solving weak vertex cover problem, which has been proved NP-hard. So finding an optimum solution for weak vertex cover problem is critical for the network measurement based on flow-conservation. In this paper, we proposed a method using topology matrix to represent the topology graph information and remove the redundant nodes through back tracing the result node set. This method can get a better solution than general greedy algorithm. An example and emulation have been provided to exemplify this method.
{"title":"An approximation algorithm for weak vertex cover problem in IP network traffic measurement","authors":"Y. Zeng, Dezheng Wang, Wei Liu, Ao Xiong","doi":"10.1109/ICNIDC.2009.5360820","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360820","url":null,"abstract":"In order to plan the network construction reasonable and ensure the quality of network service, it is important to measure the Link-bandwidth utilization and get the flow information. One of the methods to monitor network efficiently is based on flow-conservation, and the problem of searching a solution for this method could be deduced to solving weak vertex cover problem, which has been proved NP-hard. So finding an optimum solution for weak vertex cover problem is critical for the network measurement based on flow-conservation. In this paper, we proposed a method using topology matrix to represent the topology graph information and remove the redundant nodes through back tracing the result node set. This method can get a better solution than general greedy algorithm. An example and emulation have been provided to exemplify this method.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"68 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":"133311019","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.5360858
Yuanyuan Zhang, Xiaojun Jing, Xiaoyong Wang
A critical and Indispensable step of an automatic fingerprint identification system (AFIS) is Fingerprint image Thinning. many algorithms have been devised and applied trying to obtain one pixel wide and 8 neighbor connected thinning result. In this paper, a method of improving the thinning result through adding eliminate structure templates is proposed. The ZS algorithm is a parallel thinning algorithm which has fast converge speed, but it also has some problems such as Distortion of the fingerprint ridge, incapability of gaining one-pixel wide skeleton. the proposed improved algorithm will solve the problems without paying extra times, as a result, more effective fingerprint minutiae points could be extracted.
{"title":"An approach to improve the ZS thinning algorithm","authors":"Yuanyuan Zhang, Xiaojun Jing, Xiaoyong Wang","doi":"10.1109/ICNIDC.2009.5360858","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360858","url":null,"abstract":"A critical and Indispensable step of an automatic fingerprint identification system (AFIS) is Fingerprint image Thinning. many algorithms have been devised and applied trying to obtain one pixel wide and 8 neighbor connected thinning result. In this paper, a method of improving the thinning result through adding eliminate structure templates is proposed. The ZS algorithm is a parallel thinning algorithm which has fast converge speed, but it also has some problems such as Distortion of the fingerprint ridge, incapability of gaining one-pixel wide skeleton. the proposed improved algorithm will solve the problems without paying extra times, as a result, more effective fingerprint minutiae points could be extracted.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"42 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":"133513250","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.5360971
Fu Zhao, Y. Gong, Li Zhang, H. Xiang, Ping Wang
Taking account of the complexity of optimization of the deformable mirror support structure, this paper puts forward an intelligent optimized method for multi variable structure. On the basis of modal analysis which is implemented by the finite element software, a method combining orthogonal experiment, artificial neural network (ANN) and genetic algorithms(GA) is applied to optimization of the structural parameters for the DM hexagon support structure. Finally, the random vibration analysis is given for the optimized support structure and the results indicate the optimization method based on artificial intelligent technology is effective.
{"title":"Structural optimization for deformable mirror hexagon support based on artificial intelligence technology","authors":"Fu Zhao, Y. Gong, Li Zhang, H. Xiang, Ping Wang","doi":"10.1109/ICNIDC.2009.5360971","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360971","url":null,"abstract":"Taking account of the complexity of optimization of the deformable mirror support structure, this paper puts forward an intelligent optimized method for multi variable structure. On the basis of modal analysis which is implemented by the finite element software, a method combining orthogonal experiment, artificial neural network (ANN) and genetic algorithms(GA) is applied to optimization of the structural parameters for the DM hexagon support structure. Finally, the random vibration analysis is given for the optimized support structure and the results indicate the optimization method based on artificial intelligent technology is effective.","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":"114656009","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.5360843
Pei Luo, Shanguo Huang, Bin Li, Jie Zhang, W. Gu
The hierarchical routing and wavelength assignment problem in Automatic Switched Optical Network (ASON) is researched. Based on our analysis, three adaptive algorithms called MLLR (Multi-Layer Least Loaded Routing Algorithm), WMLCR (Wavelength-graph-based Multi-Layer Least Congestion Routing Algorithm) and BMR (Backtracking-based Multi-Layer Routing Algorithm) are proposed. A platform named AHORSP (ASON based hierarchical optimal routing & signaling platform) supporting our routing scheme is proposed and demonstrated. The simulation shows that the proposed algorithms can have comprehensive application on the basis of their convenience to be realized, low BP performance and acceptable operation time.
{"title":"Adaptive routing and wavelength assignment algorithms for hierarchical architecture in ASON","authors":"Pei Luo, Shanguo Huang, Bin Li, Jie Zhang, W. Gu","doi":"10.1109/ICNIDC.2009.5360843","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360843","url":null,"abstract":"The hierarchical routing and wavelength assignment problem in Automatic Switched Optical Network (ASON) is researched. Based on our analysis, three adaptive algorithms called MLLR (Multi-Layer Least Loaded Routing Algorithm), WMLCR (Wavelength-graph-based Multi-Layer Least Congestion Routing Algorithm) and BMR (Backtracking-based Multi-Layer Routing Algorithm) are proposed. A platform named AHORSP (ASON based hierarchical optimal routing & signaling platform) supporting our routing scheme is proposed and demonstrated. The simulation shows that the proposed algorithms can have comprehensive application on the basis of their convenience to be realized, low BP performance and acceptable operation time.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"350 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":"132166081","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.5360852
Yanyun Zhao, A. Cai
We propose a novel relative orientation feature (ROF) to represent the contour or skeleton of a two-dimensional object. With the aid of ROF, the shapes of two objects with fine structures can be compared. Matching with ROF is invariant with respect to translation, rotation and scaling transforms. Experimental results on hand gesture recognition demonstrate the effectiveness and efficiency of ROF with the identification rate of 98% and the average computational time less than 0.45ms/frame.
{"title":"A novel relative orientation feature for shape-based object recognition","authors":"Yanyun Zhao, A. Cai","doi":"10.1109/ICNIDC.2009.5360852","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360852","url":null,"abstract":"We propose a novel relative orientation feature (ROF) to represent the contour or skeleton of a two-dimensional object. With the aid of ROF, the shapes of two objects with fine structures can be compared. Matching with ROF is invariant with respect to translation, rotation and scaling transforms. Experimental results on hand gesture recognition demonstrate the effectiveness and efficiency of ROF with the identification rate of 98% and the average computational time less than 0.45ms/frame.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"9 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":"132178480","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.5360800
Ying Sun, Yubin Xu, Di Wu
In this paper, BGP-Update based monitoring method is proposed to effectively alleviate bandwidth tension and link congestion, and eventually resolve the problem of update message flooding when routing anomalies. Such monitoring method tracks routings and dynamically displays the alternations of selected routings and its updating quantities by analyzing collected BGP-Update messages. With the help of Internet routing structure in IP level from AS diagram we will successfully locate routing anomalies quickly. Moreover, in the paper we establish a new framework for routing message filtering — classifying update messages to reduce bandwidth waste and storage space waste when excluding causes of routing anomalies one by one, which demonstrates the superiority and great applicable prospects.
{"title":"The implementation of BGP-Update based monitoring method for routing anomalies","authors":"Ying Sun, Yubin Xu, Di Wu","doi":"10.1109/ICNIDC.2009.5360800","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360800","url":null,"abstract":"In this paper, BGP-Update based monitoring method is proposed to effectively alleviate bandwidth tension and link congestion, and eventually resolve the problem of update message flooding when routing anomalies. Such monitoring method tracks routings and dynamically displays the alternations of selected routings and its updating quantities by analyzing collected BGP-Update messages. With the help of Internet routing structure in IP level from AS diagram we will successfully locate routing anomalies quickly. Moreover, in the paper we establish a new framework for routing message filtering — classifying update messages to reduce bandwidth waste and storage space waste when excluding causes of routing anomalies one by one, which demonstrates the superiority and great applicable prospects.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"23 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":"128243692","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}
With continuously development of the Ad hoc network technology, integrating with other networks becomes one of the trends. Due to the involvement of other networks, routing strategy needs to change with the development. To considerate the key factors whose influence are serious comprehensively is needed. For those reasons, this paper proposes a novel concept of the optimal routing function, which considers the location of the nodes, mobility, and left battery capacity together to decide the routing. At the same time, a novel routing handoff strategy based on the optimal routing function was proposed. When the routing link becomes too poor to be used, it will be switched to the other routing link. The routing handoff strategy route is able to reduce the disruption rate, improve system routing reliability.
{"title":"A novel routing algorithm based on ORF in mobile Ad hoc networks","authors":"Shoufeng Wang, Yinghai Zhang, Yu Liu, Zongwen Wang, Weidong Wang, Xiaoxiao Jiang","doi":"10.1109/ICNIDC.2009.5360893","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360893","url":null,"abstract":"With continuously development of the Ad hoc network technology, integrating with other networks becomes one of the trends. Due to the involvement of other networks, routing strategy needs to change with the development. To considerate the key factors whose influence are serious comprehensively is needed. For those reasons, this paper proposes a novel concept of the optimal routing function, which considers the location of the nodes, mobility, and left battery capacity together to decide the routing. At the same time, a novel routing handoff strategy based on the optimal routing function was proposed. When the routing link becomes too poor to be used, it will be switched to the other routing link. The routing handoff strategy route is able to reduce the disruption rate, improve system routing reliability.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"91 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":"128643848","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.5360873
Chun Jin, Xing Liu, Z. Ren
The fatal weakness of wireless sensor is the problem of energy consumption. The AODV protocol is based on the minimum number of hops. However, it may not be the optimal routing. Considering from the perspective of remaining energy of nodes, we found this protocol is more likely to result in the death of nodes. In order to solve this problem, we divided the nodes into three stages according to the residual energy of them. Then we improved each phase of the protocol in order to ensure the maximize life of each node, so that the survival time of entire network would be improved obviously.
{"title":"Energy-based wireless sensor networks to improve the AODV protocol","authors":"Chun Jin, Xing Liu, Z. Ren","doi":"10.1109/ICNIDC.2009.5360873","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360873","url":null,"abstract":"The fatal weakness of wireless sensor is the problem of energy consumption. The AODV protocol is based on the minimum number of hops. However, it may not be the optimal routing. Considering from the perspective of remaining energy of nodes, we found this protocol is more likely to result in the death of nodes. In order to solve this problem, we divided the nodes into three stages according to the residual energy of them. Then we improved each phase of the protocol in order to ensure the maximize life of each node, so that the survival time of entire network would be improved obviously.","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":"134158249","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.5360816
Liu Wen, Zehua Gao, Feng Gao, D. Tang, Ronghua Zhao
The maximum nominal data rate specified in IEEE 802.11a is up to 54Mbps. However, in practice, we find that the data rate which users can get is much lower than that. In order to accurately evaluate the ability of IEEE 802.11a to support data services, we improve the existing two-dimensional Markov chain models of the backoff window scheme, and analyze the efficiency of the IEEE 802.11a standard for wireless LANs in non-saturation conditions from the perspective of framing efficiency and MAC layer channel transport efficiency in this paper. Specifically, we derive an analytical formula for the protocol actual throughput. The proposed model and the analytical results will help researchers to further study how to predict and optimize the system performance.
{"title":"Performance analysis of IEEE 802.11a in non-saturation conditions","authors":"Liu Wen, Zehua Gao, Feng Gao, D. Tang, Ronghua Zhao","doi":"10.1109/ICNIDC.2009.5360816","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360816","url":null,"abstract":"The maximum nominal data rate specified in IEEE 802.11a is up to 54Mbps. However, in practice, we find that the data rate which users can get is much lower than that. In order to accurately evaluate the ability of IEEE 802.11a to support data services, we improve the existing two-dimensional Markov chain models of the backoff window scheme, and analyze the efficiency of the IEEE 802.11a standard for wireless LANs in non-saturation conditions from the perspective of framing efficiency and MAC layer channel transport efficiency in this paper. Specifically, we derive an analytical formula for the protocol actual throughput. The proposed model and the analytical results will help researchers to further study how to predict and optimize the system performance.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"50 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":"133447102","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
扫码关注我们
求助内容：
应助结果提醒方式：