This research proposed an effective mechanism for an effective solution to tackle missing data problem in the handoff delay. The focus of this research is the effective combination of multicast-base and forecast enhancement prediction mechanism. This solution will help future network management for bandwidth reservation for mobile users in motion.
{"title":"The Study for Wireless Network Packet Transmission","authors":"Chung-Hsin Liu, Ping-Shin Tsai","doi":"10.1109/NCM.2009.68","DOIUrl":"https://doi.org/10.1109/NCM.2009.68","url":null,"abstract":"This research proposed an effective mechanism for an effective solution to tackle missing data problem in the handoff delay. The focus of this research is the effective combination of multicast-base and forecast enhancement prediction mechanism. This solution will help future network management for bandwidth reservation for mobile users in motion.","PeriodicalId":119669,"journal":{"name":"2009 Fifth International Joint Conference on INC, IMS and IDC","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115909192","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}
Following the theory of evolutionary power spectral density (EPSD) for non-stationary stochastic processes, it is anticipated that the non-stationary fluctuating wind velocity can be generated by resorting to a deterministic modulating function used to modulate the stationary fluctuating wind velocity. In order to carry out the digital simulation of non-stationary stochastic process with resorting to the spectral representation (SR) method, there is a need for remarkably reducing the increasing number of Cholesky decomposition of the time-varying spectral density matrix with the duration of simulation. In order to cope with this issue, the introduction of spline interpolation algorithm (SIA) is advanced herein so as to enhance the computational speed. Results obtained from the present procedure corroborate its feasibility of simulating the non-stationary stochastic processes. Results also show that the present approach can not only fully capture the nonstationarity but also leads to a surprising speedup of computation in the simulation of non-stationary stochastic processes.
{"title":"Simulation of Transient Non-stationary Winds","authors":"Chunxiang Li, Jin-hua Li, Jian-hong Shen","doi":"10.1109/NCM.2009.63","DOIUrl":"https://doi.org/10.1109/NCM.2009.63","url":null,"abstract":"Following the theory of evolutionary power spectral density (EPSD) for non-stationary stochastic processes, it is anticipated that the non-stationary fluctuating wind velocity can be generated by resorting to a deterministic modulating function used to modulate the stationary fluctuating wind velocity. In order to carry out the digital simulation of non-stationary stochastic process with resorting to the spectral representation (SR) method, there is a need for remarkably reducing the increasing number of Cholesky decomposition of the time-varying spectral density matrix with the duration of simulation. In order to cope with this issue, the introduction of spline interpolation algorithm (SIA) is advanced herein so as to enhance the computational speed. Results obtained from the present procedure corroborate its feasibility of simulating the non-stationary stochastic processes. Results also show that the present approach can not only fully capture the nonstationarity but also leads to a surprising speedup of computation in the simulation of non-stationary stochastic processes.","PeriodicalId":119669,"journal":{"name":"2009 Fifth International Joint Conference on INC, IMS and IDC","volume":"471 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114601163","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}
Carma is a type of online association algorithm, designed to facilitate association rule with online data flow and successively changing support thresholds. In this paper we study the factors that contribute to the efficiency of Carma and how data flow distribution give effects on the performance of Carma. We design several experiments with two kinds of data. In fixed support threshold situations, we compare Carma with that of Apriori. We find the sets generated by Carma are subsets of those generated by Apriori. We find that if the support threshold is reasonably defined, these two algorithms reach the same results. On the other hand, as the support threshold increases, Phase Ι generates less items and the number of deleted sets from Phase II first increases and then declines. Carma behaves consistently towards changing support. We notice the earlier the items enter into a lattice, the more accurate the estimations are. If base stone elements show up early in the transaction, the performance of Phase II is mainly influenced by the late-entered item sets. Based on the discussion with Carma, we propose a new procedure to improve Carma. Simulations reveal that the modified algorithm works well.
{"title":"Efficiency and Consistency Study on Carma","authors":"Yuan Huang, Xing Wang, B. Shia","doi":"10.1109/NCM.2009.241","DOIUrl":"https://doi.org/10.1109/NCM.2009.241","url":null,"abstract":"Carma is a type of online association algorithm, designed to facilitate association rule with online data flow and successively changing support thresholds. In this paper we study the factors that contribute to the efficiency of Carma and how data flow distribution give effects on the performance of Carma. We design several experiments with two kinds of data. In fixed support threshold situations, we compare Carma with that of Apriori. We find the sets generated by Carma are subsets of those generated by Apriori. We find that if the support threshold is reasonably defined, these two algorithms reach the same results. On the other hand, as the support threshold increases, Phase Ι generates less items and the number of deleted sets from Phase II first increases and then declines. Carma behaves consistently towards changing support. We notice the earlier the items enter into a lattice, the more accurate the estimations are. If base stone elements show up early in the transaction, the performance of Phase II is mainly influenced by the late-entered item sets. Based on the discussion with Carma, we propose a new procedure to improve Carma. Simulations reveal that the modified algorithm works well.","PeriodicalId":119669,"journal":{"name":"2009 Fifth International Joint Conference on INC, IMS and IDC","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114371365","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}
In the architecture of GSM-WLAN interworking, there are drawbacks related to authentication efficiency for processing loads in the RADIUS server. Therefore, this paper presents two authentication schemes, based on the EAP-SIM mechanism, to improve the authentication efficiency by balancing the processing loads among the RADIUS server and APs. The performance evaluation on the average authentication session time and the processing time for the conventional EAP-SIM authentication schemes and the proposed authentication schemes shows the efficiency improvement of the proposed schemes. It can save about 19% authentication processing time for the proposed full authentication, and about 75% authentication processing time for the proposed iterative fast authentication scheme.
{"title":"Authentication Schemes Based on the EAP-SIM Mechanism in GSM-WLAN Heterogeneous Mobile Networks","authors":"Shen-Ho Lin, J. Chiu, Sung-Shiou Shen","doi":"10.1109/NCM.2009.259","DOIUrl":"https://doi.org/10.1109/NCM.2009.259","url":null,"abstract":"In the architecture of GSM-WLAN interworking, there are drawbacks related to authentication efficiency for processing loads in the RADIUS server. Therefore, this paper presents two authentication schemes, based on the EAP-SIM mechanism, to improve the authentication efficiency by balancing the processing loads among the RADIUS server and APs. The performance evaluation on the average authentication session time and the processing time for the conventional EAP-SIM authentication schemes and the proposed authentication schemes shows the efficiency improvement of the proposed schemes. It can save about 19% authentication processing time for the proposed full authentication, and about 75% authentication processing time for the proposed iterative fast authentication scheme.","PeriodicalId":119669,"journal":{"name":"2009 Fifth International Joint Conference on INC, IMS and IDC","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116991268","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}
The Web2.0 concept encourages rich information exchanging and enables individuals to collaborative with others for content co-creation. Extensive interactions empower brainstorming and leads to numerous innovative ideas. The collective effort of user groups in the cyberspace have becomes an emergent division of social intelligence. Unlike traditional animal social behaviors that physically tight linked with each other, participants in cyberspace could join and contribute to social groups crossing geographic constraint. In this paper, a social context interaction framework for successful collaboration is proposed to conquer the motivational challenges in web 2.0 era. The framework highlights aggregation of social interactions in cyberspace that improve healthy development of web 2.0 e-service. Several typical social context models are introduced for accelerating positive social interactions among individuals and user groups within the cyberspace. The social context evolution provides the implementation guideline to assure the web 2.0 evolution healthily.
{"title":"Conquer Web 2.0 Motivational Challenges from Social Context Evolution","authors":"Yuanchu Hwang, Tsung-Lin Li","doi":"10.1109/NCM.2009.156","DOIUrl":"https://doi.org/10.1109/NCM.2009.156","url":null,"abstract":"The Web2.0 concept encourages rich information exchanging and enables individuals to collaborative with others for content co-creation. Extensive interactions empower brainstorming and leads to numerous innovative ideas. The collective effort of user groups in the cyberspace have becomes an emergent division of social intelligence. Unlike traditional animal social behaviors that physically tight linked with each other, participants in cyberspace could join and contribute to social groups crossing geographic constraint. In this paper, a social context interaction framework for successful collaboration is proposed to conquer the motivational challenges in web 2.0 era. The framework highlights aggregation of social interactions in cyberspace that improve healthy development of web 2.0 e-service. Several typical social context models are introduced for accelerating positive social interactions among individuals and user groups within the cyberspace. The social context evolution provides the implementation guideline to assure the web 2.0 evolution healthily.","PeriodicalId":119669,"journal":{"name":"2009 Fifth International Joint Conference on INC, IMS and IDC","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117068745","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}
Conrado R. Ruiz, R. Cabredo, Levi Jones Monteverde, Zhiyong Huang
Current research on the retrieval systems for 3Dmodels focuses on using the shape of the models to facilitate search and retrieval. This paper explores the possibility of augmenting the existing 3D shape-based similarity measures by combining shape and color. First, a new descriptor was developed based on the D2 shape descriptor. In our method, Npairs of faces are randomly chosen from a 3D model, with probability proportional to the area of the face. The ratio of the smaller area over the larger area is computed and its frequency stored, generating a frequency distribution of Nratios which is stored as the second dimension of a 2D array,while the first dimension contains the frequency distribution of distances of randomly generated point pairs (the D2distribution). Second, this research introduces the use of the color features of a 3D model in combination with the shape features to determine similarity. The research involves the study and adoption of an existing 2D color-based similarity measure for 3D models. The analysis of the results is based on the precision and recall of both approaches.
{"title":"Combining Shape and Color for Retrieval of 3D Models","authors":"Conrado R. Ruiz, R. Cabredo, Levi Jones Monteverde, Zhiyong Huang","doi":"10.1109/NCM.2009.140","DOIUrl":"https://doi.org/10.1109/NCM.2009.140","url":null,"abstract":"Current research on the retrieval systems for 3Dmodels focuses on using the shape of the models to facilitate search and retrieval. This paper explores the possibility of augmenting the existing 3D shape-based similarity measures by combining shape and color. First, a new descriptor was developed based on the D2 shape descriptor. In our method, Npairs of faces are randomly chosen from a 3D model, with probability proportional to the area of the face. The ratio of the smaller area over the larger area is computed and its frequency stored, generating a frequency distribution of Nratios which is stored as the second dimension of a 2D array,while the first dimension contains the frequency distribution of distances of randomly generated point pairs (the D2distribution). Second, this research introduces the use of the color features of a 3D model in combination with the shape features to determine similarity. The research involves the study and adoption of an existing 2D color-based similarity measure for 3D models. The analysis of the results is based on the precision and recall of both approaches.","PeriodicalId":119669,"journal":{"name":"2009 Fifth International Joint Conference on INC, IMS and IDC","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117195652","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}
Weigang Hou, Lei Guo, Xingwei Wang, Jiannong Cao, Jingjing Wu, Yan Li
In this paper, we study the waveband switching for wavelength-level demands and the traffic grooming for sub-wavelength-level demands in multi-granularity optical networks and propose a new routing algorithm called Multi-granularity Grooming based on Integrated Grooming Auxiliary Graph (MG-IGAG) to save the cost by reducing the number of switching ports in optical-cross connects. In MG-IGAG, we develop the Integrated Grooming Auxiliary Graph (IGAG) that includes a Wavelength Integrated Auxiliary Graph (WIAG) and a wave-Band Integrated Auxiliary Graph (BIAG) to groom the sub-wavelength-level and wavelength-level demands, respectively. Simulation results show that the performance of MG-IGAG can obtain significant improvement than previous algorithms.
{"title":"A New Routing Algorithm Based on Integrated Grooming Auxiliary Graph in Multi-granularity Optical Networks","authors":"Weigang Hou, Lei Guo, Xingwei Wang, Jiannong Cao, Jingjing Wu, Yan Li","doi":"10.1109/NCM.2009.264","DOIUrl":"https://doi.org/10.1109/NCM.2009.264","url":null,"abstract":"In this paper, we study the waveband switching for wavelength-level demands and the traffic grooming for sub-wavelength-level demands in multi-granularity optical networks and propose a new routing algorithm called Multi-granularity Grooming based on Integrated Grooming Auxiliary Graph (MG-IGAG) to save the cost by reducing the number of switching ports in optical-cross connects. In MG-IGAG, we develop the Integrated Grooming Auxiliary Graph (IGAG) that includes a Wavelength Integrated Auxiliary Graph (WIAG) and a wave-Band Integrated Auxiliary Graph (BIAG) to groom the sub-wavelength-level and wavelength-level demands, respectively. Simulation results show that the performance of MG-IGAG can obtain significant improvement than previous algorithms.","PeriodicalId":119669,"journal":{"name":"2009 Fifth International Joint Conference on INC, IMS and IDC","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116315766","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}
6LoWPAN is a low-power wireless personal area network and a technique to apply TCP/IP stack to sensor networks. By installing IPv6 stack to the sensor node, the sensor networks have interoperability with the external IPv6 network. To solve the 6LoWPAN’s restrictions, IETF working group recently published problems, IPv6 header compression, and routing mechanism requirement documents through their study. Among the suggested routing mechanisms, there is a hierarchical routing protocol designed to establish a hierarchical tree with parent and child nodes to transmit packets. However, the authors design only the address allocation mechanism and the routing mechanism. In our paper, we describe one of the hierarchical routing protocol’s problems and suggest a mechanism to avoid the bias routing tree that could happen in the condition child nodes don’t attach to parents nodes evenly. The simulation result shows that the four nodes are suitable for communication.
{"title":"The Bias Routing Tree Avoiding Technique for Hierarchical Routing Protocol over 6LoWPAN","authors":"Hun-Jung Lim, Tai-Myung Chung","doi":"10.1109/NCM.2009.331","DOIUrl":"https://doi.org/10.1109/NCM.2009.331","url":null,"abstract":"6LoWPAN is a low-power wireless personal area network and a technique to apply TCP/IP stack to sensor networks. By installing IPv6 stack to the sensor node, the sensor networks have interoperability with the external IPv6 network. To solve the 6LoWPAN’s restrictions, IETF working group recently published problems, IPv6 header compression, and routing mechanism requirement documents through their study. Among the suggested routing mechanisms, there is a hierarchical routing protocol designed to establish a hierarchical tree with parent and child nodes to transmit packets. However, the authors design only the address allocation mechanism and the routing mechanism. In our paper, we describe one of the hierarchical routing protocol’s problems and suggest a mechanism to avoid the bias routing tree that could happen in the condition child nodes don’t attach to parents nodes evenly. The simulation result shows that the four nodes are suitable for communication.","PeriodicalId":119669,"journal":{"name":"2009 Fifth International Joint Conference on INC, IMS and IDC","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122045152","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}
Ubiquitous communication indeed requires a seamless networking deployment enable user access the Internet and receive particular service at anytime. However,the deployment of wireless device and service source for ubiquitous communication is a dynamic complex problem which a typical multiple objectives decision problem. In this research, a general model is proposed to deal with such ubiquitous networking deployment constructed (UNDC)problem which takes multiple objectives, including: available budget, coverage range, throughput and interference rate, into consideration simultaneously and then output a feasible recommendation for u-networking deployment. Further, the proposed general model is reformulated via goal programming and then can be implemented and resolved by optimal methodology. Finally, two illustration experiments demonstrated the efficiency and feasibility of proposed model.
{"title":"General Model for Ubiquitous Networking Deployment Constructed Recommendation","authors":"Chen-Shu Wang, Hsin-Chang Li","doi":"10.1109/NCM.2009.139","DOIUrl":"https://doi.org/10.1109/NCM.2009.139","url":null,"abstract":"Ubiquitous communication indeed requires a seamless networking deployment enable user access the Internet and receive particular service at anytime. However,the deployment of wireless device and service source for ubiquitous communication is a dynamic complex problem which a typical multiple objectives decision problem. In this research, a general model is proposed to deal with such ubiquitous networking deployment constructed (UNDC)problem which takes multiple objectives, including: available budget, coverage range, throughput and interference rate, into consideration simultaneously and then output a feasible recommendation for u-networking deployment. Further, the proposed general model is reformulated via goal programming and then can be implemented and resolved by optimal methodology. Finally, two illustration experiments demonstrated the efficiency and feasibility of proposed model.","PeriodicalId":119669,"journal":{"name":"2009 Fifth International Joint Conference on INC, IMS and IDC","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117095159","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}
This paper proposes a novel energy efficient data clustering scheme to improve energy efficiency for cluster-based wireless sensor networks (WSNs). In order to reduce the energy dissipation of transmitting sensing data at each sensor, the fixed clustering algorithm uniformly divides the sensing area into clusters where the cluster head is deployed to the centered of the cluster area. Moreover, to perform energy efficient grid clustering (EEGC), the nodes take turns to be cluster head. Simulation results show that proposed EEGC definitely reduces the energy consumption of the sensors and prolongs network lifetime to be longer than LEACH for both life rate=50% and 70%. Moreover, the total transmission data of EEGC is more 60% than LEACH scheme.
{"title":"An Energy Efficient Clustering for Cluster-Based Wireless Sensor Networks","authors":"Yung-Fa Huang, Jhao-Wei Guo, Young-Long Chen","doi":"10.1109/NCM.2009.390","DOIUrl":"https://doi.org/10.1109/NCM.2009.390","url":null,"abstract":"This paper proposes a novel energy efficient data clustering scheme to improve energy efficiency for cluster-based wireless sensor networks (WSNs). In order to reduce the energy dissipation of transmitting sensing data at each sensor, the fixed clustering algorithm uniformly divides the sensing area into clusters where the cluster head is deployed to the centered of the cluster area. Moreover, to perform energy efficient grid clustering (EEGC), the nodes take turns to be cluster head. Simulation results show that proposed EEGC definitely reduces the energy consumption of the sensors and prolongs network lifetime to be longer than LEACH for both life rate=50% and 70%. Moreover, the total transmission data of EEGC is more 60% than LEACH scheme.","PeriodicalId":119669,"journal":{"name":"2009 Fifth International Joint Conference on INC, IMS and IDC","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125929729","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
扫码关注我们
求助内容：
应助结果提醒方式：