In this paper, we study the issue of optimizing transmission power (energy per symbol) for minimizing the expected energy required to deliver a frame to the destination node in a point-to-point link employing an automatic repeat request (ARQ) scheme over a fading channel. We derive the expected energy as a function of the transmission power and derive a simple optimization algorithm based on the properties of this function.
{"title":"Optimizing Bit Transmission Power for Link Layer Energy Efficiency","authors":"A. Ghanavati, D. Lee","doi":"10.1109/WAINA.2014.119","DOIUrl":"https://doi.org/10.1109/WAINA.2014.119","url":null,"abstract":"In this paper, we study the issue of optimizing transmission power (energy per symbol) for minimizing the expected energy required to deliver a frame to the destination node in a point-to-point link employing an automatic repeat request (ARQ) scheme over a fading channel. We derive the expected energy as a function of the transmission power and derive a simple optimization algorithm based on the properties of this function.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125182279","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}
This paper presents the results of our analysis of the film selection process for a film festival. The selection of films characterises the festival, which then attracts audiences. Although the criteria for selection are fundamentally decided by members of the selection committee, we investigate if computation can characterise the selection process by utilising available data in this study. Selections are made by watching films and not by checking the associated information. However, considering the difficulties in semantically understanding the video content for computers, we attempted the analysis of the selection process based solely on associated information, including textual, numerical, or categorical data. Results of the analysis revealed factors that may affect the outcome of the selection.
{"title":"Analysis of the Film Selection Process for a Film Festival","authors":"Masashi Inoue, Sakie Sakuma","doi":"10.1109/WAINA.2014.96","DOIUrl":"https://doi.org/10.1109/WAINA.2014.96","url":null,"abstract":"This paper presents the results of our analysis of the film selection process for a film festival. The selection of films characterises the festival, which then attracts audiences. Although the criteria for selection are fundamentally decided by members of the selection committee, we investigate if computation can characterise the selection process by utilising available data in this study. Selections are made by watching films and not by checking the associated information. However, considering the difficulties in semantically understanding the video content for computers, we attempted the analysis of the selection process based solely on associated information, including textual, numerical, or categorical data. Results of the analysis revealed factors that may affect the outcome of the selection.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127758433","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}
Gustavo Furquim, Filipe Neto, G. Pessin, J. Ueyama, J. Albuquerque, M. C. Fava, E. Mendiondo, V. C. B. Souza, D. Dimitrova, T. Braun
This paper addresses an investigation with machine learning (ML) classification techniques to assist in the problem of flash flood now casting. We have been attempting to build a Wireless Sensor Network (WSN) to collect measurements from a river located in an urban area. The machine learning classification methods were investigated with the aim of allowing flash flood now casting, which in turn allows the WSN to give alerts to the local population. We have evaluated several types of ML taking account of the different now casting stages (i.e. Number of future time steps to forecast). We have also evaluated different data representation to be used as input of the ML techniques. The results show that different data representation can lead to results significantly better for different stages of now casting.
{"title":"Combining Wireless Sensor Networks and Machine Learning for Flash Flood Nowcasting","authors":"Gustavo Furquim, Filipe Neto, G. Pessin, J. Ueyama, J. Albuquerque, M. C. Fava, E. Mendiondo, V. C. B. Souza, D. Dimitrova, T. Braun","doi":"10.1109/WAINA.2014.21","DOIUrl":"https://doi.org/10.1109/WAINA.2014.21","url":null,"abstract":"This paper addresses an investigation with machine learning (ML) classification techniques to assist in the problem of flash flood now casting. We have been attempting to build a Wireless Sensor Network (WSN) to collect measurements from a river located in an urban area. The machine learning classification methods were investigated with the aim of allowing flash flood now casting, which in turn allows the WSN to give alerts to the local population. We have evaluated several types of ML taking account of the different now casting stages (i.e. Number of future time steps to forecast). We have also evaluated different data representation to be used as input of the ML techniques. The results show that different data representation can lead to results significantly better for different stages of now casting.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124356347","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}
Biometrics is a field in which very little progress has been made since it was first established. One of the major milestones in the field was the introduction of the multi-modal biometrics concept which uses a multi-factor authentication method. In this method, multiple factors are being authenticated as opposed to a single factor in the 'classic' unimodal biometric systems. This paper proposes an extension to the multi-modal biometrics concept to check for individuals' consent or intent to authenticate. It does that by checking certain physiological characteristics during authentication together with the classic biometric traits of fingerprints, iris etc. This additional physiological measurement will indicate whether the user authenticating is doing so without consent or whether the authentication is done with mal intentions.
{"title":"Intent Biometrics: An Enhanced Form of Multimodal Biometric Systems","authors":"Erez Gilady, Dale Lindskog, S. Aghili","doi":"10.1109/WAINA.2014.133","DOIUrl":"https://doi.org/10.1109/WAINA.2014.133","url":null,"abstract":"Biometrics is a field in which very little progress has been made since it was first established. One of the major milestones in the field was the introduction of the multi-modal biometrics concept which uses a multi-factor authentication method. In this method, multiple factors are being authenticated as opposed to a single factor in the 'classic' unimodal biometric systems. This paper proposes an extension to the multi-modal biometrics concept to check for individuals' consent or intent to authenticate. It does that by checking certain physiological characteristics during authentication together with the classic biometric traits of fingerprints, iris etc. This additional physiological measurement will indicate whether the user authenticating is doing so without consent or whether the authentication is done with mal intentions.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133299170","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}
Krishna Doddapaneni, Fredrick A. Omondi, E. Ever, P. Shah, O. Gemikonakli, R. Gagliardi
Clustering techniques for wireless sensor networks (WSNs) have been extensively studied and proven to improve the network lifetime, a primary metric, used for performance evaluation of sensor networks. Although introduction of clustering techniques has the potential to reduce energy consumption and extend the lifetime of the network by decreasing the contention through either power control or node scheduling, scalability remains an issue. Therefore, the optimality of the cluster size still needs to be thoroughly investigated. In this paper, a single cluster head (CH) queuing model is presented. Using an event based simulation tool (Castalia), key issues that affect the practical deployment of clustering techniques in wireless sensor networks are analysed. These include identifying the bottlenecks in terms of cluster scalability and predicting the nature of data packets arrival distribution at the CH. Results presented show that this analysis can be used to specify the size of a cluster, when a specific flow of data is expected from the sensing nodes based on a particular application and also the distribution of the inter-arrival times of data packets at the CH follows exponential distribution.
{"title":"Deployment Challenges and Developments in Wireless Sensor Networks Clustering","authors":"Krishna Doddapaneni, Fredrick A. Omondi, E. Ever, P. Shah, O. Gemikonakli, R. Gagliardi","doi":"10.1109/WAINA.2014.46","DOIUrl":"https://doi.org/10.1109/WAINA.2014.46","url":null,"abstract":"Clustering techniques for wireless sensor networks (WSNs) have been extensively studied and proven to improve the network lifetime, a primary metric, used for performance evaluation of sensor networks. Although introduction of clustering techniques has the potential to reduce energy consumption and extend the lifetime of the network by decreasing the contention through either power control or node scheduling, scalability remains an issue. Therefore, the optimality of the cluster size still needs to be thoroughly investigated. In this paper, a single cluster head (CH) queuing model is presented. Using an event based simulation tool (Castalia), key issues that affect the practical deployment of clustering techniques in wireless sensor networks are analysed. These include identifying the bottlenecks in terms of cluster scalability and predicting the nature of data packets arrival distribution at the CH. Results presented show that this analysis can be used to specify the size of a cluster, when a specific flow of data is expected from the sensing nodes based on a particular application and also the distribution of the inter-arrival times of data packets at the CH follows exponential distribution.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114867530","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}
The Domain Name System (DNS) is widely seen as a vital protocol of the modern Internet. For example, popular services like load balancers and Content Delivery Networks heavily rely on DNS. Because of its important role, DNS is also a desirable target for malicious activities such as spamming, phishing, and botnets. To protect networks against these attacks, a number of DNS-based security approaches have been proposed. The key insight of our study is to measure the effectiveness of security approaches that rely on DNS in large-scale networks. For this purpose, we answer the following questions, How often is DNS used? Are most of the Internet flows established after contacting DNS? In this study, we collected data from the University of Auckland campus network with more than 33,000 Internet users and processed it to find out how DNS is being used. Moreover, we studied the flows that were established with and without contacting DNS. Our results show that less than 5 percent of the observed flows use DNS. Therefore, we argue that those security approaches that solely depend on DNS are not sufficient to protect large-scale networks.
{"title":"Effectiveness of DNS-Based Security Approaches in Large-Scale Networks","authors":"M. Janbeglou, H. Naderi, N. Brownlee","doi":"10.1109/WAINA.2014.87","DOIUrl":"https://doi.org/10.1109/WAINA.2014.87","url":null,"abstract":"The Domain Name System (DNS) is widely seen as a vital protocol of the modern Internet. For example, popular services like load balancers and Content Delivery Networks heavily rely on DNS. Because of its important role, DNS is also a desirable target for malicious activities such as spamming, phishing, and botnets. To protect networks against these attacks, a number of DNS-based security approaches have been proposed. The key insight of our study is to measure the effectiveness of security approaches that rely on DNS in large-scale networks. For this purpose, we answer the following questions, How often is DNS used? Are most of the Internet flows established after contacting DNS? In this study, we collected data from the University of Auckland campus network with more than 33,000 Internet users and processed it to find out how DNS is being used. Moreover, we studied the flows that were established with and without contacting DNS. Our results show that less than 5 percent of the observed flows use DNS. Therefore, we argue that those security approaches that solely depend on DNS are not sufficient to protect large-scale networks.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"296 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121719049","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}
Live migration of virtual machines (VMs) enables the transfer of a running VM to a new hardware component with minimal and hardly noticeable interruption. It is an important feature of virtualization technology for maintenance, load-balancing and energy reduction, especially for data centers operators and cluster service providers. Recently, virtualization started to find its way into enterprise environments such as large and medium-sized IT companies. However, no feasibility study to highlight the pros and cons of such a trend has been conducted yet. In particular, a seamless live migration requires a reliable network connection and will have an impact on the network infrastructure. Therefore, this paper describes the design and set-up of our test bed to simulate a realistic implementation of virtualization in an enterprise environment. We tested three different scenarios of live migration and checked the impact of each scenario on the network infrastructure. Based on the implementation results, the paper introduces a list of recommendations for IT companies which might be interested in implementing virtualization and live migration.
{"title":"Investigating the Impact of Live Migration on the Network Infrastructure in Enterprise Environments","authors":"Jose Sinti, F. Jiffry, Mahdi Aiash","doi":"10.1109/WAINA.2014.34","DOIUrl":"https://doi.org/10.1109/WAINA.2014.34","url":null,"abstract":"Live migration of virtual machines (VMs) enables the transfer of a running VM to a new hardware component with minimal and hardly noticeable interruption. It is an important feature of virtualization technology for maintenance, load-balancing and energy reduction, especially for data centers operators and cluster service providers. Recently, virtualization started to find its way into enterprise environments such as large and medium-sized IT companies. However, no feasibility study to highlight the pros and cons of such a trend has been conducted yet. In particular, a seamless live migration requires a reliable network connection and will have an impact on the network infrastructure. Therefore, this paper describes the design and set-up of our test bed to simulate a realistic implementation of virtualization in an enterprise environment. We tested three different scenarios of live migration and checked the impact of each scenario on the network infrastructure. Based on the implementation results, the paper introduces a list of recommendations for IT companies which might be interested in implementing virtualization and live migration.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121366898","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}
With the emergence of machine-to-machine (M2M) communications, huge numbers of devices have been connected and massive amounts of traffic are exchanged. However, since M2M applications typically generate packets of very small size, the number of incoming packets is becoming larger than the maximum number of packets that a router can handle per second, and network throughput is decreased. That is, network resources cannot be used efficiently. Therefore, the M2M cloud network operator makes chunks of these small packets, but a waiting time for chunking is inevitable, and thus application requirements may not be satisfied. This paper proposes new packet chunking schemes to both meet the QoS application requirement and improve the router's achievable throughput. The proposed schemes need multiple buffers and then classify the arrival packets to one buffer based on their acceptable waiting time. After that, the chunk packet is made based on an attribute of each packet to meet the application requirements. Through simulation experiments, we showed that the proposed scheme attains excellent performance even in cases of overloaded and imbalanced traffic.
{"title":"QoS-Aware Packet Chunking Schemes for M2M Cloud Services","authors":"Anan Sawabe, K. Tsukamoto, Y. Oie","doi":"10.1109/WAINA.2014.36","DOIUrl":"https://doi.org/10.1109/WAINA.2014.36","url":null,"abstract":"With the emergence of machine-to-machine (M2M) communications, huge numbers of devices have been connected and massive amounts of traffic are exchanged. However, since M2M applications typically generate packets of very small size, the number of incoming packets is becoming larger than the maximum number of packets that a router can handle per second, and network throughput is decreased. That is, network resources cannot be used efficiently. Therefore, the M2M cloud network operator makes chunks of these small packets, but a waiting time for chunking is inevitable, and thus application requirements may not be satisfied. This paper proposes new packet chunking schemes to both meet the QoS application requirement and improve the router's achievable throughput. The proposed schemes need multiple buffers and then classify the arrival packets to one buffer based on their acceptable waiting time. After that, the chunk packet is made based on an attribute of each packet to meet the application requirements. Through simulation experiments, we showed that the proposed scheme attains excellent performance even in cases of overloaded and imbalanced traffic.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125432635","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}
A network processor (NP) usually contains multiple packet processing cores (PPCs) and a control processing core (CPC), and the synchronization and communication between CPC and PPCs, which is required for controlling an NP, is very complex. To reduce the complexity, a method for controlling packet processing in NPs by using PPCs is proposed. By means of this method, complex control messages are partially processed and divided into simplified control packets by a CPU outside the NP chip, and these packets are sent to a control-processing PPC. The control-processing PPC controls data-processing PPCs by using data-exchange mechanisms, such as a shared memory or an on-chip network, which are more uniform and simpler than those between a CPC and PPCs. This control method is applied to a virtual-link control-processing task and packet-processing tasks in a network node with a virtualization function. Both tasks are described by a hardware-independent high-level language called "Phonepl," and communication between the PPCs is programmed following normal and uniform shared-memory semantics. As a result, programming the control-processing task and porting the program become much easier.
{"title":"Controlling Network Processors by Using Packet-Processing Cores","authors":"Y. Kanada","doi":"10.1109/WAINA.2014.112","DOIUrl":"https://doi.org/10.1109/WAINA.2014.112","url":null,"abstract":"A network processor (NP) usually contains multiple packet processing cores (PPCs) and a control processing core (CPC), and the synchronization and communication between CPC and PPCs, which is required for controlling an NP, is very complex. To reduce the complexity, a method for controlling packet processing in NPs by using PPCs is proposed. By means of this method, complex control messages are partially processed and divided into simplified control packets by a CPU outside the NP chip, and these packets are sent to a control-processing PPC. The control-processing PPC controls data-processing PPCs by using data-exchange mechanisms, such as a shared memory or an on-chip network, which are more uniform and simpler than those between a CPC and PPCs. This control method is applied to a virtual-link control-processing task and packet-processing tasks in a network node with a virtualization function. Both tasks are described by a hardware-independent high-level language called \"Phonepl,\" and communication between the PPCs is programmed following normal and uniform shared-memory semantics. As a result, programming the control-processing task and porting the program become much easier.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128138422","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}
Stelios Sotiriadis, N. Bessis, E. Asimakopoulou, N. Mustafee
There is an increasing interest in Internet of Things (IoT) and healthcare is considered to be one of the most common applications of it. Using the IoT paradigm, various devices including smart-phones and sensor-embedded healthcare applications can be used for monitoring health. In this study, we model an IoT use case scenario with regard to monitoring the activities associated with health. In particular, we present our use case using the SimIoT extended simulation toolkit to demonstrate the various functions and the interactions occurring within the IoT-enabled healthcare context. Specifically, we extend the functionalities of the SimIC simulation toolkit by adding the IoT layer that incorporates IoT devices which generated data for the private clouds. We focus our experimental analysis from the perspective of cloud performance to illustrate the turnaround and make span of the system.
{"title":"Towards Simulating the Internet of Things","authors":"Stelios Sotiriadis, N. Bessis, E. Asimakopoulou, N. Mustafee","doi":"10.1109/WAINA.2014.74","DOIUrl":"https://doi.org/10.1109/WAINA.2014.74","url":null,"abstract":"There is an increasing interest in Internet of Things (IoT) and healthcare is considered to be one of the most common applications of it. Using the IoT paradigm, various devices including smart-phones and sensor-embedded healthcare applications can be used for monitoring health. In this study, we model an IoT use case scenario with regard to monitoring the activities associated with health. In particular, we present our use case using the SimIoT extended simulation toolkit to demonstrate the various functions and the interactions occurring within the IoT-enabled healthcare context. Specifically, we extend the functionalities of the SimIC simulation toolkit by adding the IoT layer that incorporates IoT devices which generated data for the private clouds. We focus our experimental analysis from the perspective of cloud performance to illustrate the turnaround and make span of the system.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125810876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：