Nonorthogonal multiple access (NOMA) transmission is a popular candidate technology for the next generation broadband mobile communication systems because of high spectrum efficiency. In this paper, we proposed two beamforming scheme, namely, matched-to-the-stronger-channel (MSC) beamforming and optimal beamforming schemes for a two-user downlink NOMA system. Moreover, we also develop optimal power allocation for both schemes. It shows through simulation results that the optimal scheme is capable to combat the near-far effect and provides high achievable sum rate especially when the geographical angle between two users is small.
{"title":"Joint Beamforming and Power Allocation Design in Non-Orthogonal Multiple Access Systems","authors":"Jia-Yu Yang, Wan-Jen Huang","doi":"10.1109/ICS.2016.0145","DOIUrl":"https://doi.org/10.1109/ICS.2016.0145","url":null,"abstract":"Nonorthogonal multiple access (NOMA) transmission is a popular candidate technology for the next generation broadband mobile communication systems because of high spectrum efficiency. In this paper, we proposed two beamforming scheme, namely, matched-to-the-stronger-channel (MSC) beamforming and optimal beamforming schemes for a two-user downlink NOMA system. Moreover, we also develop optimal power allocation for both schemes. It shows through simulation results that the optimal scheme is capable to combat the near-far effect and provides high achievable sum rate especially when the geographical angle between two users is small.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126544310","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 self-driving car become a completely novel application to fulfill highly safe driving era, in which the Vehicle-to-X (V2X) communications and cloud computing act as the key technologies. In such new-trend applications, for shortening the emergency messages transmitting or sharing among the self-driving cars and human-driving cars, the message broadcasting is adopted, but suffers from the broadcasting storm and message flooding. Clearly, for the mobile society via V2X, the message broadcasting protocol leads to an unpredictable long forwarding delay and degrades the QoS of real-time transmission and the synchronization interval of the adaptive cruise control (ACC). This paper thus proposes an efficient emergency message forwarding approach to guarantee the broadcasting delay and to prevent the broadcasting storm for V2X communications in 5G mobile society. Numerical results demonstrate that the proposed approach outperforms the compared approaches in transmission range, connectivity probability, total number of forwarding messages, number of hop-counts, and end-to-end delay.
{"title":"Efficient Emergency Forwarding to Prevent Message Broadcasting Storm in Mobile Society via Vehicle-to-X Communications for 5G LTE-V","authors":"Ben-Jye Chang, Ying-Hsin Liang, Yao-De Huang","doi":"10.1109/ICS.2016.0102","DOIUrl":"https://doi.org/10.1109/ICS.2016.0102","url":null,"abstract":"The self-driving car become a completely novel application to fulfill highly safe driving era, in which the Vehicle-to-X (V2X) communications and cloud computing act as the key technologies. In such new-trend applications, for shortening the emergency messages transmitting or sharing among the self-driving cars and human-driving cars, the message broadcasting is adopted, but suffers from the broadcasting storm and message flooding. Clearly, for the mobile society via V2X, the message broadcasting protocol leads to an unpredictable long forwarding delay and degrades the QoS of real-time transmission and the synchronization interval of the adaptive cruise control (ACC). This paper thus proposes an efficient emergency message forwarding approach to guarantee the broadcasting delay and to prevent the broadcasting storm for V2X communications in 5G mobile society. Numerical results demonstrate that the proposed approach outperforms the compared approaches in transmission range, connectivity probability, total number of forwarding messages, number of hop-counts, and end-to-end delay.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130144975","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}
Currently a massive amount of traffic per second is delivered through EPON systems, one of the prominent access network technologies for delivering the next generation network. Therefore, it is vital to keep the EPON optical distribution network (ODN) working by providing the necessity protection mechanism in the deployed devices, otherwise, when failures occur it will cause a great loss for both network operators and business customers. In this paper, we propose a bus-connected architecture to protect and recover distribution drop fiber (DDF) link faults or transceiver failures at ONU(s) in SIEPON system. The proposed architecture provides a cost-effective architecture, which delivers the high fault-tolerance in handling multiple DDF faults, while also providing flexibility in choosing the backup ONU assignments. Simulation results show that the proposed architecture provides the reliability and maintains quality of service (QoS) performance in terms of mean packet delay, system throughput, packet loss and EF jitter when DDF link failures occur.
EPON系统是下一代网络的重要接入网技术之一，目前每秒都有大量的流量通过EPON系统传输。因此，通过在部署的设备中提供必要的保护机制来保证EPON optical distribution network (ODN)的正常运行至关重要，否则一旦发生故障，将给网络运营商和企业客户造成巨大的损失。在本文中，我们提出了一种总线连接架构来保护和恢复SIEPON系统中ONU(s)的DDF链路故障或收发器故障。所提出的体系结构提供了一种经济高效的体系结构，在处理多个DDF故障时提供了高容错性，同时还提供了选择备份ONU分配的灵活性。仿真结果表明，当DDF链路发生故障时，所提出的体系结构在平均数据包延迟、系统吞吐量、丢包和EF抖动方面提供了可靠性并保持了服务质量(QoS)性能。
{"title":"Comprehensive DDF Link Protection with a Bus-Connected SIEPON Architecture","authors":"I. Hwang, Andrew Fernando Pakpahan","doi":"10.1109/ICS.2016.0043","DOIUrl":"https://doi.org/10.1109/ICS.2016.0043","url":null,"abstract":"Currently a massive amount of traffic per second is delivered through EPON systems, one of the prominent access network technologies for delivering the next generation network. Therefore, it is vital to keep the EPON optical distribution network (ODN) working by providing the necessity protection mechanism in the deployed devices, otherwise, when failures occur it will cause a great loss for both network operators and business customers. In this paper, we propose a bus-connected architecture to protect and recover distribution drop fiber (DDF) link faults or transceiver failures at ONU(s) in SIEPON system. The proposed architecture provides a cost-effective architecture, which delivers the high fault-tolerance in handling multiple DDF faults, while also providing flexibility in choosing the backup ONU assignments. Simulation results show that the proposed architecture provides the reliability and maintains quality of service (QoS) performance in terms of mean packet delay, system throughput, packet loss and EF jitter when DDF link failures occur.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130819170","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}
Software size estimation is a good reference to assess the project's manpower, schedule and budget in the initial project planning. Nowadays, many organizations are concerned about the cost of software maintenance, because the cost of software maintenance is constantly growing. It takes almost eighty-percent budget of software companies on maintenance, which means that the costs of software development are out-weighted by maintenance costs. Function point methods are widely adopted in estimating the size of a software under development. However, the function point calculation of a maintenance project is different from a development project. In COSMIC-FFP, when analyzing a system developed from scratch, all messages in a sequence diagram will be accumulated as function points. However, when analyzing maintenance project, if the messages passed to objects which are the same as the previous version rather than the newly added or changed, such messages will not be counted as function points. It is necessary to distinguish between the unchanged and new or enhanced functions in order to distinguish between the maintenance costs in the future and the development costs in the past. This study proposes a method to distinguish between existing and new or changed function points for maintenance projects and develops a supporting tool for COSMIC-FFP. By comparing the differences between two versions of a system, we obtained the number of lines of code per Cfsu from a regression analysis, so that we can assess more accurately the size involved in a maintenance project.
{"title":"A Software Maintenance Project Size Estimation Tool Based On Cosmic Full Function Point","authors":"Chi-Jui Lin, Dowming Yeh","doi":"10.1109/ICS.2016.0115","DOIUrl":"https://doi.org/10.1109/ICS.2016.0115","url":null,"abstract":"Software size estimation is a good reference to assess the project's manpower, schedule and budget in the initial project planning. Nowadays, many organizations are concerned about the cost of software maintenance, because the cost of software maintenance is constantly growing. It takes almost eighty-percent budget of software companies on maintenance, which means that the costs of software development are out-weighted by maintenance costs. Function point methods are widely adopted in estimating the size of a software under development. However, the function point calculation of a maintenance project is different from a development project. In COSMIC-FFP, when analyzing a system developed from scratch, all messages in a sequence diagram will be accumulated as function points. However, when analyzing maintenance project, if the messages passed to objects which are the same as the previous version rather than the newly added or changed, such messages will not be counted as function points. It is necessary to distinguish between the unchanged and new or enhanced functions in order to distinguish between the maintenance costs in the future and the development costs in the past. This study proposes a method to distinguish between existing and new or changed function points for maintenance projects and develops a supporting tool for COSMIC-FFP. By comparing the differences between two versions of a system, we obtained the number of lines of code per Cfsu from a regression analysis, so that we can assess more accurately the size involved in a maintenance project.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130972397","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}
Previous cache replacement algorithms utilize the access history information to make replacement decisions. However, they fail to deliver utmost performance since the history information exploited is incomplete. Motivated by the limitations of existing algorithms, this paper proposes a novel replacement scheme, called the Pattern-assisted Adaptive Recency Caching (PARC). PARC simultaneously utilizes the history information of recency, frequency, and access patterns to estimate the locality strength and to select the victim block. Specifically, PARC exploits the reference regularities exhibited in past behaviors, including looping or sequential references, to actively and rapidly adapt the recency and frequency information of blocks so as to exactly distill blocks with long-term utility from those with only short-term utility. Through comprehensive simulations on a variety of traces of different access patterns, we show that PARC is robust since, except for random workloads where the performance of each cache replacement algorithm is similar, PARC always outperforms the least recently used (LRU) scheme and other existing cache replacement algorithms.
{"title":"An Adaptive Buffer Cache Management Scheme","authors":"Hsung-Pin Chang, Cheng-Pang Chiang, Yu-Cheng Yu","doi":"10.1109/ICS.2016.0033","DOIUrl":"https://doi.org/10.1109/ICS.2016.0033","url":null,"abstract":"Previous cache replacement algorithms utilize the access history information to make replacement decisions. However, they fail to deliver utmost performance since the history information exploited is incomplete. Motivated by the limitations of existing algorithms, this paper proposes a novel replacement scheme, called the Pattern-assisted Adaptive Recency Caching (PARC). PARC simultaneously utilizes the history information of recency, frequency, and access patterns to estimate the locality strength and to select the victim block. Specifically, PARC exploits the reference regularities exhibited in past behaviors, including looping or sequential references, to actively and rapidly adapt the recency and frequency information of blocks so as to exactly distill blocks with long-term utility from those with only short-term utility. Through comprehensive simulations on a variety of traces of different access patterns, we show that PARC is robust since, except for random workloads where the performance of each cache replacement algorithm is similar, PARC always outperforms the least recently used (LRU) scheme and other existing cache replacement algorithms.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131186001","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}
Chih-Tsan Chang, Cheng-Yu Tsai, Song Peng, Hung-Hsu Tsai, Pao-Ta Yu
This paper develops a multi-user streaming feedback system for cooperative learning in classroom learning. The system offers Android Apps to perform mobile interactive learning. Therefore, the system can be applied for interactive teaching. It also provides a game-based approach to improve students' cooperative learning. On the cognitive development of the game-based learning, the students use mobile devices camera and record their screen activity to play from streaming server and broadcast the contest on the streaming video wall such that the whole class can be able to see the contest. Moreover, the teacher can observe students' learning status and problems in real-time. That students have more willing to concentrate on their learning in the lecture. In other words, the streaming feedback system for cooperative learning in game-based theory classroom learning increases interactive between the teacher and students. Therefore, it improves learners' interest and efficiency in learning.
{"title":"On the Design of Multi-User Streaming Feedback System for Application of Cooperative Learning","authors":"Chih-Tsan Chang, Cheng-Yu Tsai, Song Peng, Hung-Hsu Tsai, Pao-Ta Yu","doi":"10.1109/ICS.2016.0134","DOIUrl":"https://doi.org/10.1109/ICS.2016.0134","url":null,"abstract":"This paper develops a multi-user streaming feedback system for cooperative learning in classroom learning. The system offers Android Apps to perform mobile interactive learning. Therefore, the system can be applied for interactive teaching. It also provides a game-based approach to improve students' cooperative learning. On the cognitive development of the game-based learning, the students use mobile devices camera and record their screen activity to play from streaming server and broadcast the contest on the streaming video wall such that the whole class can be able to see the contest. Moreover, the teacher can observe students' learning status and problems in real-time. That students have more willing to concentrate on their learning in the lecture. In other words, the streaming feedback system for cooperative learning in game-based theory classroom learning increases interactive between the teacher and students. Therefore, it improves learners' interest and efficiency in learning.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133501679","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 any positive integer k, the total k-domatic partition problem is to partition the vertices of a graph G into k pairwise disjoint total dominating sets. In this paper, we study the problem for planar graphs, chordal bipartite graphs, convex bipartite graphs, and bipartite permutation graphs. We show that the total 3-domatic partition problem on planar graphs is NP-complete. Moreover, we give an alternative algorithm to solve the total k-domatic partition problem for chordal bipartite graphs with weak elimination orderings, and adapt it to solve the problem in linear time for bipartite permutation graphs and convex bipartite graphs even if Gamma-free forms of the adjacency matrices of the considered graphs are not given.
{"title":"Total k-Domatic Partition on Some Classes of Graphs","authors":"Chuan-Min Lee","doi":"10.1109/ICS.2016.0023","DOIUrl":"https://doi.org/10.1109/ICS.2016.0023","url":null,"abstract":"For any positive integer k, the total k-domatic partition problem is to partition the vertices of a graph G into k pairwise disjoint total dominating sets. In this paper, we study the problem for planar graphs, chordal bipartite graphs, convex bipartite graphs, and bipartite permutation graphs. We show that the total 3-domatic partition problem on planar graphs is NP-complete. Moreover, we give an alternative algorithm to solve the total k-domatic partition problem for chordal bipartite graphs with weak elimination orderings, and adapt it to solve the problem in linear time for bipartite permutation graphs and convex bipartite graphs even if Gamma-free forms of the adjacency matrices of the considered graphs are not given.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116298574","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}
Zhao Hai-tao, Du Ai-Qian, Zhu Hong-bo, Li Dapeng, LI Nan-jie
A Q-Learning based back-off algorithm was proposed in this paper because the traditional DCF approach used for IEEE 802.11p MAC protocol to access the channel has some problems of the low packet delivery rate, high delay and the poor scalability in VANETs. The proposed algorithm which is quite different from the traditional BEB algorithm was adopted by the nodes(agents) to interact with surroundings continuously and learn from each other. The vehicle nodes adjust the size of CW(Contention Window) dynamically according to the results learned from the surroundings so that the nodes can access the channel with the optimal CW eventually minimizing the packet collisions and end-to-end delay. The simulation results show that the communication nodes using the proposed algorithm can adapt to the unknown vehicular environment rapidly, and simultaneously the high packet delivery ratio, low end-to-end delay and high fairness can be achieved for vehicular network with various load.
{"title":"Research on Q-Learning Based Channel Access Control Algorithm for Internet of Vehicles","authors":"Zhao Hai-tao, Du Ai-Qian, Zhu Hong-bo, Li Dapeng, LI Nan-jie","doi":"10.1109/ICS.2016.0104","DOIUrl":"https://doi.org/10.1109/ICS.2016.0104","url":null,"abstract":"A Q-Learning based back-off algorithm was proposed in this paper because the traditional DCF approach used for IEEE 802.11p MAC protocol to access the channel has some problems of the low packet delivery rate, high delay and the poor scalability in VANETs. The proposed algorithm which is quite different from the traditional BEB algorithm was adopted by the nodes(agents) to interact with surroundings continuously and learn from each other. The vehicle nodes adjust the size of CW(Contention Window) dynamically according to the results learned from the surroundings so that the nodes can access the channel with the optimal CW eventually minimizing the packet collisions and end-to-end delay. The simulation results show that the communication nodes using the proposed algorithm can adapt to the unknown vehicular environment rapidly, and simultaneously the high packet delivery ratio, low end-to-end delay and high fairness can be achieved for vehicular network with various load.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123628997","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 recent years, many researchers have proposed intelligent systems based on the IoT (Internet of Things). Among these smart systems, one of the most common applications is intelligent surveillance system. Due to the development of the camera, some applications adopt higher resolution of images to get more accurate results. Therefore, how to process these high-resolution images in real time has become more and more important. In this paper, we design two efficient libraries to detect and track objects. Background subtraction and template matching techniques are our basic approaches which are usually applied to object detection and tracking systems. In order to process high-resolution images, we optimize these two modules by parallel technique to enhance the performance. Experimental results show that the performance of the tracking system using the proposed approach can be increased about 52%.
近年来，许多研究者提出了基于IoT (Internet of Things)的智能系统。在这些智能系统中，最常见的应用之一就是智能监控系统。由于相机的发展，一些应用采用更高分辨率的图像来获得更准确的结果。因此，如何对这些高分辨率图像进行实时处理变得越来越重要。在本文中，我们设计了两个高效的库来检测和跟踪目标。背景减法和模板匹配技术是我们通常应用于目标检测和跟踪系统的基本方法。为了处理高分辨率图像，我们采用并行技术对这两个模块进行优化，以提高性能。实验结果表明，采用该方法的跟踪系统性能可提高约52%。
{"title":"Parallel Design of Background Subtraction and Template Matching Modules for Image Objects Tracking System","authors":"Kuei-Chung Chang, P. Liu, Yu-Shun Wang","doi":"10.1109/ICS.2016.0013","DOIUrl":"https://doi.org/10.1109/ICS.2016.0013","url":null,"abstract":"In recent years, many researchers have proposed intelligent systems based on the IoT (Internet of Things). Among these smart systems, one of the most common applications is intelligent surveillance system. Due to the development of the camera, some applications adopt higher resolution of images to get more accurate results. Therefore, how to process these high-resolution images in real time has become more and more important. In this paper, we design two efficient libraries to detect and track objects. Background subtraction and template matching techniques are our basic approaches which are usually applied to object detection and tracking systems. In order to process high-resolution images, we optimize these two modules by parallel technique to enhance the performance. Experimental results show that the performance of the tracking system using the proposed approach can be increased about 52%.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123696857","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 investigate the problem concerning about how to construct an interference-free multicast tree in the multi-channel multi-radio multi-rate wireless mesh networks with the goal of maximizing the number of clients served by the tree. This problem is referred as the profit-based multi-rate multicast tree (PMMT) problem. With the joint consideration of multicast routing, channel assignment and transmitting data rate, a cross-layer based heuristic named the profit-oriented and multi-rate (POM) algorithm is proposed for the PMMT problem. A set of preliminary experiments is also provided for evaluating the performance of the POM algorithm.
{"title":"A Study on Interference-Free Multicast in Multi-Channel Multi-Radio Multi-Rate Wireless Mesh Networks","authors":"Wen-Lin Yang","doi":"10.1109/ICS.2016.0035","DOIUrl":"https://doi.org/10.1109/ICS.2016.0035","url":null,"abstract":"In this paper, we investigate the problem concerning about how to construct an interference-free multicast tree in the multi-channel multi-radio multi-rate wireless mesh networks with the goal of maximizing the number of clients served by the tree. This problem is referred as the profit-based multi-rate multicast tree (PMMT) problem. With the joint consideration of multicast routing, channel assignment and transmitting data rate, a cross-layer based heuristic named the profit-oriented and multi-rate (POM) algorithm is proposed for the PMMT problem. A set of preliminary experiments is also provided for evaluating the performance of the POM algorithm.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124808643","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
扫码关注我们
求助内容：
应助结果提醒方式：