The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services最新文献_第6页

A peer-to-peer architecture for context lookup 用于上下文查找的点对点架构

The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services Pub Date : 2005-07-17 DOI: 10.1109/MOBIQUITOUS.2005.5

T. Gu, Edmond Tan, H. Pung, Daqing Zhang

引用次数: 14

A reputation-based mechanism for isolating selfish nodes in ad hoc networks 一种基于声誉的机制，用于在自组织网络中隔离自私节点

The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services Pub Date : 2005-07-17 DOI: 10.1109/MOBIQUITOUS.2005.7

M. Refaei, Vivek Srivastava, L. Dasilva, M. Eltoweissy

{"title":"A reputation-based mechanism for isolating selfish nodes in ad hoc networks","authors":"M. Refaei, Vivek Srivastava, L. Dasilva, M. Eltoweissy","doi":"10.1109/MOBIQUITOUS.2005.7","DOIUrl":"https://doi.org/10.1109/MOBIQUITOUS.2005.7","url":null,"abstract":"For ad hoc networks to realize their potential in commercial deployments, it is important that they incorporate adequate security measures. Selfish behavior of autonomous network nodes could greatly disrupt network operation. Such behavior should be discouraged, detected, and isolated. In this paper, we propose a reputation-based mechanism to detect and isolate selfish nodes in an ad hoc network. The proposed mechanism allows a node to autonomously evaluate the \"reputation\" of its neighbors based on the completion of the requested service. The underlying principle is that when a node forwards a packet through one of its neighbors, it holds that neighbor responsible for the correct delivery of the packet to the destination. Our mechanism is efficient and immune to node collusion since, unlike most contemporary mechanisms for reputation-based trust, it does not depend on exchanging reputation information among nodes. We also explore various reputation functions and report on their effectiveness in isolating selfish nodes and reducing false positives. Our simulation results demonstrate that the choice of the reputation function greatly impacts performance and that the proposed mechanism, with a carefully selected function, is successful in isolating selfish nodes while maintaining false positives at a reasonably low level.","PeriodicalId":129488,"journal":{"name":"The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127487342","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}

引用次数: 149

MPA assisted optimized proactive handoff scheme MPA辅助优化主动切换方案

The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services Pub Date : 2005-07-17 DOI: 10.1109/MOBIQUITOUS.2005.38

A. Dutta, Zhang Tao, Y. Ohba, K. Taniuchi, H. Schulzrinne

引用次数: 30

StateSnap: a snapshot-based interface for state-reproductable operation of networked appliances 一个基于快照的接口，用于网络设备的状态再现操作

The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services Pub Date : 2005-07-17 DOI: 10.1109/MOBIQUITOUS.2005.55

N. Kohtake, Takeshi Iwamoto, Genta Suzuki, Shun Aoki, K. Takashio, H. Tokuda

{"title":"StateSnap: a snapshot-based interface for state-reproductable operation of networked appliances","authors":"N. Kohtake, Takeshi Iwamoto, Genta Suzuki, Shun Aoki, K. Takashio, H. Tokuda","doi":"10.1109/MOBIQUITOUS.2005.55","DOIUrl":"https://doi.org/10.1109/MOBIQUITOUS.2005.55","url":null,"abstract":"This paper describes a snapshot-based interface for networked appliances operations that allows users to store and reproduce the conditions of media contents in those appliances by means of photographed image data of the networked appliances. The conditions of the appliances are stored as metadata in photographed image data and displayed over a display of each appliance. A user can reproduce the state of the appliances with those image data. Furthermore, such a reproduction can be made on other appliances with the same function. Storing the information as image data makes it easy for a user to refer to an exact data out of an enormous amount of data. One of advantages of this system is that, by photographing many appliances at the same time, one image data can hold various appliances conditions. We have developed a prototype system to realize the proposed interface and some applications to confirm its effective usage. We have also confirmed its possibility for practical use through an evaluation of the system's performance.","PeriodicalId":129488,"journal":{"name":"The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services","volume":"427 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133339279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Correlation analysis for alleviating effects of inserted data in wireless sensor networks 减轻无线传感器网络中插入数据影响的相关分析

The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services Pub Date : 2005-07-17 DOI: 10.1109/MOBIQUITOUS.2005.20

Sapon Tanachaiwiwat, A. Helmy

引用次数: 36

Plethora: a framework for converting generic applications to run in a ubiquitous environment 一个将通用应用程序转换为在通用环境中运行的框架

The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services Pub Date : 2005-07-17 DOI: 10.1109/MOBIQUITOUS.2005.47

Z. Anwar, J. Al-Muhtadi, W. Yurcik, R. Campbell

{"title":"Plethora: a framework for converting generic applications to run in a ubiquitous environment","authors":"Z. Anwar, J. Al-Muhtadi, W. Yurcik, R. Campbell","doi":"10.1109/MOBIQUITOUS.2005.47","DOIUrl":"https://doi.org/10.1109/MOBIQUITOUS.2005.47","url":null,"abstract":"Applications designed for ubiquitous computing environments need to be coded in a specific way in order to fully realize the benefits of ubiquitous computing. Currently, applications for ubiquitous computing environments either need to be rewritten entirely to benefit from ubiquity, or special wrappers need to be written and customized for particular applications to provide limited compatibility. We argue that the real-world deployment of ubiquitous computing will be realized when users can migrate and use the applications they are familiar with in their daily lives with minimal effort. Furthermore, these applications should automatically benefit from typical ubiquitous computing features including multi-device support, runtime adaptation, environment-independence and context-awareness. In this paper we present a framework that allows us to port any generic application to the domain of ubiquitous computing without having to rewrite the code from scratch. We have experimented with the framework in our prototype ubiquitous computing platform known as active spaces. This has allowed us to explosively increase the number of applications supported by our active space.","PeriodicalId":129488,"journal":{"name":"The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services","volume":"312 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116630475","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A generalization of the FACE ROUTING algorithm to a class of non-planar networks FACE ROUTING算法在一类非平面网络中的推广

The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services Pub Date : 2005-07-17 DOI: 10.1109/MOBIQUITOUS.2005.3

Sabeel Ansari, L. Narayanan, J. Opatrny

{"title":"A generalization of the FACE ROUTING algorithm to a class of non-planar networks","authors":"Sabeel Ansari, L. Narayanan, J. Opatrny","doi":"10.1109/MOBIQUITOUS.2005.3","DOIUrl":"https://doi.org/10.1109/MOBIQUITOUS.2005.3","url":null,"abstract":"We consider the problem of routing with guaranteed delivery in ad-hoc wireless networks using the positions of the mobile hosts. Such networks can be modeled as geometric graphs. FACE ROUTING [Bose, P et al. (1999), Karp, B et al. (2000)] is a position-based routing algorithm for planar geometric graphs that guarantees delivery of messages without flooding control packets throughout the network. For general ad hoc networks, FACE ROUTING can use a planar sub-graph of the original graph; many local and distributed algorithms have been proposed to extract such a planar sub-graph. However, these planarization algorithms may fail in some situations, such as when the transmission ranges are not the same, for example, due to the presence of obstacles, which in turn may cause a routing failure. In this paper, we describe a generalization of FACE ROUTING that can guarantee delivery in planar graphs with disjoint crossing edges added. Our algorithm needs O(/spl lscr/) memory, where /spl lscr/ is the maximum number of edges in any face in a graph obtained by removing one edge in each pair of crossing edges.","PeriodicalId":129488,"journal":{"name":"The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131948233","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}

引用次数: 5

Multi-constraint dynamic access selection in always best connected networks 始终最佳连接网络中的多约束动态接入选择

The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services Pub Date : 2005-07-17 DOI: 10.1109/MOBIQUITOUS.2005.39

Bo Xing, N. Venkatasubramanian

{"title":"Multi-constraint dynamic access selection in always best connected networks","authors":"Bo Xing, N. Venkatasubramanian","doi":"10.1109/MOBIQUITOUS.2005.39","DOIUrl":"https://doi.org/10.1109/MOBIQUITOUS.2005.39","url":null,"abstract":"In future generation networks, various access technologies, such as Wi-Fi, Bluetooth, GPRS and UMTS, etc., are simultaneously available to mobile devices. They vary in characteristics (communication range, power consumption, security, etc.) and QoS parameters (bandwidth, delay, etc.) The notion of always best connected (ABC) enables people to run applications over the most efficient combination of access technologies with continuous connectivity. Access selection is the key functional block in ABC solutions, as it chooses the most suitable access networks for application traffic flows. However, it is important that access selection decisions be dynamically made, minimizing the power consumption on mobile devices while satisfying QoS requirements and user/application preferences. In this paper, we model the problem of multi-constraint dynamic access selection (MCDAS) as a variant of bin packing problem. A series of approximation algorithms derived from the first fit decreasing (FFD) algorithm are proposed for finding near-optimal solutions. Simulation studies show that the algorithms we propose gradually improve performance towards quasi-optimal solutions in terms of power consumption and preference satisfaction.","PeriodicalId":129488,"journal":{"name":"The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132129584","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}

引用次数: 67

Multi-path admission control for mobile ad hoc networks 移动自组织网络的多路径准入控制

The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services Pub Date : 2004-10-01 DOI: 10.1145/1052871.1052879

Anders Lindgren, E. Belding-Royer

引用次数: 38