With Moodle a web based interface supporting a wide range of activities including forums, contents, and assignments is provided to assist both the teachers and the students. However, limitations of the file-size acceptable for uploads, weakness in the assessment procedure, complicated task of replacing an existing file, and the lowest visiting rate of the traditional discussion module are some major deficiencies in the traditional Moodle module. Thus, we propose a new Moodle module integrating both the cloud storage services and Facebook with the traditional Moodle module to cover the mentioned shortcomings. The module provides a straightforward uploading-function to allow, with only few seconds, uploading several large-size files simultaneously without any restriction on the files-size. The new module also offers an assessment-function that supports the web browsing of the files being uploaded to assist teachers, without the need to download and save each assignment separately, in checking and grading the submitted assignments directly via any web browser. The proposed module also integrates the Moodle with Facebook to increase the visiting rate of the traditional discussion Moodle module, hence, increasing the students' motivation to ask questions and the interaction among the students. The performance and the usability of the new module was evaluated and promising results were obtained.
{"title":"A New Cloud Storage Support and Facebook Enabled Moodle Module","authors":"E. Daraghmi, Cheng Hsun Hsiao, S. Yuan","doi":"10.1109/U-MEDIA.2014.12","DOIUrl":"https://doi.org/10.1109/U-MEDIA.2014.12","url":null,"abstract":"With Moodle a web based interface supporting a wide range of activities including forums, contents, and assignments is provided to assist both the teachers and the students. However, limitations of the file-size acceptable for uploads, weakness in the assessment procedure, complicated task of replacing an existing file, and the lowest visiting rate of the traditional discussion module are some major deficiencies in the traditional Moodle module. Thus, we propose a new Moodle module integrating both the cloud storage services and Facebook with the traditional Moodle module to cover the mentioned shortcomings. The module provides a straightforward uploading-function to allow, with only few seconds, uploading several large-size files simultaneously without any restriction on the files-size. The new module also offers an assessment-function that supports the web browsing of the files being uploaded to assist teachers, without the need to download and save each assignment separately, in checking and grading the submitted assignments directly via any web browser. The proposed module also integrates the Moodle with Facebook to increase the visiting rate of the traditional discussion Moodle module, hence, increasing the students' motivation to ask questions and the interaction among the students. The performance and the usability of the new module was evaluated and promising results were obtained.","PeriodicalId":174849,"journal":{"name":"2014 7th International Conference on Ubi-Media Computing and Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121016991","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}
Three dimensional television (3DTV) has attracted more and more attention in the area of TV broadcasting. However, the applications are constrained due to the content shortage. It is an economical way by converting monoscopic 2D video to 3D (2D-3D) so as to reuse the existed huge amount of 2D videos materials by using Depth-Image-Based-Rendering (DIBR). In this paper, an efficient framework for extracting depth information from the single image is proposed, which is based on scene classification and object detection. In the proposed scheme, by applying that real similar 3D scenes may have a similar depth map, we construct an image set including many kinds of images (their corresponding depth maps are given) with different scene structures first. The image set is classified into some categories manually. For a certain input image, k-Nearest Neighbor (KNN) algorithm is employed to judge that whether the input image corresponds to outdoor scene or not. Then, the initial depth map is obtained by fusing the depth maps of those images in the category which the input image belongs to, After that, we incorporate the image segmentation results to detect the sky region and the ground region by using color information. Finally, the depth map is obtained by refining the initial depth map using the sky and ground region. Experimental results demonstrate that the proposed scheme can generate smooth and reliable depth maps with satisfied performance.
三维电视(3DTV)在电视广播领域受到越来越多的关注。然而，由于内容不足，应用程序受到限制。利用深度图像渲染(deep - image - based rendering, DIBR)技术将单视角2D视频转换为3D (2D-3D)，从而重用现有的大量2D视频素材，是一种经济的方法。本文提出了一种基于场景分类和目标检测的单幅图像深度信息提取框架。在该方案中，我们利用真实相似的3D场景可能具有相似的深度图，首先构建了包含多种不同场景结构的图像(给出了它们对应的深度图)的图像集。手动将图像集划分为一些类别。对于某一输入图像，采用k-最近邻(k-Nearest Neighbor, KNN)算法判断输入图像是否与室外场景相对应。然后，对输入图像所属类别图像的深度图进行融合得到初始深度图，然后结合图像分割结果，利用颜色信息检测天空区域和地面区域。最后，利用天空和地面区域对初始深度图进行细化，得到深度图。实验结果表明，该方法能够生成平滑可靠的深度图，并具有满意的性能。
{"title":"Single Outdoor Image Depth Map Generation Based on Scene Classification and Object Detection","authors":"Yannan Ren, Ju Liu","doi":"10.1109/U-MEDIA.2014.55","DOIUrl":"https://doi.org/10.1109/U-MEDIA.2014.55","url":null,"abstract":"Three dimensional television (3DTV) has attracted more and more attention in the area of TV broadcasting. However, the applications are constrained due to the content shortage. It is an economical way by converting monoscopic 2D video to 3D (2D-3D) so as to reuse the existed huge amount of 2D videos materials by using Depth-Image-Based-Rendering (DIBR). In this paper, an efficient framework for extracting depth information from the single image is proposed, which is based on scene classification and object detection. In the proposed scheme, by applying that real similar 3D scenes may have a similar depth map, we construct an image set including many kinds of images (their corresponding depth maps are given) with different scene structures first. The image set is classified into some categories manually. For a certain input image, k-Nearest Neighbor (KNN) algorithm is employed to judge that whether the input image corresponds to outdoor scene or not. Then, the initial depth map is obtained by fusing the depth maps of those images in the category which the input image belongs to, After that, we incorporate the image segmentation results to detect the sky region and the ground region by using color information. Finally, the depth map is obtained by refining the initial depth map using the sky and ground region. Experimental results demonstrate that the proposed scheme can generate smooth and reliable depth maps with satisfied performance.","PeriodicalId":174849,"journal":{"name":"2014 7th International Conference on Ubi-Media Computing and Workshops","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125632587","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}
Chun-Hsiung Tseng, Yung-Hui Chen, C. Chuang, Jia Hua Wu, Yi Syuan Yang, Yaning Liang
Search engines usually do their jobs well. However, due to the fact that most existing search algorithms are keyword-based, search engines may not work as expected in some scenarios when ambiguity problems are encountered. A possible approach to overcome it is to categorize Web resources in advance. In this research, a k-means variation, the keen-means algorithm, along with its implementation is proposed. The algorithm will dynamically and automatically adjust the k value to achieve better results.
{"title":"Keen-Means: A Web Page Clustering Tool Based on an Self-Adjustable K-Means Algorithm","authors":"Chun-Hsiung Tseng, Yung-Hui Chen, C. Chuang, Jia Hua Wu, Yi Syuan Yang, Yaning Liang","doi":"10.1109/U-MEDIA.2014.44","DOIUrl":"https://doi.org/10.1109/U-MEDIA.2014.44","url":null,"abstract":"Search engines usually do their jobs well. However, due to the fact that most existing search algorithms are keyword-based, search engines may not work as expected in some scenarios when ambiguity problems are encountered. A possible approach to overcome it is to categorize Web resources in advance. In this research, a k-means variation, the keen-means algorithm, along with its implementation is proposed. The algorithm will dynamically and automatically adjust the k value to achieve better results.","PeriodicalId":174849,"journal":{"name":"2014 7th International Conference on Ubi-Media Computing and Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115743688","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 propose novel subscriber reconfigurable-time division multiplexed passive optical network (SR-TDM PON) architectures with wavelength dynamicity and protection features in order to provide more bandwidths to the subscribers. Moreover, we demonstrate the network design flexibility for various SR-TDM PON architectures in terms of wavelength dynamicity range.
{"title":"Subscriber Reconfigurable TDM PON Architectures","authors":"Z. Buyankhishig","doi":"10.1109/U-MEDIA.2014.58","DOIUrl":"https://doi.org/10.1109/U-MEDIA.2014.58","url":null,"abstract":"In this paper, we propose novel subscriber reconfigurable-time division multiplexed passive optical network (SR-TDM PON) architectures with wavelength dynamicity and protection features in order to provide more bandwidths to the subscribers. Moreover, we demonstrate the network design flexibility for various SR-TDM PON architectures in terms of wavelength dynamicity range.","PeriodicalId":174849,"journal":{"name":"2014 7th International Conference on Ubi-Media Computing and Workshops","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122558198","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 an effective and robust hand tracking and fingertip detection method and applies it to a novel vision based human computer interaction system: Visual Keyboard System For Smart TV (VKS). The both hands tracking and fingertip recognition approach consists of three stages. First, based on the CAMSHIFT, Motion Template and Shape Template Matching, the both hands were tracked by Multi Object Tracking CAMSHIFT. Then, the location of fingertip was localized precisely based on Motion Template. After those process, we have the Robust Shape Template Matching to recognize a fingertip. Experiments suggest that the proposed our method is capable of detecting fingertip recognition in a reliable manner even in a complex background under different light conditions without any markers. The Fingertip Recognition Visual Keyboard System in this paper is particularly advantageous for Human-computer Interaction (HCI) in that users can communicate with SMART TV by their favorite mean: fingertip gesturing. At the same time, they can perform typing with only their fingertip directly.
{"title":"Visual Keyboard for Smart TV Using RGB Camera","authors":"Enkhtogtokh Togootogtokh, Amarzaya Amartuvshin, Runhe Huang","doi":"10.1109/U-MEDIA.2014.70","DOIUrl":"https://doi.org/10.1109/U-MEDIA.2014.70","url":null,"abstract":"This paper proposes an effective and robust hand tracking and fingertip detection method and applies it to a novel vision based human computer interaction system: Visual Keyboard System For Smart TV (VKS). The both hands tracking and fingertip recognition approach consists of three stages. First, based on the CAMSHIFT, Motion Template and Shape Template Matching, the both hands were tracked by Multi Object Tracking CAMSHIFT. Then, the location of fingertip was localized precisely based on Motion Template. After those process, we have the Robust Shape Template Matching to recognize a fingertip. Experiments suggest that the proposed our method is capable of detecting fingertip recognition in a reliable manner even in a complex background under different light conditions without any markers. The Fingertip Recognition Visual Keyboard System in this paper is particularly advantageous for Human-computer Interaction (HCI) in that users can communicate with SMART TV by their favorite mean: fingertip gesturing. At the same time, they can perform typing with only their fingertip directly.","PeriodicalId":174849,"journal":{"name":"2014 7th International Conference on Ubi-Media Computing and Workshops","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125014635","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}
Martin M. Weng, J. C. Hung, Jing-De Weng, N. Yen, Chun-Hong Huang
Since the ubiquitous computing was proposed and developed for many years and the matured develop of location based research, personal user information and e-travel, our research provides a personal and useful tour guide mechanism and adaptive learning content when user traveling in anywhere they interesting. This research hopes user not only have fun during tour but also provides several knowledge they may interests about the tour places. This research extends former experiences on the development of location based research, and integrate the Petri Net methods to produce the task based procedure during the travel for user, we called it MOPN (Mission oriented Petri-Net)Besides, this research also proposes a user portfolio synchronize mechanism to provide user more adaptive and personal content based on former user background and using experience. With the results of this research, most user indicated that they have more fun with proposed system during the travel and also got lots of useful knowledge from the mission.
{"title":"A Combination with Knowledge Acquisition Petri Net for Location-Based Service","authors":"Martin M. Weng, J. C. Hung, Jing-De Weng, N. Yen, Chun-Hong Huang","doi":"10.1109/U-MEDIA.2014.8","DOIUrl":"https://doi.org/10.1109/U-MEDIA.2014.8","url":null,"abstract":"Since the ubiquitous computing was proposed and developed for many years and the matured develop of location based research, personal user information and e-travel, our research provides a personal and useful tour guide mechanism and adaptive learning content when user traveling in anywhere they interesting. This research hopes user not only have fun during tour but also provides several knowledge they may interests about the tour places. This research extends former experiences on the development of location based research, and integrate the Petri Net methods to produce the task based procedure during the travel for user, we called it MOPN (Mission oriented Petri-Net)Besides, this research also proposes a user portfolio synchronize mechanism to provide user more adaptive and personal content based on former user background and using experience. With the results of this research, most user indicated that they have more fun with proposed system during the travel and also got lots of useful knowledge from the mission.","PeriodicalId":174849,"journal":{"name":"2014 7th International Conference on Ubi-Media Computing and Workshops","volume":"11 2-3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120895591","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}
Kuo-Feng Huang, Ying-Hong Wang, Chen Chehung, Lei Chih
Wireless Sensor Networks (WSNs) is composed of sinks and sensor nodes, which can monitor large-scale environment. The sensor nodes have several advantages, such as low cost, small size, and capability of mobility, and they can do data sensing, data processing and wireless communication. However, the greatest challenge is the constraints of energy. The most critical issue is how to minimize the energy consumption and keep tracking the mobile target in WSNs. In this paper, we propose a tracking approach for tracking mobile target in hybrid wireless sensor network which consisting of static and mobile node. While static nodes are random distributed in the Field of Interested (FoI) and mobile nodes are moved to fill the coverage hole. We predict the area where the target may cross and construction the local barrier coverage to detect the target. In order to reduce the energy consumption, we wakeup the portion of constructed local barrier coverage to tracking the target. The simulation shows the proposed scheme can reduce the energy consumption and missing rate.
{"title":"Target Tracking Mechanism Using Local Barrier Coverage in Hybrid Wireless Sensor Networks","authors":"Kuo-Feng Huang, Ying-Hong Wang, Chen Chehung, Lei Chih","doi":"10.1109/U-MEDIA.2014.61","DOIUrl":"https://doi.org/10.1109/U-MEDIA.2014.61","url":null,"abstract":"Wireless Sensor Networks (WSNs) is composed of sinks and sensor nodes, which can monitor large-scale environment. The sensor nodes have several advantages, such as low cost, small size, and capability of mobility, and they can do data sensing, data processing and wireless communication. However, the greatest challenge is the constraints of energy. The most critical issue is how to minimize the energy consumption and keep tracking the mobile target in WSNs. In this paper, we propose a tracking approach for tracking mobile target in hybrid wireless sensor network which consisting of static and mobile node. While static nodes are random distributed in the Field of Interested (FoI) and mobile nodes are moved to fill the coverage hole. We predict the area where the target may cross and construction the local barrier coverage to detect the target. In order to reduce the energy consumption, we wakeup the portion of constructed local barrier coverage to tracking the target. The simulation shows the proposed scheme can reduce the energy consumption and missing rate.","PeriodicalId":174849,"journal":{"name":"2014 7th International Conference on Ubi-Media Computing and Workshops","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126903152","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 propose a real-time traffic surveillance system using computer vision for tracking multiple vehicles from roadway images. We design an application program to monitor increasing congestion on roadway and problems. The application program is developed based on OpenCV library functions for the computer vision of the proposed monitoring algorithm. Our system sends traffic surveillance status to driver using GSM network. Additionally, we obtained the implementation of traffic monitoring system by using LED (Light-Emitting Diode) matrix display.
{"title":"Traffic Surveillance System Based on Computer Vision and its Application","authors":"Davaadorj Norpel, Sodkhuu Dalaikhuu, Khurelbaatar Tseveenjav","doi":"10.1109/U-MEDIA.2014.68","DOIUrl":"https://doi.org/10.1109/U-MEDIA.2014.68","url":null,"abstract":"In this paper we propose a real-time traffic surveillance system using computer vision for tracking multiple vehicles from roadway images. We design an application program to monitor increasing congestion on roadway and problems. The application program is developed based on OpenCV library functions for the computer vision of the proposed monitoring algorithm. Our system sends traffic surveillance status to driver using GSM network. Additionally, we obtained the implementation of traffic monitoring system by using LED (Light-Emitting Diode) matrix display.","PeriodicalId":174849,"journal":{"name":"2014 7th International Conference on Ubi-Media Computing and Workshops","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128974383","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 computing is considered as a promising technological path of innovation. In order to support various kinds of ubiquitous applications, the service providers have to build up networked infrastructures consisting of heterogeneous computing appliances and sensors. With the growth in the number of devices and the increasing complexity of the infrastructure, it becomes an important concern and challenge in the design and management of ubiquitous infrastructure to allocate the resources to maximize the total utilization and minimize the energy consumption, that is, in the energy-efficient manner. Addressing this issue, this paper proposes a resource allocation model, with the goal to minimize the energy consumption of the infrastructure, while achieving Quality of Service (QoS) requirements. We first propose a stochastic model using queueing theory and then model this problem as a nonlinear programming problem subject to a number of inequality constraints and develop heuristic solutions to solve it. Simulation results are presented to show the effectiveness of our approach.
{"title":"Energy-Efficient Resource Allocation Model with QoS Assurance for Ubiquitous and Heterogeneous Environment","authors":"Dian Shen, Junzhou Luo, Fang Dong","doi":"10.1109/U-MEDIA.2014.35","DOIUrl":"https://doi.org/10.1109/U-MEDIA.2014.35","url":null,"abstract":"Ubiquitous computing is considered as a promising technological path of innovation. In order to support various kinds of ubiquitous applications, the service providers have to build up networked infrastructures consisting of heterogeneous computing appliances and sensors. With the growth in the number of devices and the increasing complexity of the infrastructure, it becomes an important concern and challenge in the design and management of ubiquitous infrastructure to allocate the resources to maximize the total utilization and minimize the energy consumption, that is, in the energy-efficient manner. Addressing this issue, this paper proposes a resource allocation model, with the goal to minimize the energy consumption of the infrastructure, while achieving Quality of Service (QoS) requirements. We first propose a stochastic model using queueing theory and then model this problem as a nonlinear programming problem subject to a number of inequality constraints and develop heuristic solutions to solve it. Simulation results are presented to show the effectiveness of our approach.","PeriodicalId":174849,"journal":{"name":"2014 7th International Conference on Ubi-Media Computing and Workshops","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114893484","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}
Ulti-path routing protocol is a way to improve the reliability of connections in cognitive radio networks with supporting the quality-of-service (QoS) communications. In this paper, we consider the probability of spectrum hole unoccupied by PUs and allocating every link channel, namely multi-path QoS routing protocol in cognitive radio networks. Our proposed scheme of multi-path routing protocol for cognitive radio networks must account the probability of spectrum hole unoccupied by PUs, data throughput and QoS. Our QoS multi-path routing protocol determines the expected transmission bandwidth calculation and bandwidth allocation at the destination. Our protocol collects link probability of spectrum hole unoccupied by PUs information from source to destination in order to calculate all paths expected transmission bandwidth with the information of link bandwidth at the destination. To satisfy a given bandwidth requirement for primary users who are serious interfering the factors, the bandwidth calculation of the QoS multi-path are determined at the destination to accurately determine the QoS multi-path depending on the status of network bandwidth.
{"title":"An Efficient Multi-path Routing Scheme for Cognitive Ad-Hoc Networks","authors":"T. Juang, Yuh-Shyan Chen, C. Hsu","doi":"10.1109/U-MEDIA.2014.1","DOIUrl":"https://doi.org/10.1109/U-MEDIA.2014.1","url":null,"abstract":"Ulti-path routing protocol is a way to improve the reliability of connections in cognitive radio networks with supporting the quality-of-service (QoS) communications. In this paper, we consider the probability of spectrum hole unoccupied by PUs and allocating every link channel, namely multi-path QoS routing protocol in cognitive radio networks. Our proposed scheme of multi-path routing protocol for cognitive radio networks must account the probability of spectrum hole unoccupied by PUs, data throughput and QoS. Our QoS multi-path routing protocol determines the expected transmission bandwidth calculation and bandwidth allocation at the destination. Our protocol collects link probability of spectrum hole unoccupied by PUs information from source to destination in order to calculate all paths expected transmission bandwidth with the information of link bandwidth at the destination. To satisfy a given bandwidth requirement for primary users who are serious interfering the factors, the bandwidth calculation of the QoS multi-path are determined at the destination to accurately determine the QoS multi-path depending on the status of network bandwidth.","PeriodicalId":174849,"journal":{"name":"2014 7th International Conference on Ubi-Media Computing and Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127972054","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
扫码关注我们
求助内容：
应助结果提醒方式：