Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594902
T. Deryckere, W. Joseph, L. Martens, L. Marez, K. Moor, K. Berte
Users in todaypsilas mobile ICT environment are confronted with more and more innovations and an ever increasing technical quality, which makes them more demanding and harder to please. It is often hard to measure and to predict the user experience during service consumption. This is nevertheless a very important dimension that should be taken into account while developing applications or frameworks. In this paper we demonstrate a software tool that is integrated in a wireless living lab environment in order to validate and quantify actual user experience. The methodology to assess the user experience combines both technological and social assets. User experience of a Wineguide application on a PDA is related to signal strength, monitored during usage of the applications. Higher signal strengths correspond with a better experience (e.g. speed). Finally, difference in the experience among users will be discussed.
{"title":"A software tool to relate technical performance to user experience in a mobile context","authors":"T. Deryckere, W. Joseph, L. Martens, L. Marez, K. Moor, K. Berte","doi":"10.1109/WOWMOM.2008.4594902","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594902","url":null,"abstract":"Users in todaypsilas mobile ICT environment are confronted with more and more innovations and an ever increasing technical quality, which makes them more demanding and harder to please. It is often hard to measure and to predict the user experience during service consumption. This is nevertheless a very important dimension that should be taken into account while developing applications or frameworks. In this paper we demonstrate a software tool that is integrated in a wireless living lab environment in order to validate and quantify actual user experience. The methodology to assess the user experience combines both technological and social assets. User experience of a Wineguide application on a PDA is related to signal strength, monitored during usage of the applications. Higher signal strengths correspond with a better experience (e.g. speed). Finally, difference in the experience among users will be discussed.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114644734","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 : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594923
M. Ramkumar
Some important requirements of key distribution schemes for many emerging applications involving resource constrained devices (for example, ad hoc and sensor networks) are 1) low complexity; 2) the ability to support unmediated establishment of security associations and 3) scalability. We propose a novel key distribution scheme based on an elegant scheme proposed by Leighton and Micali (1994). While the scheme in (Leighton and Micali, 1994) was intended to be an alternative to Kerberos (employing a trusted server for mediation), the proposed modifications are towards realizing a scheme for nonmediated establishment of pairwise secrets. We enumerate several compelling advantages of the proposed scheme over existing schemes in the literature.
{"title":"On the scalability of an efficient “Nonscalable” key distribution scheme","authors":"M. Ramkumar","doi":"10.1109/WOWMOM.2008.4594923","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594923","url":null,"abstract":"Some important requirements of key distribution schemes for many emerging applications involving resource constrained devices (for example, ad hoc and sensor networks) are 1) low complexity; 2) the ability to support unmediated establishment of security associations and 3) scalability. We propose a novel key distribution scheme based on an elegant scheme proposed by Leighton and Micali (1994). While the scheme in (Leighton and Micali, 1994) was intended to be an alternative to Kerberos (employing a trusted server for mediation), the proposed modifications are towards realizing a scheme for nonmediated establishment of pairwise secrets. We enumerate several compelling advantages of the proposed scheme over existing schemes in the literature.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123431014","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 : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594840
Jun Ma, Xuansong Li, Xianping Tao, Jian Lu
Location Based Service (LBS) is one kind of ubiquitous applications whose functions are based on the locations of clients. The core of LBS is an effective positioning system. As wireless LAN (WLAN) costs less and is easy to access, using WLAN for indoor positioning has been widely studied recently. K nearest neighbors (KNN) is one of the basic deterministic fingerprint based algorithms and widely used for WLAN-based indoor positioning. However, KNN takes all the nearest K neighbors for calculating the estimated result, which could be improved if some selective work could be done to those neighbors beforehand. In this paper we propose a new scheme called "cluster filtered KNN" (CFK). CFK utilizes clustering technique to partition those neighbors into different clusters and chooses one cluster as the delegate. In the end, the final estimate can be calculated only based on the elements of the delegate. With experiments, we found that CFK does outperform KNN.
{"title":"Cluster filtered KNN: A WLAN-based indoor positioning scheme","authors":"Jun Ma, Xuansong Li, Xianping Tao, Jian Lu","doi":"10.1109/WOWMOM.2008.4594840","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594840","url":null,"abstract":"Location Based Service (LBS) is one kind of ubiquitous applications whose functions are based on the locations of clients. The core of LBS is an effective positioning system. As wireless LAN (WLAN) costs less and is easy to access, using WLAN for indoor positioning has been widely studied recently. K nearest neighbors (KNN) is one of the basic deterministic fingerprint based algorithms and widely used for WLAN-based indoor positioning. However, KNN takes all the nearest K neighbors for calculating the estimated result, which could be improved if some selective work could be done to those neighbors beforehand. In this paper we propose a new scheme called \"cluster filtered KNN\" (CFK). CFK utilizes clustering technique to partition those neighbors into different clusters and chooses one cluster as the delegate. In the end, the final estimate can be calculated only based on the elements of the delegate. With experiments, we found that CFK does outperform KNN.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116071894","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 : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594842
Golnaz Karbaschi, A. Fladenmuller, B. Wolfinger
In this paper we introduce a novel distributed and robust link-quality measurement framework, called QualRoute. It exploits the existing traffic in the network in order to estimate accurately the quality of the links. Different from existing methods, our proposed scheme takes advantage of the broadcast nature of the wireless medium, and sets up an asynchronous cooperation between neighbors without any extra signaling between the node pairs. The simulation results suggest that the route derived from QualRoute yields to noticeably better performance than the traditional shortest path routes. Moreover, a comparison with a similar link-quality metric which is measured differently confirms the significant impact of the measurement scheme on the overall performance.
{"title":"Link-quality measurement enhancement for routing in wireless mesh networks","authors":"Golnaz Karbaschi, A. Fladenmuller, B. Wolfinger","doi":"10.1109/WOWMOM.2008.4594842","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594842","url":null,"abstract":"In this paper we introduce a novel distributed and robust link-quality measurement framework, called QualRoute. It exploits the existing traffic in the network in order to estimate accurately the quality of the links. Different from existing methods, our proposed scheme takes advantage of the broadcast nature of the wireless medium, and sets up an asynchronous cooperation between neighbors without any extra signaling between the node pairs. The simulation results suggest that the route derived from QualRoute yields to noticeably better performance than the traditional shortest path routes. Moreover, a comparison with a similar link-quality metric which is measured differently confirms the significant impact of the measurement scheme on the overall performance.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124585620","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 : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594926
Paul L. Yu, J. Baras, Brian M. Sadler
Authentication is the process where claims of identity are verified. Though authentication mechanisms typically exist above the physical layer, physical layer methods have recently been introduced that do not require extra bandwidth. In this paper we propose a multi-carrier extension to the work and consider the stealth and robustness tradeoffs. We conclude by discussing the power-reliability tradeoff and the applicability to cross-layer security.
{"title":"Multicarrier authentication at the physical layer","authors":"Paul L. Yu, J. Baras, Brian M. Sadler","doi":"10.1109/WOWMOM.2008.4594926","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594926","url":null,"abstract":"Authentication is the process where claims of identity are verified. Though authentication mechanisms typically exist above the physical layer, physical layer methods have recently been introduced that do not require extra bandwidth. In this paper we propose a multi-carrier extension to the work and consider the stealth and robustness tradeoffs. We conclude by discussing the power-reliability tradeoff and the applicability to cross-layer security.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121284624","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 : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594816
M. Moghaddam, D. Adjeroh
New applications made possible by the rapid improvements and miniaturization in hardware has motivated recent developments in wireless multimedia sensor networks (WMSNs). As multimedia applications produce high volumes of data which require high transmission rates, multimedia traffic is usually high speed. This may cause congestion in the sensor nodes, leading to impairments in the quality of service (QoS) of multimedia applications. Thus, to meet the QoS requirements of multimedia applications, a reliable and fair transport protocol is mandatory. An important function of the transport layer in WMSNs is congestion control. In this paper, we present a new queue based congestion control protocol with priority support (QCCP-PS), using the queue length as an indication of congestion degree. The rate assignment to each traffic source is based on its priority index as well as its current congestion degree. Simulation results show that the proposed QCCP-PS protocol can detect congestion better than previous mechanisms. Furthermore it has a good achieved priority close to the ideal and near-zero packet loss probability, which make it an efficient congestion control protocol for multimedia traffic in WMSNs. As congestion wastes the scarce energy due to a large number of retransmissions and packet drops, the proposed QCCP-PS protocol can save energy at each node, given the reduced number of retransmissions and packet losses.
{"title":"A new priority based congestion control protocol for Wireless Multimedia Sensor Networks","authors":"M. Moghaddam, D. Adjeroh","doi":"10.1109/WOWMOM.2008.4594816","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594816","url":null,"abstract":"New applications made possible by the rapid improvements and miniaturization in hardware has motivated recent developments in wireless multimedia sensor networks (WMSNs). As multimedia applications produce high volumes of data which require high transmission rates, multimedia traffic is usually high speed. This may cause congestion in the sensor nodes, leading to impairments in the quality of service (QoS) of multimedia applications. Thus, to meet the QoS requirements of multimedia applications, a reliable and fair transport protocol is mandatory. An important function of the transport layer in WMSNs is congestion control. In this paper, we present a new queue based congestion control protocol with priority support (QCCP-PS), using the queue length as an indication of congestion degree. The rate assignment to each traffic source is based on its priority index as well as its current congestion degree. Simulation results show that the proposed QCCP-PS protocol can detect congestion better than previous mechanisms. Furthermore it has a good achieved priority close to the ideal and near-zero packet loss probability, which make it an efficient congestion control protocol for multimedia traffic in WMSNs. As congestion wastes the scarce energy due to a large number of retransmissions and packet drops, the proposed QCCP-PS protocol can save energy at each node, given the reduced number of retransmissions and packet losses.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128149204","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 : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594927
K. Sivakumar, M. Ramkumar
Ariadne is a popular secure ad hoc routing protocol based on the dynamic source routing (DSR) protocol. While Ariadne was designed to be capable of detecting attacks by non colluding attackers, it does not include measures to identify or narrow down perpetrators responsible for such attacks. We propose some modifications to Ariadne to improve its resiliency, by affording the ability to identify and route around malicious nodes.
{"title":"Improving the resiliency of Ariadne","authors":"K. Sivakumar, M. Ramkumar","doi":"10.1109/WOWMOM.2008.4594927","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594927","url":null,"abstract":"Ariadne is a popular secure ad hoc routing protocol based on the dynamic source routing (DSR) protocol. While Ariadne was designed to be capable of detecting attacks by non colluding attackers, it does not include measures to identify or narrow down perpetrators responsible for such attacks. We propose some modifications to Ariadne to improve its resiliency, by affording the ability to identify and route around malicious nodes.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132060416","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 : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594887
Gonzalo Huerta Cánepa, Dongman Lee
Advancement in mobile devices makes possible to add more features to them while reducing the size. If we also consider the fact that they posses advance communications features, we can convert these devices into the central manager of userspsila activities. One feature in this line is the ability to control the devices surrounding the user. Problems arise when the devices belong to a shared space. In this case we also need to consider interactions and conflicts between users. In this research we present a multi-user ad-hoc resource manager for smart spaces, which allow us to control devices present in the area, and avoid conflicts between users.
{"title":"A multi-user ad-hoc resource manager for smart spaces","authors":"Gonzalo Huerta Cánepa, Dongman Lee","doi":"10.1109/WOWMOM.2008.4594887","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594887","url":null,"abstract":"Advancement in mobile devices makes possible to add more features to them while reducing the size. If we also consider the fact that they posses advance communications features, we can convert these devices into the central manager of userspsila activities. One feature in this line is the ability to control the devices surrounding the user. Problems arise when the devices belong to a shared space. In this case we also need to consider interactions and conflicts between users. In this research we present a multi-user ad-hoc resource manager for smart spaces, which allow us to control devices present in the area, and avoid conflicts between users.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133601167","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 : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594898
D. McIlwraith, M. Paquier, Evangelos Kotsovinos
Internet worms pose a serious and ongoing threat to system security, often resulting in significant service downtime and disruption. In recent years peer-to-peer (p2p) networks have become a target for the deployment of worms as their high connectivity allows for rapid dissemination and homogeneity of the adopted software platform ensures the existence of common susceptibilities. In this paper we observe that peer similarity in p2p networks can greatly increase overall vulnerability; peers with largely different system characteristics are unlikely to be infected by the same worm. With this in mind we present di-jest - an autonomic method for neighbour selection based on heterogeneity. Our results show the efficacy of di-jest in reducing the spread rate and potency of p2p worms. By selecting neighbours with different system characteristics di-jest can reduce the number of peers infected by a worm by up to 80%.
{"title":"di-jest: Autonomic neighbour management for worm resilience in p2p systems","authors":"D. McIlwraith, M. Paquier, Evangelos Kotsovinos","doi":"10.1109/WOWMOM.2008.4594898","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594898","url":null,"abstract":"Internet worms pose a serious and ongoing threat to system security, often resulting in significant service downtime and disruption. In recent years peer-to-peer (p2p) networks have become a target for the deployment of worms as their high connectivity allows for rapid dissemination and homogeneity of the adopted software platform ensures the existence of common susceptibilities. In this paper we observe that peer similarity in p2p networks can greatly increase overall vulnerability; peers with largely different system characteristics are unlikely to be infected by the same worm. With this in mind we present di-jest - an autonomic method for neighbour selection based on heterogeneity. Our results show the efficacy of di-jest in reducing the spread rate and potency of p2p worms. By selecting neighbours with different system characteristics di-jest can reduce the number of peers infected by a worm by up to 80%.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124238324","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 : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594812
P. Marshall
Ongoing research and experimentation activities have rapidly created confidence in the ability to transition from conventional radios to those introducing initial functionality proposed for Dynamic Spectrum Access and Cognitive Radio. Additionally, work on networking concepts, such as Delay Tolerant Networking and Disruption Tolerant Networks provide service architectures appropriate to dynamic and self-reliant edge networks. These technologies make it possible to consider wireless networks that are much more robust, scalable, and self-reliant than was conceived of in the past.
{"title":"Recent progress in moving cognitive radio and services to deployment","authors":"P. Marshall","doi":"10.1109/WOWMOM.2008.4594812","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594812","url":null,"abstract":"Ongoing research and experimentation activities have rapidly created confidence in the ability to transition from conventional radios to those introducing initial functionality proposed for Dynamic Spectrum Access and Cognitive Radio. Additionally, work on networking concepts, such as Delay Tolerant Networking and Disruption Tolerant Networks provide service architectures appropriate to dynamic and self-reliant edge networks. These technologies make it possible to consider wireless networks that are much more robust, scalable, and self-reliant than was conceived of in the past.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117344706","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
扫码关注我们
求助内容：
应助结果提醒方式：