检索结果-内蒙古大学图书馆

Receiver-oriented design of Bloom filters for data-centric routing

COMPUTER NETWORKS 2010年第1期54卷 165-174页

作者： Guo, Deke He, Yuan Yang, Panlong Natl Univ Def Technol Key Lab C4 ISR Technol Changsha 410073 Hunan Peoples R China Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China PLA Univ Sci & Technol Inst Commun Engn Nanjing 210000 Jiangsu Peoples R China

Bloom filter (BF) is a space-efficient data structure that represents a large set of items and supports efficient membership queries. It has been widely proposed to employ Bloom filters in the routing entries so as to facilitate data-centric routing in network applications. The existing designs of Bloom filters, however, cannot effectively support in-network queries. Given a query for a data item at a node in the network, the noise in unrelated routing entries very likely equals to the useful information of the item in the right routing entries. Consequently, the majority of queries are routed towards many wrong nodes besides those destinations, wasting large quantities of network traffic. To address this issue, we classified the existing designs as CUBF (Cumulative Bloom filters) and ABF (Aggregated Bloom filters), and then evaluate their performance in routing queries under the noisy environments. Based on the evaluation results, we propose a receiver-oriented design of Bloom filters to sufficiently restrict the probability of a wrong routing decision. Moreover, we significantly decrease the delay of a routing decision in the case of CUBF by using the bit slice approach, and reduce the transmission size of each BF in the case of ABF by using the compression approach. Both the theoretical analysis and experimental results demonstrate that our receiver-oriented design of Bloom filters apparently outperforms the existing approaches in terms of the success probability of routing and network traffic cost. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Bloom filters data-centric routing Receiver-oriented design

来源：评论

学校读者我要写书评

暂无评论

A performance evaluation of a novel energy-aware data-centric routing algorithm in wireless sensor networks

引用

WIRELESS NETWORKS 2005年第5期11卷 619-635页

作者： Boukerche, A Cheng, XZ Linus, J Univ Ottawa SITE Ottawa ON K1N 6N5 Canada George Washington Univ Dept Comp Sci Washington DC 20052 USA Univ N Texas Dept Comp Sci Denton TX 76203 USA

In this paper, we present a novel Energy-Aware data-centric routing algorithm for wireless sensor networks, which we refer to as EAD. We discuss the algorithm and its implementation, and report on the performance results of several workloads using the network simulator ns-2. EAD represents an efficient energy-aware distributed protocol to build a rooted broadcast tree with many leaves, and facilitate the data-centric routing in wireless micro sensor networks. The idea is to turn off the radios of all leaf nodes and let the non-leaf nodes be in charge of data aggregation and relaying tasks. The main contribution of this protocol is the introduction of a novel approach based on a low cost backbone provisioning within a wireless sensor network in order to turn off the non backbone nodes and save energy without compromising the connectivity of the network, and thereby extending the network lifetime. EAD makes no assumption on the network topology, and it is based on a residual power. We present an extensive simulation experiments to evaluate the performance of our EAD forwarding-to-parent routing scheme over a tree created by a single EAD execution, and compare it with the routing scheme over a regular Ad hoc On-Demand Distance Vector (AODV) Protocol. Last but not least, we evaluate the performance of our proposed EAD algorithm and compare it to the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol, a cluster-based, energy-aware routing protocol specifically designed for sensor networks. Our results indicate clearly that EAD outperforms AODV and LEACH in energy conservation, throughput, and network lifetime extension.

关键词： wireless sensor network spanning tree with maximum leaves data-centric routing in-network processing

来源：评论

学校读者我要写书评

暂无评论

Multi-attribute Decision Making for data-centric routing in Wireless Sensor Network

Multi-attribute Decision Making for Data-centric Routing in ...

引用

International Conference on Fuzzy Theory and Its Applications (iFUZZY)

作者： Zhou, Jin Chen, C. L. Philip Chen, Long Univ Macau Fac Sci & Technol Dept Comp & Informat Sci Macao Peoples R China

ISBN: (纸本)9781479903863

Recent data-centric routing protocols in wireless sensor network usually aim to pursue either the minimum energy consumption (the maximum network lifetime), or the minimum delay time, but can not achieve a good balance. To address this issue, an efficient routing algorithm is proposed, in which multiple routing information are taken into consideration for routing decision making in a quick and accurate way. And a general distance metric is defined for processing both exact and fuzzy data. As a general framework, this method can provide various routing decisions on the choice of different attributes to meet diverse routing requirements. Simulations show the suitability and efficiency of the proposed routing scheme.

