Distributed compression of correlated sources has been discussed much in wireless sensor networks, while the error-resilient implementation of this efficient coding strategy is one of the crucial issues for applications. In this paper, a symmetric Distributed Joint Source-Channel Coding (DJSCC) scheme is proposed by using Raptor codes for the independent channels case. The channel noise and the correlation of sources are considered simultaneously within one set of encoder and decoder. The symmetric structure of the proposed approach leads to more flexible and balanced rate allocation, and the rateless property of Raptor codes also guarantees tractable code rates and error correction. At last, the simulation results demonstrate that our scheme outperforms the existing LDPC-based scheme at low SNR.
{"title":"Symmetric Distributed Joint Source-Channel Coding Using Raptor Codes","authors":"Xuqi Zhu, Wenbo Zhang, Bin Li, Lin Zhang","doi":"10.1109/NAS.2010.17","DOIUrl":"https://doi.org/10.1109/NAS.2010.17","url":null,"abstract":"Distributed compression of correlated sources has been discussed much in wireless sensor networks, while the error-resilient implementation of this efficient coding strategy is one of the crucial issues for applications. In this paper, a symmetric Distributed Joint Source-Channel Coding (DJSCC) scheme is proposed by using Raptor codes for the independent channels case. The channel noise and the correlation of sources are considered simultaneously within one set of encoder and decoder. The symmetric structure of the proposed approach leads to more flexible and balanced rate allocation, and the rateless property of Raptor codes also guarantees tractable code rates and error correction. At last, the simulation results demonstrate that our scheme outperforms the existing LDPC-based scheme at low SNR.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123844441","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}
José Miguel Montañana, M. Koibuchi, Hiroki Matsutani, H. Amano
Power saving is required for interconnects of modern PC clusters as well as the performance improvement. To reduce the power consumption of switches with maintaining the performance, on/off link regulations that activate and deactivate the links based on the traffic load have been widely developed in interconnection networks. Depending on which operation is selected, link activation or deactivation, the available network resources are changed, thus requiring paths to be reconfigured. To maintain deadlock freedom of packet transfers, connectivity, and performance during the path changes, we propose to apply dynamic reconfiguration techniques that process packet transfer uninterruptedly to power-aware on/off interconnection networks. The dynamic network reconfiguration techniques stabilize the update of paths that are quite crucial to use power-aware on/off link techniques in interconnects of PC clusters. We investigate the performance and behavior of network reconfiguration technique as soon as the link activation or deactivation occurs. Evaluation results show that the simple dynamic reconfiguration techniques slightly reduce the peak packet latency and reconfiguration time of the change compared with existing static reconfiguration in on/off interconnection networks. A reconfiguration technique called Double Scheme reduces by up to 95% the peak packet latency caused by the on/off link operation.
{"title":"Stabilizing Path Modification of Power-Aware On/Off Interconnection Networks","authors":"José Miguel Montañana, M. Koibuchi, Hiroki Matsutani, H. Amano","doi":"10.1109/NAS.2010.13","DOIUrl":"https://doi.org/10.1109/NAS.2010.13","url":null,"abstract":"Power saving is required for interconnects of modern PC clusters as well as the performance improvement. To reduce the power consumption of switches with maintaining the performance, on/off link regulations that activate and deactivate the links based on the traffic load have been widely developed in interconnection networks. Depending on which operation is selected, link activation or deactivation, the available network resources are changed, thus requiring paths to be reconfigured. To maintain deadlock freedom of packet transfers, connectivity, and performance during the path changes, we propose to apply dynamic reconfiguration techniques that process packet transfer uninterruptedly to power-aware on/off interconnection networks. The dynamic network reconfiguration techniques stabilize the update of paths that are quite crucial to use power-aware on/off link techniques in interconnects of PC clusters. We investigate the performance and behavior of network reconfiguration technique as soon as the link activation or deactivation occurs. Evaluation results show that the simple dynamic reconfiguration techniques slightly reduce the peak packet latency and reconfiguration time of the change compared with existing static reconfiguration in on/off interconnection networks. A reconfiguration technique called Double Scheme reduces by up to 95% the peak packet latency caused by the on/off link operation.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114717102","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}
Innovation is a new way of doing something. It may be incremental, radical, or revolutionary changes in thinking, products, processes, or organizations. Different from invention, which is an idea made manifest, innovation is ideas applied successfully. In this work, we strive to apply innovative Radio Frequency Identification (RFID) systems to special education school campus because in this modern age of science and technology, there still exists a wide digital gap in special education schools such that they have not yet benefited from technology advancements such as RFID. Supported by the ministry of education in Taiwan, we successfully designed and deployed RFID technology to the campus of a special education school at Chiayi in Taiwan. Though the technology was applied to eight different use case scenarios, we will focus on five of the more innovative ones in this work, including student temperature monitoring (STM), body weight monitoring (BWM), garbage disposal monitoring (GDM), mopping course recording (MCR), and campus visitor monitoring (CVM). Both active and passive tags and readers were employed to implement these five systems within the same campus. The benefits obtained from these systems by the students, teachers, and administrators were three-folds. First, student health monitoring through STM and BWM systems allowed the teachers and administration real-time control over changing health conditions that significantly affects such students. Second, course monitoring and recording through GDM and MCR allowed teachers to easily grasp and tune the learning curve of each student and also to implement a more guided training based on past learning efforts. Last but not least, campus safety monitoring through CVM allowed the administration to monitor the location of visitors in the campus and thus safeguard the students and teachers from dangerous or troublesome visitors. Novel techniques and creative methods were employed in the five systems, including temperature correction algorithm in STM, BMI-based weight tuning strategy in BWM, multiple route-tracking in GDM, learning improvement through history analysis in MCR, and face detection in CVM. The project was successfully deployed and is currently in use by the Chiayi School of Special Education which has more than 300 students and 150 administration staff and faculty.
{"title":"Innovative Application of RFID Systems to Special Education Schools","authors":"Shu-Hui Yang, Pao-Ann Hsiung","doi":"10.1109/NAS.2010.33","DOIUrl":"https://doi.org/10.1109/NAS.2010.33","url":null,"abstract":"Innovation is a new way of doing something. It may be incremental, radical, or revolutionary changes in thinking, products, processes, or organizations. Different from invention, which is an idea made manifest, innovation is ideas applied successfully. In this work, we strive to apply innovative Radio Frequency Identification (RFID) systems to special education school campus because in this modern age of science and technology, there still exists a wide digital gap in special education schools such that they have not yet benefited from technology advancements such as RFID. Supported by the ministry of education in Taiwan, we successfully designed and deployed RFID technology to the campus of a special education school at Chiayi in Taiwan. Though the technology was applied to eight different use case scenarios, we will focus on five of the more innovative ones in this work, including student temperature monitoring (STM), body weight monitoring (BWM), garbage disposal monitoring (GDM), mopping course recording (MCR), and campus visitor monitoring (CVM). Both active and passive tags and readers were employed to implement these five systems within the same campus. The benefits obtained from these systems by the students, teachers, and administrators were three-folds. First, student health monitoring through STM and BWM systems allowed the teachers and administration real-time control over changing health conditions that significantly affects such students. Second, course monitoring and recording through GDM and MCR allowed teachers to easily grasp and tune the learning curve of each student and also to implement a more guided training based on past learning efforts. Last but not least, campus safety monitoring through CVM allowed the administration to monitor the location of visitors in the campus and thus safeguard the students and teachers from dangerous or troublesome visitors. Novel techniques and creative methods were employed in the five systems, including temperature correction algorithm in STM, BMI-based weight tuning strategy in BWM, multiple route-tracking in GDM, learning improvement through history analysis in MCR, and face detection in CVM. The project was successfully deployed and is currently in use by the Chiayi School of Special Education which has more than 300 students and 150 administration staff and faculty.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"967 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123075008","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}
We propose a new authentication method based on identifying the ownership and location of the mobile devices. It can be assumed that the majority of the authenticating users will have a cellular device, a personal data assistant (PDA), or a smart phone device and, therefore, such devices are prime candidates to be used as another form of secondary authentication device. The proposed system uses the identifier pair (BSSID and SSID) and the corresponding signal strength in a wireless environment as a relative location marker for the mobile device. The marked locations are update to a centralized server database. This information can then be used as a secondary means of authentication by associating the authenticating user with the location of the authentication device
{"title":"Secondary User Authentication Based on Mobile Devices Location","authors":"Min-Hsao Chen, Chung-Han Chen","doi":"10.1109/NAS.2010.56","DOIUrl":"https://doi.org/10.1109/NAS.2010.56","url":null,"abstract":"We propose a new authentication method based on identifying the ownership and location of the mobile devices. It can be assumed that the majority of the authenticating users will have a cellular device, a personal data assistant (PDA), or a smart phone device and, therefore, such devices are prime candidates to be used as another form of secondary authentication device. The proposed system uses the identifier pair (BSSID and SSID) and the corresponding signal strength in a wireless environment as a relative location marker for the mobile device. The marked locations are update to a centralized server database. This information can then be used as a secondary means of authentication by associating the authenticating user with the location of the authentication device","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121165880","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 novel architecture used in the Ad Hoc networks is designed for building a well communication network quickly and reliably without any support of base installation. The system including hardware and software, called NASA, is also designed for high data rate transmission. The system architecture of NASA takes collaborative design of hardware and software. Therefore, it is completely open and doesn’t base on any operating system. NASA is designed for distributed networks and every NASA node could communicate with each other coequally. The paper discusses how to build the hardware platform of NASA, the cross layer implementation of the MAC and routing protocol. It has been proved that the proposed system is quite efficient and has low data transmission delay. In our experiments, the highest data transfer rate of NASA can be up to 1Mbps with 120 meters.
{"title":"NASA: A Novel System Architecture for Ad Hoc Networks","authors":"G. Xue, Yunxia Feng, Zhigang Gao, Guojun Dai","doi":"10.1109/NAS.2010.54","DOIUrl":"https://doi.org/10.1109/NAS.2010.54","url":null,"abstract":"A novel architecture used in the Ad Hoc networks is designed for building a well communication network quickly and reliably without any support of base installation. The system including hardware and software, called NASA, is also designed for high data rate transmission. The system architecture of NASA takes collaborative design of hardware and software. Therefore, it is completely open and doesn’t base on any operating system. NASA is designed for distributed networks and every NASA node could communicate with each other coequally. The paper discusses how to build the hardware platform of NASA, the cross layer implementation of the MAC and routing protocol. It has been proved that the proposed system is quite efficient and has low data transmission delay. In our experiments, the highest data transfer rate of NASA can be up to 1Mbps with 120 meters.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127220233","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nowadays, dependability is of paramount importance in modern distributed storage systems. A challenging issue to deploy a storage system with certain dependability requirements or improve existing systems' dependability is how to comprehensively and efficiently characterize the dependability of those systems. In this paper, we present a two-layer Hidden Markov Model (HMM) to characterize the dependability of a distributed storage system, focusing on the layer of parallel file system. By training the model with observable measurements under faulty scenarios, such as I/O performance, we quantify the system dependability via a tuple of state transition probability, service degradation, and fault latency under those scenarios. Our experimental results on a distributed storage system with PVFS (Parallel Virtual File System) demonstrate the effectiveness of our HMM-based approach, which efficiently captures the behavior patterns of the target system under disk faults and memory overusage.
{"title":"Characterizing the Dependability of Distributed Storage Systems Using a Two-Layer Hidden Markov Model-Based Approach","authors":"Xin Chen, James Warren, Fang Han, Xubin He","doi":"10.1109/NAS.2010.28","DOIUrl":"https://doi.org/10.1109/NAS.2010.28","url":null,"abstract":"Nowadays, dependability is of paramount importance in modern distributed storage systems. A challenging issue to deploy a storage system with certain dependability requirements or improve existing systems' dependability is how to comprehensively and efficiently characterize the dependability of those systems. In this paper, we present a two-layer Hidden Markov Model (HMM) to characterize the dependability of a distributed storage system, focusing on the layer of parallel file system. By training the model with observable measurements under faulty scenarios, such as I/O performance, we quantify the system dependability via a tuple of state transition probability, service degradation, and fault latency under those scenarios. Our experimental results on a distributed storage system with PVFS (Parallel Virtual File System) demonstrate the effectiveness of our HMM-based approach, which efficiently captures the behavior patterns of the target system under disk faults and memory overusage.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134369991","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}
T. Jungeblut, Gregor Sievers, Mario Porrmann, U. Rückert
In this work we present a design space exploration of the memory subsystem of our configurable CoreVA VLIW architecture. The development of resource efficient processor architectures is based on a two-stage tool flow using a high-level processor specification as a reference. We evaluate several memory configurations like one memory port or two memory ports, as well as different write-miss-allocation modes. Applications ranging from LTE protocol stack over baseband processing up to cryptography and multimedia are evaluated in terms of execution time and energy efficiency. Analyses have shown that the application specific configuration of the memory subsystem can improve energy by up to 25%. Our environment allows the rapid profiling and evaluation of algorithms to choose the most efficient configuration.
{"title":"Design Space Exploration for Memory Subsystems of VLIW Architectures","authors":"T. Jungeblut, Gregor Sievers, Mario Porrmann, U. Rückert","doi":"10.1109/NAS.2010.14","DOIUrl":"https://doi.org/10.1109/NAS.2010.14","url":null,"abstract":"In this work we present a design space exploration of the memory subsystem of our configurable CoreVA VLIW architecture. The development of resource efficient processor architectures is based on a two-stage tool flow using a high-level processor specification as a reference. We evaluate several memory configurations like one memory port or two memory ports, as well as different write-miss-allocation modes. Applications ranging from LTE protocol stack over baseband processing up to cryptography and multimedia are evaluated in terms of execution time and energy efficiency. Analyses have shown that the application specific configuration of the memory subsystem can improve energy by up to 25%. Our environment allows the rapid profiling and evaluation of algorithms to choose the most efficient configuration.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128471117","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}
Most data aggregation and dissemination approaches for VANETs attempt to create and utilize a structure for collecting information. The structures vary and could be categorized as either node-centric, as in a tree, mesh, or a cluster, or road-centric as in highway segmentation. In this paper we present a structureless information dissemination scheme that creates a layered view of road conditions with a diminishing resolution as the geocast distance increases. Our scheme first provides a high-detail local view of a given vehicle's neighbors and their immediate neighbors, which is further extended when information dissemination is employed. The scheme also allows for the preservation of unique reports within aggregated frames, such that safety-critical notifications are kept in high detail, all for the benefit of the driver's improved decision making during emergency scenarios. Here we report that our scheme provides the driver with a high detail view of road conditions sufficiently far ahead, as well as with aggregated information for the length of the whole geocast distance, all while preserving safety critical reports.
{"title":"Geocast-Driven Structureless Information Dissemination Scheme for Vehicular Ad Hoc Networks","authors":"Filip Cuckov, Min Song","doi":"10.1109/NAS.2010.51","DOIUrl":"https://doi.org/10.1109/NAS.2010.51","url":null,"abstract":"Most data aggregation and dissemination approaches for VANETs attempt to create and utilize a structure for collecting information. The structures vary and could be categorized as either node-centric, as in a tree, mesh, or a cluster, or road-centric as in highway segmentation. In this paper we present a structureless information dissemination scheme that creates a layered view of road conditions with a diminishing resolution as the geocast distance increases. Our scheme first provides a high-detail local view of a given vehicle's neighbors and their immediate neighbors, which is further extended when information dissemination is employed. The scheme also allows for the preservation of unique reports within aggregated frames, such that safety-critical notifications are kept in high detail, all for the benefit of the driver's improved decision making during emergency scenarios. Here we report that our scheme provides the driver with a high detail view of road conditions sufficiently far ahead, as well as with aggregated information for the length of the whole geocast distance, all while preserving safety critical reports.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125388513","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}
Chongmin Li, Haixia Wang, Y. Xue, Xi Zhang, Dongsheng Wang
As more processing cores are integrated into one chip and the feature size continues to shrink, the increasing on-chip access latency complicates the design of the on-chip last-level cache for chip multiprocessors. At the same time, the overhead of maintaining on-chip directory cannot be ignored as the number of processing cores increasing. There is an urgent need for scalable organization of on-chip last-level cache. In this work, we propose fast hierarchical cache directory for tiled CMP, which divides CMP tiles into multiple regions hierarchically, and combines it with data replication. Multi-level directory is used to record the share information within a region and assist the regional home node to complete operation efficiently. Fast directory is used to get lower L2 slice access latency at the same time. Most cache requests to last-level cache can be handled within the local level-1 region. Evaluation indicates this architecture is highly scalable. Simulation results show that for a 16-core CMP, hierarchical cache directory reduces average access latency to last-level cache by 46.35% and average on-chip network traffic by 19.25% respectively. The system performance is increased by 20.82% at the same time.
{"title":"Fast Hierarchical Cache Directory: A Scalable Cache Organization for Large-Scale CMP","authors":"Chongmin Li, Haixia Wang, Y. Xue, Xi Zhang, Dongsheng Wang","doi":"10.1109/NAS.2010.25","DOIUrl":"https://doi.org/10.1109/NAS.2010.25","url":null,"abstract":"As more processing cores are integrated into one chip and the feature size continues to shrink, the increasing on-chip access latency complicates the design of the on-chip last-level cache for chip multiprocessors. At the same time, the overhead of maintaining on-chip directory cannot be ignored as the number of processing cores increasing. There is an urgent need for scalable organization of on-chip last-level cache. In this work, we propose fast hierarchical cache directory for tiled CMP, which divides CMP tiles into multiple regions hierarchically, and combines it with data replication. Multi-level directory is used to record the share information within a region and assist the regional home node to complete operation efficiently. Fast directory is used to get lower L2 slice access latency at the same time. Most cache requests to last-level cache can be handled within the local level-1 region. Evaluation indicates this architecture is highly scalable. Simulation results show that for a 16-core CMP, hierarchical cache directory reduces average access latency to last-level cache by 46.35% and average on-chip network traffic by 19.25% respectively. The system performance is increased by 20.82% at the same time.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121470570","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 a Binomial Probability Redundancy Model (BPRM). This model is based on the Forward Error Correction (FEC) Reed-Solomon Coding Technique and the Interweaving Packet Loss Recovery Technique. It calculates the number of redundant packets according to the feedback from the receiver and dynamically generates these superfluous packets. Different from the Linear Probability Redundancy Model (LPRM) proposed by McKinley et al., we adopt the interweaving technique to transmit these redundant packets. We also present a bandwidth control strategy to improve quality of video data. The experimental result shows that BPRM is able to generate enough redundant packets even under congestive network condition. These packets ensure the receiver to restore the original data and achieve a better video quality compared with LPRM.
{"title":"Binomial Probability Redundancy Strategy for Multimedia Transmission","authors":"Lizhuo Zhang, W. Jia, Shifei Zhou","doi":"10.1109/NAS.2010.45","DOIUrl":"https://doi.org/10.1109/NAS.2010.45","url":null,"abstract":"This paper proposes a Binomial Probability Redundancy Model (BPRM). This model is based on the Forward Error Correction (FEC) Reed-Solomon Coding Technique and the Interweaving Packet Loss Recovery Technique. It calculates the number of redundant packets according to the feedback from the receiver and dynamically generates these superfluous packets. Different from the Linear Probability Redundancy Model (LPRM) proposed by McKinley et al., we adopt the interweaving technique to transmit these redundant packets. We also present a bandwidth control strategy to improve quality of video data. The experimental result shows that BPRM is able to generate enough redundant packets even under congestive network condition. These packets ensure the receiver to restore the original data and achieve a better video quality compared with LPRM.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114827978","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
扫码关注我们
求助内容：
应助结果提醒方式：