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

Graph Colouring MAC Protocol for Underwater Sensor Networks 水下传感器网络的图形着色MAC协议

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-08-13 DOI: 10.1109/AINA.2018.00030

Faisal Alfouzan, A. Shahrabi, S. Ghoreyshi, T. Boutaleb

{"title":"Graph Colouring MAC Protocol for Underwater Sensor Networks","authors":"Faisal Alfouzan, A. Shahrabi, S. Ghoreyshi, T. Boutaleb","doi":"10.1109/AINA.2018.00030","DOIUrl":"https://doi.org/10.1109/AINA.2018.00030","url":null,"abstract":"Employing contention-based MAC protocols in underwater sensor networks are typically costly. This is mainly due to the unique characteristics of its acoustic channels such as long propagation delay, high bit error rate, and limited bandwidth. As a consequence, handshake-based and random access-based MAC protocols do not perform as well as expected. The collision-free approach is therefore considered to achieve a better performance by efficiently addressing spatial-temporal uncertainty, hidden/exposed terminal problems, and near-far effect at MAC layer, thus collisions and retransmissions are properly avoided in order to reduce the energy cost and also to improve the throughput and fairness across the network. In this paper, we propose a novel energy-conserving and collision-free graph colouring MAC protocol, called GC-MAC, for UWSNs. It employs a TDMA-like principle by assigning separate time slots to every individual colour in the network. Nodes with the same colours can thus transmit concurrently without any collision. GC-MAC also does not require CDMA or power adjustment for collision resolution. Our extensive simulation study reveals that our proposed protocol can efficiently handle the traffic contention to achieve significant improvement in terms of throughput, energy consumption, and fairness index under varying offered loads.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129271045","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}

引用次数: 13

An Efficient AUV-Aided Data Collection in Underwater Sensor Networks 水下传感器网络中高效的auv辅助数据采集

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-08-13 DOI: 10.1109/AINA.2018.00051

S. Ghoreyshi, A. Shahrabi, T. Boutaleb

{"title":"An Efficient AUV-Aided Data Collection in Underwater Sensor Networks","authors":"S. Ghoreyshi, A. Shahrabi, T. Boutaleb","doi":"10.1109/AINA.2018.00051","DOIUrl":"https://doi.org/10.1109/AINA.2018.00051","url":null,"abstract":"From the view of routing protocols in Underwater Sensor Networks (UWSNs), mobile data-gathering mechanisms using Autonomous Underwater Vehicle (AUV) have received significant attention because of data collection capability via short-range communications. In this paper, a new Cluster-based AUV-aided Data Collection scheme (CADC) for large-scale UWSNs is proposed to make a trade-off between energy saving and data gathering latency. Our scheme consists of three phases: discovery phase, clustering phase, and data gathering phase. Neighbouring information is exchanged and then collected by AUV during the discovery phase. The collected information is used in the clustering phase in order to determine the cluster heads and members. Then, the AUV tour is planned such that all cluster heads are visited while shortening the tour length of the AUV. To cluster the sensors and cover their heads with the shortest possible tour, we first propose an optimal algorithm to find the global optimal solution, and then propose an efficient algorithm to obtain the near-optimal solution in the less computational time. CADC is scalable and also applicable in both connected and disconnected networks. In terms of energy-latency trade-off, CADC can effectively keep the tour length short while prolonging the network lifetime compared to those of mobile data-gathering approaches. The effectiveness of CADC is validated through an extensive simulation study which reveals the performance improvement in the packet delivery ratio, energy saving, and data gathering latency.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116159477","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}

引用次数: 17

Exploring Textures in Traffic Matrices to Classify Data Center Communications 探索流量矩阵中的纹理以分类数据中心通信

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-08-09 DOI: 10.1109/AINA.2018.00161

Celio Trois, L. C. E. Bona, Luiz Oliveira, M. Martinello, D. Harewood-Gill, Marcos Didonet Del Fabro, R. Nejabati, D. Simeonidou, J. C. D. Lima, B. Stein

{"title":"Exploring Textures in Traffic Matrices to Classify Data Center Communications","authors":"Celio Trois, L. C. E. Bona, Luiz Oliveira, M. Martinello, D. Harewood-Gill, Marcos Didonet Del Fabro, R. Nejabati, D. Simeonidou, J. C. D. Lima, B. Stein","doi":"10.1109/AINA.2018.00161","DOIUrl":"https://doi.org/10.1109/AINA.2018.00161","url":null,"abstract":"Data analytics and scientific computing are two modern applications that in recent years have substantially changed their computation and communication needs, requiring additional processing capability and bandwidth to be able to keep pace with current demands. These applications are commonly processed within data centers, exchanging enormous volumes of data, rapidly stressing existing network infrastructures. Thus, it is crucial for data center operations and management to be able to understand and classify the communication demands of these applications. The traditional approaches for classifying application traffic are port-based and Deep Packet Inspection, both presenting issues with current network technology. Some recent works propose using machine learning plus statistical information collected from application flows to classify traffic. Applications running in data centers present communication patterns which can be recognized through their traffic matrices. So, the main contribution of this paper is a method that explores the textural information extracted from these matrices to classify the data center traffic using machine learning techniques. As a proof-of-concept, we implemented this method in a system named DCTraCS. The experimental dataset was gathered from two real data centers, collecting the traffic matrices of MapReduce and a set of scientific applications every second for a period of 30 minutes. For assessing our proposal, we compared it with other machine learning techniques for classifying application traffic found in current literature. Results show that our approach achieved the highest accuracy, classifying correctly over 99% of our data center applications.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124081915","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

Distributed Mobility Management (DMM) Using the Software Defined Network (SDN)-Based Backward Fast Handover (SBF-DMM) Method 基于软件定义网络(SDN)的后向快速切换(SBF-DMM)方法的分布式移动管理(DMM

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-08-09 DOI: 10.1109/AINA.2018.00079

Chung-Ming Huang, Duy-Tuan Dao, Meng-Shu Chiang

{"title":"Distributed Mobility Management (DMM) Using the Software Defined Network (SDN)-Based Backward Fast Handover (SBF-DMM) Method","authors":"Chung-Ming Huang, Duy-Tuan Dao, Meng-Shu Chiang","doi":"10.1109/AINA.2018.00079","DOIUrl":"https://doi.org/10.1109/AINA.2018.00079","url":null,"abstract":"Distributed mobility management (DMM) is designed for flattening the network architecture to resolve the problems, e.g., scalability, non-optimal path, and reliability issues, existed in mobile Internet's mobility management. Although Software Defined Network (SDN) has been applied to DMM to enhance the performance of existed DMM-based schemes, the current mobility management schemes still suffer the high signaling cost and handover latency. In this paper, a Software Defined Network (SDN)-based Backward Fast Handover (SBF-DMM) method that can let MN have the higher chance of being in the predictive mode, which can finish the handover preparation processing before MN disconnecting from the current Mobility Anchor and Access Router's (MAAR's) domain, was proposed. Furthermore, SBF-DMM also can support sub-optimal routing through the help of the SDN Controller. To evaluate and verify the proposed method, an analytical model was devised. The performance analysis has shown that the proposed SBF-DMM has the better handover performance than the other methods in terms of signaling overhead, average handover latency and packets loss.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130440495","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

Risk of Re-identification from Payment Card Histories in Multiple Domains 从多个领域的支付卡历史中重新识别的风险

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-08-09 DOI: 10.1109/AINA.2018.00137

Satoshi Ito, Reo Harada, Hiroaki Kikuchi

{"title":"Risk of Re-identification from Payment Card Histories in Multiple Domains","authors":"Satoshi Ito, Reo Harada, Hiroaki Kikuchi","doi":"10.1109/AINA.2018.00137","DOIUrl":"https://doi.org/10.1109/AINA.2018.00137","url":null,"abstract":"Anonymization is the process of modifying a data set to prevent the identification of individual people from the data. However, most studies consider only the anonymization of data from a single domain. No study has been made on the risk of re-identification from combined data sets involving more than one domain. This paper proposes an evaluation of the risk of re-identification from payment card histories in multiple domains. First, we model the correlation between two histories from different usage domains in terms of information entropy and use mutual information to quantify the risk of identification from the data. Second, we describe an experiment to evaluate the risk in payment card data. The results validated the proposed method for real payment card data from 31 subjects. Metrics for the privacy and utility of 47 anonymized data items were evaluated. Overall, we found that there was a correlation between the histories of transportation and item purchases stored in the payment card data and established that most (44 of 47) of the anonymized data enabled correct identification with more than 45% accuracy for any privacy metric. This indicates that the risk of re-identification from payment card data is very high.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124839805","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

Distributed User-Based Collaborative Filtering on an Opportunistic Network 机会网络中基于用户的分布式协同过滤

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00049

L. Barbosa, Jonathan F. Gemmell, Miller Horvath, T. Heimfarth

{"title":"Distributed User-Based Collaborative Filtering on an Opportunistic Network","authors":"L. Barbosa, Jonathan F. Gemmell, Miller Horvath, T. Heimfarth","doi":"10.1109/AINA.2018.00049","DOIUrl":"https://doi.org/10.1109/AINA.2018.00049","url":null,"abstract":"This paper presents a novel collaborative filtering recommender system based on an opportunistic distributed network. Collaborative filtering algorithms are widely used in many online systems. Often, the computation of these recommender systems is performed on a central server, controlled by the provider, requiring constant internet connection for gathering and computing data. However, in many scenarios, such constraints cannot be guaranteed or may not even be desired. This work proposes a recommendation engine where users share information via an opportunistic network independent of a dedicated internet connection. In this framework, each node is responsible for gathering information from nearby nodes and calculating its own recommendations. Using a centralized collaborative filtering recommender as a baseline, we evaluate three simulated scenarios composed by different movement speeds and data exchange parameters. Our results show that in a relatively short time, an opportunistic distributed recommender systems can achieve results similar to a traditional central system. Our analysis shows that the speed at which the opportunistic recommender system stabilizes depends on several factors including density of the users, movement speed and patterns of the users, and transmission strategies.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"19 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":"117019975","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

Home Energy Management in Smart Grid Using Evolutionary Algorithms 基于进化算法的智能电网家庭能源管理

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00154

A. Saboor, N. Javaid, Z. Iqbal, Z. Abbas, A. Khan, Saad Rashid, M. Awais

引用次数: 6

Formal Verification of Temporal Constraints and Allocated Cloud Resources in Business Processes 业务流程中时间约束和已分配云资源的形式化验证

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00139

Rania Ben Halima, Imen Zouaghi, Slim Kallel, Walid Gaaloul, M. Jmaiel

{"title":"Formal Verification of Temporal Constraints and Allocated Cloud Resources in Business Processes","authors":"Rania Ben Halima, Imen Zouaghi, Slim Kallel, Walid Gaaloul, M. Jmaiel","doi":"10.1109/AINA.2018.00139","DOIUrl":"https://doi.org/10.1109/AINA.2018.00139","url":null,"abstract":"Cloud environments offer an interesting infrastructure for any modern enterprise information systems due to their high performance and low operating cost. Cloud resources are offered in various pricing strategies based on temporal properties. In general, enterprises looking towards minimizing their spending on IT infrastructure find such pricing strategies very attractive to deploy and run their business processes. Nevertheless, due to the lack of explicit and formal description of (Cloud) resources in existing business processes modeling languages, such as BPMN, Cloud resources can not be correctly allocated. Therefore, we elaborate an extension to BPMN 2.0 to fully integrate (Cloud) resource perspective, especially the temporal properties of Cloud pricing strategies in business process model. In order to help the designer to allocate correctly the required Cloud resources, we propose an automatic generation of timed automata from this BPMN extensions to check the matching between both temporal constraints: activities and Cloud resources. To show its feasibility, our approach has been implemented and tested using a real use case from an industrial partner.","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":"129841345","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}

引用次数: 11

NIEP: NFV Infrastructure Emulation Platform NFV基础设施仿真平台

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00037

Thales Nicolai Tavares, L. D. C. Marcuzzo, Vinicius Fulber Garcia, G. Souza, M. Franco, Lucas Bondan, F. Turck, L. Granville, E. P. Duarte, C. R. P. D. Santos, A. E. S. Filho

{"title":"NIEP: NFV Infrastructure Emulation Platform","authors":"Thales Nicolai Tavares, L. D. C. Marcuzzo, Vinicius Fulber Garcia, G. Souza, M. Franco, Lucas Bondan, F. Turck, L. Granville, E. P. Duarte, C. R. P. D. Santos, A. E. S. Filho","doi":"10.1109/AINA.2018.00037","DOIUrl":"https://doi.org/10.1109/AINA.2018.00037","url":null,"abstract":"Network Functions Virtualization (NFV) presents several advantages over traditional network architectures, such as flexibility, security, and reduced CAPEX/OPEX. However, virtualizing network functions usually executed on specialized hardware (e.g., firewall, DPI, load balancer) and employing innovative technologies (e.g., OpenFlow, P4) increases the challenges of designing, testing, and deploying network infrastructures and services. Although platforms for prototyping NFV environments have emerged in recent years, they still present limitations that hinder the evaluation of specific NFV scenarios, such as fog computing and heterogeneous networks. In this paper, we present NIEP: a platform for designing and testing NFV-based infrastructures and Virtualized Network Functions (VNFs) through the integration of a well-known network emulator (Mininet) and a novel platform for Click-based VNFs development (Click-on- OSv). NIEP provides a complete NFV emulation environment, allowing network operators to test their solutions in a controlled scenario prior to deployment in production networks. As main advantages, NIEP allows the emulation of heterogeneous scenarios, which can be easily migrated to production environments. An experimental scenario is defined to analyze NIEP's performance in terms of VNFs boot time and throughput. Further, NIEP's advantages and shortcomings are discussed and compared to existing emulation platforms.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"4 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":"134551492","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

Rope Deployment Method for Ropeway-Type Vermin Detection Systems 索道式害虫探测系统的绳索展开方法

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00060

Kodai Ogura, Kei Nihonyanagi, R. Katsuma

{"title":"Rope Deployment Method for Ropeway-Type Vermin Detection Systems","authors":"Kodai Ogura, Kei Nihonyanagi, R. Katsuma","doi":"10.1109/AINA.2018.00060","DOIUrl":"https://doi.org/10.1109/AINA.2018.00060","url":null,"abstract":"In recent years, damage to rural areas by vermin such as deer, wild boars or monkeys has increased in both frequency and severity. This problem is expected to be counteracted by wireless sensor networks constructed from multiple sensor nodes with wireless communication devices. These systems reduce the damage by detecting vermin and repelling them by signals such as sounds and light. However, owing to their fixed monitoring cameras, general monitoring systems cannot always cope with plant growth and other obscurations that decrease the monitored area. This paper proposes a ropeway-type vermin detection system that moves the monitoring cameras on ropes, and a method that minimizes the number of required ropes in the expected monitoring scenario. For efficient monitoring with as few cameras as possible, the method groups several target areas into one by a clustering procedure. The grouped area can then be monitored from a single position. Subsequently, our algorithm finds the most efficient rope deployment that completely monitors the grouped areas. In simulations, the proposed method monitored all target areas with 26% fewer monitoring cameras than a general clustering method (k-means clustering).","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"151 3 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":"131078007","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