关键词： data-centric routing wireless sensor network multi-attribute decision making

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient data-centric routing in wireless sensor networks

Energy-efficient data-centric routing in wireless sensor net...

引用

International Symposium on Autonomous Decentralized Systems (ISADS 2005)

作者： Yen, HH Lin, FYS Lin, SP Shih Hsin Univ Dept Informat Management Taipei Taiwan

Incorporating sensor nodes with data aggregation capability to transmit less data flow in wireless sensor networks could reduce the total energy consumption. This calls for the efficient and effective datacentric routing algorithm to facilitate this advantage. In the first part of this paper, we model the data-centric routing problem by rigorous mixed integer and linear mathematical formulation, where the objective function is to minimize the total transmission cost subject to multicast tree constraints. With the advancement of sensor network technology, sensor nodes with configurable transmission radius capability could further reduce energy consumption. The second part of this paper considers the transmission radius assignment of each sensor node and the data-centric routing assignment jointly. The objective function is to minimize the total power consumption together with consideration of construction of a data aggregation tree and sensor node transmission radius assignment. The solution approach is based on Lagrangean relaxation in conjunction with the novel optimization-based heuristics. From the computational experiments, it is shown that the proposed algorithms calculate better solution than other existing heuristics with improvement ratio up to 169% and 59% with respect to fixed transmission radius and configurable transmission radius for network with 300 random generated nodes.

关键词： energy saving data aggregation data-centric routing Lagrangean relaxation wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

SABAGAR: A simple attribute-based addressing and GPS-aided routing protocol for applications in wireless sensor networks

引用

TELECOMMUNICATION SYSTEMS 2004年第2-4期26卷 197-212页

作者： Wang, ST Wu, JLC Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei 106 Taiwan

We propose in this paper a data-centric routing protocol for wireless sensor network applications. This protocol, called SABAGAR, is designed to be implemented easily to provide the basis for commercially successful products, and to await more vendors in wireless products. Sensor nodes may have no global identifications because the number of sensors can be large, hence, attribute-based addressing and broadcast communication paradigm can be used to facilitate data acquisition. However, broadcasting simply by flooding usually results in serious redundancy and endlessly looping packets, and thus degrades the network performance. To deal with this problem, we present a position-vector-based (PVB) algorithm for the SABAGAR protocol. This paper also provides detailed simulation results to support the proposed protocol design.

关键词： attribute-based addressing data-centric routing wireless sensor network packet forwarding broadcast information dissemination global positioning system (GPS)

来源：评论

学校读者我要写书评

暂无评论

Designing routes for source coding with explicit side information in sensor networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2007年第6期15卷 1401-1413页

作者： Luo, Huiyu Pottie, Gregory J. Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA

In this paper, we study the problem of designing routes for source coding with explicit side information (i.e., with side information at both the encoder and the decoder) in sensor networks. Two difficulties in constructing such data-centric routes are the lack of reasonably practical data aggregation models and the high computational complexity resulting from the coupling of routing and in-network data fusion. Our data aggregation model is built upon the observation that in many physical situations the side information providing the most coding gain comes from a small number of nearby sensors. Based on this model, we formulate an optimization problem to minimize the communication cost, and show that finding the exact solution of this problem is NP-hard. Subsequently, two suboptimal algorithms are proposed. One is inspired by the balanced trees that have small total weights and reasonable distance from each sensor to the fusion center [6]. The other separately routes the explicit side information to achieve cost minimization. Bounds on the worst-case performance ratios of two methods to the optimal solution are derived for a special class of rate models, and simulations are conducted to shed light, on their average behaviors.

关键词： data-centric routing maximum weight branching NP-hardness shortest path tree source coding Steiner tree

来源：评论

学校读者我要写书评

暂无评论

Directed diffusion for wireless sensor networking

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2003年第1期11卷 2-16页

作者： Intanagonwiwat, C Govindan, R Estrin, D Heidemann, J Silva, F Univ So Calif Dept Comp Sci Los Angeles CA 90089 USA Univ So Calif Inst Informat Sci Marina Del Rey CA 90292 USA

