Pub Date : 2010-12-01DOI: 10.4108/CHINACOM.2010.120
Jiann-Liang Chen, Yi-Wei Ma, Yueh-Min Huang, Qing-Tai Yang
This study develops a novel IEEE 802.21 MIH (Media Independent Handover) mechanism for next generation vehicular multimedia network. An adaptive QoS management mechanism is also proposed. By obtaining received signal strength parameters, the proposed MIH framework can determine the best available network. The adaptive QoS mechanism substantially improves the performance of real-time multimedia applications. The simulation results show that average handover time is slower than both UMTS and WiMAX when the MIH mechanism is used in vehicular network. However, the simulation results confirm that using the IEEE 802.21 MIH mechanism can increase overall throughput. Increased throughput is satisfactory compensation for increased handover time.
{"title":"An Adaptive QoS mechanism for multimedia applications over next generation vehicular network","authors":"Jiann-Liang Chen, Yi-Wei Ma, Yueh-Min Huang, Qing-Tai Yang","doi":"10.4108/CHINACOM.2010.120","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.120","url":null,"abstract":"This study develops a novel IEEE 802.21 MIH (Media Independent Handover) mechanism for next generation vehicular multimedia network. An adaptive QoS management mechanism is also proposed. By obtaining received signal strength parameters, the proposed MIH framework can determine the best available network. The adaptive QoS mechanism substantially improves the performance of real-time multimedia applications. The simulation results show that average handover time is slower than both UMTS and WiMAX when the MIH mechanism is used in vehicular network. However, the simulation results confirm that using the IEEE 802.21 MIH mechanism can increase overall throughput. Increased throughput is satisfactory compensation for increased handover time.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115284061","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 vehicular networks, safety and comfort applications are two quite different kinds of applications to avoid the emergency traffic accident and enjoy the non-emergency entertainment. The comfort application drives the challenges of new non-emergency entertainments for vehicular ad-hoc networks (VANETs). The comfort application usually keeps the delay-tolerant capability; that is, messages initiated from a specific vehicle at time t can be delivered through VANETs to some vehicles within a given constrained delay time λ. In this paper, we investigate a new mobicast protocol to support comfort applications for a highway scenario in vehicular ad-hoc networks (VANETs). All vehicles located in a geographic zone (denoted as zone of relevance, ZOR) at time t, the mobicast routing is to disseminate the data message initiated from a specific vehicle to all vehicles which have ever appeared in ZOR at time t. This data dissemination must be done before time t + λ through the carry-and-forward technique. In addition, the temporary network fragmentation problem is considered in our protocol design. In addition, the low degree of channel utilization is kept to reserve the resource for safety applications. To illustrate the performance achievement, simulation results are examined in terms of message overhead, dissemination successful rate, and accumulative packet delivery delay.
{"title":"A mobicast routing protocol with carry-and-forward in vehicular ad-hoc networks","authors":"Yuh-Shyan Chen, Yun-Wei Lin","doi":"10.1002/dac.2404","DOIUrl":"https://doi.org/10.1002/dac.2404","url":null,"abstract":"In vehicular networks, safety and comfort applications are two quite different kinds of applications to avoid the emergency traffic accident and enjoy the non-emergency entertainment. The comfort application drives the challenges of new non-emergency entertainments for vehicular ad-hoc networks (VANETs). The comfort application usually keeps the delay-tolerant capability; that is, messages initiated from a specific vehicle at time t can be delivered through VANETs to some vehicles within a given constrained delay time λ. In this paper, we investigate a new mobicast protocol to support comfort applications for a highway scenario in vehicular ad-hoc networks (VANETs). All vehicles located in a geographic zone (denoted as zone of relevance, ZOR) at time t, the mobicast routing is to disseminate the data message initiated from a specific vehicle to all vehicles which have ever appeared in ZOR at time t. This data dissemination must be done before time t + λ through the carry-and-forward technique. In addition, the temporary network fragmentation problem is considered in our protocol design. In addition, the low degree of channel utilization is kept to reserve the resource for safety applications. To illustrate the performance achievement, simulation results are examined in terms of message overhead, dissemination successful rate, and accumulative packet delivery delay.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128090396","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}
Pub Date : 2010-12-01DOI: 10.4108/CHINACOM.2010.119
O. Dobre, R. Inkol, S. Rajan
This paper provides a brief overview of selected achievements by our group concerning cyclostationarity-based joint signal detection, classification, and blind parameter estimation. These developments have important applications in signal intelligence, spectrum surveillance and management, and are highly relevant to spectrum sensing and awareness in cognitive radio.
{"title":"Application of cyclostationarity to joint signal detection, classification, and blind parameter estimation","authors":"O. Dobre, R. Inkol, S. Rajan","doi":"10.4108/CHINACOM.2010.119","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.119","url":null,"abstract":"This paper provides a brief overview of selected achievements by our group concerning cyclostationarity-based joint signal detection, classification, and blind parameter estimation. These developments have important applications in signal intelligence, spectrum surveillance and management, and are highly relevant to spectrum sensing and awareness in cognitive radio.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131270883","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}
Pub Date : 2010-12-01DOI: 10.4108/CHINACOM.2010.52
Rung-Shiang Cheng, M. Shih, C. Ke, Qili Zhou
To prevent decoding failure of MPEG-based applications caused by error propagation, the present study modifies multi-streaming mechanism of SCTP protocol and proposes a transmission control approach which can adjust transmission policy dynamically according to the quality of service requirement of individual frame. The simulation results confirmed that the proposed scheme can improve the performance of MPEG-based video stream by modified SCTP multi-streaming mechanism.
{"title":"Improving performance of MPEG-based stream by SCTP multi-streaming mechanism","authors":"Rung-Shiang Cheng, M. Shih, C. Ke, Qili Zhou","doi":"10.4108/CHINACOM.2010.52","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.52","url":null,"abstract":"To prevent decoding failure of MPEG-based applications caused by error propagation, the present study modifies multi-streaming mechanism of SCTP protocol and proposes a transmission control approach which can adjust transmission policy dynamically according to the quality of service requirement of individual frame. The simulation results confirmed that the proposed scheme can improve the performance of MPEG-based video stream by modified SCTP multi-streaming mechanism.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120916218","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}
Pub Date : 2010-12-01DOI: 10.4108/CHINACOM.2010.84
Jae Won Yoo, Tie Liu, Yingbin Liang
A product Gaussian broadcast channel with three receivers and degraded message sets is considered. A single-letter characterization of the capacity region was obtained in a recent work of Nair and El Gamal based on superposition coding and indirect decoding. Through Lagrangian theory and an extremal entropy inequality, the single-letter expression of Nair and El Gamal is evaluated for the specific product Gaussian model, which leads to an explicit characterization of the capacity region.
{"title":"The capacity region of a product Gaussian broadcast channel with degraded message sets","authors":"Jae Won Yoo, Tie Liu, Yingbin Liang","doi":"10.4108/CHINACOM.2010.84","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.84","url":null,"abstract":"A product Gaussian broadcast channel with three receivers and degraded message sets is considered. A single-letter characterization of the capacity region was obtained in a recent work of Nair and El Gamal based on superposition coding and indirect decoding. Through Lagrangian theory and an extremal entropy inequality, the single-letter expression of Nair and El Gamal is evaluated for the specific product Gaussian model, which leads to an explicit characterization of the capacity region.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133578932","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}
Pub Date : 2010-08-28DOI: 10.4108/CHINACOM.2010.74
Linyu Wang, E. V. Van Lil, Geert Deconinck
The original Fischer-Huber loading algorithm attempts to minimize the probability of bit error by maximizing the signal to noise ratio. Bits are allocated to achieve the same error probability in each of the used subcarriers. However, in channels with a high difference in attenuation like access Power Line Communications (PLC) channels, this could result in overallocation for parts of the subcarriers, which is unreasonable in practice but is neglected during the bit allocation in the algorithm. Furthermore, after defining the upper boundary of constellation, the bit allocation is changed and then the method of flat power allocation generates a bad error probability. In this paper, we present an improved Fischer-Huber loading algorithm for access PLC channels with high attenuation variability. By adding constellation limitations and adjusting the power allocation policy, the improved algorithm appears more flexible. Simulation results show the improved performance.
{"title":"An improved Fischer-Huber loading algorithm for reliable applications on access power line communications","authors":"Linyu Wang, E. V. Van Lil, Geert Deconinck","doi":"10.4108/CHINACOM.2010.74","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.74","url":null,"abstract":"The original Fischer-Huber loading algorithm attempts to minimize the probability of bit error by maximizing the signal to noise ratio. Bits are allocated to achieve the same error probability in each of the used subcarriers. However, in channels with a high difference in attenuation like access Power Line Communications (PLC) channels, this could result in overallocation for parts of the subcarriers, which is unreasonable in practice but is neglected during the bit allocation in the algorithm. Furthermore, after defining the upper boundary of constellation, the bit allocation is changed and then the method of flat power allocation generates a bad error probability. In this paper, we present an improved Fischer-Huber loading algorithm for access PLC channels with high attenuation variability. By adding constellation limitations and adjusting the power allocation policy, the improved algorithm appears more flexible. Simulation results show the improved performance.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123863495","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}
Pub Date : 2010-08-01DOI: 10.4108/CHINACOM.2010.38
Rong Chai, Lun Tang, Min Xiao, Qianbin Chen
In next generation network, various heterogeneous wireless access networks are expected to integrate to support user's seamless connection. In this system, efficient and reliable network selection schemes are required for users to choose a suitable network among all the available networks. In this paper, an adaptive network selection algorithm based on user profile and application profile is proposed for a cellular and WLAN integrated heterogeneous scenario. In the novel algorithm, user profile information, including user mobility, the power of user terminal, the service cost preference, etc., and the characteristics of user applications are taken into account in designing the cost function factors and the corresponding weights of the network selection algorithm. Comparing to traditional fixed-form cost function based network selection algorithms, the proposed algorithm offers better QoS guarantee and user satisfactory.
{"title":"Adaptive network selection algorithm based on user application profile","authors":"Rong Chai, Lun Tang, Min Xiao, Qianbin Chen","doi":"10.4108/CHINACOM.2010.38","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.38","url":null,"abstract":"In next generation network, various heterogeneous wireless access networks are expected to integrate to support user's seamless connection. In this system, efficient and reliable network selection schemes are required for users to choose a suitable network among all the available networks. In this paper, an adaptive network selection algorithm based on user profile and application profile is proposed for a cellular and WLAN integrated heterogeneous scenario. In the novel algorithm, user profile information, including user mobility, the power of user terminal, the service cost preference, etc., and the characteristics of user applications are taken into account in designing the cost function factors and the corresponding weights of the network selection algorithm. Comparing to traditional fixed-form cost function based network selection algorithms, the proposed algorithm offers better QoS guarantee and user satisfactory.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116780666","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}
As heterogeneous wireless networks are deployed and users need more flexible mobility services, there has been a lot of research work about interworking mechanism between widely deployed 3G network and rapidly boarded WLAN (wireless local area network). On the other side, TD-SCDMA (time division-synchronous code division multiple access), which combines all the advantage of the TDD (time-division deplex) with CDMA (code-division multiple access), is one of the three main standards of third-generation mobile radio system, and is newly commer-cialized in China. It is expected to provide enough mobility and higher data rate. So the study of the integration between WLAN and TD-SCDMA will be attractive. In this paper, we propose an efficient joint session admission control scheme that maximize overall network revenue with Qos (quality of service) constraints over both the WLAN and the TD-SCDMA cellular networks. Simulation results illustrate that the overall network revenue earned in the proposed scheme is significant larger than that when the individual networks are optimized independently.
{"title":"Joint session admission control scheme in integrated WLAN and 3G networks","authors":"Xijin Li, Hong Ji, Pengbo Si, Lin Zhang","doi":"10.4108/CHINACOM.2010.5","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.5","url":null,"abstract":"As heterogeneous wireless networks are deployed and users need more flexible mobility services, there has been a lot of research work about interworking mechanism between widely deployed 3G network and rapidly boarded WLAN (wireless local area network). On the other side, TD-SCDMA (time division-synchronous code division multiple access), which combines all the advantage of the TDD (time-division deplex) with CDMA (code-division multiple access), is one of the three main standards of third-generation mobile radio system, and is newly commer-cialized in China. It is expected to provide enough mobility and higher data rate. So the study of the integration between WLAN and TD-SCDMA will be attractive. In this paper, we propose an efficient joint session admission control scheme that maximize overall network revenue with Qos (quality of service) constraints over both the WLAN and the TD-SCDMA cellular networks. Simulation results illustrate that the overall network revenue earned in the proposed scheme is significant larger than that when the individual networks are optimized independently.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116904308","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}
Pub Date : 2010-08-01DOI: 10.4108/CHINACOM.2010.55
Yong Zhang, Yong Wang, Ping Zhang, Kai Sun
Robustness enhancement scheme in Serial RapidIO (SRIO) interconnect is proposed to overcome the performance degradation caused by noise and Electromagnetic Interference (EMI). The main idea of this scheme is the adaptive speed transition and mode conversion. Adaptive speed transition can improve average throughput and reduce delay in high Bit Error Rate (BER) environment. Mode conversion is to conquer frequent usage of feedback channel. Simulation shows that the scheme of combining adaptive speed transition with mode conversion leads great performance enhancement in SRIO network.
{"title":"Serial RapidIO robustness enhancement scheme","authors":"Yong Zhang, Yong Wang, Ping Zhang, Kai Sun","doi":"10.4108/CHINACOM.2010.55","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.55","url":null,"abstract":"Robustness enhancement scheme in Serial RapidIO (SRIO) interconnect is proposed to overcome the performance degradation caused by noise and Electromagnetic Interference (EMI). The main idea of this scheme is the adaptive speed transition and mode conversion. Adaptive speed transition can improve average throughput and reduce delay in high Bit Error Rate (BER) environment. Mode conversion is to conquer frequent usage of feedback channel. Simulation shows that the scheme of combining adaptive speed transition with mode conversion leads great performance enhancement in SRIO network.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125081907","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}
Pub Date : 2010-08-01DOI: 10.4108/CHINACOM.2010.81
M. Lentmaier, G. Liva, E. Paolini, G. Fettweis
Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors. In this paper, we show by means of an ensemble weight enumerator analysis that the minimum distance multiplicities of product codes are much higher than those obtainable by other generalized LDPC (GLDPC) constructions employing the same component codes. We then propose a simple construction of quasi-cyclic GLDPC codes which leads to significantly lower error floors while leaving the decoder architecture of product codes almost untouched.
{"title":"From product codes to structured generalized LDPC codes","authors":"M. Lentmaier, G. Liva, E. Paolini, G. Fettweis","doi":"10.4108/CHINACOM.2010.81","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.81","url":null,"abstract":"Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors. In this paper, we show by means of an ensemble weight enumerator analysis that the minimum distance multiplicities of product codes are much higher than those obtainable by other generalized LDPC (GLDPC) constructions employing the same component codes. We then propose a simple construction of quasi-cyclic GLDPC codes which leads to significantly lower error floors while leaving the decoder architecture of product codes almost untouched.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125543036","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
扫码关注我们
求助内容：
应助结果提醒方式：