Pub Date : 2010-12-23DOI: 10.1109/ICTC.2010.5674801
Kangwook Lee, Myungwon Ham, Howon Lee, D. Cho
Energy-efficient Camera Operating Scheme(ECOS) is a technique to save energy which is used for mass surveillance cameras. ECOS determines how many cameras should be turned on with the information of monitored objects and the coverage area of the installed cameras. Also, we address other techniques used to save energy for the surveillance system as well as ECOS. Throughout performance evaluation, we demonstrate the excellence of our proposed scheme compared with other schemes.
{"title":"ECOS: Energy-efficient Camera Operating Scheme for large scale surveillance systems","authors":"Kangwook Lee, Myungwon Ham, Howon Lee, D. Cho","doi":"10.1109/ICTC.2010.5674801","DOIUrl":"https://doi.org/10.1109/ICTC.2010.5674801","url":null,"abstract":"Energy-efficient Camera Operating Scheme(ECOS) is a technique to save energy which is used for mass surveillance cameras. ECOS determines how many cameras should be turned on with the information of monitored objects and the coverage area of the installed cameras. Also, we address other techniques used to save energy for the surveillance system as well as ECOS. Throughout performance evaluation, we demonstrate the excellence of our proposed scheme compared with other schemes.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"463 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123886879","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-23DOI: 10.1109/ICTC.2010.5674675
Chanho Yoon, W. Lee, H. Chung, Joonhyuk Kang
In this paper, we propose a zero-padded (ZP) packet transmission scheme for forward link packet data channel (F-PDCH) of cdma2000 1x EV-DV. The system utilizes the quasi complementary Turbo codes (QCTC) to adjust its packet format to be modulated in ZP single-carrier frequency domain equalizer (FDE) symbol units while the subpacket structure of forward link packet data channel is preserved. Thus, by allowing a slight modification to the standard, backward compatibility is maintained to the existing 1x EV-DV system. We report that the link-level performance of our system is significantly better than previous equalizer-based systems in frequency selective fading channels.
{"title":"Packet transmission utilizing single-carrier FDE technique in a modified CDMA2000 based cellular system","authors":"Chanho Yoon, W. Lee, H. Chung, Joonhyuk Kang","doi":"10.1109/ICTC.2010.5674675","DOIUrl":"https://doi.org/10.1109/ICTC.2010.5674675","url":null,"abstract":"In this paper, we propose a zero-padded (ZP) packet transmission scheme for forward link packet data channel (F-PDCH) of cdma2000 1x EV-DV. The system utilizes the quasi complementary Turbo codes (QCTC) to adjust its packet format to be modulated in ZP single-carrier frequency domain equalizer (FDE) symbol units while the subpacket structure of forward link packet data channel is preserved. Thus, by allowing a slight modification to the standard, backward compatibility is maintained to the existing 1x EV-DV system. We report that the link-level performance of our system is significantly better than previous equalizer-based systems in frequency selective fading channels.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124802592","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-23DOI: 10.1109/ICTC.2010.5674266
Perumal Ramesh Babu, Young-Jo Bang, Youn-Ok Park
When the ABS supports mixed mode that is it supports both 16e MSs and 16m AMSs, if we have a Software Defined Radio which supports both 16e and 16m modes, then we can take advantage of the extra preamble available from the other mode to do either fast or robust coarse timing synchronization. For 16e mode, if the signal is weak and cannot synchronize on 16e preamble, the MS can first synchronize on 16m PA-Preamble and then offset back by a known integer number of 16e symbols to reach 16e preamble location. Usually for a given performance or bit error rate, the 16m PA-Preamble can work at 5dB SNR lower than the 16e preamble. Similarly when working in 16m mode, if the AMS wants to do fast synchronization and the signal quality is good, it can synchronize on 16e preamble first (which is available every frame as compared to 16m PA-Preamble which is only available every super frame) and then offset forward to 16m A-Preamble (PA-Preamble or SA-Preamble). This way we can make choices based on SNR level and time required to synchronize.
{"title":"Fast and robust timing synchronization for IEEE 802.16 MSs in mixed mode (16e, 16m)","authors":"Perumal Ramesh Babu, Young-Jo Bang, Youn-Ok Park","doi":"10.1109/ICTC.2010.5674266","DOIUrl":"https://doi.org/10.1109/ICTC.2010.5674266","url":null,"abstract":"When the ABS supports mixed mode that is it supports both 16e MSs and 16m AMSs, if we have a Software Defined Radio which supports both 16e and 16m modes, then we can take advantage of the extra preamble available from the other mode to do either fast or robust coarse timing synchronization. For 16e mode, if the signal is weak and cannot synchronize on 16e preamble, the MS can first synchronize on 16m PA-Preamble and then offset back by a known integer number of 16e symbols to reach 16e preamble location. Usually for a given performance or bit error rate, the 16m PA-Preamble can work at 5dB SNR lower than the 16e preamble. Similarly when working in 16m mode, if the AMS wants to do fast synchronization and the signal quality is good, it can synchronize on 16e preamble first (which is available every frame as compared to 16m PA-Preamble which is only available every super frame) and then offset forward to 16m A-Preamble (PA-Preamble or SA-Preamble). This way we can make choices based on SNR level and time required to synchronize.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125022905","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-23DOI: 10.1109/ICTC.2010.5674261
Jun Li, Md. Hashem Ali Khan, Xueqin Jiang, M. Lee
This paper presents a hybrid approach to the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes based on parallel bundles in Euclidean geometries and circulant permutation matrices. Codes constructed by this method are shown to be regular with large girth and low density. Simulation results show that these codes perform very well with iterative decoding and achieve reasonably large coding gains over uncoded system.
{"title":"Hybrid construction of quasi-cyclic low-density parity-check codes with large girth based on euclidean geometries","authors":"Jun Li, Md. Hashem Ali Khan, Xueqin Jiang, M. Lee","doi":"10.1109/ICTC.2010.5674261","DOIUrl":"https://doi.org/10.1109/ICTC.2010.5674261","url":null,"abstract":"This paper presents a hybrid approach to the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes based on parallel bundles in Euclidean geometries and circulant permutation matrices. Codes constructed by this method are shown to be regular with large girth and low density. Simulation results show that these codes perform very well with iterative decoding and achieve reasonably large coding gains over uncoded system.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126003168","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-23DOI: 10.1109/ICTC.2010.5674714
Soonbae Ji, Junghyun Kim, C. You, Sunghyun Cho, Dong-Ho Kim, Y. Lee
The Digital Video Broadcasting second generation Terrestrial (DVB-T2) standard purposes to provide high definition digital video and high rate services for the same spectrum allocation of the current Digital Video Broadcasting Terrestrial (DVB-T) standard. The implementation guideline is provided by the DVB-T2 standardization community, the Digital Video Broadcasting (DVB) Project. The DVB Project is requesting the many submission technologies which could be considered as candidates for a second generation terrestrial transmission system. The most challenging requirements introduced by the DVB-T2 specification are an Fast Fourier Transform (FFT) size of up to 32k samples, 256-Quadrature amplitude modulation (QAM) and Low-Density Parity-Check (LDPC) coding with a block size of 64k bits. The increasing concern in Multiple-Input Multiple-Output (MIMO) systems has given rise to numerous research activities in recent years. In this paper, we propose the MIMO architecture and coded cooperative MIMO transmission scheme for DVB-T2 system. The simulation result of the proposal MIMO architecture in DVB-T2 system shows a definite performance improvement for coded cooperative MIMO system.
{"title":"Cooperative MIMO transmission scheme for the DVB-T2 system","authors":"Soonbae Ji, Junghyun Kim, C. You, Sunghyun Cho, Dong-Ho Kim, Y. Lee","doi":"10.1109/ICTC.2010.5674714","DOIUrl":"https://doi.org/10.1109/ICTC.2010.5674714","url":null,"abstract":"The Digital Video Broadcasting second generation Terrestrial (DVB-T2) standard purposes to provide high definition digital video and high rate services for the same spectrum allocation of the current Digital Video Broadcasting Terrestrial (DVB-T) standard. The implementation guideline is provided by the DVB-T2 standardization community, the Digital Video Broadcasting (DVB) Project. The DVB Project is requesting the many submission technologies which could be considered as candidates for a second generation terrestrial transmission system. The most challenging requirements introduced by the DVB-T2 specification are an Fast Fourier Transform (FFT) size of up to 32k samples, 256-Quadrature amplitude modulation (QAM) and Low-Density Parity-Check (LDPC) coding with a block size of 64k bits. The increasing concern in Multiple-Input Multiple-Output (MIMO) systems has given rise to numerous research activities in recent years. In this paper, we propose the MIMO architecture and coded cooperative MIMO transmission scheme for DVB-T2 system. The simulation result of the proposal MIMO architecture in DVB-T2 system shows a definite performance improvement for coded cooperative MIMO system.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117209854","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-23DOI: 10.1109/ICTC.2010.5674678
Youngyoon Lee, Seungsoo Yoo, Dahae Chong, Seokho Yoon, Sun Yong Kim
A pilot-aided integer frequency offset (IFO) estimation scheme robust to the timing offset is proposed for orthogonal frequency division multiplexing (OFDM)-based digital video broadcasting-terrestrial (DVB-T) systems. The proposed scheme first produces correlation values between each continual pilot (CP) and a predetermined scattered pilot (SP), and then, recorrelates the correlation values in order to reduce the influence of the timing offset. Simulation results show that the proposed IFO estimation scheme is robust to the timing offset and has better estimation performance than the conventional scheme.
{"title":"A pilot-aided integer frequency offset estimation scheme robust to influence of timing offset for OFDM-based DVB-T systems","authors":"Youngyoon Lee, Seungsoo Yoo, Dahae Chong, Seokho Yoon, Sun Yong Kim","doi":"10.1109/ICTC.2010.5674678","DOIUrl":"https://doi.org/10.1109/ICTC.2010.5674678","url":null,"abstract":"A pilot-aided integer frequency offset (IFO) estimation scheme robust to the timing offset is proposed for orthogonal frequency division multiplexing (OFDM)-based digital video broadcasting-terrestrial (DVB-T) systems. The proposed scheme first produces correlation values between each continual pilot (CP) and a predetermined scattered pilot (SP), and then, recorrelates the correlation values in order to reduce the influence of the timing offset. Simulation results show that the proposed IFO estimation scheme is robust to the timing offset and has better estimation performance than the conventional scheme.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121453803","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-23DOI: 10.1109/ICTC.2010.5674663
Hongbin Liang, L. Cai, Hangguan Shan, Xuemin Shen, D. Peng
In this paper, we study adaptive resource allocation for elastic media services in service-oriented network. We form ulate the resource allocation problem as a semi-Markov decision process (SMDP) to capture the dynamics of user arrivals and departures. Based on the network resources, an optimal decision is made to maximize the overall system rewards by striking the balance between the network utilities and costs of network resources. We further analyze the network performance in terms of the service blocking probability, and the probability of different decisions or actions of resource allocation. Extensive simulations demonstrate that our proposed scheme can achieve much higher network utility and lower service blocking probability compared with a greedy resource allocation.
{"title":"Adaptive resource allocation for media services based on semi-Markov decision process","authors":"Hongbin Liang, L. Cai, Hangguan Shan, Xuemin Shen, D. Peng","doi":"10.1109/ICTC.2010.5674663","DOIUrl":"https://doi.org/10.1109/ICTC.2010.5674663","url":null,"abstract":"In this paper, we study adaptive resource allocation for elastic media services in service-oriented network. We form ulate the resource allocation problem as a semi-Markov decision process (SMDP) to capture the dynamics of user arrivals and departures. Based on the network resources, an optimal decision is made to maximize the overall system rewards by striking the balance between the network utilities and costs of network resources. We further analyze the network performance in terms of the service blocking probability, and the probability of different decisions or actions of resource allocation. Extensive simulations demonstrate that our proposed scheme can achieve much higher network utility and lower service blocking probability compared with a greedy resource allocation.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122941588","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-23DOI: 10.1109/ICTC.2010.5674812
I. Park, Y. Kim, J. Cha, Kye-san Lee, Y. Jang, J. Kim
LED-ID (light emitting diode - identification) system typically uses line of sight (LOS) channels to achieve high data rate and bright illumination. In LOS channel, however, the LED-ID system has very narrow coverage. In cellular networks, the relay station has been introduced to improve system throughput and coverage. Accordingly, new optical relay scheme is essential to support multi-hop transmission in relay-assisted LED-ID networks. In this paper, effects of shadow region problem are investigated for LED identification (LED-ID) system in a non-line of sight (NLOS) environment. A scenario on shadow region problem is proposed, and nominal interrogation range of a desired reader is derived from this model. In order to expand the coverage of LED-ID networks, an efficient optical relay scheme is proposed and simulated by employing cooperative communication methodology. It is confirmed that the proposed technique performs well both in terms of throughput and fairness by simulation results. Also, the proposed scheme is very effective to expand coverage of LED-ID communication networks.
{"title":"Scalable optical relay for LED-ID systems","authors":"I. Park, Y. Kim, J. Cha, Kye-san Lee, Y. Jang, J. Kim","doi":"10.1109/ICTC.2010.5674812","DOIUrl":"https://doi.org/10.1109/ICTC.2010.5674812","url":null,"abstract":"LED-ID (light emitting diode - identification) system typically uses line of sight (LOS) channels to achieve high data rate and bright illumination. In LOS channel, however, the LED-ID system has very narrow coverage. In cellular networks, the relay station has been introduced to improve system throughput and coverage. Accordingly, new optical relay scheme is essential to support multi-hop transmission in relay-assisted LED-ID networks. In this paper, effects of shadow region problem are investigated for LED identification (LED-ID) system in a non-line of sight (NLOS) environment. A scenario on shadow region problem is proposed, and nominal interrogation range of a desired reader is derived from this model. In order to expand the coverage of LED-ID networks, an efficient optical relay scheme is proposed and simulated by employing cooperative communication methodology. It is confirmed that the proposed technique performs well both in terms of throughput and fairness by simulation results. Also, the proposed scheme is very effective to expand coverage of LED-ID communication networks.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122856802","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-23DOI: 10.1109/ICTC.2010.5674669
H. Lim, Tae-Kyoung Kim, G. Im
Single-carrier frequency division multiple access (SC-FDMA) with iterative multiuser detection, called grouped FDMA (GFDMA), allows several users to share a common set of subcarriers. In order to improve user fairness and guarantee quality-of-service (QoS) of users who share subcarrier sets, we propose a proportional fair (PF) scheduling algorithm satisfying QoS constraints. For each user selection of a subcarrier set, the scheduler considers average data rates and multiuser interference of users. Simulation results show that the proposed PF scheduling algorithm not only increases the spectral efficiency of GFDMA but also provides long-term fairness to users.
{"title":"A proportional fair scheduling algorithm for SC-FDMA with iterative multiuser detection","authors":"H. Lim, Tae-Kyoung Kim, G. Im","doi":"10.1109/ICTC.2010.5674669","DOIUrl":"https://doi.org/10.1109/ICTC.2010.5674669","url":null,"abstract":"Single-carrier frequency division multiple access (SC-FDMA) with iterative multiuser detection, called grouped FDMA (GFDMA), allows several users to share a common set of subcarriers. In order to improve user fairness and guarantee quality-of-service (QoS) of users who share subcarrier sets, we propose a proportional fair (PF) scheduling algorithm satisfying QoS constraints. For each user selection of a subcarrier set, the scheduler considers average data rates and multiuser interference of users. Simulation results show that the proposed PF scheduling algorithm not only increases the spectral efficiency of GFDMA but also provides long-term fairness to users.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115191555","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-23DOI: 10.1109/ICTC.2010.5674701
Zahra MohammadNejad, M. Ahmadian, S. Khorsandi
Sensor networks are large scale networks of low power devices that collaborate in order to perform a given task. The sensors are limited in battery energy, capacity and computational power. In recent years, researcher have proposed several protocols for such sensor networks assuming that all sensors belong the same authority. In this paper, we introduce the concept of multi-domain sensor networks. We propose a economical mechanism to dynamic management of cost and combine routing algorithm with a dynamic pricing model that we design. With this incentive model, our result present that cooperation in sensor nodes increase and total energy consumption in network exactly reduce.
{"title":"Providing a hybrid algorithm for routing and cooperation based on dynamic pricing in wireless sensor networks","authors":"Zahra MohammadNejad, M. Ahmadian, S. Khorsandi","doi":"10.1109/ICTC.2010.5674701","DOIUrl":"https://doi.org/10.1109/ICTC.2010.5674701","url":null,"abstract":"Sensor networks are large scale networks of low power devices that collaborate in order to perform a given task. The sensors are limited in battery energy, capacity and computational power. In recent years, researcher have proposed several protocols for such sensor networks assuming that all sensors belong the same authority. In this paper, we introduce the concept of multi-domain sensor networks. We propose a economical mechanism to dynamic management of cost and combine routing algorithm with a dynamic pricing model that we design. With this incentive model, our result present that cooperation in sensor nodes increase and total energy consumption in network exactly reduce.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115556799","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
扫码关注我们
求助内容：
应助结果提醒方式：