This paper presents an architectural solution to address the problem of scalable routing for data intensive applications in very large sensor networks. Due to large routing overheads, the control complexity of the existing sensor routing protocols, both node-centric and data-centric, do not scale well in very large networks with potentially thousands of sensor devices. In this paper, we develop a hybrid architectural solution off-network control processing (ONCP) that achieves scalable routing in large networks by shifting certain amount of routing functions to an "off-network" routing server. A tiered routing approach is proposed to avoid network-wide control message dissemination. Our experimental results indicate that for large sensor networks with realistic data models, the packet drop, latency, energy performance and bandwidth usage of ONCP can be significantly better than those for completely distributed routing protocols such as directed diffusion.
{"title":"Scalable Hybrid Routing in Very Large Sensor Networks","authors":"Tao Wu, Fan Yu, S. Biswas","doi":"10.1109/MDM.2007.77","DOIUrl":"https://doi.org/10.1109/MDM.2007.77","url":null,"abstract":"This paper presents an architectural solution to address the problem of scalable routing for data intensive applications in very large sensor networks. Due to large routing overheads, the control complexity of the existing sensor routing protocols, both node-centric and data-centric, do not scale well in very large networks with potentially thousands of sensor devices. In this paper, we develop a hybrid architectural solution off-network control processing (ONCP) that achieves scalable routing in large networks by shifting certain amount of routing functions to an \"off-network\" routing server. A tiered routing approach is proposed to avoid network-wide control message dissemination. Our experimental results indicate that for large sensor networks with realistic data models, the packet drop, latency, energy performance and bandwidth usage of ONCP can be significantly better than those for completely distributed routing protocols such as directed diffusion.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114155700","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}
We discuss the integration of on-line data stream clustering into a distributed query processor for wireless sensor networks (WSNs). Our approach is to combine an adaptive clustering algorithm with in-network data processing by introducing specialised query operators that implement stateful stream processing. We have implemented a testbed for an on-line clustering algorithm as part of a query processing system for the Sun SPOT sensor network platform. The paper discusses the design alternatives for continuous stream clustering in WSNs and for the integration of the resource-awareness to be able to trade result accuracy for resource consumption.
{"title":"On the Integration of Data Stream Clustering into a Query Processor for Wireless Sensor Networks","authors":"Uwe Röhm, Bernhard Scholz, M. Gaber","doi":"10.1109/MDM.2007.70","DOIUrl":"https://doi.org/10.1109/MDM.2007.70","url":null,"abstract":"We discuss the integration of on-line data stream clustering into a distributed query processor for wireless sensor networks (WSNs). Our approach is to combine an adaptive clustering algorithm with in-network data processing by introducing specialised query operators that implement stateful stream processing. We have implemented a testbed for an on-line clustering algorithm as part of a query processing system for the Sun SPOT sensor network platform. The paper discusses the design alternatives for continuous stream clustering in WSNs and for the integration of the resource-awareness to be able to trade result accuracy for resource consumption.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114737228","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}
D. Zeinalipour-Yazti, P. Andreou, Panos K. Chrysanthis, G. Samaras
In this paper we introduce MINT (materialized in-network top-k) Views, a novel framework for optimizing the execution of continuous monitoring queries in sensor networks. A typical materialized view V maintains the complete results of a query Q in order to minimize the cost of future query executions. In a sensor network context, maintaining consistency between V and the underlying and distributed base relation R is very expensive in terms of communication. Thus, our approach focuses on a subset V(sube. V) that unveils only the k highest-ranked answers at the sink for some user defined parameter k. We additionally provide an elaborate description of energy-conscious algorithms for constructing, pruning and maintaining such recursively- defined in-network views. Our trace-driven experimentation with real datasets show that MINT offers significant energy reductions compared to other predominant data acquisition models.
{"title":"MINT Views: Materialized In-Network Top-k Views in Sensor Networks","authors":"D. Zeinalipour-Yazti, P. Andreou, Panos K. Chrysanthis, G. Samaras","doi":"10.1109/MDM.2007.34","DOIUrl":"https://doi.org/10.1109/MDM.2007.34","url":null,"abstract":"In this paper we introduce MINT (materialized in-network top-k) Views, a novel framework for optimizing the execution of continuous monitoring queries in sensor networks. A typical materialized view V maintains the complete results of a query Q in order to minimize the cost of future query executions. In a sensor network context, maintaining consistency between V and the underlying and distributed base relation R is very expensive in terms of communication. Thus, our approach focuses on a subset V(sube. V) that unveils only the k highest-ranked answers at the sink for some user defined parameter k. We additionally provide an elaborate description of energy-conscious algorithms for constructing, pruning and maintaining such recursively- defined in-network views. Our trace-driven experimentation with real datasets show that MINT offers significant energy reductions compared to other predominant data acquisition models.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117136734","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}
We consider the problem of processing join queries in a wireless sensor network, focusing on where (which sensor node(s)) to process the join. We propose four strategies for processing such queries and investigate their performance across several scenarios. Not surprisingly, our experiments show that no single strategy performs best for all scenarios. In order to avoid the potential high cost of using a fixed strategy for processing all queries, we develop a cost-based model that can be used to select the best join strategy for the query at hand. Our experiments confirm that, given a set of queries, selecting the join strategy based on the cost model is always better than using any fixed strategy for all queries.
{"title":"On Join Location in Sensor Networks","authors":"Alexandru Coman, M. Nascimento, J. Sander","doi":"10.1109/MDM.2007.35","DOIUrl":"https://doi.org/10.1109/MDM.2007.35","url":null,"abstract":"We consider the problem of processing join queries in a wireless sensor network, focusing on where (which sensor node(s)) to process the join. We propose four strategies for processing such queries and investigate their performance across several scenarios. Not surprisingly, our experiments show that no single strategy performs best for all scenarios. In order to avoid the potential high cost of using a fixed strategy for processing all queries, we develop a cost-based model that can be used to select the best join strategy for the query at hand. Our experiments confirm that, given a set of queries, selecting the join strategy based on the cost model is always better than using any fixed strategy for all queries.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125526183","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}
Data consistency protocols are vital ingredients of mobile data management systems. Notable research efforts have been spent to find adequate consistency models for allowing mobile and nomadic users to share mutable data. Recently, mobile Ambient Service infrastructures that pose somewhat different requirements have entered the focus of attention. Ambient services are not as loosely coupled as the afore-mentioned systems, but they still need flexible consistency protocols that may adapt to the current dynamics in the system. We propose an extension to the well-known anti-entropy protocol that makes use of the nature of Ambient Service environments to allow for a flexible consistency management among arbitrary groups of mobile service replicas. We will show that our protocol can exploit the concept of group updates to increase its efficiency in terms of bandwidth usage. Furthermore, we prove that it avoids costly state transfers by means of a simple rule that limits the divergence within the overall set of replicas. Finally, we introduce two parameters for adjusting the level of consistency in system, and we present experimental results that show the effectiveness and the efficiency of the protocol.
{"title":"Group Anti-Entropy - Achieving Eventual Consistency in Mobile Service Environments","authors":"K. Herrmann","doi":"10.1109/MDM.2007.26","DOIUrl":"https://doi.org/10.1109/MDM.2007.26","url":null,"abstract":"Data consistency protocols are vital ingredients of mobile data management systems. Notable research efforts have been spent to find adequate consistency models for allowing mobile and nomadic users to share mutable data. Recently, mobile Ambient Service infrastructures that pose somewhat different requirements have entered the focus of attention. Ambient services are not as loosely coupled as the afore-mentioned systems, but they still need flexible consistency protocols that may adapt to the current dynamics in the system. We propose an extension to the well-known anti-entropy protocol that makes use of the nature of Ambient Service environments to allow for a flexible consistency management among arbitrary groups of mobile service replicas. We will show that our protocol can exploit the concept of group updates to increase its efficiency in terms of bandwidth usage. Furthermore, we prove that it avoids costly state transfers by means of a simple rule that limits the divergence within the overall set of replicas. Finally, we introduce two parameters for adjusting the level of consistency in system, and we present experimental results that show the effectiveness and the efficiency of the protocol.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129710448","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}
Camera networks have been paid much attention in sensor networks since those network are useful to visualize a phenomenon sensed by other sensors for temperature, humidity, and light. When a user selects a point of an area deployed cameras in an application, a geographic routing is best used as a routing of the camera network. In conventional geographic routing, the destination of a message should be the location of a node. However, this is not suitable for sensors that cover a wide or directed sensing area such as cameras. To cope with this problem, we propose a modified geographic routing scheme called SenriGan. SenriGan accommodates specifying a sensed point as a destination instead of using a location of a node. In this demonstration, we show a prototype system of SenriGan.
{"title":"A Sensed-Point-Oriented Geographic Routing for Camera Networks","authors":"H. Ishizuka, Y. Tobe","doi":"10.1109/MDM.2007.38","DOIUrl":"https://doi.org/10.1109/MDM.2007.38","url":null,"abstract":"Camera networks have been paid much attention in sensor networks since those network are useful to visualize a phenomenon sensed by other sensors for temperature, humidity, and light. When a user selects a point of an area deployed cameras in an application, a geographic routing is best used as a routing of the camera network. In conventional geographic routing, the destination of a message should be the location of a node. However, this is not suitable for sensors that cover a wide or directed sensing area such as cameras. To cope with this problem, we propose a modified geographic routing scheme called SenriGan. SenriGan accommodates specifying a sensed point as a destination instead of using a location of a node. In this demonstration, we show a prototype system of SenriGan.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128724912","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}
Location technology allows for the tracking and tracing of individuals. Users may increasingly be concerned about the abilities of new technology to keep an eye on ones' private life. There are concerns that the increased privacy awareness among citizens and legislation may hinder the success and further development of these technologies. An analysis of the European legal framework for protecting individual's privacy versus private sector use of location information and public sector use in the intelligence services indicates that individuals should be most aware on intrusions in their privacy by intelligence services. The privacy legislation lets the user be in control of the decision if and when his location information may be used by private sector location based services providers. Users seem often willing to allow this, judging by the increase in available location based services. The privacy legislation is not as protective regarding the use for law enforcement and secret intelligence purposes. Thus the location technology industry is also likely to prosper from the investments of the public intelligence sector.
{"title":"Privacy (Regimes) Do Not Threaten Location Technology Development","authors":"B. V. Loenen, J. Zevenbergen","doi":"10.1109/MDM.2007.50","DOIUrl":"https://doi.org/10.1109/MDM.2007.50","url":null,"abstract":"Location technology allows for the tracking and tracing of individuals. Users may increasingly be concerned about the abilities of new technology to keep an eye on ones' private life. There are concerns that the increased privacy awareness among citizens and legislation may hinder the success and further development of these technologies. An analysis of the European legal framework for protecting individual's privacy versus private sector use of location information and public sector use in the intelligence services indicates that individuals should be most aware on intrusions in their privacy by intelligence services. The privacy legislation lets the user be in control of the decision if and when his location information may be used by private sector location based services providers. Users seem often willing to allow this, judging by the increase in available location based services. The privacy legislation is not as protective regarding the use for law enforcement and secret intelligence purposes. Thus the location technology industry is also likely to prosper from the investments of the public intelligence sector.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127775608","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}
In this paper, we investigate adaptive control for broadcast scheduling and base station caching in the hybrid wireless broadcast (HWB) environment. The proposed adaptive method can adapt well to different access conditions and bandwidth capabilities and adequately exploit the three data delivery modes: push-based broadcast, pull- based broadcast, and pull-based point-to-point communication. Simulation studies demonstrated that our proposed method achieves significant performance improvement in average waiting time and success rate.
{"title":"An Adaptive Control Method in the Hybrid Wireless Broadcast Environment","authors":"Jing Cai, T. Terada, T. Hara, S. Nishio","doi":"10.1109/MDM.2007.21","DOIUrl":"https://doi.org/10.1109/MDM.2007.21","url":null,"abstract":"In this paper, we investigate adaptive control for broadcast scheduling and base station caching in the hybrid wireless broadcast (HWB) environment. The proposed adaptive method can adapt well to different access conditions and bandwidth capabilities and adequately exploit the three data delivery modes: push-based broadcast, pull- based broadcast, and pull-based point-to-point communication. Simulation studies demonstrated that our proposed method achieves significant performance improvement in average waiting time and success rate.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127390658","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}
The performance of distributed algorithms in mobile ad hoc networks is strongly influenced by the connectivity of the network. In cases where the connectivity is low, network partitioning occurs. The mobility and the density of network nodes as well as the communication technology are fundamental properties that have a large impact on partitioning. A detailed characterization of this behavior helps to improve the performance of distributed algorithms. In this paper we introduce a set of metrics that characterize partitioning in mobile ad hoc networks. Based on an extensive simulation study we show the impact of node mobility, density and transmission range on the proposed metrics for a wide range of network scenarios.
{"title":"Quantifying Network Partitioning in Mobile Ad Hoc Networks","authors":"J. Hähner, D. Dudkowski, P. Marrón, K. Rothermel","doi":"10.1109/MDM.2007.33","DOIUrl":"https://doi.org/10.1109/MDM.2007.33","url":null,"abstract":"The performance of distributed algorithms in mobile ad hoc networks is strongly influenced by the connectivity of the network. In cases where the connectivity is low, network partitioning occurs. The mobility and the density of network nodes as well as the communication technology are fundamental properties that have a large impact on partitioning. A detailed characterization of this behavior helps to improve the performance of distributed algorithms. In this paper we introduce a set of metrics that characterize partitioning in mobile ad hoc networks. Based on an extensive simulation study we show the impact of node mobility, density and transmission range on the proposed metrics for a wide range of network scenarios.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129108572","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}
Ad hoc networks rely on nodes forwarding each other's packets, making trust and cooperation key issues for ensuring network performance. As long as all nodes in the network belong to the same organization and share the same goal (in military scenarios, for example), it can generally be expected that all nodes can be trusted. However, as wireless technology becomes more commonplace, we can foresee the appearance of very large, heterogeneous networks where the intentions of neighboring nodes are unknown. Without any security measures in place, any node is capable of compromising the integrity of the data it forwards. Our goal in this paper is to ensure the integrity of the data being disseminated without resorting to complex and expensive solutions. We achive this by discouraging malicious behavior in two ways: a) enforcing integrity checks close to the source and b) refusing to communicate with obviously malicious nodes. We find that by having nodes sample their traffic for corrupted messages, malicious nodes can be identified with high accuracy, in effect transforming our collection of nodes into a self-policing network.
Ad hoc网络依赖于节点之间相互转发数据包，信任与合作成为保证网络性能的关键问题。只要网络中的所有节点属于同一组织并具有相同的目标(例如，在军事场景中)，通常可以期望所有节点都是可信的。然而，随着无线技术变得越来越普遍，我们可以预见到非常大的异构网络的出现，其中相邻节点的意图是未知的。如果没有适当的安全措施，任何节点都可能危及其转发的数据的完整性。我们在本文中的目标是确保传播的数据的完整性，而无需诉诸复杂和昂贵的解决方案。我们通过两种方式阻止恶意行为来实现这一点:a)在靠近源的地方执行完整性检查，b)拒绝与明显恶意的节点通信。我们发现，通过让节点对其流量进行采样以获取损坏的消息，可以高精度地识别恶意节点，从而有效地将我们的节点集合转换为自我监管网络。
{"title":"Enforcing Data Integrity in Very Large Ad Hoc Networks","authors":"D. Gavidia, M. Steen","doi":"10.1109/MDM.2007.20","DOIUrl":"https://doi.org/10.1109/MDM.2007.20","url":null,"abstract":"Ad hoc networks rely on nodes forwarding each other's packets, making trust and cooperation key issues for ensuring network performance. As long as all nodes in the network belong to the same organization and share the same goal (in military scenarios, for example), it can generally be expected that all nodes can be trusted. However, as wireless technology becomes more commonplace, we can foresee the appearance of very large, heterogeneous networks where the intentions of neighboring nodes are unknown. Without any security measures in place, any node is capable of compromising the integrity of the data it forwards. Our goal in this paper is to ensure the integrity of the data being disseminated without resorting to complex and expensive solutions. We achive this by discouraging malicious behavior in two ways: a) enforcing integrity checks close to the source and b) refusing to communicate with obviously malicious nodes. We find that by having nodes sample their traffic for corrupted messages, malicious nodes can be identified with high accuracy, in effect transforming our collection of nodes into a self-policing network.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130664822","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
扫码关注我们
求助内容：
应助结果提醒方式：