2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)最新文献

筛选
英文 中文
Experimentation of V2X Communication in Real Environment for Road Alert Information Sharing System 道路报警信息共享系统中V2X通信的真实环境实验
Kenta Ito, Go Hirakawa, Y. Shibata
{"title":"Experimentation of V2X Communication in Real Environment for Road Alert Information Sharing System","authors":"Kenta Ito, Go Hirakawa, Y. Shibata","doi":"10.1109/AINA.2016.90","DOIUrl":"https://doi.org/10.1109/AINA.2016.90","url":null,"abstract":"In this paper, we introduce an experimentation of V2X communication in real environment for a road alert information sharing system. Traffic accidents and traffic hazard are serious social problems. Understanding road condition in advance is important and necessary to prevent traffic accidents and traffic hazards. In addition, getting information without Internet connection is necessary to provide road information for drivers in real-time because there is an environment that getting Internet connection is difficult. We construct a road alert information sharing system with multiple vehicles using V2X communication. Our goal is to share road alert information without Internet connection. To realize our goal, we experiment V2X communication in various environments and evaluate experimental results.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125853190","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}
引用次数: 16
A Python Framework for Exhaustive Machine Learning Algorithms and Features Evaluations 穷尽机器学习算法和特征评估的Python框架
Fabien Dubosson, S. Bromuri, M. Schumacher
{"title":"A Python Framework for Exhaustive Machine Learning Algorithms and Features Evaluations","authors":"Fabien Dubosson, S. Bromuri, M. Schumacher","doi":"10.1109/AINA.2016.160","DOIUrl":"https://doi.org/10.1109/AINA.2016.160","url":null,"abstract":"Machine learning domain has grown quickly the last few years, in particular in the mobile eHealth domain. In the context of the DINAMO project, we aimed to detect hypoglycemia on Type 1 diabetes patients by using their ECG, recorded with a sport-like chest belt. In order to know if the data contain enough information for this classification task, we needed to apply and evaluate machine learning algorithms on several kinds of features. We have built a Python toolbox for this reason. It is built on top of the scikit-learn toolbox and it allows evaluating a defined set of machine learning algorithms on a defined set of features extractors, taking care of applying good machine learning techniques such as cross-validation or parameters grid-search. The resulting framework can be used as a first analysis toolbox to investigate the potential of the data. It can also be used to fine-tune parameters of machine learning algorithms or parameters of features extractors. In this paper we explain the motivation of such a framework, we present its structure and we show a case study presenting negative results that we could quickly spot using our toolbox.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122699347","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
Handover Decision in Heterogeneous Networks 异构网络中的切换决策
Sassi Maaloul, Mériem Afif, S. Tabbane
{"title":"Handover Decision in Heterogeneous Networks","authors":"Sassi Maaloul, Mériem Afif, S. Tabbane","doi":"10.1109/AINA.2016.33","DOIUrl":"https://doi.org/10.1109/AINA.2016.33","url":null,"abstract":"The integration of heterogeneous wireless networks allows the mobile users to benefit simultaneously from the radio coverage of different access technologies (RAT: Radio Access Technology) and the diversity of applications. Nowadays, applications are becoming more and more critical in terms of Quality of Service (QoS) and dynamicity. Handover mechanism is responsible of guaranteeing the required quality of service in ubiquitous environment when mobile users roam across different RATs. The diversification of context metrics offered by these different networks has a direct impact on the user perceived quality of service especially during the network selection process. The present work addresses the network selection process, which is the most important stage of the vertical handover decision mechanism. Our proposed algorithm for Vertical Handover decision making is based on the context awareness and the quality of experience (QoE). It integrates the threshold values of sensitive criteria, which are considered as the required metrics in the making decision process used to select the optimal target network. However, we define a decision function that checks the performance of the given networks and identifies the best solution. Performance offered by the chosen network has to be reviewed since the handover is launched to control the quality of service perceived by the end user. Simulation results improve the perceived network performance by avoiding unnecessary handover. In Ubiquitous environment, most Handover decision mechanisms generate a ping pong effect caused by the inefficiency of the network handover metrics which do not consider the required end user performance. As compared to several existing algorithms, our algorithm fits the expected changes in the network performance and the users preferences without wastage of network resources. It reduces the processing delay and the complexity level caused by unnecessary computation over available radio access technologies which do not ensure required connection performance.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127696038","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}
引用次数: 14
Applying Data Mining to Explore Students' Self-Regulation in Learning Contexts 应用数据挖掘探讨学生在学习情境中的自我调节
Chia-Yin Ko, Fang-Yie Leu
{"title":"Applying Data Mining to Explore Students' Self-Regulation in Learning Contexts","authors":"Chia-Yin Ko, Fang-Yie Leu","doi":"10.1109/AINA.2016.123","DOIUrl":"https://doi.org/10.1109/AINA.2016.123","url":null,"abstract":"The theory of self-regulation, which includes cognitive, motivational, and behavioral dimensions, is useful for understanding the relationships between motivations, learning strategies, and the learner in the context of learning. The critical attributes, such as planning, metacognitive monitoring, and self-reflection, provide valuable information to clarify why some students perform better than others. In order to extract significant attributes for successful learners, the supervised learning method is applied to 131 students of Tunghai University in Taiwan. The mining results indicate that successful students normally spend time on the unclear concepts and put more emphasis on difficult learning materials during the course of learning. The findings provide further information for understanding how students deploy their self-regulatory behaviors in the learning contexts.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124435345","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}
引用次数: 2
On Utilizing Static Courier Nodes to Achieve Energy Efficiency with Depth Based Routing for Underwater Wireless Sensor Networks 利用静态信使节点实现水下无线传感器网络基于深度路由的能效研究
Z. Rahman, Z. Ahmad, Amir Murad, Tanveer Khan, Z. Khan, U. Qasim, N. Javaid
{"title":"On Utilizing Static Courier Nodes to Achieve Energy Efficiency with Depth Based Routing for Underwater Wireless Sensor Networks","authors":"Z. Rahman, Z. Ahmad, Amir Murad, Tanveer Khan, Z. Khan, U. Qasim, N. Javaid","doi":"10.1109/AINA.2016.170","DOIUrl":"https://doi.org/10.1109/AINA.2016.170","url":null,"abstract":"Under water sensor networks(UWSNs) have attracted significantly to explore natural and undersea resources and gathering scientific data in aqueous conditions. The adverse characteristics in UWSNs communication and high cost limit the sensor nodes to spare deployment, causing delay, low propagation, power efficiency and floating node mobility. This proposed protocol is developed to handle these problems in under water sensor networks, two static sinks and four courier nodes are used to perform routing. Sensor nodes select their appropriate nearby static courier node to forward their data towards destination. Courier nodes have maximum energy, as compare to sensor nodes causing to enhance the network life time and provide equal distribution of energy consumption resulting to provide maximum throughput and stability of the network. Network field is hundred by hundred and providing maximum rounds through which we can closely over view the network life time, energy efficiency and throughput. Simulation results show maximum packet delivery per round. Courier nodes have maximum energy so the maximum routing will be performed by the courier nodes and sensor nodes will only sense their data and forward it to courier nodes causing to minimize the destabilization period of the network. Simulation results provide maximum throughput, minimum dead versus alive nodes and equal energy consumption per round.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"33 4 Pt 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132601763","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
Dynamic Street-Parking Optimisation 动态街道停车优化
Nuria Pazos, Michael Müller, M. Favre-Bulle, Kilian Brandt-Dit-Grieurin, Oliver Hüsser, M. Aeberli, N. Ouerhani
{"title":"Dynamic Street-Parking Optimisation","authors":"Nuria Pazos, Michael Müller, M. Favre-Bulle, Kilian Brandt-Dit-Grieurin, Oliver Hüsser, M. Aeberli, N. Ouerhani","doi":"10.1109/AINA.2016.171","DOIUrl":"https://doi.org/10.1109/AINA.2016.171","url":null,"abstract":"An instrument to improve the quality of life in large cities, helping to reduce the car traffic, is presented in this paper. It will result in a mobile guidance software that will help the drivers looking for a parking place to find it efficiently. SmartPark relies on available parking information systems, as well as on new sensors or even on social data inputs. A fixed magnetic on-street sensor and a video processing smart camera have been developed and prototypes of both devices were tested. Their data is available through a cloud-based Internet of Things infrastructure and continuously updated every few seconds. Databases will be built over time enabling data mining methods to infer parking availability models over time which will be used, eventually, by the algorithms feeding the mobile application.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133757683","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
An Opportunistic Void Avoidance Routing Protocol for Underwater Sensor Networks 水下传感器网络的机会回避空路由协议
S. Ghoreyshi, A. Shahrabi, T. Boutaleb
{"title":"An Opportunistic Void Avoidance Routing Protocol for Underwater Sensor Networks","authors":"S. Ghoreyshi, A. Shahrabi, T. Boutaleb","doi":"10.1109/AINA.2016.96","DOIUrl":"https://doi.org/10.1109/AINA.2016.96","url":null,"abstract":"An Underwater Sensor Network (UWSN) has many unique features that makes it different from terrestrial network. This includes lower bandwidth, longer propagation delay, dynamic topology, high error rate, and energy constraint. To overcome the limitations of such an environment, opportunistic routing has recently attracted much attention due to its ability to improve the performance of UWSNs in terms of packet delivery ratio and energy saving. With the aid of opportunistic data routing, underwater sensors can collaboratively route a packet towards the destination which is a more adequate approach for sparse and lossy channels. In this paper, we propose a new routing protocol, called Opportunistic Void Avoidance Routing (OVAR), to address the void problem and high bit error rate without relying on any positioning system. OVAR is able to efficiently bypass all kinds of void areas with the lowest possible cost (including energy and delay) while prioritising the group of candidate nodes with the highest packet advancement. Given the density of neighbours (sparse or dense), each forwarding node is able to hold a trade-off between packet advancement and energy consumption by adjusting the number of nodes in its forwarding set. OVAR is also able to select the forwarding set in any direction from the sender without including any hidden node. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of packet delivery ratio, energy consumption, and average end-to-end delay.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124442944","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}
引用次数: 33
EDR: An Encounter and Distance Based Routing Protocol for Opportunistic Networks 机会网络中基于相遇和距离的路由协议
S. K. Dhurandher, S. J. Borah, I. Woungang, D. Sharma, Kunal Arora, Divyansh Agarwal
{"title":"EDR: An Encounter and Distance Based Routing Protocol for Opportunistic Networks","authors":"S. K. Dhurandher, S. J. Borah, I. Woungang, D. Sharma, Kunal Arora, Divyansh Agarwal","doi":"10.1109/AINA.2016.15","DOIUrl":"https://doi.org/10.1109/AINA.2016.15","url":null,"abstract":"In an Opportunistic Network (Oppnet), the transmission of messages between mobile devices is achieved in a store-carry-and-forward fashion since nodes store the incoming messages in their buffer and wait until a suitable next hop node is encountered that can carry the message closer to the destination. In such environment, due to the delay-tolerant nature of the network, designing a routing protocol is a challenge. This paper proposes a novel routing protocol called Encounter and Distance based Routing (EDR), which utilizes the so-called forward parameter to determine the next hop selection. This parameter is calculated by taking into account the number of encounters and the distance of each node in the network with respect to a particular destination. Simulation results are provided, showing the superiority of EDR over the History based Prediction for Routing (HBPR) protocol and the ProWait protocol, chosen as benchmark schemes, in terms of hop count, messages dropped, and average latency.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116028553","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}
引用次数: 37
Research on Never Die Network for Disaster Prevention Based on OpenFlow and Cognitive Wireless Technology 基于OpenFlow和认知无线技术的防灾永不死网络研究
Goshi Sato, Noriki Uchida, N. Shiratori, Y. Shibata
{"title":"Research on Never Die Network for Disaster Prevention Based on OpenFlow and Cognitive Wireless Technology","authors":"Goshi Sato, Noriki Uchida, N. Shiratori, Y. Shibata","doi":"10.1109/AINA.2016.120","DOIUrl":"https://doi.org/10.1109/AINA.2016.120","url":null,"abstract":"By large tsunami damage due to the Great East Japan Earthquake, many existing network system stopped functioning in various factors. Even under such circumstances, some of the information communication method that including satellite communications, it was able to recover the Network Connectivity, actually quickly and effectively. Although there are some valid information communicating method in disaster, however the information communication method has a strong and weak points, when using each a single unit, it is not possible to follow the disaster area of the situations to be constantly changing. In addition, the emergency information communication system there may not be available in the battery out and do not know how to use in case of emergency. Therefore, it is important to design a systems available without a disaster by providing enough Network Capability. We develop a Never Die Network (NDN) system that is a new network system to achieve both the Network Capability in the normal and Network Connectivity in disaster based on the experience of Great East Japan Earthquake. In this paper, we propose a method for the system to autonomously derive the optimum packet flow by measuring the communication state such as throughput and packet loss in a system such as to considering multiple different access networks. We prepared a test bed that implements a prototype system, and evaluated based on a disaster scenario.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122559293","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
A GA-Based Simulation System for WMNs: Performance Analysis of WMN-GA System for Different WMN Architectures and Uniform Distribution Considering DCF and EDCA 基于遗传算法的WMN仿真系统:考虑DCF和EDCA的不同结构和均匀分布的WMN- ga系统性能分析
I. Shinko, Tetsuya Oda, Evjola Spaho, Admir Barolli, Vladi Koliçi, L. Barolli
{"title":"A GA-Based Simulation System for WMNs: Performance Analysis of WMN-GA System for Different WMN Architectures and Uniform Distribution Considering DCF and EDCA","authors":"I. Shinko, Tetsuya Oda, Evjola Spaho, Admir Barolli, Vladi Koliçi, L. Barolli","doi":"10.1109/AINA.2016.145","DOIUrl":"https://doi.org/10.1109/AINA.2016.145","url":null,"abstract":"Wireless Mesh Networks (WMNs) are attracting a lot of attention from wireless network researchers. Node placement problems have been investigated for a long time in the optimization field due to numerous applications in location science. In this paper, we evaluate the performance of two WMN architectures considering throughput, delay, jitter and fairness index metrics. For simulations, we used ns-3 and Optimized Link State Routing (OLSR). We compare the performance for Distributed Coordination Function (DCF) and Enhanced Distributed Channel Access (EDCA) for uniform distribution of mesh clients by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for I/B WMN, the throughput of EDCA is a little bit higher than Hybrid WMN. However, for Hybrid WMN, the throughput of DCF is higher than EDCA. The delay and jitter of both architectures are almost the same. However, in the case of DCF for 20 flows, the delay and jitter of I/B WMN is a lower compared with Hybrid WMN. The fairness index of 10 flows is higher than other flows for both WMN architectures.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122975194","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
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学术文献互助群
群 号:481959085
Book学术官方微信