发布求助
文献互助 智能选刊 最新文献

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)最新文献

筛选
英文 中文
MBCAP: Mission Based Collision Avoidance Protocol for UAVs 无人机基于任务的避碰协议
2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00090
Francisco Fabra, C. Calafate, Juan-Carlos Cano, P. Manzoni
{"title":"MBCAP: Mission Based Collision Avoidance Protocol for UAVs","authors":"Francisco Fabra, C. Calafate, Juan-Carlos Cano, P. Manzoni","doi":"10.1109/AINA.2018.00090","DOIUrl":"https://doi.org/10.1109/AINA.2018.00090","url":null,"abstract":"The number of Unmanned Aerial Vehicles (UAVs) flying around is increasing year after year due to their popularity. This new scenario considerably increases the risk of collision among them, which makes the development of protocols to avoid this issue an emerging topic. This work focuses on the development of a collision avoidance protocol between multicopters performing planned missions. Our proposal is based on the periodic submission of state information, and estimations concerning future UAV positions, allowing collision risks to be detected early. Collision avoidance is achieved by forcing UAVs to stop when they are flying critically near each other, and establishing a priority to determine which UAV shall go through the critical area first; this decision is based on a per-UAV unique identifier. We prove that our solution is robust enough to avoid collisions in all the situations tested; in addition, the overhead introduced by our protocol in terms of additional UAV flight time is low.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"21 33","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132743389","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}
引用次数: 6
Resource Exploration Using Levy Walk on Unit Disk Graphs 利用单位磁盘图上的列维行走进行资源勘探
2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00034
Kenya Shinki, Naohiro Hayashibara
{"title":"Resource Exploration Using Levy Walk on Unit Disk Graphs","authors":"Kenya Shinki, Naohiro Hayashibara","doi":"10.1109/AINA.2018.00034","DOIUrl":"https://doi.org/10.1109/AINA.2018.00034","url":null,"abstract":"Random walks play an important role in computer science, spreading a wide range of topics in theory and practice, including networking, dis- tributed systems, and optimization. Levy walk is a family of random walks whose distance of a walk is chosen from the power law distribution. There are lots of works of Lévy walk in the context of target detection in swarm robotics, analyzing human walk patterns, and modeling the behavior of animal foraging in recent years. According to these results, it is known as an efficient method to search in a two-dimensional plane. However, most of the works assume a continuous plane. In this paper, our simulation results indicate that Lévy walk on unit disk graphs is more efficient than other random walks on the resource exploration problem. This result means that Lévy walk can detect illegal data in large-scale delay tolerant sensor networks in realistic time.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127677515","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
NBF: An FCA-Based Algorithm to Identify Negative Correlation Biclusters of DNA Microarray Data 一种基于fca的DNA微阵列数据负相关双聚类识别算法
2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00146
Amina Houari, Wassim Ayadi, S. Yahia
{"title":"NBF: An FCA-Based Algorithm to Identify Negative Correlation Biclusters of DNA Microarray Data","authors":"Amina Houari, Wassim Ayadi, S. Yahia","doi":"10.1109/AINA.2018.00146","DOIUrl":"https://doi.org/10.1109/AINA.2018.00146","url":null,"abstract":"Biclustering is a popular technique to study gene expression data, especially to identify functionally related groups of genes under subsets of conditions. Nevertheless, most of the existing biclustering algorithms only focus on the positive correlations of genes. However, recent research shows that groups of biologically significant genes may exhibit negative correlations. Thus, we need a novel way to efficiently unveil such a type of correlations. We introduce, in this paper, a new algorithm, called the Negative Bicluster Finder (NBF). The sighting features of the NBF stands in its ability to discover the biclusters of negative correlations using the theoretical results provided by the Formal Concept Analysis. Exhaust experiments are carried out on three real-life datasets to assess the performance of the NBF. Our results prove the NBF's ability to statistically and biologically identify significant biclusters.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129037657","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}
引用次数: 5
Stackelberg Game-Theoretic Approach in Joint Pricing and Assortment Optimizing for Small-Scale Online Retailers: Seller-Buyer Supply Chain Case 小规模在线零售商联合定价与分类优化的Stackelberg博弈论方法:以卖方-买方供应链为例
2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00123
Z. Saberi, O. Hussain, Morteza Saberi, Elizabeth Chang
{"title":"Stackelberg Game-Theoretic Approach in Joint Pricing and Assortment Optimizing for Small-Scale Online Retailers: Seller-Buyer Supply Chain Case","authors":"Z. Saberi, O. Hussain, Morteza Saberi, Elizabeth Chang","doi":"10.1109/AINA.2018.00123","DOIUrl":"https://doi.org/10.1109/AINA.2018.00123","url":null,"abstract":"Assortment planning is one of the fundamental and complex decisions for online retailers. The complexity of this problem is increasing while considering demand and supply uncertainties in assortment planning (AP). However, this leads to more efficient results in today's uncertain markets. In this paper, the supplier and E-tailer interactions are modeled by the non-cooperative game theory model. As small-scale online retailers opposed to bricks and mortar usually have lower power in front of suppliers, we propose a Stackelberg or leader-follower game model. First, the supplier as a leader announces its decisions regarding selling price to the E-tailer. Consequently, the E-tailer reacts by determining the purchase quantity, selling price to the customers and assortment size. Various scenarios are presented and analyzed to show the effectiveness of the Stackelberg game model in simulating the interactions between small-scale online retailers and a powerful supplier.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126080052","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
Efficiency of the TR Technique and the POPS Algorithm for Waveform Optimization in MISO-OFDM Systems 在MISO-OFDM系统中TR技术的效率和POPS算法的波形优化
2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00063
Wafa Khrouf, F. Abdelkefi, M. Siala, M. Crussiére
{"title":"Efficiency of the TR Technique and the POPS Algorithm for Waveform Optimization in MISO-OFDM Systems","authors":"Wafa Khrouf, F. Abdelkefi, M. Siala, M. Crussiére","doi":"10.1109/AINA.2018.00063","DOIUrl":"https://doi.org/10.1109/AINA.2018.00063","url":null,"abstract":"In this paper, we extend the joint use of the Time Reversal (TR) precoding technique and the Ping-Pong Optimized Pulse Shaping (POPS) waveform optimization algorithm to design optimal transmit and receive waveforms for Multiple Input Single Output-Orthogonal Frequency Division Multiplexing (MISO-OFDM) systems. The design process banks on a full characterization of the scattering function of the TR-MISO channel, followed by the implementation of the POPS approach. Numerical analysis reveal a significant gain, brought by the optimized waveforms in TR-MISO-OFDM systems, in terms of Signal to Interference plus Noise Ratio (SINR), compared to the optimized waveforms in TR-SISO-OFDM systems and the PHYDYAS waveform in TR-MISO-OFDM systems.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123702528","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
Design and Implementation of a Hybrid Intelligent System Based on Particle Swarm Optimization, Hill Climbing and Distributed Genetic Algorithm for Node Placement Problem in WMNs: A Comparison Study 基于粒子群优化、爬坡和分布式遗传算法的WMNs节点放置混合智能系统的设计与实现
2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00103
Shinji Sakamoto, Admir Barolli, L. Barolli, M. Takizawa
{"title":"Design and Implementation of a Hybrid Intelligent System Based on Particle Swarm Optimization, Hill Climbing and Distributed Genetic Algorithm for Node Placement Problem in WMNs: A Comparison Study","authors":"Shinji Sakamoto, Admir Barolli, L. Barolli, M. Takizawa","doi":"10.1109/AINA.2018.00103","DOIUrl":"https://doi.org/10.1109/AINA.2018.00103","url":null,"abstract":"The Wireless Mesh Networks (WMNs) have low cost and high speed wireless Internet connectivity, therefore they are becoming an important networking infrastructure. In our previous work, we implemented a hybrid intelligent system based on Particle Swarm Optimization (PSO) and Hill Climbing (HC), called WMN-PSOHC, and a simulation system based on Genetic Algorithm (GA), called WMN-GA, for solving node placement problem in WMNs. In this paper, we implement a new hybrid simulation system based on PSOHC and distributed GA (DGA), called WMN-PSOHC-DGA. We evaluate WMN-PSOHC-DGA system by computer simulations. The simulation results show that the WMN-PSOHC-DGA system has a better performance compared with WMN-PSODGA.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123709809","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}
引用次数: 12
DeMONS: A DDoS Mitigation NFV Solution 恶魔:DDoS缓解NFV解决方案
2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00115
Vinicius Fulber Garcia, Guilherme de Freitas Gaiardo, L. D. C. Marcuzzo, Raul Ceretta Nunes, Carlos Raniery Paula dos Santos
{"title":"DeMONS: A DDoS Mitigation NFV Solution","authors":"Vinicius Fulber Garcia, Guilherme de Freitas Gaiardo, L. D. C. Marcuzzo, Raul Ceretta Nunes, Carlos Raniery Paula dos Santos","doi":"10.1109/AINA.2018.00115","DOIUrl":"https://doi.org/10.1109/AINA.2018.00115","url":null,"abstract":"Distributed Denial of Service (DDoS) attacks become increasingly sophisticated and massive in traffic volume. These attacks can be mainly classified as IP Spoofing or Real Source IP. In special, Real Source IP attacks are characterized by the use of malware-infected hosts to simulate real network traffic. Those attacks are constantly evolving, new and sophisticated infection methods are always being employed by attackers. To deal with such constant change, the research community is always searching for advanced approaches to mitigate, or even eliminate, those threats. One of these new approaches, is the use of Network Function Virtualization (NFV). This new paradigm supports the creation of more scalable and flexible, thus resilient, network infrastructures. We, therefore, propose a DDoS mitigation system - called DeMONS - that uses NFV concept together both a dynamic allocation and a reputation mechanisms. The results demonstrate that the employed techniques are a feasible solution to reach higher utilization rates.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128316345","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 Demand Side Management Using Hybridization of Elephant Herding Optimization and Firefly Optimization 基于象群优化和萤火虫优化的高效需求侧管理
2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00124
Iqra Fatima, Sikandar Asif, Sundas Shafiq, Itrat Fatima, M. H. Rahim, N. Javaid
{"title":"Efficient Demand Side Management Using Hybridization of Elephant Herding Optimization and Firefly Optimization","authors":"Iqra Fatima, Sikandar Asif, Sundas Shafiq, Itrat Fatima, M. H. Rahim, N. Javaid","doi":"10.1109/AINA.2018.00124","DOIUrl":"https://doi.org/10.1109/AINA.2018.00124","url":null,"abstract":"This paper presents a new algorithm to solve the problem of electricity cost reduction by hybridization of two meta-heuristic techniques, i.e., Elephant Herding Optimization (EHO) and Firefly Optimization (FF). A home energy management controller (HEMC), based on scheduling of different household electrical tasks is proposed to maintain balance between load and demand profile. The objective of this study is to determine lowest cost while considering user comfort maximization factor and peak to average ratio (PAR). The proposed algorithm, i.e., Hybrid Elephant and Firefly (HEF) optimization is analyzed comparatively to its' separate implemented versions to evaluate the performance and behavior towards scheduling process. Moreover, three different pricing models are used to calculate the total power consumption rate. Simulation results show that our proposed hybrid optimization technique performs more efficiently to achieve lowest cost and maximum consumer satisfaction.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129588445","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}
引用次数: 4
Energy Consumption for Opportunistic Routing Algorithms in WSN 无线传感器网络中机会路由算法的能量消耗
2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00048
Hajer Ben Fradj, Rajoua Anane, R. Bouallègue
{"title":"Energy Consumption for Opportunistic Routing Algorithms in WSN","authors":"Hajer Ben Fradj, Rajoua Anane, R. Bouallègue","doi":"10.1109/AINA.2018.00048","DOIUrl":"https://doi.org/10.1109/AINA.2018.00048","url":null,"abstract":"Opportunistic routing (OR) is a new paradigm in routing protocol for wireless sensor network (WSN). The OR has aroused wide concern because it can improve the energy consumption and reliability in wireless sensor networks (WSNs), especially if the most sensor nodes are equipped with a limited norechargeable battery power. In this context, performing optimal routing strategy is a crucial task at the network layer of WSN. In this paper, we focus on minimizing energy consumption and enhance the network lifetime. Indeed, we proposed a new opportunistic routing algorithm called ECS-OR (Energy Candidate Set-opportunistic Routing) that permit to balance energy consumption and extend the lifespan of wireless sensor network. Extensive simulations show that our proposed routing strategy ECS-OR can significantly improve the network performance on energy saving and wireless connectivity in comparison with other existing WSN routing schemes.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130862048","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}
引用次数: 10
Time Modeling with NS2 in UHF RFID Anti-Collision Protocols 基于NS2的超高频RFID防撞协议时间建模
2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00016
R. B. Fraj, V. Beroulle, N. Fourty, A. Meddeb
{"title":"Time Modeling with NS2 in UHF RFID Anti-Collision Protocols","authors":"R. B. Fraj, V. Beroulle, N. Fourty, A. Meddeb","doi":"10.1109/AINA.2018.00016","DOIUrl":"https://doi.org/10.1109/AINA.2018.00016","url":null,"abstract":"In UHF RFID systems, many collisions happen due to the numerous tag responses generated by the inventory process. This is a serious worry faced by the RFID technology which can limit RFID system performances. As a matter of fact, the extra identification delays added by these collisions and the extra energy consumed can bring a waste of bandwidth to the interrogation process. Considering these collisions has been identified as a critical task in RFID systems. Indeed, the efficiency of tag identification is related to the performance of the algorithm of anti-collision, which is implemented on the tag and the reader. To evaluate this performance, an RFID module has already been developed in the NS2 Simulator. This NS2 RFID module implements an RFID system based on the Q-Algorithm of EPC global Radio-Frequency Identification Protocols Class1 Generation-2 Standard (EPC C1 Gen2). The focus of this module is the network layer and its mechanisms for anticollision. In this paper, we propose an optimization of the time model of this NS2 RFID module. This optimization is based on the use of several slots time durations. First, we validate our RFID module model by simulation with NS2 and comparison with theoretical results. Secondly, we conduct a performance evaluation of two recent RFID anti-collision algorithms (Q+ and Split Q-Algorithm), evaluate their performances with this novel model and compared them to the Q-Algorithm of the EPC C1 Gen2 standard. By evaluating the performance of these protocols in our RFID module, we validate that the Split Q-Algorithm and the Q+ minimize the Q-Algorithm identification time. Our new model much more realistic in terms of timing can be of great help in further investigating the performance of the Q-Algorithm and for actual UHF RFID systems performance analysis.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129807075","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信