Education is incorporating more and more of the capabilities provided by the Internet. One such move is the incorporation of 3D virtual worlds in the learning environment. Another is the increasing development of multiagent systems that support the learner or the tutor. Integrating pedagogically based multiagent systems with 3D virtual worlds could provide a more engaging immersive learning environment. This paper explores the feasibility of integrating a 3D virtual world with a pedagogical multiagent system named QuizMASter, an educational game for elearning that helps students learn their course material through friendly competition. The integration was developed by devising, implementing and testing an approach using open source technologies, namely, Open Wonderland and JADE. The result is encouraging as the integration is technically feasible, not overly difficult and opens a door to further integration opportunities.
{"title":"An Approach for Integrating 3D Virtual Worlds with Multiagent Systems","authors":"J. Blair, F. Lin","doi":"10.1109/WAINA.2011.15","DOIUrl":"https://doi.org/10.1109/WAINA.2011.15","url":null,"abstract":"Education is incorporating more and more of the capabilities provided by the Internet. One such move is the incorporation of 3D virtual worlds in the learning environment. Another is the increasing development of multiagent systems that support the learner or the tutor. Integrating pedagogically based multiagent systems with 3D virtual worlds could provide a more engaging immersive learning environment. This paper explores the feasibility of integrating a 3D virtual world with a pedagogical multiagent system named QuizMASter, an educational game for elearning that helps students learn their course material through friendly competition. The integration was developed by devising, implementing and testing an approach using open source technologies, namely, Open Wonderland and JADE. The result is encouraging as the integration is technically feasible, not overly difficult and opens a door to further integration opportunities.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"40 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121007890","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}
H. Trivedi, P. Veeraraghavan, S. Loke, A. Desai, J. Singh
Dedicated Short Range Communication (DSRC) based Vehicular Ad Hoc Network (VANET) provides an opportunity to enable communication-based cooperative safety systems in order to decrease road traumas and improve traffic efficiency. VANET also offers a wide range of commercial and infotainment applications. VANET exhibits unique characteristics that create new challenges. This paper discusses the DSRC technology and its shortcomings in order to achieve reliable content dissemination. To optimise the performance of the vehicular networks, a novel network architecture using the cross-layer paradigm is presented. The architecture is called Smart Vehicular Ad-hoc Network (SmartVANET) architecture. The proposed SmartVANET architecture can support safety, traffic management and commercial applications. The SmartVANET architecture complies with the DSRC channel plan. The architecture divides road into segments and assigns a service channel to each segment. The SmartVANET combines a segment based clustering technique with a hybrid Medium Access Control (MAC) mechanism (termed as the Smart MAC protocol). Using cross-layer integration, SmartVANET also provides a solution for broadcast storm problems and offers scalability. The paper presents the SmartVANET architecture and argues its advantages.
{"title":"SmartVANET: The Case for a Cross-Layer Vehicular Network Architecture","authors":"H. Trivedi, P. Veeraraghavan, S. Loke, A. Desai, J. Singh","doi":"10.1109/WAINA.2011.62","DOIUrl":"https://doi.org/10.1109/WAINA.2011.62","url":null,"abstract":"Dedicated Short Range Communication (DSRC) based Vehicular Ad Hoc Network (VANET) provides an opportunity to enable communication-based cooperative safety systems in order to decrease road traumas and improve traffic efficiency. VANET also offers a wide range of commercial and infotainment applications. VANET exhibits unique characteristics that create new challenges. This paper discusses the DSRC technology and its shortcomings in order to achieve reliable content dissemination. To optimise the performance of the vehicular networks, a novel network architecture using the cross-layer paradigm is presented. The architecture is called Smart Vehicular Ad-hoc Network (SmartVANET) architecture. The proposed SmartVANET architecture can support safety, traffic management and commercial applications. The SmartVANET architecture complies with the DSRC channel plan. The architecture divides road into segments and assigns a service channel to each segment. The SmartVANET combines a segment based clustering technique with a hybrid Medium Access Control (MAC) mechanism (termed as the Smart MAC protocol). Using cross-layer integration, SmartVANET also provides a solution for broadcast storm problems and offers scalability. The paper presents the SmartVANET architecture and argues its advantages.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126139396","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 mobile wireless systems, the data on air can be accessed by a large number of mobile clients. The organization of data on wireless channels, which aims to reduce the access time of clients, is a key problem in data broadcast systems. Existing algorithms for periodic data broadcasts generally make assumptions that the clients' queries are already known and/or the distribution of access frequencies of these queries can be obtained in advance. However, the assumptions are not realistic in real life. In this paper, we study the scheduling problem of periodic XML data broadcast and demonstrate that when scheduling XML data in this context, these assumptions are unnecessary. Then taking the structural similarity between XML documents into account, a novel cluster-based scheduling algorithm for periodic XML data broadcast is also proposed. Finally, we study the performance of our scheduling algorithm through a set of experiments. The results show that our scheduling algorithm can significantly improve access efficiency.
{"title":"Cluster-Based Scheduling Algorithm for Periodic XML Data Broadcast in Wireless Environments","authors":"Yongrui Qin, Hua Wang, Lili Sun","doi":"10.1109/WAINA.2011.60","DOIUrl":"https://doi.org/10.1109/WAINA.2011.60","url":null,"abstract":"In mobile wireless systems, the data on air can be accessed by a large number of mobile clients. The organization of data on wireless channels, which aims to reduce the access time of clients, is a key problem in data broadcast systems. Existing algorithms for periodic data broadcasts generally make assumptions that the clients' queries are already known and/or the distribution of access frequencies of these queries can be obtained in advance. However, the assumptions are not realistic in real life. In this paper, we study the scheduling problem of periodic XML data broadcast and demonstrate that when scheduling XML data in this context, these assumptions are unnecessary. Then taking the structural similarity between XML documents into account, a novel cluster-based scheduling algorithm for periodic XML data broadcast is also proposed. Finally, we study the performance of our scheduling algorithm through a set of experiments. The results show that our scheduling algorithm can significantly improve access efficiency.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"390 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114914371","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 on mobile devices has become increasingly complicated as end users demand a PC-converged user experience on the mobile Internet. This has complicated the software configuration and boot procedures, resulting in a longer boot time. This is damaging to the mobile user experience. Many legacy techniques to enable the fast boot time differentiation in mobile handsets are not applicable to the today's advanced handsets, which are capable of handling rich multimedia applications. The authors propose a fast boot method for embedded mobile Linux, that is suitable for mobile handsets. They evaluate the proposed method in a prototype for a commercial handset and show positive results in a single-digit user sensed boot time.
{"title":"A Fast-Boot Method for Embedded Mobile Linux: Toward a Single-Digit User Sensed Boot Time for Full-Featured Commercial Phones","authors":"Daisuke Fuji, T. Yamakami, K. Ishiguro","doi":"10.1109/WAINA.2011.126","DOIUrl":"https://doi.org/10.1109/WAINA.2011.126","url":null,"abstract":"Software on mobile devices has become increasingly complicated as end users demand a PC-converged user experience on the mobile Internet. This has complicated the software configuration and boot procedures, resulting in a longer boot time. This is damaging to the mobile user experience. Many legacy techniques to enable the fast boot time differentiation in mobile handsets are not applicable to the today's advanced handsets, which are capable of handling rich multimedia applications. The authors propose a fast boot method for embedded mobile Linux, that is suitable for mobile handsets. They evaluate the proposed method in a prototype for a commercial handset and show positive results in a single-digit user sensed boot time.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115355268","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}
There are many wireless sensor network(WSN) applications which require reliable data transfer between the nodes. Several techniques including link level retransmission, error correction methods and hybrid Automatic Repeat re- Quest(ARQ) were introduced into the wireless sensor networks for ensuring reliability. In this paper, we use Automatic resend request(ASQ) technique with regular acknowledgement to design reliable end-to-end communication protocol, called Adaptive Reliable Transport(ARTP) protocol, for WSNs. Besides ensuring reliability, objective of ARTP protocol is to ensure message stream FIFO at the receiver side instead of the byte stream FIFO used in TCP/IP protocol suite. To realize this objective, a new protocol stack has been used in the ARTP protocol. The ARTP protocol saves energy without affecting the throughput by sending three different types of acknowledgements, viz. ACK, NACK and FNACK with semantics different from that existing in the literature currently and adapting to the network conditions. Additionally, the protocol controls flow based on the receiver’s feedback and congestion by holding ACK messages. To the best of our knowledge, there has been little or no attempt to build a receiver controlled regularly acknowledged reliable communication protocol. We have carried out extensive simulation studies of our protocol using Castalia simulator, and the study shows that our protocol performs better than related protocols in wireless/wire line networks, in terms of throughput and energy efficiency.
{"title":"An Adaptive Reliable Transport Protocol Based on Automatic reSend reQuest(ASQ) Technique for Wireless Sensor Networks","authors":"M. Gilesh, R. Hansdah","doi":"10.1109/WAINA.2011.86","DOIUrl":"https://doi.org/10.1109/WAINA.2011.86","url":null,"abstract":"There are many wireless sensor network(WSN) applications which require reliable data transfer between the nodes. Several techniques including link level retransmission, error correction methods and hybrid Automatic Repeat re- Quest(ARQ) were introduced into the wireless sensor networks for ensuring reliability. In this paper, we use Automatic resend request(ASQ) technique with regular acknowledgement to design reliable end-to-end communication protocol, called Adaptive Reliable Transport(ARTP) protocol, for WSNs. Besides ensuring reliability, objective of ARTP protocol is to ensure message stream FIFO at the receiver side instead of the byte stream FIFO used in TCP/IP protocol suite. To realize this objective, a new protocol stack has been used in the ARTP protocol. The ARTP protocol saves energy without affecting the throughput by sending three different types of acknowledgements, viz. ACK, NACK and FNACK with semantics different from that existing in the literature currently and adapting to the network conditions. Additionally, the protocol controls flow based on the receiver’s feedback and congestion by holding ACK messages. To the best of our knowledge, there has been little or no attempt to build a receiver controlled regularly acknowledged reliable communication protocol. We have carried out extensive simulation studies of our protocol using Castalia simulator, and the study shows that our protocol performs better than related protocols in wireless/wire line networks, in terms of throughput and energy efficiency.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"67 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116379478","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}
Query processing using mostly various NoSQL languages becomes a significant application area for Hadoop. Despite significant work on performance improvement of these languages the performance dependence on basic configuration parameters seems not to be fully considered. In this paper we present a relatively comprehensive study into influence the basic configuration parameters have on performance of typical types of queries. We choose three queries from Lehigh University Benchmark that can represent the most typical challenges and we analyze their dependence on parameters such as: dataset size, number of nodes, number of reducers and loading overhead. The results indicate strong dependence on the amount of reducers and IO performance of the cluster, which proves the common opinion that MapReduce is IO bound. These results can help to compare performance behavior of different languages and serve as a basis for understanding the influence of configuration parameters on the final performance.
使用各种NoSQL语言进行查询处理成为Hadoop的一个重要应用领域。尽管在这些语言的性能改进方面做了大量工作，但对基本配置参数的性能依赖似乎没有得到充分考虑。在本文中，我们比较全面地研究了基本配置参数对典型查询类型性能的影响。我们从Lehigh University Benchmark中选择了三个可以代表最典型挑战的查询，并分析了它们与参数的依赖关系，例如:数据集大小、节点数量、reducer数量和负载开销。结果表明，reduce的数量和集群的IO性能有很强的依赖性，这证明了MapReduce是IO绑定的观点。这些结果可以帮助比较不同语言的性能行为，并作为理解配置参数对最终性能影响的基础。
{"title":"Performance Analysis of Hadoop for Query Processing","authors":"T. Wlodarczyk, Yi Han, Chunming Rong","doi":"10.1109/WAINA.2011.130","DOIUrl":"https://doi.org/10.1109/WAINA.2011.130","url":null,"abstract":"Query processing using mostly various NoSQL languages becomes a significant application area for Hadoop. Despite significant work on performance improvement of these languages the performance dependence on basic configuration parameters seems not to be fully considered. In this paper we present a relatively comprehensive study into influence the basic configuration parameters have on performance of typical types of queries. We choose three queries from Lehigh University Benchmark that can represent the most typical challenges and we analyze their dependence on parameters such as: dataset size, number of nodes, number of reducers and loading overhead. The results indicate strong dependence on the amount of reducers and IO performance of the cluster, which proves the common opinion that MapReduce is IO bound. These results can help to compare performance behavior of different languages and serve as a basis for understanding the influence of configuration parameters on the final performance.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122752166","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}
L. Barolli, Hironori Ando, F. Xhafa, A. Durresi, Rozeta Miho, A. Koyama
Cluster formation and cluster head selection are important problems in sensor network applications and can drastically affect the network's communication energy dissipation. However, selecting of the cluster head is not easy in different environments which may have different characteristics. In our previous work, in order to deal with this problem, we proposed a power reduction algorithm for sensor networks based on fuzzy logic and number of neighbour nodes. We call this algorithm F3N. In this paper, we evaluate F3N and LEACH by many simulation results. We evaluate the performance of our proposed system for tree different parameters: Remaining Battery Power of Sensor (RPS), Degree of Number of Neighbour Nodes (D3N), and Distance from Cluster Centroid (DCC). From the simulation results, we found that the probability of a sensor node to be a cluster head is increased with increase of number of neighbour nodes and remained battery power and is decreased with the increase of distance from the cluster centroid.
{"title":"Evaluation of an Intelligent Fuzzy-Based Cluster Head Selection System for WSNs Using Different Parameters","authors":"L. Barolli, Hironori Ando, F. Xhafa, A. Durresi, Rozeta Miho, A. Koyama","doi":"10.1109/WAINA.2011.84","DOIUrl":"https://doi.org/10.1109/WAINA.2011.84","url":null,"abstract":"Cluster formation and cluster head selection are important problems in sensor network applications and can drastically affect the network's communication energy dissipation. However, selecting of the cluster head is not easy in different environments which may have different characteristics. In our previous work, in order to deal with this problem, we proposed a power reduction algorithm for sensor networks based on fuzzy logic and number of neighbour nodes. We call this algorithm F3N. In this paper, we evaluate F3N and LEACH by many simulation results. We evaluate the performance of our proposed system for tree different parameters: Remaining Battery Power of Sensor (RPS), Degree of Number of Neighbour Nodes (D3N), and Distance from Cluster Centroid (DCC). From the simulation results, we found that the probability of a sensor node to be a cluster head is increased with increase of number of neighbour nodes and remained battery power and is decreased with the increase of distance from the cluster centroid.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"65 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122582486","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}
Due to the rapid development of Internet, there are extensive amount of applications that require fast and stable network communication. However, the infrastructure of Internet is limited by TCP/IP protocol. The Future Internet has become a hot network research topic, such as GENI project in U.S. and FIRST project in Korea. Most of these projects adopt OpenFlow framework in their network environment. Because OpenFlow allow researchers to design and develop innovative protocols, it can be applied in different situations for constructing desired network environments. In this paper, we will introduce how to build Future Internet testbed with OpenFlow. We also research and design real-time warning system over this testbed. This system could be applied to earthquake early warning for Taiwan Central Weather Bureau in the future.
{"title":"The Design of Real-Time Warning System in Future Internet Environment","authors":"Wun-Yuan Huang, Jen-Wei Hu, Te-Lung Liu","doi":"10.1109/WAINA.2011.11","DOIUrl":"https://doi.org/10.1109/WAINA.2011.11","url":null,"abstract":"Due to the rapid development of Internet, there are extensive amount of applications that require fast and stable network communication. However, the infrastructure of Internet is limited by TCP/IP protocol. The Future Internet has become a hot network research topic, such as GENI project in U.S. and FIRST project in Korea. Most of these projects adopt OpenFlow framework in their network environment. Because OpenFlow allow researchers to design and develop innovative protocols, it can be applied in different situations for constructing desired network environments. In this paper, we will introduce how to build Future Internet testbed with OpenFlow. We also research and design real-time warning system over this testbed. This system could be applied to earthquake early warning for Taiwan Central Weather Bureau in the future.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123443133","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}
No matter how robust the employed security mechanisms are malicious users or attackers will always find a way to bypass them. In addition, National Institute of Security and Technology mentions "In conjunction with appropriate tools & procedures, audit trail can assist in detecting security violation and flaws in applications". Until now, in Multimedia Communication Services (MCS), such as Voice over IP, audit trails are not utilized in security audits due to (a) the lack of the appropriate analysis tools and (b) privacy restrictions. In this paper we report on the analysis of MCS audit trail by employing a novel method for identifying "uncommon" traffic indicating non normal behaviour that does not violate users’ privacy. We rely on entropy theory and the notion of "itself information" to quantify the randomness of specific message segments, and we also introduce the term "actual itself information" for the assessment of entire message randomness. To protect users’ privacy we hash audit trail’s data. For evaluating the applicability of our proposed method we utilize an audit trail of a real MCS provider published by honey pot project. Initial outcomes show the feasibility of employing such a method to recognize "uncommon" traffic, recorded in MCS audit trail.
{"title":"Towards a Forensic Analysis for Multimedia Communication Services","authors":"D. Geneiatakis, A. Keromytis","doi":"10.1109/WAINA.2011.14","DOIUrl":"https://doi.org/10.1109/WAINA.2011.14","url":null,"abstract":"No matter how robust the employed security mechanisms are malicious users or attackers will always find a way to bypass them. In addition, National Institute of Security and Technology mentions \"In conjunction with appropriate tools & procedures, audit trail can assist in detecting security violation and flaws in applications\". Until now, in Multimedia Communication Services (MCS), such as Voice over IP, audit trails are not utilized in security audits due to (a) the lack of the appropriate analysis tools and (b) privacy restrictions. In this paper we report on the analysis of MCS audit trail by employing a novel method for identifying \"uncommon\" traffic indicating non normal behaviour that does not violate users’ privacy. We rely on entropy theory and the notion of \"itself information\" to quantify the randomness of specific message segments, and we also introduce the term \"actual itself information\" for the assessment of entire message randomness. To protect users’ privacy we hash audit trail’s data. For evaluating the applicability of our proposed method we utilize an audit trail of a real MCS provider published by honey pot project. Initial outcomes show the feasibility of employing such a method to recognize \"uncommon\" traffic, recorded in MCS audit trail.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116258460","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 introduces the construction of systematic irregular RA codes. The encoding line is used to describe the graph structure of IRA codes. Two interleaving strategies for IRA codes are analyzed and it is shown that the two interleaving strategies are equal. The rateless character of IRA codes is also shown. The performances of IRA codes with different rate in binary erasure channel are simulated. Simulation results show that the IRA codes is capacity achieving. The error floor performance of IRA codes is analyzed and the modified encoding method is presented to lower the error floor.
{"title":"On the Rateless Character of Irregular RA Codes","authors":"Rong Sun, Jingwei Liu, Pingli Zhang, B. Bai","doi":"10.1109/WAINA.2011.49","DOIUrl":"https://doi.org/10.1109/WAINA.2011.49","url":null,"abstract":"This paper introduces the construction of systematic irregular RA codes. The encoding line is used to describe the graph structure of IRA codes. Two interleaving strategies for IRA codes are analyzed and it is shown that the two interleaving strategies are equal. The rateless character of IRA codes is also shown. The performances of IRA codes with different rate in binary erasure channel are simulated. Simulation results show that the IRA codes is capacity achieving. The error floor performance of IRA codes is analyzed and the modified encoding method is presented to lower the error floor.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121588039","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
扫码关注我们
求助内容：
应助结果提醒方式：