首页 > 最新文献

2017 8th International Conference on Information and Communication Systems (ICICS)最新文献

英文 中文
Secure LSB steganography for colored images using character-color mapping 使用字符-颜色映射的彩色图像安全LSB隐写术
Pub Date : 2017-04-01 DOI: 10.1109/IACS.2017.7921954
Zaid Y. Al-Omari, Ahmad T. Al-Taani
Steganography is the science of embedding the secret messages inside other medium files in a way that hides the existence of the secret message at all. Steganography can be applied to text, audio, image, and video file types. In this study, we propose a new steganography approach for digital images in which the RGB coloring model was used. The efficiency of the proposed approach has been tested and evaluated. The experimental results show that the proposed approach produce high-quality stego images that resist against visual and statistical attacks.
隐写术是一门将秘密信息嵌入到其他媒体文件中的科学,它以一种完全隐藏秘密信息存在的方式。隐写术可以应用于文本、音频、图像和视频文件类型。在这项研究中,我们提出了一种新的数字图像隐写方法,其中使用了RGB着色模型。所提出的方法的效率已被测试和评估。实验结果表明,该方法可以产生高质量的隐写图像,能够抵抗视觉攻击和统计攻击。
{"title":"Secure LSB steganography for colored images using character-color mapping","authors":"Zaid Y. Al-Omari, Ahmad T. Al-Taani","doi":"10.1109/IACS.2017.7921954","DOIUrl":"https://doi.org/10.1109/IACS.2017.7921954","url":null,"abstract":"Steganography is the science of embedding the secret messages inside other medium files in a way that hides the existence of the secret message at all. Steganography can be applied to text, audio, image, and video file types. In this study, we propose a new steganography approach for digital images in which the RGB coloring model was used. The efficiency of the proposed approach has been tested and evaluated. The experimental results show that the proposed approach produce high-quality stego images that resist against visual and statistical attacks.","PeriodicalId":180504,"journal":{"name":"2017 8th International Conference on Information and Communication Systems (ICICS)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125689943","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}
引用次数: 19
Selection process approaches in live migration: A comparative study 移民选择过程方法的比较研究
Pub Date : 2017-04-01 DOI: 10.1109/IACS.2017.7921940
Suhib Bani Melhem, A. Agarwal, N. Goel, Marzia Zaman
Live virtual machine (VM) migration is defined as a technique that migrates the entire operating system (OS) and its associated applications from one host/physical server to another providing that users should not notice any interruption in their services. Live VM migration plays an important role to facilitate online maintenance, load balancing, and energy management as part of resource management. Live VM migration can be divided into two parts: 1) selection process which involves three different phases: when to trigger the migration, which VMs must be selected to be migrated, and which destination host must be chosen to move the selected VMs. 2) migration process that targets moving the VM in minimum time to avoid any interruption of services. In this paper, we present a comparative study of selection approaches used in the live VM migration technique.
实时虚拟机(VM)迁移被定义为一种将整个操作系统(OS)及其相关应用程序从一台主机/物理服务器迁移到另一台主机/物理服务器的技术,前提是用户不会注意到其服务中的任何中断。作为资源管理的一部分,在线虚拟机迁移在促进在线维护、负载均衡和能源管理方面发挥着重要作用。在线虚拟机迁移可分为两部分:1)选择过程,包括三个不同的阶段:何时触发迁移,必须选择哪些虚拟机进行迁移,必须选择哪个目标主机来移动所选择的虚拟机。2)迁移过程,目标是在最短的时间内移动虚拟机,以避免任何业务中断。在本文中,我们提出了在虚拟机迁移技术中使用的选择方法的比较研究。
{"title":"Selection process approaches in live migration: A comparative study","authors":"Suhib Bani Melhem, A. Agarwal, N. Goel, Marzia Zaman","doi":"10.1109/IACS.2017.7921940","DOIUrl":"https://doi.org/10.1109/IACS.2017.7921940","url":null,"abstract":"Live virtual machine (VM) migration is defined as a technique that migrates the entire operating system (OS) and its associated applications from one host/physical server to another providing that users should not notice any interruption in their services. Live VM migration plays an important role to facilitate online maintenance, load balancing, and energy management as part of resource management. Live VM migration can be divided into two parts: 1) selection process which involves three different phases: when to trigger the migration, which VMs must be selected to be migrated, and which destination host must be chosen to move the selected VMs. 2) migration process that targets moving the VM in minimum time to avoid any interruption of services. In this paper, we present a comparative study of selection approaches used in the live VM migration technique.","PeriodicalId":180504,"journal":{"name":"2017 8th International Conference on Information and Communication Systems (ICICS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124255270","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}
引用次数: 7
Taking over malicious connection in half way by migrating protocol state to a user-level TCP stack 通过将协议状态迁移到用户级TCP堆栈,在中途接管恶意连接
Pub Date : 2017-04-01 DOI: 10.1109/IACS.2017.7921976
Qi Tang, Chao Zheng, Qiuwen Lu, Wei Yang, Qingsheng Yuan, Xunxun Chen
Network intrusion detection system (NIDS) takes necessary measures when detecting threats. Since most of the malicious contents like phishing sites and advanced persistent threats are transmitted on transmission control protocol (TCP), existing measures are usually injection-based, such as injecting a reset (RST) packet to terminate the connection or a HTTP 302 response to redirect users' requests. Injection is a feasible measure but is unable to scrub traffic like removing malicious contents. Therefore, taking over malicious TCP connections instead of injection is a more effective solution for NIDS. In this paper, we propose an efficient and flexible solution to take over malicious connections selectively at any period of the connections combining with two typical deployments of NIDS. The NIDS usually works as a passive protocol analyzer to gain high performance, when malicious contents are detected, it will migrate TCP states to a user-level TCP stack and work as a transparent proxy. The migration to user-level TCP stack is flexible and graceful due to bypassing the complexity and overhead of OS TCP stack. To evaluate our approach, we elaborate an experiment to compare with the migration to OS TCP stack. The result shows that the response speed of our approach is 8x faster than the OS stack, and more stable.
网络入侵检测系统(NIDS)在检测威胁时采取必要的措施。由于钓鱼网站和高级持续性威胁等恶意内容大多通过TCP (transmission control protocol,传输控制协议)传输,因此现有的措施通常是基于注入的,例如注入重置(RST)数据包来终止连接,或者注入HTTP 302响应来重定向用户的请求。注入是一种可行的措施,但无法像清除恶意内容那样清除流量。因此,接管恶意TCP连接而不是注入是一种更有效的解决方案。在本文中,我们结合两种典型的网络入侵防御部署,提出了一种高效灵活的解决方案,可以在连接的任何阶段有选择地接管恶意连接。NIDS通常作为被动协议分析器来获得高性能,当检测到恶意内容时,它将TCP状态迁移到用户级TCP堆栈,并作为透明代理工作。由于绕过了操作系统TCP堆栈的复杂性和开销,因此迁移到用户级TCP堆栈是灵活和优雅的。为了评估我们的方法,我们精心设计了一个实验来比较向OS TCP堆栈的迁移。结果表明,该方法的响应速度比OS堆栈快8倍,并且更加稳定。
{"title":"Taking over malicious connection in half way by migrating protocol state to a user-level TCP stack","authors":"Qi Tang, Chao Zheng, Qiuwen Lu, Wei Yang, Qingsheng Yuan, Xunxun Chen","doi":"10.1109/IACS.2017.7921976","DOIUrl":"https://doi.org/10.1109/IACS.2017.7921976","url":null,"abstract":"Network intrusion detection system (NIDS) takes necessary measures when detecting threats. Since most of the malicious contents like phishing sites and advanced persistent threats are transmitted on transmission control protocol (TCP), existing measures are usually injection-based, such as injecting a reset (RST) packet to terminate the connection or a HTTP 302 response to redirect users' requests. Injection is a feasible measure but is unable to scrub traffic like removing malicious contents. Therefore, taking over malicious TCP connections instead of injection is a more effective solution for NIDS. In this paper, we propose an efficient and flexible solution to take over malicious connections selectively at any period of the connections combining with two typical deployments of NIDS. The NIDS usually works as a passive protocol analyzer to gain high performance, when malicious contents are detected, it will migrate TCP states to a user-level TCP stack and work as a transparent proxy. The migration to user-level TCP stack is flexible and graceful due to bypassing the complexity and overhead of OS TCP stack. To evaluate our approach, we elaborate an experiment to compare with the migration to OS TCP stack. The result shows that the response speed of our approach is 8x faster than the OS stack, and more stable.","PeriodicalId":180504,"journal":{"name":"2017 8th International Conference on Information and Communication Systems (ICICS)","volume":"13 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120848770","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}
引用次数: 0
Detecting malicious user accounts using Canvas Fingerprint 使用Canvas指纹检测恶意用户帐户
Pub Date : 2017-04-01 DOI: 10.1109/IACS.2017.7921998
Ahmed M. Abouollo, Sultan Almuhammadi
Online social network applications suffer from people owning bulk of fake accounts. These fake accounts cause several problems such as resource consumption and inaccurate study results. In many cases, the social network operators assign full time employees to detect these fake accounts. Many researchers have proposed methods that help detecting fake accounts in online social networks. This research paper proposes a new technique that depends on HTML Canvas Fingerprint to identify what accounts belong to the same person or entity. The methodology has been tested on a public web application and found to give promising results, especially when combined with the other techniques described in the future work.
在线社交网络应用程序因用户拥有大量虚假账户而受到影响。这些虚假账户造成了资源消耗和研究结果不准确等问题。在许多情况下,社交网络运营商会指派全职员工来检测这些虚假账户。许多研究人员提出了帮助检测在线社交网络中的虚假账户的方法。本文提出了一种新的技术,该技术依赖于HTML画布指纹来识别哪些帐户属于同一个人或实体。该方法已经在一个公共web应用程序上进行了测试,结果令人满意,特别是在与未来工作中描述的其他技术结合使用时。
{"title":"Detecting malicious user accounts using Canvas Fingerprint","authors":"Ahmed M. Abouollo, Sultan Almuhammadi","doi":"10.1109/IACS.2017.7921998","DOIUrl":"https://doi.org/10.1109/IACS.2017.7921998","url":null,"abstract":"Online social network applications suffer from people owning bulk of fake accounts. These fake accounts cause several problems such as resource consumption and inaccurate study results. In many cases, the social network operators assign full time employees to detect these fake accounts. Many researchers have proposed methods that help detecting fake accounts in online social networks. This research paper proposes a new technique that depends on HTML Canvas Fingerprint to identify what accounts belong to the same person or entity. The methodology has been tested on a public web application and found to give promising results, especially when combined with the other techniques described in the future work.","PeriodicalId":180504,"journal":{"name":"2017 8th International Conference on Information and Communication Systems (ICICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129405864","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}
引用次数: 9
Efficient joint encryption and data hiding algorithm for medical images security 医学图像安全的高效联合加密与数据隐藏算法
Pub Date : 2017-04-01 DOI: 10.1109/IACS.2017.7921962
Heba Abdelnabi, A. Al-Haj
In this paper an efficient crypto-watermarking algorithm is proposed to secure medical images transmitted in tele-medicine applications. The proposed algorithm uses standard encryption methods and reversible watermarking techniques to provide security to the transmitted medical images as well as to control access privileges at the receiver side. The algorithm jointly embeds two watermarks in two domains using encryption and reversible watermarking to avoid any interference between the watermarks. The authenticity and integrity of medical images can be verified in the spatial domain, the encrypted domain, or in both domains. The performance of the proposed algorithm is evaluated using test medical images of different modalities. The algorithm preforms well in terms of visual quality of the watermarked images and in terms of the available embedding capacity.
本文提出了一种有效的加密水印算法来保护远程医疗应用中传输的医学图像。该算法采用标准加密方法和可逆水印技术,为传输的医学图像提供安全性,并控制接收端的访问权限。该算法利用加密和可逆水印技术在两个域内联合嵌入两个水印,避免了水印之间的相互干扰。医学图像的真实性和完整性可以在空间域、加密域或两个域进行验证。使用不同模态的测试医学图像对所提出算法的性能进行了评估。该算法在水印图像的视觉质量和可用的嵌入容量方面表现良好。
{"title":"Efficient joint encryption and data hiding algorithm for medical images security","authors":"Heba Abdelnabi, A. Al-Haj","doi":"10.1109/IACS.2017.7921962","DOIUrl":"https://doi.org/10.1109/IACS.2017.7921962","url":null,"abstract":"In this paper an efficient crypto-watermarking algorithm is proposed to secure medical images transmitted in tele-medicine applications. The proposed algorithm uses standard encryption methods and reversible watermarking techniques to provide security to the transmitted medical images as well as to control access privileges at the receiver side. The algorithm jointly embeds two watermarks in two domains using encryption and reversible watermarking to avoid any interference between the watermarks. The authenticity and integrity of medical images can be verified in the spatial domain, the encrypted domain, or in both domains. The performance of the proposed algorithm is evaluated using test medical images of different modalities. The algorithm preforms well in terms of visual quality of the watermarked images and in terms of the available embedding capacity.","PeriodicalId":180504,"journal":{"name":"2017 8th International Conference on Information and Communication Systems (ICICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129932926","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}
引用次数: 21
An intelligent model for trustworthiness evaluation in semantic web applications 语义web应用中可信度评估的智能模型
Pub Date : 2017-04-01 DOI: 10.1109/IACS.2017.7921999
R. Mohammad, Hussein Y. AbuMansour
The development and the advances of the World Wide Web from its first inception resulted in numerous diverse amounts of data and webpages on the web which motivates to greater demand for managing this data in an effective manner. Therefore, novel tools and techniques are required to effectively manage these data. Such tools are assumed to support interoperability and warehousing between the multiple data sources and extracting information from the different trusted databases on the web. Subsequently, the web is evolving into what is now called the Semantic Web aims to alleviate users from the burden of integrating different information sources as well as to perform searches. However, one needs to examine the trust issue of the searching results from any Semantic Web application. This paper investigates trust policies and mechanisms in semantic web applications and introduces an intermediary step to classify the relevant web services via intelligent model based on NN.
万维网从一开始的发展和进步导致了网络上大量不同数量的数据和网页,这激发了以有效方式管理这些数据的更大需求。因此,需要新颖的工具和技术来有效地管理这些数据。假设这些工具支持多个数据源之间的互操作性和仓库,并从web上不同的可信数据库中提取信息。随后,网络发展成为现在所谓的语义网,旨在减轻用户整合不同信息源和执行搜索的负担。但是,需要检查来自任何语义Web应用程序的搜索结果的信任问题。研究了语义web应用中的信任策略和机制,并引入了一个中间步骤,通过基于神经网络的智能模型对相关web服务进行分类。
{"title":"An intelligent model for trustworthiness evaluation in semantic web applications","authors":"R. Mohammad, Hussein Y. AbuMansour","doi":"10.1109/IACS.2017.7921999","DOIUrl":"https://doi.org/10.1109/IACS.2017.7921999","url":null,"abstract":"The development and the advances of the World Wide Web from its first inception resulted in numerous diverse amounts of data and webpages on the web which motivates to greater demand for managing this data in an effective manner. Therefore, novel tools and techniques are required to effectively manage these data. Such tools are assumed to support interoperability and warehousing between the multiple data sources and extracting information from the different trusted databases on the web. Subsequently, the web is evolving into what is now called the Semantic Web aims to alleviate users from the burden of integrating different information sources as well as to perform searches. However, one needs to examine the trust issue of the searching results from any Semantic Web application. This paper investigates trust policies and mechanisms in semantic web applications and introduces an intermediary step to classify the relevant web services via intelligent model based on NN.","PeriodicalId":180504,"journal":{"name":"2017 8th International Conference on Information and Communication Systems (ICICS)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132485253","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}
引用次数: 9
Elastic password: A new mechanism for strengthening passwords using time delays between keystrokes 弹性密码:使用按键之间的时间延迟来加强密码的新机制
Pub Date : 2017-04-01 DOI: 10.1109/IACS.2017.7921991
Khaled W. Mahmoud
Text passwords were and still an easy, common, practical and reliable authentication method. To ensure the desired goal of access protection, passwords should be implemented carefully. This study proposes a new mechanism to strengthen passwords through introducing time gaps (delays) between some password characters during the sign-up process. During sign-in, users should not only enter their correct passwords, but also they must leave time delays in the correct position(s) as it was designated during the sign-up process. Any attempt to login using a real password without adding time delays in the correct position(s) will be rejected. Laboratory experiments were conducted to test the proposed mechanism. These experiments are based on known password but hidden delay position(s). The obtained results show that the False Acceptance Rate (FAR) was 11.33% and the False Rejection Rate (FRR) was 17.3%. These ratios could be improved when users became more familiar with the system.
文本密码是一种简便、常用、实用、可靠的认证方法。为了确保访问保护的预期目标,密码的使用应该谨慎。本研究提出了一种新的机制,通过在注册过程中引入一些密码字符之间的时间间隔(延迟)来加强密码。在登录过程中,用户不仅要输入正确的密码,还必须在注册过程中指定的正确位置留下时间延迟。任何使用真实密码而未在正确位置添加延迟时间的登录尝试将被拒绝。对提出的机理进行了实验室实验。这些实验是基于已知密码但隐藏延迟位置的。结果表明,论文的误接受率(FAR)为11.33%,误拒率(FRR)为17.3%。当用户对系统更加熟悉时,这些比率可以得到改善。
{"title":"Elastic password: A new mechanism for strengthening passwords using time delays between keystrokes","authors":"Khaled W. Mahmoud","doi":"10.1109/IACS.2017.7921991","DOIUrl":"https://doi.org/10.1109/IACS.2017.7921991","url":null,"abstract":"Text passwords were and still an easy, common, practical and reliable authentication method. To ensure the desired goal of access protection, passwords should be implemented carefully. This study proposes a new mechanism to strengthen passwords through introducing time gaps (delays) between some password characters during the sign-up process. During sign-in, users should not only enter their correct passwords, but also they must leave time delays in the correct position(s) as it was designated during the sign-up process. Any attempt to login using a real password without adding time delays in the correct position(s) will be rejected. Laboratory experiments were conducted to test the proposed mechanism. These experiments are based on known password but hidden delay position(s). The obtained results show that the False Acceptance Rate (FAR) was 11.33% and the False Rejection Rate (FRR) was 17.3%. These ratios could be improved when users became more familiar with the system.","PeriodicalId":180504,"journal":{"name":"2017 8th International Conference on Information and Communication Systems (ICICS)","volume":"405 4-6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120897215","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}
引用次数: 3
MUMBA: Multi-unit multi-broker auctions for CRNs 孟买:多单位多经纪人拍卖crn
Pub Date : 2017-04-01 DOI: 10.1109/IACS.2017.7921983
N. Riala, M. Al-Ayyoub, Y. Jararweh, H. Salameh
Several studies have highlighted the severe under utilization of licensed spectrum by its incumbent (primary) users. To increase spectrum utilization, studies suggested using a dynamic spectrum access model in both spatial and temporal dimensions. For such a model, the spectrum is continuously monitored and the unused parts of it are allocated to secondary users. This is known as Cognitive Radio Networks (CRNs), where secondary users (nodes) send their messages (packets) directly to a nearby Secondary Base Station (SBS), which is responsible for forwarding the messages to their designated recipients. In terms of their power sources, there are two types of secondary nodes: continuous power nodes (CPN) and limited power nodes (LPN). An LPN's goal is to send its message with the minimum battery power consumption. To save power, an LPN can use a nearby “idle” CPN as a relay. On the other hand, an idle CPN (which has no packets of its own to send) aims at maximizing the benefit of its resources. These different types of nodes compete with each other to achieve their goals. An auction-based market mechanism is an appealing option to regulate such a competitive environment. It is favored due to its simplicity, efficiency and high utilization of the spectrum. The model consists of a set of brokers (idle CPNs) and an available (unused) spectrum divided into channels. The brokers iteratively issue short-term dynamic spectrum leases of these channels to competing LPNs. They choose a temporary leading broker to run the auction. The leading broker receives the LPNs' bids (which are based on their spectrum demands) and computes the output of the auction (i.e., the set of winners and their payments) with the objective of obtaining maximal revenue. Computing a solution with the maximum revenue is known to be an NP-hard problem even if there is only one broker. We design a greedy algorithm to solve this problem in polynomial time and compare it with the brute-force solution requiring exponential time. We conduct several experiments and compare the two mechanisms in terms of revenue, running time and spectrum utilization. The results show that the greedy algorithm is very fast and produces solutions that are very close (or sometimes identical) to the optimal solution.
几项研究突出表明,现有(主要)用户对许可频谱的利用严重不足。为了提高频谱利用率,研究建议在空间和时间两个维度上采用动态频谱接入模型。在这种模式下,频谱被持续监控,未使用的部分被分配给辅助用户。这被称为认知无线网络(crn),辅助用户(节点)将其消息(数据包)直接发送到附近的辅助基站(SBS),该基站负责将消息转发给其指定的接收者。从功率来源来看,辅助节点有两种类型:连续功率节点(CPN)和有限功率节点(LPN)。LPN的目标是用最小的电池功耗发送信息。为了节省电力,LPN可以使用附近的“空闲”CPN作为继电器。另一方面,空闲的CPN(没有自己的数据包要发送)的目标是最大化其资源的效益。这些不同类型的节点相互竞争以实现各自的目标。以拍卖为基础的市场机制是管理这种竞争环境的一个诱人选择。它因其简单、高效和频谱利用率高而受到青睐。该模型由一组代理(空闲cpn)和一个划分为信道的可用(未使用)频谱组成。代理迭代地将这些通道的短期动态频谱租赁给竞争的lpn。他们选择一个临时的主要经纪人来进行拍卖。领先的经纪人接收lpn的出价(基于他们的频谱需求),并计算拍卖的输出(即,获胜者的集合和他们的付款),目标是获得最大的收入。即使只有一个经纪人,计算具有最大收益的解决方案也是一个np困难问题。我们设计了一种贪心算法,在多项式时间内解决该问题,并将其与需要指数时间的蛮力算法进行了比较。我们进行了多次实验,比较了两种机制在收益、运行时间和频谱利用率方面的差异。结果表明,贪心算法是非常快的,产生的解非常接近(或有时完全相同)的最优解。
{"title":"MUMBA: Multi-unit multi-broker auctions for CRNs","authors":"N. Riala, M. Al-Ayyoub, Y. Jararweh, H. Salameh","doi":"10.1109/IACS.2017.7921983","DOIUrl":"https://doi.org/10.1109/IACS.2017.7921983","url":null,"abstract":"Several studies have highlighted the severe under utilization of licensed spectrum by its incumbent (primary) users. To increase spectrum utilization, studies suggested using a dynamic spectrum access model in both spatial and temporal dimensions. For such a model, the spectrum is continuously monitored and the unused parts of it are allocated to secondary users. This is known as Cognitive Radio Networks (CRNs), where secondary users (nodes) send their messages (packets) directly to a nearby Secondary Base Station (SBS), which is responsible for forwarding the messages to their designated recipients. In terms of their power sources, there are two types of secondary nodes: continuous power nodes (CPN) and limited power nodes (LPN). An LPN's goal is to send its message with the minimum battery power consumption. To save power, an LPN can use a nearby “idle” CPN as a relay. On the other hand, an idle CPN (which has no packets of its own to send) aims at maximizing the benefit of its resources. These different types of nodes compete with each other to achieve their goals. An auction-based market mechanism is an appealing option to regulate such a competitive environment. It is favored due to its simplicity, efficiency and high utilization of the spectrum. The model consists of a set of brokers (idle CPNs) and an available (unused) spectrum divided into channels. The brokers iteratively issue short-term dynamic spectrum leases of these channels to competing LPNs. They choose a temporary leading broker to run the auction. The leading broker receives the LPNs' bids (which are based on their spectrum demands) and computes the output of the auction (i.e., the set of winners and their payments) with the objective of obtaining maximal revenue. Computing a solution with the maximum revenue is known to be an NP-hard problem even if there is only one broker. We design a greedy algorithm to solve this problem in polynomial time and compare it with the brute-force solution requiring exponential time. We conduct several experiments and compare the two mechanisms in terms of revenue, running time and spectrum utilization. The results show that the greedy algorithm is very fast and produces solutions that are very close (or sometimes identical) to the optimal solution.","PeriodicalId":180504,"journal":{"name":"2017 8th International Conference on Information and Communication Systems (ICICS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132938194","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}
引用次数: 0
A stochastic optimization technique for PAPR reduction in the uplink of LTE-Advanced with carrier aggregation 基于载波聚合的LTE-Advanced上行链路PAPR降低随机优化技术
Pub Date : 2017-04-01 DOI: 10.1109/IACS.2017.7921972
Abdel-karim Ajami, H. Artail
The ever increase in the demand on peak data rates due to emerging services and applications has motivated the use of carrier aggregation (CA) as a key enabling technique to increase the bandwidth of users. CA allows the users to utilize both licensed and unlicensed spectrum simultaneously. However one of the main practical challenges that comes with CA is the severe increase in the peak-to-average-power ratio (PAPR) of the aggregated time domain N×SC-FDMA signal. This issue affects the efficiency of the power amplifier (PA) at the user equipment (UE) in the uplink and hence the transmission coverage is reduced. In this paper, we propose a stochastic optimization technique to reduce the PAPR of N×SC-FDMA signals. Several CA scenarios were analyzed where experimental results show that the proposed technique outperforms the random circular shifting technique and can provide an average coverage gain of 40% for the case of 2 CCs.
由于新兴业务和应用程序对峰值数据速率的需求不断增加,促使使用载波聚合(CA)作为增加用户带宽的关键使能技术。CA允许用户同时使用授权频谱和未授权频谱。然而,CA带来的主要实际挑战之一是聚合时域N×SC-FDMA信号的峰值与平均功率比(PAPR)的严重增加。此问题会影响上行链路中用户设备(UE)处功率放大器(PA)的效率,从而降低传输覆盖范围。在本文中,我们提出了一种随机优化技术来降低N×SC-FDMA信号的PAPR。分析了几种CA场景,实验结果表明,所提出的技术优于随机圆移位技术,并且在2 cc的情况下可以提供40%的平均覆盖增益。
{"title":"A stochastic optimization technique for PAPR reduction in the uplink of LTE-Advanced with carrier aggregation","authors":"Abdel-karim Ajami, H. Artail","doi":"10.1109/IACS.2017.7921972","DOIUrl":"https://doi.org/10.1109/IACS.2017.7921972","url":null,"abstract":"The ever increase in the demand on peak data rates due to emerging services and applications has motivated the use of carrier aggregation (CA) as a key enabling technique to increase the bandwidth of users. CA allows the users to utilize both licensed and unlicensed spectrum simultaneously. However one of the main practical challenges that comes with CA is the severe increase in the peak-to-average-power ratio (PAPR) of the aggregated time domain N×SC-FDMA signal. This issue affects the efficiency of the power amplifier (PA) at the user equipment (UE) in the uplink and hence the transmission coverage is reduced. In this paper, we propose a stochastic optimization technique to reduce the PAPR of N×SC-FDMA signals. Several CA scenarios were analyzed where experimental results show that the proposed technique outperforms the random circular shifting technique and can provide an average coverage gain of 40% for the case of 2 CCs.","PeriodicalId":180504,"journal":{"name":"2017 8th International Conference on Information and Communication Systems (ICICS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114385451","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}
引用次数: 1
ALIF editor for generating Arabic normalized lexicons 用于生成阿拉伯语规范化词汇的ALIF编辑器
Pub Date : 2017-04-01 DOI: 10.1109/IACS.2017.7921948
Samia Ben Ismail, Hajer Maraoui, K. Haddar, Laurent Romary
The development of a normalized morpho-syntactic Arabic lexicon is not an easy task. In fact, many norms allow the structuration and representation of lexical data. The adoption of a stable standard will guarantee the interoperability and interchangeability of lexical resources. Still, research work that deals with normalization for Arabic lexical resources is not well developed yet, especially for some standards such as the TEI (Text Encoding Initiative). In this context, we aim at creating an Arabic lexicon editor with a constraint checker based on both the ISO standard LMF (Lexical Markup Framework) and the TEI guidelines. To develop this editor, we use a linguistic approach composed of several steps. The editor's prototype named ALIF can guarantee the construction of two types of output lexicon files: one in LMF and the other in TEI. The evaluation of this system is based upon a lexical database that contains all the derived and inflected forms generated from a lexicon of 10 000 canonical verbs. The results obtained were encouraging despite some flaws related to exceptional cases of difficult words.
发展一个规范化的形态句法阿拉伯语词汇不是一件容易的事。事实上,许多规范都允许对词法数据进行结构化和表示。采用稳定的标准将保证词汇资源的互操作性和互换性。然而,处理阿拉伯语词汇资源规范化的研究工作还没有得到很好的发展,特别是对于一些标准,如TEI (Text Encoding Initiative)。在此上下文中,我们的目标是创建一个带有约束检查器的阿拉伯语词典编辑器,该约束检查器基于ISO标准LMF(词法标记框架)和TEI指南。为了开发这个编辑器,我们使用了由几个步骤组成的语言方法。名为ALIF的编辑器原型可以保证构建两种类型的输出词典文件:一种在LMF中,另一种在TEI中。该系统的评估是基于一个词汇数据库,该数据库包含从10,000个规范动词的词典中生成的所有派生和屈折形式。结果令人鼓舞,尽管有一些与特殊情况下的困难单词有关的缺陷。
{"title":"ALIF editor for generating Arabic normalized lexicons","authors":"Samia Ben Ismail, Hajer Maraoui, K. Haddar, Laurent Romary","doi":"10.1109/IACS.2017.7921948","DOIUrl":"https://doi.org/10.1109/IACS.2017.7921948","url":null,"abstract":"The development of a normalized morpho-syntactic Arabic lexicon is not an easy task. In fact, many norms allow the structuration and representation of lexical data. The adoption of a stable standard will guarantee the interoperability and interchangeability of lexical resources. Still, research work that deals with normalization for Arabic lexical resources is not well developed yet, especially for some standards such as the TEI (Text Encoding Initiative). In this context, we aim at creating an Arabic lexicon editor with a constraint checker based on both the ISO standard LMF (Lexical Markup Framework) and the TEI guidelines. To develop this editor, we use a linguistic approach composed of several steps. The editor's prototype named ALIF can guarantee the construction of two types of output lexicon files: one in LMF and the other in TEI. The evaluation of this system is based upon a lexical database that contains all the derived and inflected forms generated from a lexicon of 10 000 canonical verbs. The results obtained were encouraging despite some flaws related to exceptional cases of difficult words.","PeriodicalId":180504,"journal":{"name":"2017 8th International Conference on Information and Communication Systems (ICICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129428326","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}
引用次数: 8
期刊
2017 8th International Conference on Information and Communication Systems (ICICS)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1