The paper mainly discusses the interference between LTE system and Analog TV in the frequency band 700MHz, with the simulation of the interference probability caused by the LTE cell based on energy detection of cognitive radio. The formula of interference distribution is based on RSMN network model, and focuses on the interference probability changed with the distance between LTE cell and Analog TV as well as the radius of LTE cell. That is, we can minimize effect of the interference to a certain extent by adjusting the parameters above.
{"title":"Interference Estimation of Analog TV and LTE System Based on Cognitive Radio","authors":"Mingxing Liu, Wenwen Ma","doi":"10.1109/BWCCA.2014.103","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.103","url":null,"abstract":"The paper mainly discusses the interference between LTE system and Analog TV in the frequency band 700MHz, with the simulation of the interference probability caused by the LTE cell based on energy detection of cognitive radio. The formula of interference distribution is based on RSMN network model, and focuses on the interference probability changed with the distance between LTE cell and Analog TV as well as the radius of LTE cell. That is, we can minimize effect of the interference to a certain extent by adjusting the parameters above.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129747376","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}
Proxy Mobile IPv6 (PMIPv6), as a network-based mobility management protocol, was released in 2008 by the IETF in RFC 5213 to support IP mobility. But in its handover procedure, network-link disconnection cannot absolutely be avoided. The IETF later proposed Fast Proxy Mobile IPv6 (FPMIPv6 for short) protocol, which was designed primarily to improve the switching process, particularly for reducing its handover latency and packet loss rate, rather than mitigating the probability of network-link disconnection. In fact, no matter how fast a handover is, handover delay does unavoidably exist, which in turn rises the packet loss rate. Therefore, in this study, we propose a new MIPv6 family protocol called SCTP-based Proxy Mobile IPv6 (S-PMIPv6 for short), which integrates F-PMIPv6 with stream control transmission protects (SCTP for short) and route optimization to enhance its IP mobility and achieve the stage of seamless handover.
代理移动IPv6 (Proxy Mobile IPv6, PMIPv6)是一种基于网络的移动性管理协议，由IETF于2008年在RFC 5213中发布，以支持IP移动性。但在其移交过程中，网络链路断开是无法完全避免的。IETF后来提出了快速代理移动IPv6(简称FPMIPv6)协议，该协议的主要目的是改善交换过程，特别是减少其切换延迟和丢包率，而不是减少网络链路断开的概率。实际上，无论切换速度有多快，都不可避免地存在切换延迟，从而导致丢包率上升。因此，在本研究中，我们提出了一种新的MIPv6家族协议，称为基于SCTP的代理移动IPv6(简称S-PMIPv6)，该协议将F-PMIPv6与流控制传输保护(简称SCTP)和路由优化相结合，以增强其IP移动性，实现无缝切换阶段。
{"title":"S-PMIPv6: Efficient Handover of Proxy Mobile IPv6 by Using SCTP","authors":"Ching-Yu Liu, Fang-Yie Leu, Jung-Chun Liu","doi":"10.1109/BWCCA.2014.77","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.77","url":null,"abstract":"Proxy Mobile IPv6 (PMIPv6), as a network-based mobility management protocol, was released in 2008 by the IETF in RFC 5213 to support IP mobility. But in its handover procedure, network-link disconnection cannot absolutely be avoided. The IETF later proposed Fast Proxy Mobile IPv6 (FPMIPv6 for short) protocol, which was designed primarily to improve the switching process, particularly for reducing its handover latency and packet loss rate, rather than mitigating the probability of network-link disconnection. In fact, no matter how fast a handover is, handover delay does unavoidably exist, which in turn rises the packet loss rate. Therefore, in this study, we propose a new MIPv6 family protocol called SCTP-based Proxy Mobile IPv6 (S-PMIPv6 for short), which integrates F-PMIPv6 with stream control transmission protects (SCTP for short) and route optimization to enhance its IP mobility and achieve the stage of seamless handover.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130907716","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}
By using a photonic crystal structure, it's possible to realize integrated optical circuit with ultra-high density which is difficult to be realized in any other way. To achieve various kinds of optical devices, many related studies have been conducted. As a simulation method of the waveguide with photonic crystal structure, constrained interpolation profile (CIP) method shows good reliability and effectiveness. In the paper, the measured results of the experiment about photonic crystal waveguide (resonator with Y-shaped branch waveguide) is compared with the results of CIP method.
{"title":"Numerical Analysis of Y-Shaped Branch Waveguide in Photonic Crystal Structures and Its Application","authors":"Jianming Jin, Yuting Bao, Huili Chen, H. Maeda","doi":"10.1109/BWCCA.2014.90","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.90","url":null,"abstract":"By using a photonic crystal structure, it's possible to realize integrated optical circuit with ultra-high density which is difficult to be realized in any other way. To achieve various kinds of optical devices, many related studies have been conducted. As a simulation method of the waveguide with photonic crystal structure, constrained interpolation profile (CIP) method shows good reliability and effectiveness. In the paper, the measured results of the experiment about photonic crystal waveguide (resonator with Y-shaped branch waveguide) is compared with the results of CIP method.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126227847","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 is concerned with proposing a numerical method to predict the wave front movement of optical rays based on the Dijkstra algorithm. Data for refractive index of the medium through which optical rays propagate are assigned to all nodes of rectangular meshes and its values apart from the mesh nodes can be approximated in terms of linear interpolation. The velocity of the wave front of an optical ray can be calculated by the refractive index assigned to each node and it varies from one node to another due to the medium in homogeneity. Since the wave front movement of any waves is governed by the Fermat principle, it can be easily estimated based on the Dijkstra algorithm. In this paper we discuss the Dijkstra algorithm relevant to optical rays propagating through the inhomogeneous media such as Luneburg lens and Maxwell's fish-eye lens. We also show some numerical examples to demonstrate the effectiveness of the proposed method for analyzing ray front movement and ray tracing.
{"title":"Optical Ray Tracing Based on Dijkstra Algorithm in Inhomogeneous Medium","authors":"K. Uchida","doi":"10.1109/BWCCA.2014.92","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.92","url":null,"abstract":"This paper is concerned with proposing a numerical method to predict the wave front movement of optical rays based on the Dijkstra algorithm. Data for refractive index of the medium through which optical rays propagate are assigned to all nodes of rectangular meshes and its values apart from the mesh nodes can be approximated in terms of linear interpolation. The velocity of the wave front of an optical ray can be calculated by the refractive index assigned to each node and it varies from one node to another due to the medium in homogeneity. Since the wave front movement of any waves is governed by the Fermat principle, it can be easily estimated based on the Dijkstra algorithm. In this paper we discuss the Dijkstra algorithm relevant to optical rays propagating through the inhomogeneous media such as Luneburg lens and Maxwell's fish-eye lens. We also show some numerical examples to demonstrate the effectiveness of the proposed method for analyzing ray front movement and ray tracing.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114511863","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 this paper, we present a method of acquiring / utilizing the study records using smartphone for improving the students learning motivation for learning. During the lecture, the students use the smartphone for learning. The results showed that the proposed study record system has a good effect for improving students' motivation for learning. For the professors of the university, it is difficult to offer all necessary information to the students. In addition, they cannot provide the information to satisfy all students because the quantity of knowledge of each student attending a lecture is different. Therefore, for the lectures of a higher level than intermediate level, the students should study the learning materials by themslef. In this study, we show that our method of acquiring / utilizing the study record promotes the self-learning of the student. In this research, we carried experiments during real lectures at the intermediate level. The results showed that the proposed study record system can improve the degree of self-learning after the lecture.
{"title":"An Interactive Learning System Using Smartphone: Improving Students' Learning Motivation and Self-Learning","authors":"Noriyasu Yamamoto","doi":"10.1109/BWCCA.2014.125","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.125","url":null,"abstract":"In this paper, we present a method of acquiring / utilizing the study records using smartphone for improving the students learning motivation for learning. During the lecture, the students use the smartphone for learning. The results showed that the proposed study record system has a good effect for improving students' motivation for learning. For the professors of the university, it is difficult to offer all necessary information to the students. In addition, they cannot provide the information to satisfy all students because the quantity of knowledge of each student attending a lecture is different. Therefore, for the lectures of a higher level than intermediate level, the students should study the learning materials by themslef. In this study, we show that our method of acquiring / utilizing the study record promotes the self-learning of the student. In this research, we carried experiments during real lectures at the intermediate level. The results showed that the proposed study record system can improve the degree of self-learning after the lecture.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122684695","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}
Nowadays, frequent item set mining is the major task in association rule mining. With the observation that the support plays an important role in mining frequent item sets, in this paper, we review the previous efficient algorithms and study the effect of different order of support in the performance of frequent item sets mining algorithms and propose our improved schedule. In our new algorithm, items are sorted in descending order according to the frequencies in transaction cache while item sets use ascending order of support during support count. Compared with other algorithms, the results of experiments show that the new algorithm gains better performance on on well-known benchmark data sets.
{"title":"A Bidirectional Process Algorithm for Mining Probabilistic Frequent Itemsets","authors":"Xiaomei Yu, Hong Wang, Xiangwei Zheng","doi":"10.1109/BWCCA.2014.122","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.122","url":null,"abstract":"Nowadays, frequent item set mining is the major task in association rule mining. With the observation that the support plays an important role in mining frequent item sets, in this paper, we review the previous efficient algorithms and study the effect of different order of support in the performance of frequent item sets mining algorithms and propose our improved schedule. In our new algorithm, items are sorted in descending order according to the frequencies in transaction cache while item sets use ascending order of support during support count. Compared with other algorithms, the results of experiments show that the new algorithm gains better performance on on well-known benchmark data sets.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122658004","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}
Taiki Honda, S. Ishikawa, Makoto Ikeda, L. Barolli
The Delay/Disruption Tolerant Networking (DTN) aims to provide inter-operable communications with wide range of networks which have poor performance characteristics. In this paper, we propose a message suppression method for Vehicular DTN (VDTN) under highly stressed environment. The simulations for two scenarios are conducted considering obstacles (buildings), where Message Suppression with Road Side Units (MSRs) are present or not present. We consider 802.11p standard and send bundle messages in a Manhattan grid scenario. We use the Packet Delivery Ratio (PDR), duplicated bundle messages and end-to-end delay as evaluation metrics. Based on simulation results, we observed that our proposed method can reduce the duplicated message and the performance of mean PDR is higher than the results of Epidemic conventional method.
{"title":"A Message Suppression Method for Vehicular Delay Tolerant Networking","authors":"Taiki Honda, S. Ishikawa, Makoto Ikeda, L. Barolli","doi":"10.1109/BWCCA.2014.146","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.146","url":null,"abstract":"The Delay/Disruption Tolerant Networking (DTN) aims to provide inter-operable communications with wide range of networks which have poor performance characteristics. In this paper, we propose a message suppression method for Vehicular DTN (VDTN) under highly stressed environment. The simulations for two scenarios are conducted considering obstacles (buildings), where Message Suppression with Road Side Units (MSRs) are present or not present. We consider 802.11p standard and send bundle messages in a Manhattan grid scenario. We use the Packet Delivery Ratio (PDR), duplicated bundle messages and end-to-end delay as evaluation metrics. Based on simulation results, we observed that our proposed method can reduce the duplicated message and the performance of mean PDR is higher than the results of Epidemic conventional method.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121497990","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}
For reliable scheduling problem about multiple DAGs scientific workflow in a cloud computing environment, we propose a competitive, dynamic and multiple DAG scheduling algorithm which takes link communication processor into consideration (CCRH). Firstly, algorithm uses communication competition model to describe the communication between the processors. It calculates the earliest completion time of the primary backup task. It defines the scheduling processor unit and uses dynamic hierarchical approach for multiple DAGs workflow tasks. It is In order to calculate the unfair degree of each DAG factor. When multiple tasks in DAG have large difference weights, the algorithm is an effective solution for previous DAGs would increase the execution time span which caused by the remaining tasks scheduling. Simulation results show that under the premise of ensuring reliable scheduling, the algorithm not only can improve the fairness of the multiple DAGs scheduling, but also effectively short the average multiple DAGs scheduling time, and make the robustness of algorithm is more better.
{"title":"Multiple DAGs Dynamic Workflow Scheduling Based on the Primary Backup Algorithm in Cloud Computing System","authors":"Yu Wang, Changyun Jia, Yang Xu","doi":"10.1109/BWCCA.2014.62","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.62","url":null,"abstract":"For reliable scheduling problem about multiple DAGs scientific workflow in a cloud computing environment, we propose a competitive, dynamic and multiple DAG scheduling algorithm which takes link communication processor into consideration (CCRH). Firstly, algorithm uses communication competition model to describe the communication between the processors. It calculates the earliest completion time of the primary backup task. It defines the scheduling processor unit and uses dynamic hierarchical approach for multiple DAGs workflow tasks. It is In order to calculate the unfair degree of each DAG factor. When multiple tasks in DAG have large difference weights, the algorithm is an effective solution for previous DAGs would increase the execution time span which caused by the remaining tasks scheduling. Simulation results show that under the premise of ensuring reliable scheduling, the algorithm not only can improve the fairness of the multiple DAGs scheduling, but also effectively short the average multiple DAGs scheduling time, and make the robustness of algorithm is more better.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122220951","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 wired and wireless integrated network, there is deployed of a small amount of heterogeneous nodes communication directly with the Sink, forming a shortcut, and making network has the properties of small world, with better energy saving and improve network performance. However, the optimal deployment of heterogeneous nodes is a kind of NP - Hard problem. Therefore, the paper consideration of the total energy of network and energy consumption balance, transforming the optimizedd eployment of heterogeneous nodes into a mixed integer programming problem, getting the approximate optimal solution by the decomposition algorithm, And then, there will be a dynamic clustering to the ordinary node deployed in the integrated network, setting up to a clustered node routing way. It is the clustering CHNMIP heterogeneous network routing algorithm based on the mixed integer programming, namely clustering based on the mixed integer programming is heterogeneous network CHNMIP routing algorithm. The result of the simulation experimental shows that the CHNMIP routing can improve integrated network performance under different simulation NGB environment.
{"title":"Research of Optimal Clustering Routing Algorithm for NGB with Small-World Property","authors":"Yang Wang, Y. Cui, Y. Wang","doi":"10.1109/BWCCA.2014.46","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.46","url":null,"abstract":"In the wired and wireless integrated network, there is deployed of a small amount of heterogeneous nodes communication directly with the Sink, forming a shortcut, and making network has the properties of small world, with better energy saving and improve network performance. However, the optimal deployment of heterogeneous nodes is a kind of NP - Hard problem. Therefore, the paper consideration of the total energy of network and energy consumption balance, transforming the optimizedd eployment of heterogeneous nodes into a mixed integer programming problem, getting the approximate optimal solution by the decomposition algorithm, And then, there will be a dynamic clustering to the ordinary node deployed in the integrated network, setting up to a clustered node routing way. It is the clustering CHNMIP heterogeneous network routing algorithm based on the mixed integer programming, namely clustering based on the mixed integer programming is heterogeneous network CHNMIP routing algorithm. The result of the simulation experimental shows that the CHNMIP routing can improve integrated network performance under different simulation NGB environment.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"63 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128528449","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}
It is extremely important that the semantic relation between the information resources for organizing and hunting for information. Many semantic connections are lost between online information resources and off-line information resources. Topic map is a discipline-specific form of concept map, which is generally a representation of concepts about the information and relationship rather than of knowledge itself. In this paper, we use the semantic relationship between information resources based on topic maps to connect the digital information resources into a World-Wide-Web of semantic links.
{"title":"Construction of Semantic Associative Network Based on Topic Maps","authors":"L. Qiu, Jie Yuan","doi":"10.1109/BWCCA.2014.84","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.84","url":null,"abstract":"It is extremely important that the semantic relation between the information resources for organizing and hunting for information. Many semantic connections are lost between online information resources and off-line information resources. Topic map is a discipline-specific form of concept map, which is generally a representation of concepts about the information and relationship rather than of knowledge itself. In this paper, we use the semantic relationship between information resources based on topic maps to connect the digital information resources into a World-Wide-Web of semantic links.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129063410","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
扫码关注我们
求助内容：
应助结果提醒方式：