Advances in processor, memory, and radio technology will enable small and cheap nodes capable of sensing, communication, and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed-diffusion paradigm for such coordination. Directed diffusion is data-centric in that all communication is for named data. All nodes in a directed-diffusion-based network are application aware. This enables diffusion to achieve energy savings by selecting empirically good paths and by caching and processing data in-network (e.g., data aggregation). We explore and evaluate the use of directed diffusion for a simple remote-surveillance sensor network analytically and experimentally. Our evaluation indicates that directed diffusion can achieve significant energy savings and can outperform idealized traditional schemes (e.g., omniscient multicast) under the investigated scenarios.

关键词： data aggregation data-centric routing distributed sensing in-network processing wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Double Rulings for Information Brokerage in Sensor Networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2009年第6期17卷 1902-1915页

作者： Sarkar, Rik Zhu, Xianjin Gao, Jie SUNY Stony Brook Dept Comp Sci Stony Brook NY 11790 USA

We study the problem of information brokerage in sensor networks, where information consumers (sinks, users) search for data acquired by information producers (sources). In-network storage such as geographical hash table (GHT) has been proposed to store data at rendezvous nodes for consumers to retrieve. In this paper, we propose a double rulings scheme that stores data replicas on a curve instead of one or multiple isolated sensors. The consumer travels along another curve that is guaranteed to intersect the producer curve. The double rulings is a natural extension of the flat hashing scheme such as GHTs. It has improved query locality-i.e., consumers close to producers find the data quickly-and structured aggregate queries, i.e., a consumer following a curve is able to retrieve all the data. Furthermore, by the flexibility of retrieval mechanisms, we have better routing robustness (as multiple retrieval paths are available) and data robustness against regional node failures. We show by simulation that the double rulings scheme provides reduced communication costs and more balanced traffic load on the sensors.

关键词： data-centric routing double rulings information storage and retrieval sensor networks

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient reliable packet delivery in variable-power wireless sensor networks

引用

AIN SHAMS ENGINEERING JOURNAL 2011年第2期2卷 87-98页

作者： Hassan, Ahmed Ibrahim Elsabrouty, Maha El-Ramly, Salwa Ericsson Egypt Ltd Giza Egypt Ain Shams Univ Fac Engn Elect & Commun Engn Dept Emeritus Elect & Commun Dept Cairo Egypt Egypt Japan Univ Sci & Technol Elect & Commun Engn Dept Alexandria Egypt

Energy efficient and reliable data forwarding becomes important if resources are limited such as in Wireless Sensor Networks (WSNs). data-centric routing approaches have been proposed in the literature to provide more energy-efficient routing as opposed to the traditional end-to-end routing schemes known as address-centric approaches. In this paper, we present the variable-power data-centric routing technique in which each sensor node (source) adjusts its transmission power based on the distance between itself and the receiver (data recipient/sink). We discuss how the error rate associated with a link affects the overall probability of reliable delivery, and consequently the energy associated with the reliable transmission of a single packet. The analysis includes both fixedpower and variable-power scenarios along with the End-to-End Retransmission (EER) and Hop-by-Hop Retransmission (HHR) techniques. (C) 2011 Ain Shams University. Production and hosting by Elsevier B.V. All rights reserved.

关键词： data-centric routing Energy-efficient Retransmission techniques Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Designing a local path repair algorithm for directed diffusion protocol

引用

EGYPTIAN INFORMATICS JOURNAL 2012年第3期13卷 155-169页

作者： El-Basioni, Basma M. Mohammad El-Kader, Sherine M. Abd Eissa, Hussein S. Elect Res Inst Computers & Syst Dept 33 El Tahrir St Giza 12622 Egypt

This paper proposes an implementation for the directed diffusion paradigm aids in studying this paradigm's operations and evaluates its behavior according to this implementation. The directed diffusion is evaluated with respect to the loss percentage, lifetime, end-to-end delay, and throughput. From these evaluations some suggestions and modifications are proposed to improve the directed diffusion behavior according to this implementation with respect to these metrics. The proposed modifications reflect the effect of local path repair by introducing a technique called Loop-free Local Path Repair (LLPR) which improves the directed diffusion behavior especially with respect to packet loss percentage by about 92.69%. Also LLPR improves the throughput and end-to-end delay by about 55.31% and 14.06% respectively, while the lifetime decreases by about 29.79%. (C) 2012 Faculty of Computers and Information, Cairo University. Production and hosting by Elsevier B.V. All rights reserved.

关键词： Attribute-value based naming scheme data-centric routing data gathering Energy-efficiency Locality Wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：