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

Geographically bound mobile agent in MANET 地域绑定移动代理在MANET

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

K. Tei, Y. Fukazawa, S. Honiden, Nobukazu Yoshioka

{"title":"Geographically bound mobile agent in MANET","authors":"K. Tei, Y. Fukazawa, S. Honiden, Nobukazu Yoshioka","doi":"10.1109/MOBIQUITOUS.2005.31","DOIUrl":"https://doi.org/10.1109/MOBIQUITOUS.2005.31","url":null,"abstract":"A location-specific data retrieval, which is data retrieval from nodes in a designated region at the time, is an attractive application in a mobile ad-hoc network (MANET). However, almost all nodes in a MANET are powered by batteries, the location-specific data retrieval should involve a small number of messages. In this paper, we use a mobile agent to retrieve the location-specific data. A mobile agent migrates to a node in a designated region, and retrieves data from nodes in this region. Since, after migration, the agent can communicate with nodes in the designated region through low overhead short length hops, the mobile agent can retrieve data at low message cost for long periods, even if the owner of this agent moves around. However, even after migrating to node in the designated region, in order to stay near this region, a mobile agent should migrate to other nodes in response to the movement of the node hosting this agent. In this paper, we propose the geographically bound mobile agent (GBMA) which is a mobile agent that periodically migrates in order to always be located in a designated region. In order to clarify where the GBMA should be located and when the GBMA starts to migrate, two geographic zones are set to the GBMA: required zone and expected zone. The required zone ease tracking of the GBMA, and the expected zone ease adjustment of the GBMA migration timing.","PeriodicalId":129488,"journal":{"name":"The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services","volume":"43 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":"122476513","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}

引用次数: 9

Embedded SW design issues for distributed applications on mobile terminals 移动终端分布式应用的嵌入式软件设计问题

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

F. Fummi, S. Martini, G. Perbellini, F. Ricciato, M. Turolla

引用次数: 1

Decentralizing query processing in 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.22

R. Rosemark, Wang-Chien Lee

引用次数: 19

WebProfiles: a negotiation model for user awareness in personal area networks WebProfiles:个人区域网络中用户意识的协商模型

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

Juan Ignacio Vázquez, D. López-de-Ipiña

引用次数: 2

An efficient peer-to-peer lookup protocol for location-aware mobile 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.12

D. Kim, Chan-Ik Park

引用次数: 0

Secure reporting of traffic forwarding activity in mobile 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.53

Heesook Choi, W. Enck, Jaesheung Shin, P. Mcdaniel, T. L. Porta

{"title":"Secure reporting of traffic forwarding activity in mobile ad hoc networks","authors":"Heesook Choi, W. Enck, Jaesheung Shin, P. Mcdaniel, T. L. Porta","doi":"10.1109/MOBIQUITOUS.2005.53","DOIUrl":"https://doi.org/10.1109/MOBIQUITOUS.2005.53","url":null,"abstract":"Nodes forward data on behalf of each other in mobile ad hoc networks. In a civilian application, nodes are assumed to be selfish and rational, i.e., they pursue their own self-interest. Hence, the ability to accurately measure traffic forwarding is critical to ensure proper network operation. These measurements are often used to credit nodes based on their level of participation, or to detect loss. Past solutions employ neighbor monitoring and reporting on node forwarding traffic. These methods are not applicable in civilian networks where neighbor nodes lack the desire or ability to perform the monitoring function. Such environments occur frequently in which neighbor hosts are resource constrained, or in networks where directional antennas are used and reliable monitoring is difficult or impossible. In this paper, we propose a protocol that uses nodes on the data path to securely produce packet forwarding reports. Reporting nodes are chosen randomly and secretly so that malicious nodes cannot modify their behavior based upon the monitoring point. The integrity and authenticity of reports are preserved through the use of secure link layer acknowledgments and monitoring reports. The robustness of the reporting mechanism is strengthened by forwarding the report to multiple destinations (source and destination). We explore the security, cost, and accuracy of our protocol.","PeriodicalId":129488,"journal":{"name":"The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services","volume":"106 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":"128185518","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}

引用次数: 9

Dynamically re-configurable communication protocols using key identifiers 使用密钥标识符动态地重新配置通信协议

The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services Pub Date : 2005-07-17 DOI: 10.1007/11557654_7

Kaushalya Premadasa, B. Landfeldt

引用次数: 1

On incremental processing of continual range queries for location-aware services and applications 关于位置感知服务和应用程序的连续范围查询的增量处理

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

Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu

{"title":"On incremental processing of continual range queries for location-aware services and applications","authors":"Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu","doi":"10.1109/MOBIQUITOUS.2005.42","DOIUrl":"https://doi.org/10.1109/MOBIQUITOUS.2005.42","url":null,"abstract":"A set of continual range queries, each defining the geographical region of interest, can be periodically re-evaluated to locate moving objects. Processing these continual queries efficiently and incrementally hence becomes important for location-aware services and applications. In this paper, we study a new query indexing method, called CES-based indexing, for incremental processing of continual range queries over moving objects. A set of containment-encoded squares (CES) are predefined, each with a unique ID. CES's are virtual constructs (VC) used to decompose query regions and to store indirectly pre-computed search results. Compared with a prior VC-based approach, the number of VC's visited in an index search in CES-based indexing is reduced from (4L/sup 2/-1)/3 to log(L)+1, where L is the maximal side length of a VC. Search time is hence significantly lowered. Moreover, containment encoding among the CES's makes it easy to identify all those VC's that need not be visited during an incremental query reevaluation. We study the performance of CES-based indexing and compare it with a prior VC-based approach.","PeriodicalId":129488,"journal":{"name":"The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services","volume":"21 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":"128239392","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}

引用次数: 25

Routing in MANETs with address conflicts 地址冲突的manet路由

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

Kwan-Wu Chin, D. Lowe, W. H. Lau

{"title":"Routing in MANETs with address conflicts","authors":"Kwan-Wu Chin, D. Lowe, W. H. Lau","doi":"10.1109/MOBIQUITOUS.2005.51","DOIUrl":"https://doi.org/10.1109/MOBIQUITOUS.2005.51","url":null,"abstract":"Mobile ad-hoc networks (MANETs) are dynamic and multi-hop in nature. As nodes continually join and leave the MANET, managing the problem of address conflicts is particularly challenging. In the past, researchers have gone to great lengths to ensure that nodes are assigned unique addresses and various protocols and policies have been designed to resolve address conflicts. In this paper, we argue that current solutions, originally designed for static wired networks, put unnecessary stress on the dynamic operation of a MANET. To solve, this problem, we present a MANET that can continue to operate even when there are conflicting addresses. Unlike previous solutions, our technique does not break applications by requiring nodes to renumber. Further, the overheads introduced by traditional address allocation and maintenance protocols are removed. All these improvements are effected by introducing of a new routing sub-layer that enables a reactive routing protocol to route packets through a MANET that is experiencing address conflicts. This routing sub-layer provides features such as conflict avoidance forwarding, conflict notification, and enhanced address resolution.","PeriodicalId":129488,"journal":{"name":"The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services","volume":"49 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":"114054948","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

Efficient aggregation of encrypted 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.25

C. Castelluccia, Einar Mykletun, G. Tsudik

引用次数: 614