Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758536
Ahmed Alqaoud
Scientific workflow is a special type of workflow for scientists to formalize and structure complex e-Science applications. Many workflow systems have been released to solve problems in special domains. In large collaborative projects, it is often necessary to recognize the heterogeneous workflow systems already in use by various partners and any potential collaboration between these systems requires workflow interoperability. Publish/Subscribe Scientific Workflow Interoperability Framework (PS-SWIF) approach was proposed by author to achieve workflow interoperability among workflow systems. This paper evaluates the PS-SWIF approach and its system to achieve workflow interoperability using Web Services with asynchronous notification messages represented by WS-Eventing standard. In this paper, the author presents quantitative measurements that show that PS-SWIF can scale in a workflow heterogeneous distributed environment by assessing the scalability of the system in terms of notification message loads using large number of machines and different sizes of datasets the system can manage.
{"title":"Performance evaluation for scientific workflow interoperability","authors":"Ahmed Alqaoud","doi":"10.1109/LCNW.2013.6758536","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758536","url":null,"abstract":"Scientific workflow is a special type of workflow for scientists to formalize and structure complex e-Science applications. Many workflow systems have been released to solve problems in special domains. In large collaborative projects, it is often necessary to recognize the heterogeneous workflow systems already in use by various partners and any potential collaboration between these systems requires workflow interoperability. Publish/Subscribe Scientific Workflow Interoperability Framework (PS-SWIF) approach was proposed by author to achieve workflow interoperability among workflow systems. This paper evaluates the PS-SWIF approach and its system to achieve workflow interoperability using Web Services with asynchronous notification messages represented by WS-Eventing standard. In this paper, the author presents quantitative measurements that show that PS-SWIF can scale in a workflow heterogeneous distributed environment by assessing the scalability of the system in terms of notification message loads using large number of machines and different sizes of datasets the system can manage.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121294105","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758531
Martin Florian, I. Baumgart
For smart traffic applications like dynamic route planning, communication between traffic participants is of high importance. Traditional communication architectures for smart traffic are centralized, which leads to major privacy concerns since every service provider gains a global view on the mobility behavior of all participating nodes. Recent publications on decentralized alternatives often claim to remedy privacy issues by getting rid of the centralized entity. In this paper, we test this assumption thoroughly, evaluating the privacy-aspects of overlay-based geocast systems in comparison to centralized approaches. To this means, we define an attacker model and describe two different attacks on privacy. Through simulation we show that without additional protection mechanisms, the difficulty for placing surveillance on individual nodes is low. Based on the results, we discuss possible improvements and alternative communication approaches.
{"title":"Privacy in overlay-based smart traffic systems","authors":"Martin Florian, I. Baumgart","doi":"10.1109/LCNW.2013.6758531","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758531","url":null,"abstract":"For smart traffic applications like dynamic route planning, communication between traffic participants is of high importance. Traditional communication architectures for smart traffic are centralized, which leads to major privacy concerns since every service provider gains a global view on the mobility behavior of all participating nodes. Recent publications on decentralized alternatives often claim to remedy privacy issues by getting rid of the centralized entity. In this paper, we test this assumption thoroughly, evaluating the privacy-aspects of overlay-based geocast systems in comparison to centralized approaches. To this means, we define an attacker model and describe two different attacks on privacy. Through simulation we show that without additional protection mechanisms, the difficulty for placing surveillance on individual nodes is low. Based on the results, we discuss possible improvements and alternative communication approaches.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125701669","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758491
Anisa Allahdadi, Ricardo Morla, Ana Aguiar, Jaime S. Cardoso
The duration of 802.11 user sessions has been widely studied in the context of analyzing user behavior and mobility. Short (smaller-than-5-minutes) sessions are never used or characterized in these analyses as they are unrelated to user behavior and considered as artifacts introduced by the wireless network. In this paper we characterize short 802.11 sessions as recorded through RADIUS authentication. We show that 50% of access points have 70% of smaller than 5 minutes sessions in a 5 months trace from the Eduroam academic wireless network in the University of Porto. Exactly because they are artifacts introduced by the network, short sessions are an important indicator for network management and the quality of the wireless access. Network managers typically do not collect and process session information but rely on SNMP to provide summaries of 802.11 usage data. We develop a modeling framework to provide predictions for the number of short sessions from SNMP data. We model the data stream of each access point using two methods of regression and one classification technique. We evaluate these models based on short session prediction accuracy. The models are trained on the 5 months data and the best results show prediction accuracy of 95.27% in polynomial regression at degree of 3.
{"title":"Predicting short 802.11 sessions from RADIUS usage data","authors":"Anisa Allahdadi, Ricardo Morla, Ana Aguiar, Jaime S. Cardoso","doi":"10.1109/LCNW.2013.6758491","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758491","url":null,"abstract":"The duration of 802.11 user sessions has been widely studied in the context of analyzing user behavior and mobility. Short (smaller-than-5-minutes) sessions are never used or characterized in these analyses as they are unrelated to user behavior and considered as artifacts introduced by the wireless network. In this paper we characterize short 802.11 sessions as recorded through RADIUS authentication. We show that 50% of access points have 70% of smaller than 5 minutes sessions in a 5 months trace from the Eduroam academic wireless network in the University of Porto. Exactly because they are artifacts introduced by the network, short sessions are an important indicator for network management and the quality of the wireless access. Network managers typically do not collect and process session information but rely on SNMP to provide summaries of 802.11 usage data. We develop a modeling framework to provide predictions for the number of short sessions from SNMP data. We model the data stream of each access point using two methods of regression and one classification technique. We evaluate these models based on short session prediction accuracy. The models are trained on the 5 months data and the best results show prediction accuracy of 95.27% in polynomial regression at degree of 3.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132664812","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758525
W. Alsalih
Radio Frequency IDentification (RFID) has enabled a wide range of automated tracking and monitoring applications. However, RFID tags share a wireless communication medium to deliver their information to the RFID reader which results in tag collisions and, hence, a significant energy consumption and delay in the interrogation process. Handling tag collisions is a challenging task because of the limited capabilities available to passive RFID tags. In classical anti-collision schemes, the RFID reader interrogates all tags in its range at once using its maximum transmission range, which results in many collisions and wastes energy. In a previous work, we proposed a novel approach in which the interrogation zone of an RFID reader is divided into a number of ring-shaped clusters, and tags of different clusters are read separately. We also proposed a method that finds the optimal clustering scheme assuming an ideal setting in which the transmission range of the RFID reader can be tuned with high precision. In this paper, we consider a more practical scenario in which the RFID reader has a finite set of discrete transmission ranges rather than continuous ones. This suits currently existing commercial RFID readers that come with configurable output power. We present a delay mathematical analysis for this optimization problem and devise an algorithm that finds the optimal clustering efficiently. The proposed approach can be integrated with any existing anti-collision scheme to improve its performance and, hence, meet the demand of large scale RFID applications. Simulation results show that our approach is able to make significant improvements in saving energy and time by reducing collisions.
{"title":"Discrete power-based Distance Clustering for anti-collision schemes in RFID systems","authors":"W. Alsalih","doi":"10.1109/LCNW.2013.6758525","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758525","url":null,"abstract":"Radio Frequency IDentification (RFID) has enabled a wide range of automated tracking and monitoring applications. However, RFID tags share a wireless communication medium to deliver their information to the RFID reader which results in tag collisions and, hence, a significant energy consumption and delay in the interrogation process. Handling tag collisions is a challenging task because of the limited capabilities available to passive RFID tags. In classical anti-collision schemes, the RFID reader interrogates all tags in its range at once using its maximum transmission range, which results in many collisions and wastes energy. In a previous work, we proposed a novel approach in which the interrogation zone of an RFID reader is divided into a number of ring-shaped clusters, and tags of different clusters are read separately. We also proposed a method that finds the optimal clustering scheme assuming an ideal setting in which the transmission range of the RFID reader can be tuned with high precision. In this paper, we consider a more practical scenario in which the RFID reader has a finite set of discrete transmission ranges rather than continuous ones. This suits currently existing commercial RFID readers that come with configurable output power. We present a delay mathematical analysis for this optimization problem and devise an algorithm that finds the optimal clustering efficiently. The proposed approach can be integrated with any existing anti-collision scheme to improve its performance and, hence, meet the demand of large scale RFID applications. Simulation results show that our approach is able to make significant improvements in saving energy and time by reducing collisions.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130324869","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758541
Eman S. Alwadiyeh, Ala' F. A. Aburumman
Routing is considered as one of the most critical research issues in the area of mobile ad hoc networks (MANETs), where it plays the main role in determining the overall throughput and the delivery ratio in the mobile networks. This paper proposes two on-demand multipath routing protocols. Efficient, Stable, Disjoint Multipath Routing protocol (ESDMR) and Efficient, Disjoint Multipath Routing protocol (EDMR), the main goal of the proposed routing protocols is to reduce the influence of interference between the selected node-disjoint multipath scheme, by selecting a node-disjoint routes with the minimal interference between them. In addition, both of the proposed protocols used a new proposed technique that aims to reduce the control packets overhead, while it enables the destination node of collecting the required information. Simulation results show that the proposed routing protocols have a higher delivery rate and higher throughput compared with the ones in Split multipath routing protocol (SMR). The significant improvement in packet delivery ratio resulted mainly from reducing the impact of hidden terminal problem. While, increasing the number of available channels between the selected disjoint routes is the main reason for the dramatic improvement in throughput. The efficiency of the proposed protocols and SMR protocol is evaluated by GloMoSim simulator.
{"title":"Interference-aware multipath routing protocols for mobile ad hoc networks","authors":"Eman S. Alwadiyeh, Ala' F. A. Aburumman","doi":"10.1109/LCNW.2013.6758541","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758541","url":null,"abstract":"Routing is considered as one of the most critical research issues in the area of mobile ad hoc networks (MANETs), where it plays the main role in determining the overall throughput and the delivery ratio in the mobile networks. This paper proposes two on-demand multipath routing protocols. Efficient, Stable, Disjoint Multipath Routing protocol (ESDMR) and Efficient, Disjoint Multipath Routing protocol (EDMR), the main goal of the proposed routing protocols is to reduce the influence of interference between the selected node-disjoint multipath scheme, by selecting a node-disjoint routes with the minimal interference between them. In addition, both of the proposed protocols used a new proposed technique that aims to reduce the control packets overhead, while it enables the destination node of collecting the required information. Simulation results show that the proposed routing protocols have a higher delivery rate and higher throughput compared with the ones in Split multipath routing protocol (SMR). The significant improvement in packet delivery ratio resulted mainly from reducing the impact of hidden terminal problem. While, increasing the number of available channels between the selected disjoint routes is the main reason for the dramatic improvement in throughput. The efficiency of the proposed protocols and SMR protocol is evaluated by GloMoSim simulator.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123307194","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758539
P. Wightman, M. Zurbarán, Miguel E. Rodríguez, M. Labrador
The popularization of Location-Based Services (LBSs) has brought along benefits for users and service provider, in terms of improved quality of existing services and a better user experience. At the same time, location privacy has become one of the most critical concerns for ensuring users' right to protection. Despite the fact that one of the best ways to protect the location information is not to reveal it, there are advantages on using this information to personalize services, however it is necessary to guarantee its protection. Private Information Retrieval is a technique that creates a common language between users and service provider so that external actors cannot understand most of the information being transferred. This paper introduces MaPIR, a mapping-based private information retrieval technique that uses mathematically generated mapping to create redundancy in order to provide multiple answers to a user with an undistinguishable location. This technique is decentralized and focuses on Point of Interest Search-based application, not on tracking services. For performance evaluation, were compared in two scenarios MaPIR, a regular spatial query and the Dummy Query technique, the results show that MaPIR takes only half the time of regular geographical queries on database processing, and 5 times less than the Dummy Query technique, while providing a similar level of redundancy.
{"title":"MaPIR: Mapping-based private information retrieval for location privacy in LBISs","authors":"P. Wightman, M. Zurbarán, Miguel E. Rodríguez, M. Labrador","doi":"10.1109/LCNW.2013.6758539","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758539","url":null,"abstract":"The popularization of Location-Based Services (LBSs) has brought along benefits for users and service provider, in terms of improved quality of existing services and a better user experience. At the same time, location privacy has become one of the most critical concerns for ensuring users' right to protection. Despite the fact that one of the best ways to protect the location information is not to reveal it, there are advantages on using this information to personalize services, however it is necessary to guarantee its protection. Private Information Retrieval is a technique that creates a common language between users and service provider so that external actors cannot understand most of the information being transferred. This paper introduces MaPIR, a mapping-based private information retrieval technique that uses mathematically generated mapping to create redundancy in order to provide multiple answers to a user with an undistinguishable location. This technique is decentralized and focuses on Point of Interest Search-based application, not on tracking services. For performance evaluation, were compared in two scenarios MaPIR, a regular spatial query and the Dummy Query technique, the results show that MaPIR takes only half the time of regular geographical queries on database processing, and 5 times less than the Dummy Query technique, while providing a similar level of redundancy.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116188437","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758493
Farnaz Farid, S. Shahrestani, Chun Ruan
Mobile broadband technologies are now an important part of the communication infrastructure even for most of the developing world. These technologies can potentially play an important role in improving the socioeconomic status of rural areas. However, adaptation of these technologies for provision of relevant multimedia services faces major challenges. Perhaps, Quality of Service (QoS) issues still tops the list of such challenges. In this work we study how to evaluate the QoS of cellular-based systems focusing on an application perspective. We quantify the QoS levels for different traffic models using application and network related parameters to identify the most suitable configuration for running multimedia-based services. More specifically, our analysis is based on considering a unified measure combining key QoS metrics such as packet loss, and delay. For evaluation purposes, we also investigate the QoS issues of deploying a distance education platform running over UMTS cellular systems. The QoS issues related to the deployment of multimedia services in cellular technologies are then considered and analyzed in detail through simulation studies. The results show that by inclusion of the communication technology and application related parameters along with the number of users in QoS evaluations, better performing network configurations can be readily selected. This is achieved, through our proposed application-based QoS evaluation scheme that is based on combining various related measures. The proposed scheme is shown to be particularly beneficial for evaluating and improving QoS for multimedia-based heterogeneous networks.
{"title":"QoS analysis and evaluations: Improving cellular-based distance education","authors":"Farnaz Farid, S. Shahrestani, Chun Ruan","doi":"10.1109/LCNW.2013.6758493","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758493","url":null,"abstract":"Mobile broadband technologies are now an important part of the communication infrastructure even for most of the developing world. These technologies can potentially play an important role in improving the socioeconomic status of rural areas. However, adaptation of these technologies for provision of relevant multimedia services faces major challenges. Perhaps, Quality of Service (QoS) issues still tops the list of such challenges. In this work we study how to evaluate the QoS of cellular-based systems focusing on an application perspective. We quantify the QoS levels for different traffic models using application and network related parameters to identify the most suitable configuration for running multimedia-based services. More specifically, our analysis is based on considering a unified measure combining key QoS metrics such as packet loss, and delay. For evaluation purposes, we also investigate the QoS issues of deploying a distance education platform running over UMTS cellular systems. The QoS issues related to the deployment of multimedia services in cellular technologies are then considered and analyzed in detail through simulation studies. The results show that by inclusion of the communication technology and application related parameters along with the number of users in QoS evaluations, better performing network configurations can be readily selected. This is achieved, through our proposed application-based QoS evaluation scheme that is based on combining various related measures. The proposed scheme is shown to be particularly beneficial for evaluating and improving QoS for multimedia-based heterogeneous networks.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121230643","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758509
James Pope, R. Simon
There has been much recent interest in deploying IP-enabled routing and management protocols within Low-Power and Lossy Networks (LLN). For instance, the Routing Protocol for LLNs (RPL) forms a directed acyclic graph from which a routing tree can be selected. RPL is designed to dynamically modify routes in response to varying network conditions. However, many performance-sensitive LLN applications require stable routing trees with fixed homogeneous or heterogeneous transmission rates over defined time intervals. For these applications we introduce the CREST: Coordinated Routing for Epoch-based Stable Tree framework. CREST provides a LLN and IP-friendly routing control plane for supporting this application class. CREST is designed to supplement, rather than replace, LLN routing protocols such as RPL or CTP. We describe our implementation of CREST in the Contiki operating system. We also present a performance analysis for a utility maximization application using the framework comparing epoch-based protocols to an RPL approach. Our results show that the epoch-based protocols consistently deliver higher utility levels.
最近，人们对在低功耗和有损网络(LLN)中部署支持ip的路由和管理协议非常感兴趣。例如，RPL (Routing Protocol For lln)形成了一个有向无环图，可以从中选择路由树。RPL的目的是动态修改路由，以响应不同的网络条件。然而，许多性能敏感的LLN应用程序需要稳定的路由树，在定义的时间间隔内具有固定的同构或异构传输速率。针对这些应用，我们引入了基于时代的稳定树框架的CREST:协调路由。CREST提供了一个LLN和ip友好的路由控制平面来支持这个应用程序类。CREST旨在补充而不是取代LLN路由协议，如RPL或CTP。我们描述了我们在Contiki操作系统中的CREST实现。我们还提出了一个效用最大化应用程序的性能分析，使用比较基于时代的协议和RPL方法的框架。我们的结果表明，基于时代的协议始终提供更高的效用水平。
{"title":"CREST: An epoch-oriented routing control plane for Low-Power and Lossy Networks","authors":"James Pope, R. Simon","doi":"10.1109/LCNW.2013.6758509","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758509","url":null,"abstract":"There has been much recent interest in deploying IP-enabled routing and management protocols within Low-Power and Lossy Networks (LLN). For instance, the Routing Protocol for LLNs (RPL) forms a directed acyclic graph from which a routing tree can be selected. RPL is designed to dynamically modify routes in response to varying network conditions. However, many performance-sensitive LLN applications require stable routing trees with fixed homogeneous or heterogeneous transmission rates over defined time intervals. For these applications we introduce the CREST: Coordinated Routing for Epoch-based Stable Tree framework. CREST provides a LLN and IP-friendly routing control plane for supporting this application class. CREST is designed to supplement, rather than replace, LLN routing protocols such as RPL or CTP. We describe our implementation of CREST in the Contiki operating system. We also present a performance analysis for a utility maximization application using the framework comparing epoch-based protocols to an RPL approach. Our results show that the epoch-based protocols consistently deliver higher utility levels.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116606879","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758527
Mohib A. Shah, Jinman Kim, D. Feng
Wireless Local Area Network (WLAN) has enabled greater communication capabilities compared to LAN counterpart. However, when it comes to quality of service (QoS), WLAN has lower reliability, where it has higher latency and packet-loss, especially for real-time streaming applications such as voice over internet protocol (VoIP) and multimedia. Thus, improving QoS in WLAN is a major research challenge, where packet-loss is considered most critical while other factors, such as latency and jitter are acceptable to certain level of tolerance. Theoretically WLAN can provide higher bandwidth and lower latency; however, practical results disagree with this statement. In this paper, we investigated the dilemma using different combination of wireless devices within a local area network to identify the problem. We propose an infrastructure based scheme to improve the QoS for real-time traffic over WLAN. We setup a wireless network using different types of wireless devices and tested VoIP traffic over it. Our simulation results for G.729.2 codec on IPv4 and IPv6 using virtual access point (v-AP) showed better performance than physical access point (ph-AP). We also observed that usage of different wireless devices within a network highly reduced real-time application performance.
{"title":"Impact of wireless devices over real-time applications: An empirical test-bed analysis","authors":"Mohib A. Shah, Jinman Kim, D. Feng","doi":"10.1109/LCNW.2013.6758527","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758527","url":null,"abstract":"Wireless Local Area Network (WLAN) has enabled greater communication capabilities compared to LAN counterpart. However, when it comes to quality of service (QoS), WLAN has lower reliability, where it has higher latency and packet-loss, especially for real-time streaming applications such as voice over internet protocol (VoIP) and multimedia. Thus, improving QoS in WLAN is a major research challenge, where packet-loss is considered most critical while other factors, such as latency and jitter are acceptable to certain level of tolerance. Theoretically WLAN can provide higher bandwidth and lower latency; however, practical results disagree with this statement. In this paper, we investigated the dilemma using different combination of wireless devices within a local area network to identify the problem. We propose an infrastructure based scheme to improve the QoS for real-time traffic over WLAN. We setup a wireless network using different types of wireless devices and tested VoIP traffic over it. Our simulation results for G.729.2 codec on IPv4 and IPv6 using virtual access point (v-AP) showed better performance than physical access point (ph-AP). We also observed that usage of different wireless devices within a network highly reduced real-time application performance.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122715928","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758544
Muhammad Usman, V. Muthukkumarasamy, Xin-Wen Wu
Mobile agent technology offers a number of advantages to resource constrained Wireless Sensor Networks (WSNs) by facilitating parallelism, code and data dissemination, localization, and distributed security services. As part of the second line of defense for WSNs, anomaly detection schemes are also benefiting from mobile agent technology. The formal verification can be used to validate the correctness of a system using formal specifications. This study employs Behavior Trees (BTs) for formal verification of mobile agent based anomaly detection system in WSNs. We employed BT based formal semantics to integrate the behavior projection of different components of anomaly detection system. The Symbolic Analysis Laboratory (SAL) tool is used to formally specify the behavior tree model. The analysis based on Linear Temporal Logic (LTL) theorems validates the completeness and consistency of the formal model of mobile agent based anomaly detection system.
{"title":"Formal verification of mobile agent based anomaly detection in Wireless Sensor Networks","authors":"Muhammad Usman, V. Muthukkumarasamy, Xin-Wen Wu","doi":"10.1109/LCNW.2013.6758544","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758544","url":null,"abstract":"Mobile agent technology offers a number of advantages to resource constrained Wireless Sensor Networks (WSNs) by facilitating parallelism, code and data dissemination, localization, and distributed security services. As part of the second line of defense for WSNs, anomaly detection schemes are also benefiting from mobile agent technology. The formal verification can be used to validate the correctness of a system using formal specifications. This study employs Behavior Trees (BTs) for formal verification of mobile agent based anomaly detection system in WSNs. We employed BT based formal semantics to integrate the behavior projection of different components of anomaly detection system. The Symbolic Analysis Laboratory (SAL) tool is used to formally specify the behavior tree model. The analysis based on Linear Temporal Logic (LTL) theorems validates the completeness and consistency of the formal model of mobile agent based anomaly detection system.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127655145","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
扫码关注我们
求助内容：
应助结果提醒方式：