Pub Date : 2008-06-23DOI: 10.1109/WOWMOM.2008.4594850
Yan He, D. Perkins
Wireless mesh networks (WMNs) are comprised of mesh routers whose relatively small transmission range may result infrequent handoffs, leading to high packet delays and loss rates and limiting the performance of real-time applications over WMNs. In this work, we propose BASH - a backhaul-aided seamless handoff scheme. Our scheme takes advantage of the wireless backhaul feature of WMNs and allows a mobile station to probe the neighboring mesh routers by accessing the backhaul channel. After the probe request, the mobile station is able to switch back to its primary communication channel and resume its ongoing communication without waiting for the probe responses. The currently associated mesh router of the mobile station collects the probe responses and selects the new mesh route on behalf of the mobile station. Our works show that by utilizing the wireless backhaul, BASH (1) reduces the probing latency and, thus, the Layer-2 handoff latency; (2) allows partial overlap of the Layer-2 and Layer-3 handoffs, reducing the overall handoff latency; and (3) shortens the authentication latency by utilizing the transitivity of trust relationship. The experimental results show that BASH achieves an average Layer-2 handoff of 8.7 ms, which supports the real-time applications during the handoff.
{"title":"BASH: A backhaul-aided seamless handoff scheme for Wireless Mesh Networks","authors":"Yan He, D. Perkins","doi":"10.1109/WOWMOM.2008.4594850","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594850","url":null,"abstract":"Wireless mesh networks (WMNs) are comprised of mesh routers whose relatively small transmission range may result infrequent handoffs, leading to high packet delays and loss rates and limiting the performance of real-time applications over WMNs. In this work, we propose BASH - a backhaul-aided seamless handoff scheme. Our scheme takes advantage of the wireless backhaul feature of WMNs and allows a mobile station to probe the neighboring mesh routers by accessing the backhaul channel. After the probe request, the mobile station is able to switch back to its primary communication channel and resume its ongoing communication without waiting for the probe responses. The currently associated mesh router of the mobile station collects the probe responses and selects the new mesh route on behalf of the mobile station. Our works show that by utilizing the wireless backhaul, BASH (1) reduces the probing latency and, thus, the Layer-2 handoff latency; (2) allows partial overlap of the Layer-2 and Layer-3 handoffs, reducing the overall handoff latency; and (3) shortens the authentication latency by utilizing the transitivity of trust relationship. The experimental results show that BASH achieves an average Layer-2 handoff of 8.7 ms, which supports the real-time applications during the handoff.","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":"132545809","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.4594838
A. Boukerche, Horácio Oliveira, E. Nakamura, A. Loureiro
Localization in time and space can be defined as the problem of solving both synchronization and positioning problems at the same time. This is a key problem for wireless sensor networks that need to determine the timing and location information of detected phenomena, especially for tracking applications. In this paper, we discuss the relationship between these two problems and propose the Mobilis (Mobile Beacon for Localization and Synchronization) algorithm, a new time-space localization algorithm for wireless sensor networks. The main aspect of the Mobilis algorithm is the use of a mobile beacon for both localization and synchronization. A mobile beacon is a node that is aware of its time and position (e.g. equipped with a GPS receiver) and that has the ability to move around the sensor field. In our algorithm, the synchronization component uses the packets required by the positioning component to improve its performance. Similarly, the positioning component benefits from the communication required by the synchronization component to decrease errors. We also present an extensive set of experiments and simulations to evaluate the performance of our algorithm.
在时间和空间上的定位可以定义为同时解决同步问题和定位问题。对于需要确定被检测现象的时间和位置信息的无线传感器网络来说，这是一个关键问题，特别是在跟踪应用中。本文讨论了这两个问题之间的关系，并提出了一种新的无线传感器网络时空定位算法Mobilis (Mobile Beacon for Localization and Synchronization)算法。Mobilis算法的主要方面是使用移动信标进行定位和同步。移动信标是一个节点，它知道自己的时间和位置(例如，配备了GPS接收器)，并有能力在传感器场周围移动。在我们的算法中，同步组件使用定位组件所需的数据包来提高其性能。类似地，定位组件受益于同步组件所需的通信以减少错误。我们还提出了一套广泛的实验和模拟来评估我们的算法的性能。
{"title":"Localization in time and space for wireless sensor networks: A Mobile Beacon approach","authors":"A. Boukerche, Horácio Oliveira, E. Nakamura, A. Loureiro","doi":"10.1109/WOWMOM.2008.4594838","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594838","url":null,"abstract":"Localization in time and space can be defined as the problem of solving both synchronization and positioning problems at the same time. This is a key problem for wireless sensor networks that need to determine the timing and location information of detected phenomena, especially for tracking applications. In this paper, we discuss the relationship between these two problems and propose the Mobilis (Mobile Beacon for Localization and Synchronization) algorithm, a new time-space localization algorithm for wireless sensor networks. The main aspect of the Mobilis algorithm is the use of a mobile beacon for both localization and synchronization. A mobile beacon is a node that is aware of its time and position (e.g. equipped with a GPS receiver) and that has the ability to move around the sensor field. In our algorithm, the synchronization component uses the packets required by the positioning component to improve its performance. Similarly, the positioning component benefits from the communication required by the synchronization component to decrease errors. We also present an extensive set of experiments and simulations to evaluate the performance of our algorithm.","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":"123684790","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.4594891
K. Oikonomou, I. Stavrakakis, Alexios Xydias
Service placement has typically been studied through the formulation and solution of a 1-median problem that is known to be complex and require global information. As such approaches are clearly not scalable in dynamic and large-scale environments, a more reasonable approach to service placement for large, ad hoc and autonomic environments would be through service migration. Such a migration policy has recently been proposed for tree topologies. The focus of the present paper is to devise effective service migration policies for general topologies with equal weight links. The proposed strategy - that incorporates a 2-phase polling mechanism of local scope and, consequently, induces in general a certain overhead - is shown to out-perform the previous one (i.e., getting closer to the optimal placement) for such general topologies. Finally, a hybrid migration policy (combining the present and the past ones) is considered and shown through simulations to be capable of reducing significantly the overhead effects of the afore-mentioned polling mechanism.
{"title":"Scalable service migration in general topologies","authors":"K. Oikonomou, I. Stavrakakis, Alexios Xydias","doi":"10.1109/WOWMOM.2008.4594891","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594891","url":null,"abstract":"Service placement has typically been studied through the formulation and solution of a 1-median problem that is known to be complex and require global information. As such approaches are clearly not scalable in dynamic and large-scale environments, a more reasonable approach to service placement for large, ad hoc and autonomic environments would be through service migration. Such a migration policy has recently been proposed for tree topologies. The focus of the present paper is to devise effective service migration policies for general topologies with equal weight links. The proposed strategy - that incorporates a 2-phase polling mechanism of local scope and, consequently, induces in general a certain overhead - is shown to out-perform the previous one (i.e., getting closer to the optimal placement) for such general topologies. Finally, a hybrid migration policy (combining the present and the past ones) is considered and shown through simulations to be capable of reducing significantly the overhead effects of the afore-mentioned polling mechanism.","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":"121986753","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.4594821
Hannes Frey, F. Ingelrest, D. Simplot-Ryl
We present a localized geographic multicast scheme, MSTEAM, based on the construction of local minimum spanning trees (MSTs), that requires information only on 1-hop neighbors. A message replication occurs when the MST spanning the current node and the set of destinations has multiple edges originated at the current node. Destinations spanned by these edges are grouped together, and for each of these subsets the best neighbor is selected as the next hop. This selection is based on a cost over progress metric, where the progress is approximated by subtracting the weight of the MST over a given neighbor and the subset of destinations to the weight of the MST over the current node and the subset of destinations. Since such greedy scheme may lead the message to a void area (i.e., no neighbor providing positive progress), we propose a new multicast generalization of the well-known face recovery mechanism. We provide a theoretical analysis proving that MSTEAM is loop-free, and achieves delivery of the multicast message as long as a path to the destinations exists. Our results demonstrate that MSTEAM outperforms the best existing localized multicast scheme, and is almost as efficient as a centralized scheme in high densities.
基于局部最小生成树(MSTs)的构造，提出了一种只需要1跳邻居信息的局部地理组播方案MSTEAM。当跨当前节点和目标集的MST具有起源于当前节点的多个边时，就会发生消息复制。由这些边跨越的目的地被分组在一起，对于每个这些子集，选择最佳邻居作为下一跳。这种选择是基于cost over progress度量，其中的进度是通过将给定邻居和目标子集上的MST的权重减去当前节点和目标子集上的MST的权重来近似的。由于这种贪婪方案可能导致消息到达一个空白区域(即没有邻居提供正进展)，我们提出了一种新的组播推广的著名的人脸恢复机制。我们提供了一个理论分析，证明MSTEAM是无环路的，只要存在到达目的地的路径，就可以实现多播消息的传递。结果表明，MSTEAM优于现有的最佳局部多播方案，并且在高密度情况下几乎与集中式多播方案一样高效。
{"title":"Localized minimum spanning tree based multicast routing with energy-efficient guaranteed delivery in ad hoc and sensor networks","authors":"Hannes Frey, F. Ingelrest, D. Simplot-Ryl","doi":"10.1109/WOWMOM.2008.4594821","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594821","url":null,"abstract":"We present a localized geographic multicast scheme, MSTEAM, based on the construction of local minimum spanning trees (MSTs), that requires information only on 1-hop neighbors. A message replication occurs when the MST spanning the current node and the set of destinations has multiple edges originated at the current node. Destinations spanned by these edges are grouped together, and for each of these subsets the best neighbor is selected as the next hop. This selection is based on a cost over progress metric, where the progress is approximated by subtracting the weight of the MST over a given neighbor and the subset of destinations to the weight of the MST over the current node and the subset of destinations. Since such greedy scheme may lead the message to a void area (i.e., no neighbor providing positive progress), we propose a new multicast generalization of the well-known face recovery mechanism. We provide a theoretical analysis proving that MSTEAM is loop-free, and achieves delivery of the multicast message as long as a path to the destinations exists. Our results demonstrate that MSTEAM outperforms the best existing localized multicast scheme, and is almost as efficient as a centralized scheme in high densities.","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":"116271163","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.4594884
Michael Roberts, Nicolas Ducheneaut, James Begole, K. Partridge, Bob Price, V. Bellotti, Alan Walendowski, Paul Rasmussen
One of the main challenges in building multi-user mobile information systems for real-world deployment lies in the development of scalable systems. Recent work on scaling infrastructure for conventional web services using distributed approaches can be applied to the mobile space, but limitations inherent to mobile devices (computational power, battery life) and their communication infrastructure (availability and quality of network connectivity) challenge system designers to carefully design and optimize their software architectures. Additionally, notions of mobility and position in space, unique to mobile systems, provide interesting directions for the segmentation and scalability of mobile information systems. In this paper we describe the implementation of a mobile recommender system for leisure activities, codenamed Magitti, which was built for commercial deployment under stringent scalability requirements. We present concrete solutions addressing these scalability challenges, with the goal of informing the design of future mobile multi-user systems.
{"title":"Scalable architecture for context-aware activity-detecting mobile recommendation systems","authors":"Michael Roberts, Nicolas Ducheneaut, James Begole, K. Partridge, Bob Price, V. Bellotti, Alan Walendowski, Paul Rasmussen","doi":"10.1109/WOWMOM.2008.4594884","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594884","url":null,"abstract":"One of the main challenges in building multi-user mobile information systems for real-world deployment lies in the development of scalable systems. Recent work on scaling infrastructure for conventional web services using distributed approaches can be applied to the mobile space, but limitations inherent to mobile devices (computational power, battery life) and their communication infrastructure (availability and quality of network connectivity) challenge system designers to carefully design and optimize their software architectures. Additionally, notions of mobility and position in space, unique to mobile systems, provide interesting directions for the segmentation and scalability of mobile information systems. In this paper we describe the implementation of a mobile recommender system for leisure activities, codenamed Magitti, which was built for commercial deployment under stringent scalability requirements. We present concrete solutions addressing these scalability challenges, with the goal of informing the design of future mobile multi-user systems.","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":"114448049","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.4594847
A. Harris, Robin Snader, R. Kravets
As mobile systems become increasing prevalent, they are being called upon to run multimedia applications traditionally associated with the wired domain. Unfortunately, battery capacity is not keeping pace with system demand, driving the demand for energy efficiency. Unfortunately, the encapsulation of traditional layered designs limits the energy that can be saved because layers cannot cooperate. However, monolithic systems have been shown to be inefficient and unscalable. In this paper, we present the design and implementation of a system consisting of multiple adaptive applications, and adaptive MAC and transport layers. We evaluate this system by implementing an adaptive video encoding application, showing that a layered approach sharing enough information can enable energy efficiency while maintaining sufficient isolation to allow the replacement of components without requiring a whole-system redesign.
{"title":"Mobile system energy conservation for adaptive multimedia applications","authors":"A. Harris, Robin Snader, R. Kravets","doi":"10.1109/WOWMOM.2008.4594847","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594847","url":null,"abstract":"As mobile systems become increasing prevalent, they are being called upon to run multimedia applications traditionally associated with the wired domain. Unfortunately, battery capacity is not keeping pace with system demand, driving the demand for energy efficiency. Unfortunately, the encapsulation of traditional layered designs limits the energy that can be saved because layers cannot cooperate. However, monolithic systems have been shown to be inefficient and unscalable. In this paper, we present the design and implementation of a system consisting of multiple adaptive applications, and adaptive MAC and transport layers. We evaluate this system by implementing an adaptive video encoding application, showing that a layered approach sharing enough information can enable energy efficiency while maintaining sufficient isolation to allow the replacement of components without requiring a whole-system redesign.","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":"130740875","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.4594922
K. Miyao, Hidehisa Nakayama, N. Ansari, Y. Nemoto, N. Kato
Data confidentiality is one of the most important concerns in security of ad-hoc networks which have been widely studied in recent years. In this paper, we consider the public-key cryptography which is one of the simplest and viable means to maintain data confidentiality. There are several ways to distribute a public key. Flooding is an intuitive approach to distribute each nodepsilas public key. However, the normal flooding approach is costly, and can cause MAC-level contention in a dense region of nodes. Tree based topology flooding can be applied to mitigate these problems. The construction algorithm should use ideally only local information. In this paper, we propose a completely localized algorithm called the Local Tree-based Reliable Topology (LTRT) algorithm, which achieves both reliability and efficiency. LTRT is a localized version of TRT that has 2-edge connectivity. Each node can distribute its public key to all other nodes in the network by LTRT. Simulation results show the efficiency of LTRT and its superiority over other localized algorithms.
{"title":"A reliable topology for efficient key distribution in ad-hoc networks","authors":"K. Miyao, Hidehisa Nakayama, N. Ansari, Y. Nemoto, N. Kato","doi":"10.1109/WOWMOM.2008.4594922","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594922","url":null,"abstract":"Data confidentiality is one of the most important concerns in security of ad-hoc networks which have been widely studied in recent years. In this paper, we consider the public-key cryptography which is one of the simplest and viable means to maintain data confidentiality. There are several ways to distribute a public key. Flooding is an intuitive approach to distribute each nodepsilas public key. However, the normal flooding approach is costly, and can cause MAC-level contention in a dense region of nodes. Tree based topology flooding can be applied to mitigate these problems. The construction algorithm should use ideally only local information. In this paper, we propose a completely localized algorithm called the Local Tree-based Reliable Topology (LTRT) algorithm, which achieves both reliability and efficiency. LTRT is a localized version of TRT that has 2-edge connectivity. Each node can distribute its public key to all other nodes in the network by LTRT. Simulation results show the efficiency of LTRT and its superiority over other localized algorithms.","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":"128757233","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.4594845
G. Nogueira, B. Baynat, Ahmed Ziram
This paper presents a simple and accurate analytical model to dimension mobile cellular networks with QoS differentiation. QoS per applicative flow is commonly defined in GPRS/EDGE and 3G systems where streaming applications with real time properties and elastic data applications have to share radio resources. The need for accurate and fast-computing tools is of primary importance to tackle complex and exhaustive dimensioning issues. In this paper, we present a generic QoS modeling methodology developed in the context of EDGE networks but that can be adapted easily to a different technology. We develop a ldquoconditional product-formrdquo Markovian model that takes into account the QoS differentiation between real time and non-real time classes and gives closed form expressions for all the required performance parameters at a click speed. We compare our model with simulation and show its accuracy. The speed of our analytical tool allows tackling dimensioning issues that require several thousands of evaluations, which is not tractable with any simulation tool.
{"title":"An efficient analytical model for QoS engineering in mobile cellular networks","authors":"G. Nogueira, B. Baynat, Ahmed Ziram","doi":"10.1109/WOWMOM.2008.4594845","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594845","url":null,"abstract":"This paper presents a simple and accurate analytical model to dimension mobile cellular networks with QoS differentiation. QoS per applicative flow is commonly defined in GPRS/EDGE and 3G systems where streaming applications with real time properties and elastic data applications have to share radio resources. The need for accurate and fast-computing tools is of primary importance to tackle complex and exhaustive dimensioning issues. In this paper, we present a generic QoS modeling methodology developed in the context of EDGE networks but that can be adapted easily to a different technology. We develop a ldquoconditional product-formrdquo Markovian model that takes into account the QoS differentiation between real time and non-real time classes and gives closed form expressions for all the required performance parameters at a click speed. We compare our model with simulation and show its accuracy. The speed of our analytical tool allows tackling dimensioning issues that require several thousands of evaluations, which is not tractable with any simulation tool.","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":"134229100","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.4594882
Erik Koch, H. Witt
In this paper we describe a novel wearable interaction device that is based on the principle of a badge reel often found in corporate environments. Our prototype devices are composed of hardware components from an ordinary off-the-shelf game pad. Preliminary results of a user study, conducted in the first prototyping cycle, showed that the device concept allows for a more accurate and intuitive interaction than an ordinary game pad when performing navigation tasks in a three-dimensional information space. Furthermore, the study suggests that device operation requires minimal attention demands due to provided tactile feedback cues when maneuvering the retractable string. Finally, the paper discusses lessons learn from the first prototyping cycle and presents the modified device after the second prototyping cycle.
{"title":"Prototyping a chest-worn string-based wearable input device","authors":"Erik Koch, H. Witt","doi":"10.1109/WOWMOM.2008.4594882","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594882","url":null,"abstract":"In this paper we describe a novel wearable interaction device that is based on the principle of a badge reel often found in corporate environments. Our prototype devices are composed of hardware components from an ordinary off-the-shelf game pad. Preliminary results of a user study, conducted in the first prototyping cycle, showed that the device concept allows for a more accurate and intuitive interaction than an ordinary game pad when performing navigation tasks in a three-dimensional information space. Furthermore, the study suggests that device operation requires minimal attention demands due to provided tactile feedback cues when maneuvering the retractable string. Finally, the paper discusses lessons learn from the first prototyping cycle and presents the modified device after the second prototyping cycle.","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":"133323765","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.4594837
Liang Liu, Xi Zhang, Huadong Ma
Target tracking and localization are important applications in camera sensor networks. Although coverage is a very important research topic in wireless sensor networks, and the coverage problem for target detection has been intensively studied, few considers the coverage problem from the perspective of target localization. In this paper, we investigate the coverage problem from the perspective of target localization for camera sensor networks. We first propose a novel localization-oriented sensing model based on the perspective projection of camera. Then, we propose a new notion of localization-oriented coverage (L-coverage for short). We assume that all camera sensors make the measurements independent of other in the field, and these camera sensors can cooperate to make an accurate estimation for the location of the target. In addition, the relationships among L-coverage, 2-coverage, and the density of camera sensors are also discussed in this paper. The obtained results show that our model can be effectively deployed in many practical scenarios.
{"title":"Localization-oriented coverage based on Bayesian estimation in camera sensor networks","authors":"Liang Liu, Xi Zhang, Huadong Ma","doi":"10.1109/WOWMOM.2008.4594837","DOIUrl":"https://doi.org/10.1109/WOWMOM.2008.4594837","url":null,"abstract":"Target tracking and localization are important applications in camera sensor networks. Although coverage is a very important research topic in wireless sensor networks, and the coverage problem for target detection has been intensively studied, few considers the coverage problem from the perspective of target localization. In this paper, we investigate the coverage problem from the perspective of target localization for camera sensor networks. We first propose a novel localization-oriented sensing model based on the perspective projection of camera. Then, we propose a new notion of localization-oriented coverage (L-coverage for short). We assume that all camera sensors make the measurements independent of other in the field, and these camera sensors can cooperate to make an accurate estimation for the location of the target. In addition, the relationships among L-coverage, 2-coverage, and the density of camera sensors are also discussed in this paper. The obtained results show that our model can be effectively deployed in many practical scenarios.","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":"115788337","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
扫码关注我们
求助内容：
应助结果提醒方式：