Donald Elmazi, Evjola Spaho, Elis Kulla, Tetsuya Oda, Makoto Ikeda, L. Barolli
In Wireless Sensor and Actor Networks (WSANs), sensors and actors collaborate together to get the information about the physical environment and perform appropriate actions. In order to provide effective sensing and acting, a distributed local coordination mechanism is necessary among sensors and actors. In this work, we consider the actor node selection problem and we propose a fuzzy-based system that based on data provided by sensors and actors selects an appropriate actor node. We use 4 input parameters. Different from our previous work, we consider also the Congestion Situation (CS) parameter. The output parameter is Actor Selection Decision (ASD). The simulation results show that the proposed system makes a proper selection of actor nodes.
{"title":"Selection of Actor Nodes in Wireless Sensor and Actor Networks Considering as a New Parameter Actor Congestion Situation","authors":"Donald Elmazi, Evjola Spaho, Elis Kulla, Tetsuya Oda, Makoto Ikeda, L. Barolli","doi":"10.1109/NBiS.2016.32","DOIUrl":"https://doi.org/10.1109/NBiS.2016.32","url":null,"abstract":"In Wireless Sensor and Actor Networks (WSANs), sensors and actors collaborate together to get the information about the physical environment and perform appropriate actions. In order to provide effective sensing and acting, a distributed local coordination mechanism is necessary among sensors and actors. In this work, we consider the actor node selection problem and we propose a fuzzy-based system that based on data provided by sensors and actors selects an appropriate actor node. We use 4 input parameters. Different from our previous work, we consider also the Congestion Situation (CS) parameter. The output parameter is Actor Selection Decision (ASD). The simulation results show that the proposed system makes a proper selection of actor nodes.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134422348","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}
Tam Nguyen Kieu, Khanh Nhan Nguyen Huu, L. N. Ngoc, H. H. Duy, T. D. Dinh, M. Voznák
Nowadays, the using of redundant energy in the environment and protecting the earth opposing the global climate change is emerged as a urgent measure drawing the majority of people in the world. Among of them, the energy harvesting protocol is a highlight attracting the concerning of many projects as well as the study of many scientists specially in wireless communication field. This paper mentions the energy harvesting structure of the full duplex relaying systems. By employing the time switching based relaying (TSR) protocol and Amplify-and-Forward (AF) model, we advance the closed-form expression of the outage probability and then calculate the optimal throughput. An essential result can be found observably that the noise factor, the time fraction, the target ratio as well as the position of relay in TSR affect on the optimal throughput. After at all, the numerical results imply an effective relaying plan in full duplex cooperation systems.
{"title":"A Performance Analysis in the One-Way Full Duplex Relaying Network","authors":"Tam Nguyen Kieu, Khanh Nhan Nguyen Huu, L. N. Ngoc, H. H. Duy, T. D. Dinh, M. Voznák","doi":"10.1109/NBIS.2016.62","DOIUrl":"https://doi.org/10.1109/NBIS.2016.62","url":null,"abstract":"Nowadays, the using of redundant energy in the environment and protecting the earth opposing the global climate change is emerged as a urgent measure drawing the majority of people in the world. Among of them, the energy harvesting protocol is a highlight attracting the concerning of many projects as well as the study of many scientists specially in wireless communication field. This paper mentions the energy harvesting structure of the full duplex relaying systems. By employing the time switching based relaying (TSR) protocol and Amplify-and-Forward (AF) model, we advance the closed-form expression of the outage probability and then calculate the optimal throughput. An essential result can be found observably that the noise factor, the time fraction, the target ratio as well as the position of relay in TSR affect on the optimal throughput. After at all, the numerical results imply an effective relaying plan in full duplex cooperation systems.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134004245","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}
Mirjeta Alinci, Takaaki Inaba, Donald Elmazi, Evjola Spaho, Vladi Koliçi, L. Barolli
A Mobile Ad hoc Network (MANET) is a multi-hop wireless network in which the mobile nodes are dynamic in nature and has a limited bandwidth and minimum battery power. Due to this challenging environment the mobile nodes can be grouped into clusters to achieve better stability and scalability. Grouping the mobile nodes is called clustering, in which a leader node is elected to manage the entire network. In this paper, first we introduce various approaches for clustering focus on different performance metrics. Then, we show some clustering schemes such as Mobility-based clustering, Energy-efficient clustering, Connectivity-based clustering, Weighted-based clustering. Finally, we present and compare two Fuzzy based systems (called F2SMC1 and F2SMC2) for improving the security of cluster nodes in MANETs. We compare the performance of F2SMC1 and F2SMC2 and show that the F2SMC2 is more complex than F2SMC1, but is more reliable and secure.
{"title":"Improving Node Security in MANET Clusters: A Comparison Study of Two Fuzzy-Based Systems","authors":"Mirjeta Alinci, Takaaki Inaba, Donald Elmazi, Evjola Spaho, Vladi Koliçi, L. Barolli","doi":"10.1109/NBiS.2016.40","DOIUrl":"https://doi.org/10.1109/NBiS.2016.40","url":null,"abstract":"A Mobile Ad hoc Network (MANET) is a multi-hop wireless network in which the mobile nodes are dynamic in nature and has a limited bandwidth and minimum battery power. Due to this challenging environment the mobile nodes can be grouped into clusters to achieve better stability and scalability. Grouping the mobile nodes is called clustering, in which a leader node is elected to manage the entire network. In this paper, first we introduce various approaches for clustering focus on different performance metrics. Then, we show some clustering schemes such as Mobility-based clustering, Energy-efficient clustering, Connectivity-based clustering, Weighted-based clustering. Finally, we present and compare two Fuzzy based systems (called F2SMC1 and F2SMC2) for improving the security of cluster nodes in MANETs. We compare the performance of F2SMC1 and F2SMC2 and show that the F2SMC2 is more complex than F2SMC1, but is more reliable and secure.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129404128","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 serializability of transactions is the most important property that ensure correct processing to transactions. In case of concurrent access to the same data by several transactions, or in case of dependency relationships between running sub transactions. But some transactions has been marked as malicious and they compromise the serialization of running system. For that purpose, we propose an intrusion tolerant scheme to ensure the continuity of the running transactions. A transaction dependency graph is also used by the CDC to make decisions concerning the set of data and transactions that are threatened by a malicious activity. We will give explanations about how to use the proposed scheme to illustrate its behavior and efficiency against a compromised transaction-based in a cloud of databases environment. Several issues should be considered when dealing with the processing of a set of interleaved transactions in a transaction based environment. In most cases, these issues are due to the concurrent access to the same data by several transactions or the dependency relationship between running transactions. The serializability may be affected if a transaction that belongs to the processing node is compromised.
{"title":"An Intrusion Tolerance Scheme for a Cloud of Databases Environment","authors":"S. Chatti, Habib Ounelli","doi":"10.1109/NBiS.2016.4","DOIUrl":"https://doi.org/10.1109/NBiS.2016.4","url":null,"abstract":"The serializability of transactions is the most important property that ensure correct processing to transactions. In case of concurrent access to the same data by several transactions, or in case of dependency relationships between running sub transactions. But some transactions has been marked as malicious and they compromise the serialization of running system. For that purpose, we propose an intrusion tolerant scheme to ensure the continuity of the running transactions. A transaction dependency graph is also used by the CDC to make decisions concerning the set of data and transactions that are threatened by a malicious activity. We will give explanations about how to use the proposed scheme to illustrate its behavior and efficiency against a compromised transaction-based in a cloud of databases environment. Several issues should be considered when dealing with the processing of a set of interleaved transactions in a transaction based environment. In most cases, these issues are due to the concurrent access to the same data by several transactions or the dependency relationship between running transactions. The serializability may be affected if a transaction that belongs to the processing node is compromised.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127580578","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}
An effective method has been proposed in this paper to reconstruct the 3D shape from single texture image with similar appearances and reflectance properties. Two main steps are required: the first is the estimation of lighting parameters, which has been estimated by detecting the largest direction of the brightness change, the second is the 3D reconstruction from single input image, which has been reconstructed by combining the patch matching and optimization methods. Experiment results have verified the effectiveness of the proposed method according to realistic perception.
{"title":"Three Dimensional Reconstruction from Single Uniform Texture Image with Unknown Lighting Conditions","authors":"Yujuan Sun, Qiuming Ma","doi":"10.1109/NBiS.2016.29","DOIUrl":"https://doi.org/10.1109/NBiS.2016.29","url":null,"abstract":"An effective method has been proposed in this paper to reconstruct the 3D shape from single texture image with similar appearances and reflectance properties. Two main steps are required: the first is the estimation of lighting parameters, which has been estimated by detecting the largest direction of the brightness change, the second is the 3D reconstruction from single input image, which has been reconstructed by combining the patch matching and optimization methods. Experiment results have verified the effectiveness of the proposed method according to realistic perception.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128595493","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}
Tourism resources are one of the most significant resources in Japan. It is necessary for the continuation of continuous sightseeing industry to utilize the attractive point in an area in which I have such diversity. However, maintenance and management are not accomplished to utilize such contents as a tourist spot. It is hard to the cost and hand's point by a conventional way by a local resource to dig contents with diversity up, manage and report it to a significant person. So we have developed LodeStar Platform, which registers time-spatial information and contents easily for everyone using ICT. LodeStarPlatform makes it possible that a highly motivated resident sends "charm in an area" freely. It is possible to offer collected "charm in" an area according to the visitor's interest including an inbound. In this paper, we introduce the concept, outline, design and implementation of LodeStar Platform, and report the result of a case study using a sample system with LodeStar Platform.
{"title":"A Collection and Delivery Method of Contents in Tourism with Location Information","authors":"Go Hirakawa, Ryoichi Nagatsuji, Y. Shibata","doi":"10.1109/NBiS.2016.91","DOIUrl":"https://doi.org/10.1109/NBiS.2016.91","url":null,"abstract":"Tourism resources are one of the most significant resources in Japan. It is necessary for the continuation of continuous sightseeing industry to utilize the attractive point in an area in which I have such diversity. However, maintenance and management are not accomplished to utilize such contents as a tourist spot. It is hard to the cost and hand's point by a conventional way by a local resource to dig contents with diversity up, manage and report it to a significant person. So we have developed LodeStar Platform, which registers time-spatial information and contents easily for everyone using ICT. LodeStarPlatform makes it possible that a highly motivated resident sends \"charm in an area\" freely. It is possible to offer collected \"charm in\" an area according to the visitor's interest including an inbound. In this paper, we introduce the concept, outline, design and implementation of LodeStar Platform, and report the result of a case study using a sample system with LodeStar Platform.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121218837","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}
Faisal Alfouzan, A. Shahrabi, S. Ghoreyshi, T. Boutaleb
Underwater Sensor Network (UWSN) is significantly different from terrestrial network in that acoustic signal is mainly used as the communication medium. The acoustic signal imposes high bit error rate, limited bandwidth and long propagation delay which, to some extent, influences the design of various services in UWSNs. MAC protocol, however, is one of the protocols which has been completely affected by the unique features of underwater environment. For UWSNs, energy-efficiency is now a major concern due to difficulties of replacing or recharging batteries. In order to save energy, most of the proposed MAC protocols follow a pattern of sleeping and listening mode, since the sleep mode energy consumption is much less than that of the idle listening mode. Hence, the energy efficiency is directly dependent upon how the sleeping and listening modes are scheduled at each node. In some protocols, sender-based scheduling, the schedule is specified by the sending nodes, whereas in receiver-based scheduling the receiving nodes decide to schedule data transmission. In this paper, we evaluate the UWAN-MAC, as a sender-based, and R-MAC, as a receiver-based scheduling. Our simulation results show that the receiver-based always performs well in terms of energy consumption for small size networks and under light traffic. However, by increasing the number of nodes or traffic load, the sender-based highly outperforms the receiver-based scheduling protocols in terms of end-to-end delay and throughput.
{"title":"Performance Comparison of Sender-Based and Receiver-Based Scheduling MAC Protocols for Underwater Sensor Networks","authors":"Faisal Alfouzan, A. Shahrabi, S. Ghoreyshi, T. Boutaleb","doi":"10.1109/NBiS.2016.3","DOIUrl":"https://doi.org/10.1109/NBiS.2016.3","url":null,"abstract":"Underwater Sensor Network (UWSN) is significantly different from terrestrial network in that acoustic signal is mainly used as the communication medium. The acoustic signal imposes high bit error rate, limited bandwidth and long propagation delay which, to some extent, influences the design of various services in UWSNs. MAC protocol, however, is one of the protocols which has been completely affected by the unique features of underwater environment. For UWSNs, energy-efficiency is now a major concern due to difficulties of replacing or recharging batteries. In order to save energy, most of the proposed MAC protocols follow a pattern of sleeping and listening mode, since the sleep mode energy consumption is much less than that of the idle listening mode. Hence, the energy efficiency is directly dependent upon how the sleeping and listening modes are scheduled at each node. In some protocols, sender-based scheduling, the schedule is specified by the sending nodes, whereas in receiver-based scheduling the receiving nodes decide to schedule data transmission. In this paper, we evaluate the UWAN-MAC, as a sender-based, and R-MAC, as a receiver-based scheduling. Our simulation results show that the receiver-based always performs well in terms of energy consumption for small size networks and under light traffic. However, by increasing the number of nodes or traffic load, the sender-based highly outperforms the receiver-based scheduling protocols in terms of end-to-end delay and throughput.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125322946","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}
Admir Barolli, Tetsuya Oda, I. Shinko, L. Barolli, F. Xhafa, M. Takizawa
In this paper, we evaluate the performance of two Wireless Mesh Networks (WMNs) architectures considering throughput, delay, jitter and fairness index metrics. For simulations, we used ns-3, Distributed Coordination Function (DCF) and Optimized Link State Routing (OLSR). We compare the performance for Transmission Control Protocol (TCP) Tahoe, Reno and NewReno for uniform distribution of mesh clients by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for both WMN architectures, the PDR values of TCP congestion-avoidance algorithms are almost the same. For Hybrid WMN architecture, the throughput of TCP Reno is better than other algorithms. However, for I/B WMN, the throughput of TCP Tahoe is higher than other algorithms. The delay and jitter of TCP NewReno are a little bit lower compared with other algorithms. The I/B WMN architecture, the fairness index of TCP congestion-avoidance algorithms is almost the same.
{"title":"Performance Analysis of WMNs by WMN-GA Simulation System for Different WMN Architectures and TCP Congestion-Avoidance Algorithms Considering Uniform Distribution","authors":"Admir Barolli, Tetsuya Oda, I. Shinko, L. Barolli, F. Xhafa, M. Takizawa","doi":"10.1109/NBiS.2016.18","DOIUrl":"https://doi.org/10.1109/NBiS.2016.18","url":null,"abstract":"In this paper, we evaluate the performance of two Wireless Mesh Networks (WMNs) architectures considering throughput, delay, jitter and fairness index metrics. For simulations, we used ns-3, Distributed Coordination Function (DCF) and Optimized Link State Routing (OLSR). We compare the performance for Transmission Control Protocol (TCP) Tahoe, Reno and NewReno for uniform distribution of mesh clients by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for both WMN architectures, the PDR values of TCP congestion-avoidance algorithms are almost the same. For Hybrid WMN architecture, the throughput of TCP Reno is better than other algorithms. However, for I/B WMN, the throughput of TCP Tahoe is higher than other algorithms. The delay and jitter of TCP NewReno are a little bit lower compared with other algorithms. The I/B WMN architecture, the fairness index of TCP congestion-avoidance algorithms is almost the same.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132960358","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 increase in network traffic has recently become a problem. Therefore, we attempt to solve it using peer-to-peer (P2P) technology. This research proposes a system design to reduce the traffic of P2P applications by switching between multiple overlay networks according to content ratings. The multiple overlay networks are constructed as virtual networks on physical networks using Software-Defined Networking (SDN) techniques. The overlay networks are mapped into slices of SDN, and the proposed system switches between multiple slices according to the content rating. Two slices are used in the prototype of the proposed system. One of the slices is an overlay network based on the network distance, and the other is an overlay network based on content trends. The network distance-based slice is constructed by clustering based on Round Trip Time (RTT). When a peer searches for content, a region of the content search is expanded little by little. The peer can then receive the content from a peer close to it in terms of network distance. The content trend-based slice is constructed according to contents of each node. Specifically, nodes that have similar content are close to each other. As a result, peers can obtain content by minimizing the number of hops when any node obtains that content. The prototype of the proposed system will be demonstrated and experiments will be performed in a testbed specialized for P2P agent platforms. In the demonstration and experiments, the slices will be implemented as conventional overlay networks.
{"title":"Peer-to-Peer Network System and Application Design on Multiple Virtual Networks","authors":"Nanami Imada, Kazunori Ueda","doi":"10.1109/NBiS.2016.66","DOIUrl":"https://doi.org/10.1109/NBiS.2016.66","url":null,"abstract":"The increase in network traffic has recently become a problem. Therefore, we attempt to solve it using peer-to-peer (P2P) technology. This research proposes a system design to reduce the traffic of P2P applications by switching between multiple overlay networks according to content ratings. The multiple overlay networks are constructed as virtual networks on physical networks using Software-Defined Networking (SDN) techniques. The overlay networks are mapped into slices of SDN, and the proposed system switches between multiple slices according to the content rating. Two slices are used in the prototype of the proposed system. One of the slices is an overlay network based on the network distance, and the other is an overlay network based on content trends. The network distance-based slice is constructed by clustering based on Round Trip Time (RTT). When a peer searches for content, a region of the content search is expanded little by little. The peer can then receive the content from a peer close to it in terms of network distance. The content trend-based slice is constructed according to contents of each node. Specifically, nodes that have similar content are close to each other. As a result, peers can obtain content by minimizing the number of hops when any node obtains that content. The prototype of the proposed system will be demonstrated and experiments will be performed in a testbed specialized for P2P agent platforms. In the demonstration and experiments, the slices will be implemented as conventional overlay networks.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126296729","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}
A real-time web-cast system for classes in the BYOD (Bring Your Own Device) style is presented. The teacher starts up our server application software to keep capturing the screens and the voices. The student PCs will be organized in the shape of a binary tree in the following steps. Each student lets his browser connect to the teacher's PC with its FQDN or IP address. The first comer becomes the root that receives screen images and voices directly from the teacher's PC by the WebSocket protocol. Two browsers newly coming in become child nodes of the root or an existing leaf node from which they receive screens and voices by the WebRTC protocol. It is advantageous especially for the classes in the BYOD style because no students are required to install anything other than a browser into the PCs in advance. It is even possible to host students outside the classroom since the teacher's voices are delivered to their PCs.
提出了一个BYOD (Bring Your Own Device)风格的实时网络直播系统。老师启动了我们的服务器应用软件，不断捕捉屏幕和声音。在接下来的步骤中，学生pc将被组织成二叉树的形状。每个学生让他的浏览器用FQDN或IP地址连接到老师的电脑上。第一个角成为根，通过WebSocket协议直接从教师的PC接收屏幕图像和声音。新进入的两个浏览器成为根节点或现有叶节点的子节点，它们通过WebRTC协议从中接收屏幕和声音。这对BYOD风格的课程尤其有利，因为学生不需要事先在电脑上安装除浏览器以外的任何东西。由于教师的声音被传送到学生的电脑上，因此甚至可以在教室外接待学生。
{"title":"A Real-Time Web-Cast System for Classes in the BYOD Style","authors":"Daiki Ito, Michitoshi Niibori, M. Kamada","doi":"10.1109/NBiS.2016.33","DOIUrl":"https://doi.org/10.1109/NBiS.2016.33","url":null,"abstract":"A real-time web-cast system for classes in the BYOD (Bring Your Own Device) style is presented. The teacher starts up our server application software to keep capturing the screens and the voices. The student PCs will be organized in the shape of a binary tree in the following steps. Each student lets his browser connect to the teacher's PC with its FQDN or IP address. The first comer becomes the root that receives screen images and voices directly from the teacher's PC by the WebSocket protocol. Two browsers newly coming in become child nodes of the root or an existing leaf node from which they receive screens and voices by the WebRTC protocol. It is advantageous especially for the classes in the BYOD style because no students are required to install anything other than a browser into the PCs in advance. It is even possible to host students outside the classroom since the teacher's voices are delivered to their PCs.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126809865","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
扫码关注我们
求助内容：
应助结果提醒方式：