Pub Date : 2014-03-27DOI: 10.1109/ICACT.2014.6779163
P. Saravanakumar, N. Mehanathen, M. Rajagopalan
The web services model is used for interoperability of Heterogeneous and distributed platforms. In this paper we present how different orchestrated and choreography based web services collide each other and exchange information. Exchanging of information takes place by means of integrating choreography Web services with push based web service architecture. In global scenario application are built with web services for their own scenario. Each services follow different set of mechanism for e.g. Web services A follows push based service and service B follows poll based services and so on. In order to exchange the information between these two web-services we introduce a layer which acts as a common platform for service synchronization. We call this layer as Heterogeneous Synchronization layer (HSL). This layer acts as a bridge between global web services and our subscribed web services.
{"title":"Heterogeneous synchronization layer for web services","authors":"P. Saravanakumar, N. Mehanathen, M. Rajagopalan","doi":"10.1109/ICACT.2014.6779163","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779163","url":null,"abstract":"The web services model is used for interoperability of Heterogeneous and distributed platforms. In this paper we present how different orchestrated and choreography based web services collide each other and exchange information. Exchanging of information takes place by means of integrating choreography Web services with push based web service architecture. In global scenario application are built with web services for their own scenario. Each services follow different set of mechanism for e.g. Web services A follows push based service and service B follows poll based services and so on. In order to exchange the information between these two web-services we introduce a layer which acts as a common platform for service synchronization. We call this layer as Heterogeneous Synchronization layer (HSL). This layer acts as a bridge between global web services and our subscribed web services.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74656594","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6778933
Bing Wang, Zhiquan Bai, Yinlong Xu, Peihao Dong, K. Kwak
Cooperative spectrum sensing (CSS) scheme is employed to detect the primary user (PU) more quickly and accurately in cognitive radio (CR) systems. The performance of CSS scheme is usually significantly degraded when the inter-user and reporting channels experience path loss or deep fading. Meanwhile, the reporting channels are usually bandwidth limited. When the number of the secondary users (SUs) is very large, the sensing results need enormous bandwidth in the transmission. To solve this problem, a dynamical clustering CSS scheme with bandwidth constraints is proposed, where the SUs with better reporting channels are chosen as the cluster heads and the other SUs are dynamically grouped according to the inter-user channel conditions. In each cluster, the proposed scheme adopts the double thresholds scheme to make sure that only the SUs with high quality can send their sensing results. Simulation results demonstrate that the average number of sensing bits of the proposed scheme decreases greatly with a little loss in the sensing performance. This advantage is more obvious compared with the STBC based cooperative spectrum sensing scheme.
{"title":"Dynamical clustering cooperative spectrum sensing with bandwidth constraints in CR systems","authors":"Bing Wang, Zhiquan Bai, Yinlong Xu, Peihao Dong, K. Kwak","doi":"10.1109/ICACT.2014.6778933","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6778933","url":null,"abstract":"Cooperative spectrum sensing (CSS) scheme is employed to detect the primary user (PU) more quickly and accurately in cognitive radio (CR) systems. The performance of CSS scheme is usually significantly degraded when the inter-user and reporting channels experience path loss or deep fading. Meanwhile, the reporting channels are usually bandwidth limited. When the number of the secondary users (SUs) is very large, the sensing results need enormous bandwidth in the transmission. To solve this problem, a dynamical clustering CSS scheme with bandwidth constraints is proposed, where the SUs with better reporting channels are chosen as the cluster heads and the other SUs are dynamically grouped according to the inter-user channel conditions. In each cluster, the proposed scheme adopts the double thresholds scheme to make sure that only the SUs with high quality can send their sensing results. Simulation results demonstrate that the average number of sensing bits of the proposed scheme decreases greatly with a little loss in the sensing performance. This advantage is more obvious compared with the STBC based cooperative spectrum sensing scheme.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73048167","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6779194
Yafei Hou, S. Tsukamoto, K. Yano, M. Uno, Kiyoshi Kobayashi
This paper proposes a method to reduce the symbol error caused by modulo operator for regularized channel inversion (RCI)-based vector perturbation (RCI-VP). The proposed method introduces dual regularization parameters of RCI precoding matrix. First regularization parameter a is set so as to maximize the signal to interference plus noise ratio (SINR) value of each stream to find the optimal perturbation vector. The second regularization parameter 0.2 is set so as to minimize the total MSE between the transmitted perturbation vector and received perturbation vector to reduce the symbol error caused by modulo operator. The simulated results confirm that the proposed method can improve the performance of RCI-VP over i.i.d. MIMO channel and frequency-selective fading MIMO channel.
{"title":"Introducing dual regularization parameters into regularized channel inversion (RCI)-based vector perturbation for modulo loss reduction","authors":"Yafei Hou, S. Tsukamoto, K. Yano, M. Uno, Kiyoshi Kobayashi","doi":"10.1109/ICACT.2014.6779194","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779194","url":null,"abstract":"This paper proposes a method to reduce the symbol error caused by modulo operator for regularized channel inversion (RCI)-based vector perturbation (RCI-VP). The proposed method introduces dual regularization parameters of RCI precoding matrix. First regularization parameter a is set so as to maximize the signal to interference plus noise ratio (SINR) value of each stream to find the optimal perturbation vector. The second regularization parameter 0.2 is set so as to minimize the total MSE between the transmitted perturbation vector and received perturbation vector to reduce the symbol error caused by modulo operator. The simulated results confirm that the proposed method can improve the performance of RCI-VP over i.i.d. MIMO channel and frequency-selective fading MIMO channel.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75378501","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6779032
Yeonjeong Jeong, Bumho Kim, Dowon Nam, K. Yoon
Digital Cinema Initiatives released a set of technical specifications and requirements for Digital Cinema. We implement the mastering system of digital cinema that produces the Digital Cinema Package (DCP) which has been designed to deliver digital cinema contents such as image, audio and subtitle and Key Delivery Message (KDM) which contains the security information to be used to decrypt the DCP and will be issued to a specific Digital Cinema playback server. We propose a mastering system that covers the packaging process of DCP for Digital Cinema content and the generating and issuing process of KDM to protect the DCP.
{"title":"Implementation of digital cinema mastering system","authors":"Yeonjeong Jeong, Bumho Kim, Dowon Nam, K. Yoon","doi":"10.1109/ICACT.2014.6779032","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779032","url":null,"abstract":"Digital Cinema Initiatives released a set of technical specifications and requirements for Digital Cinema. We implement the mastering system of digital cinema that produces the Digital Cinema Package (DCP) which has been designed to deliver digital cinema contents such as image, audio and subtitle and Key Delivery Message (KDM) which contains the security information to be used to decrypt the DCP and will be issued to a specific Digital Cinema playback server. We propose a mastering system that covers the packaging process of DCP for Digital Cinema content and the generating and issuing process of KDM to protect the DCP.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73673755","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6779002
Hiroshi Yamamoto, T. Fujii, Phuong Tran Thi Ha, K. Yamazaki
For obtaining various observation data in a dangerous disaster area where human beings cannot easily enter, a Delay Tolerant Network (DTN) based sensor network system using autonomous air vehicles has been developed. However, the existing system cannot help to observe disaster conditions of congested areas where sensor nodes cannot be easily deployed, although it can be used to collect sensor data from the sensor nodes deployed on a vast field. Therefore, in this study, we propose and develop a new air vehicle which can be controlled through a 3G cellular network so that an operator can obtain various sensor data in the disaster area from everywhere. Furthermore, the proposed air vehicle can be equipped with sensing devices because it has many analog/digital interfaces. Through the experimental evaluation, it is clarified that the remote control of the air vehicle can be done even when both the vehicle and the user terminal exist inside NAT devices.
{"title":"New development of remote control system for air vehicle using 3G cellular network","authors":"Hiroshi Yamamoto, T. Fujii, Phuong Tran Thi Ha, K. Yamazaki","doi":"10.1109/ICACT.2014.6779002","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779002","url":null,"abstract":"For obtaining various observation data in a dangerous disaster area where human beings cannot easily enter, a Delay Tolerant Network (DTN) based sensor network system using autonomous air vehicles has been developed. However, the existing system cannot help to observe disaster conditions of congested areas where sensor nodes cannot be easily deployed, although it can be used to collect sensor data from the sensor nodes deployed on a vast field. Therefore, in this study, we propose and develop a new air vehicle which can be controlled through a 3G cellular network so that an operator can obtain various sensor data in the disaster area from everywhere. Furthermore, the proposed air vehicle can be equipped with sensing devices because it has many analog/digital interfaces. Through the experimental evaluation, it is clarified that the remote control of the air vehicle can be done even when both the vehicle and the user terminal exist inside NAT devices.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74799661","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6779038
Bong-Jin Oh, Jong-Youl Park
This paper introduces a remote user interface framework which supports applications to share their view with remote smart devices. Besides that, a virtual IO function is provided to use mobile devices as remote controller. By thus, users can control home networked devices and applications by their smart devices with intuitive UI/UX. The proposed framework provides collaborative application model, APIs of sharing application view and virtual IO emulator.
{"title":"A remote user interface framework for collaborative services using interconnected smart devices","authors":"Bong-Jin Oh, Jong-Youl Park","doi":"10.1109/ICACT.2014.6779038","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779038","url":null,"abstract":"This paper introduces a remote user interface framework which supports applications to share their view with remote smart devices. Besides that, a virtual IO function is provided to use mobile devices as remote controller. By thus, users can control home networked devices and applications by their smart devices with intuitive UI/UX. The proposed framework provides collaborative application model, APIs of sharing application view and virtual IO emulator.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78710843","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6779082
Jaewon Ahn, Hong-shik Park
Energy saving study without the power consumption measurement of network devices makes less effective or biased results than the study based on the empirical power consumption data. Thus, precise evaluation of network appliance power consumption is inevitable to develop more influential energy saving techniques. In this paper, we measure the power consumption of an edge router, CISCO 7609 router, as well as evaluate the effect of the packet size and the routing protocol onto the power consumption of an edge router. We investigate that with four different packet sizes according to RFC 2544 and three different routing protocols, none, OSPF, and BGP with the increment of link utilization. We analyse empirical data for numerous individual cases and find that the packet size are closely related to the power consumption of the edge router. Based on these results, we model the formal power consumption equation of the edge router.
{"title":"Measurement and modeling the power consumption of router interface","authors":"Jaewon Ahn, Hong-shik Park","doi":"10.1109/ICACT.2014.6779082","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779082","url":null,"abstract":"Energy saving study without the power consumption measurement of network devices makes less effective or biased results than the study based on the empirical power consumption data. Thus, precise evaluation of network appliance power consumption is inevitable to develop more influential energy saving techniques. In this paper, we measure the power consumption of an edge router, CISCO 7609 router, as well as evaluate the effect of the packet size and the routing protocol onto the power consumption of an edge router. We investigate that with four different packet sizes according to RFC 2544 and three different routing protocols, none, OSPF, and BGP with the increment of link utilization. We analyse empirical data for numerous individual cases and find that the packet size are closely related to the power consumption of the edge router. Based on these results, we model the formal power consumption equation of the edge router.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75957098","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6779027
Jianbo Li, Xi Luan, Yong Luo, Xiaoning Zhang, Jianjun Wu
In this paper, we investigate the outage performance for the two-way relaying model in which a half-duplex energy harvesting relay assists in the bi-directional communication of two source nodes. Closed form results for the outage probability of two-way relaying networks has been introduced and corrected in the scenario of an energy harvesting relay. We then consider the relationship between source nodes power allocation, relay energy harvesting efficiency and outage probability. The two source nodes share the limited total power, to minimize the outage probability, we derive closed form results for the source nodes power allocation with fixed relay energy harvesting efficiency. Simulation results are provided to confirm the analytical results.
{"title":"Source nodes power optimization in energy harvesting two-way relay networks","authors":"Jianbo Li, Xi Luan, Yong Luo, Xiaoning Zhang, Jianjun Wu","doi":"10.1109/ICACT.2014.6779027","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779027","url":null,"abstract":"In this paper, we investigate the outage performance for the two-way relaying model in which a half-duplex energy harvesting relay assists in the bi-directional communication of two source nodes. Closed form results for the outage probability of two-way relaying networks has been introduced and corrected in the scenario of an energy harvesting relay. We then consider the relationship between source nodes power allocation, relay energy harvesting efficiency and outage probability. The two source nodes share the limited total power, to minimize the outage probability, we derive closed form results for the source nodes power allocation with fixed relay energy harvesting efficiency. Simulation results are provided to confirm the analytical results.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84865517","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6778925
Donggu Kang, Dong-Kyun Han, Gyumin Sim, Jong Hyuk Jung, Hyun Ki-Jeon, Soobin Lee, Joonyoung Park, Seunghyeon Moon
Everyday in Korea, more than hundred thousands of News articles and postings are generated by either writers or users. Many people read News articles and write their opinions on the articles through major News portal systems such as Naver or Daum. However, they are sometimes time-consuming, biased, and distracted by unnecessary information. We propose a realtime News recommendation system called PADACΛ2, that is more passive process for users to browse their interests from massive News media. We propose a recommendation algorithm called HeteRoCommender based on heterogeneous source of social footprints given.
{"title":"PADAC⁁2: Real-time news recommendation system with heterogeneous social footprints","authors":"Donggu Kang, Dong-Kyun Han, Gyumin Sim, Jong Hyuk Jung, Hyun Ki-Jeon, Soobin Lee, Joonyoung Park, Seunghyeon Moon","doi":"10.1109/ICACT.2014.6778925","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6778925","url":null,"abstract":"Everyday in Korea, more than hundred thousands of News articles and postings are generated by either writers or users. Many people read News articles and write their opinions on the articles through major News portal systems such as Naver or Daum. However, they are sometimes time-consuming, biased, and distracted by unnecessary information. We propose a realtime News recommendation system called PADACΛ2, that is more passive process for users to browse their interests from massive News media. We propose a recommendation algorithm called HeteRoCommender based on heterogeneous source of social footprints given.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85027963","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6779088
Jiali You, N. Qiao, Yu Zhuo, Jiniin Wang
Cloud becomes increasingly important currently, and media services, which usually have multiple steps and complexity computing requirement, are applied in it. Although this scheduling topic has been investigated a lot, most of works focus on balancing jobs or decreasing the execution time of one job. For large scale paralleling media services, the job request usually contains a series tasks, and how to schedule them to a cloud or a grid with high efficiency and low cost is an important problem. To achieve this target, we focus on the fine grain tasks for media services and propose a task-based scheduling algorithm, in which two-stage scheduling approach is designed, including initializing stage and adjustment stage. In this algorithm, after the initializing assignment process, in order to meet the need of the limited cost consumption, the characters of nodes or virtual machines(VMs), such as balance character, capability character, are considered deeply in scheduling adjusting process. Evaluation shows that our algorithm presents obviously better performance in terms of makespan, cost consumption, and balance factor than several benchmarks.
{"title":"Optimal media service scheduling in clouds","authors":"Jiali You, N. Qiao, Yu Zhuo, Jiniin Wang","doi":"10.1109/ICACT.2014.6779088","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779088","url":null,"abstract":"Cloud becomes increasingly important currently, and media services, which usually have multiple steps and complexity computing requirement, are applied in it. Although this scheduling topic has been investigated a lot, most of works focus on balancing jobs or decreasing the execution time of one job. For large scale paralleling media services, the job request usually contains a series tasks, and how to schedule them to a cloud or a grid with high efficiency and low cost is an important problem. To achieve this target, we focus on the fine grain tasks for media services and propose a task-based scheduling algorithm, in which two-stage scheduling approach is designed, including initializing stage and adjustment stage. In this algorithm, after the initializing assignment process, in order to meet the need of the limited cost consumption, the characters of nodes or virtual machines(VMs), such as balance character, capability character, are considered deeply in scheduling adjusting process. Evaluation shows that our algorithm presents obviously better performance in terms of makespan, cost consumption, and balance factor than several benchmarks.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86030894","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
扫码关注我们
求助内容：
应助结果提醒方式：