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

GIst: Group-independent spanning tree for data aggregation in dense sensor networks

2nd ieee international conference on distributed computing in sensor systems

作者： Jia, Lujun Noubir, Guevara Rajaraman, Rajmohan Sundaram, Ravi Northeastern Univ Coll Comp & Informat Sci Boston MA 02115 USA

ISBN: (纸本)3540352279

Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions of optimal, i.e. under different cost metrics). However, all these schemes differ from one common failing - they construct an optimal tree for a given fixed subset of the sensors. In most practical scenarios, the sensor group is continuously and dynamically varying - consider for example the set of sensors scattered in a forest that are sensing temperatures above some specified threshold, during a wildfire. Given the limited computational and energy resources of sensor nodes it is impossible to either prestore the optimal tree for every conceivable group or to dynamically generate them on the fly. In this paper we propose the novel approach of constructing a single group-independent spanning tree (GIst) T for the network and then letting any sensor group S use the subtree induced by S on T, T_S as its group aggregation tree. The important question is, how does the quality of the subtree T_S compare to the optimal tree, OPTs, across different groups S. We consider two well-accepted measures - aggregation cost (sum over all links) and delay (diameter). We show that in polynomial time we can construct a GIst that simultaneously achieves O(log n)-approximate aggregation cost and O(1)-approximate delay, for all groups S. To the best of our knowledge GIst is the first construction with a nontrivial and provable performance guarantee that works for all groups. We provide a practical and distributed protocol for realizing GIst that requires only local knowledge. We show an Ω(n) lower bound for commonly accepted solutions such as Mst and SPT (i.e. there exists a group for which the induced subtree performs poorly) and demonstrate by simulation that GIst is good not just in the worst case - it outperforms SPT and Mst by between 30 and 60 per cent in realistic random scenarios. GIst is an ov

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Ultra-low-power alcohol vapor sensors based on multi-walled carbon nanotube

Ultra-low-power alcohol vapor sensors based on multi-walled ...

引用

ieee international conference of Nano/Micro Engineered and Molecular systems

作者： Sin, Mandy L. Y. Chow, Gary C. T. Fung, Carmen K. M. Li, Wen J. Leong, Philip Wong, K. W. Lee, Terry Chinese Univ Hong Kong Ctr Micro & Nano Syst Hong Kong Hong Kong Peoples R China Chinese Univ Hong Kong Dept Phys Hong Kong Hong Kong Peoples R China Automat MFG Ltd Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781424401390

We have demonstrated multi-walled carbon nanotube (MWCNTs) based sensors, which are capable of detecting alcohol vapor with ultra-low power. We fabricated the Si-substrate sensors using an AC electrophoretic technique so as to form bundled MWCNTs sensing elements between An microelectrodes. The I-V measurement illustrates that we can activate the sensors at the Ohmic region of the sensors (at 10 mu A), which is without any overheat effect. The sensors only need an ultra-low power (similar to 1 mu W) to detect the alcohol vapor. They exhibit fast, reversible and repeatable response. We have tested the response of the sensors with alcohol concentrations from 10ppth to 400ppth (ppth = parts per thousand). Our result shows that there is a linear relation between the resistance of the sensors and alcohol concentration. Also, we can easily reverse the sensor to the initial reference resistance by annealing them at 100-250 mu A current within 6 minutes. Moreover, the sensors are selective with respect to flow from air, water vapor, and alcohol vapor. Finally, we have also studied how the temperature of the sensors affects their response towards alcohol vapor. The result shows that the performance of the sensors will deteriorate as the temperature of the sensors increase. Also, the cooling effect of the vapor is not a dominating factor in determining the response of the sensor. Based on our experiments, we prove the feasibility of turning the MWCNTs sensors into a commercialized alcohol sensor with ultra-low power requirements.

关键词： carbon nanotubes alcohol sensor ultra-low-power

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable interconnection networks in distributed Shared Memory systems: a study on communication patterns

Reconfigurable interconnection networks in Distributed Share...

引用

1st international conference on Communications and Electronics (ICCE 2006)

作者： Khoi, Bui Viet Tinh, Pham Doan Quan, Nguyen Nam Artudo, Inigo Manjarres, Daniel Heirman, Wim Debaes, Christof Dambre, Joni Van Campenhout, Jan Thienpont, Hugo Hanoi Univ Technol Dept Elect & Informat Hanoi Vietnam Vrije Univ Brussel Dept Appl Phys & Photon Brussels Belgium Univ Ghent Elect & Informat Syst Dept Ghent Belgium

ISBN: (纸本)9781424405688

The static interconnection network topologies in the distributed shared memory systems (DSM) have several limitations. The reconfigurable interconnection networks may reduce the network congestion, network latency and improve the overall performance. However it is necessary to know when the right moment to perform the reconfiguration is and how to implement it. In this paper, we present our study on communication patterns of parallel scientific and commercial benchmark applications on a simulated but realistic DSM machine and their relation to context switching in the operating system. We also propose a reconfiguration scheme that is triggered by the context switches.

关键词： reconfiguration imerconnection network distributed shared ntemoiy multiprocessors context switch

来源：评论

学校读者我要写书评

暂无评论

Supporting heterogeneous traffic in wireless sensor networks

Supporting heterogeneous traffic in wireless sensor networks

引用

1st international Symposium on Wireless Pervasive computing

作者： Poonvasin, Sirivat Pathommanit, Nartiemon Kasetsart Univ Fac Engn Dept Elect Engn Bangkok Thailand

ISBN: (纸本)0780394100

We consider an energy-aware packet transmission node that supports packets of two types: real-time packets and non real-time packets. Several energy-aware packet scheduling schemes are explored and discussed. Using the average delay of non real-time packets and the rejection rate of real-time packets as performance metrics, a scheduling scheme for this purpose is proposed. It is composed of two scheduling stages. In the early stage, each packet type is scheduled independently on the per type basis. They are then merged using PGPS into the second stage where the transmission speed for each packet is assigned. The packets are then transmitted using Dynamic Modulation Scaling (DMS). The method has been evaluated using simulation and compared against one in which energy savings schemes are not incorporated. The result shows that not only does it provide a fair share of bandwidth (low rejected packets for real-time packets and low delay for non real-time packets) between these streams' but it also saves the overall transmission energy, particularly in the light load case, where as much as 90% savings can be obtained.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic group-based key establishment for large-scale wireless sensor networks

Dynamic group-based key establishment for large-scale wirele...

引用

1st international conference on Communications and Networking in China, ChinaCom '06

作者： Kifayat, Kashif Merabti, Madjid Qi, Shi Llewellyn-Jones, David School of Computing and Mathematical Sciences Liverpool John Moores University United Kingdom

ISBN: (纸本)1424404630

Key establishment and its management in Wireless sensor Networks is a challenging problem due to the limited resources and disordered structure of such networks. In this paper we propose a dynamic group-based key management technique. In our solution, a large-scale network is divided into small logical groups. Each group is assigned a unique master key that will be used to generate other distinct keys between pairs of nodes inside the group. In this way we provide secure communications between nodes, robust against node capture attack. Unlike other techniques ours is highly scalable and application independent and can be used both in indoors and outdoors applications whilst reducing memory overhead and maintaining maximum connectivity. © 2006 ieee.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A practical method to form energy efficient connected K-coverage in wireless sensor networks

A practical method to form energy efficient connected K-cove...

引用

26th ieee international conference on distributed computing systems Workshops, ICDCS 2006

作者： Jiang, Zhen Kline, Robert Wu, Jie Dai, Fei Dept. of Computer Sci. Information Assurance Center West Chester University West Chester PA 19383 United States Dept. of Computer Sci. and Eng. Florida Atlantic University Boca Raton FL 33431 United States Dept. of Elec. and Computer Eng. North Dakota State University Fargo ND 58105 United States

ISBN: (纸本)0769525415

In the wireless sensor networks, an important issue of area coverage is to know how many sensor nodes are needed in a deployment under a certain kind of distribution. In that way, the nodes can be dense enough to form a complete and connected cover of interest area. Another issue that needs to be addressed is the "redundancy of connectivity" caused by the use of the well known sufficient condition that "the communication range R is at least twice the sensing range r". In this paper, we show our result in solving these problems, a practical method to form a connected k-coverage with a connected dominating set (CDS). By introducing a measure of node density called the biggest vacant square territory (BVst), we prove that the point coverage offered by a CDS implies area coverage of the area of interest. The 1-point-coverage of a CDS with a reduced R and a certain number of deploying sensors guarantees k-area-coverage, or simply k-coverage. Such assurance is verified via a simulation study on the CDS in [7] under random node distribution. © 2006 ieee.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Research on the intelligent network storage platform for the military information source

Research on the intelligent network storage platform for the...

引用

5th ieee/ACIS international conference on Computer and Information Science, ICIS 2006. In conjunction with 1st ieee/ACIS international Workshop on Component-Based Software Engineering, Software Architecture and Reuse, COMSAR 2006

作者： Jia, Lianxing Chen, Zhifeng Li, Chenhui Dan, Feng Communications Command Academy Huazhong University of Science and Technology

ISBN: (纸本)0769526136

In the Information Age, armies of some countries work hard for more than ten years, obtain substantial progress in the informatization construction. But they mainly focus on modernization of communication in this construction, pay more attention to distributing and processing military information automatically. They neglect the foundation of Information Warfare (IW) - constructing the military information source (MIS), In other words, armies just do the "informatization construction", but not the "information construction". In this article, after studying the necessity of constructing the MIS, we use network storage in military affairs, and then analyze the key characteristics of the infrastructure of the intelligent MIS platform. Finally, we put forward the solution of the MIS. © 2006 ieee.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

distributed end host multicast algorithms for irregular overlay mesh

Distributed end host multicast algorithms for irregular over...

引用

1st international conference on Semantics, Knowledge and Grid, SKG 2005

作者： Tu, Wanqing Jia, Weijia Department of Computer Science City University of Hong Kong

ISBN: (纸本)0769525342

This paper proposes a set of novel distributed algorithms on top of m-D irregular mesh overlay to achieve the short delay and low network resource consumption end host multicast services. Our end host multicast fully utilizes the advantages of m-D irregular mesh to construct a two-layer architecture. Compared to previous approaches, the novelty and contribution of our end host multicast include: 1. cluster formation that partitions the group members into different clusters in the lower layer;2. cluster core selection that selects a core who has the minimum sum of overlay hops to all other cluster members for each cluster;3. weighted shortest path tree construction that constructs the shortest multicast trees with the minimum number of paths to propagate the multicast traffic;4. distributed multicast routing directs the multicast messages to be efficiently distributed along the two-layer multicast architecture in parallel without a global control. Simulation results show that our end host multicast can distributively achieves the short delay and low network resource consumption multicast services as compared with some well-know end host multicast systems. © 2006 ieee.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

distributed wisdom: What's wrong with us?

引用

ieee distributed systems Online 2006年第5期7卷 3-3页

作者： Shapiro, Marc INRIA Rocquencourt LIP6

The efforts of EuroSys, the professional society for European systems community, towards researching distributed systems, are discussed. As far as publishing about distributed systems is concerned European are way behind the US. The Symposium on Operating systems Design and Implementation, ACM Transactions on Computer systems, and the ACM Symposium on Operating systems Principles rank 1st, 8th, and 11th on the CiteSeer impact list. The ACM sigops European workshop is 216th, the international conference on distributed computing systems is 217th, the international Symposium on Fault-Tolerant computing is 270th, and the European conference on Parrallel PRocessing is 491st. Researchers are trying to change the system from within by creating the Euro Sys professional society, holding workshops, launching the EuroSys conference series, networking and exchanging information, and so on.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Algorithms for delay constrained and energy efficiently routing in wireless sensor network

Algorithms for delay constrained and energy efficiently rout...

引用

1st international conference on Wireless Algorithms, systems and Applications

作者： Wang, Yuanli Liu, Xianghui Ning, Jing Yin, Jianping Wu, Yongan Natl Univ Def Technol Sch Comp Sci Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Sch Elect Sci & Technol Changsha 410073 Hunan Peoples R China

ISBN: (纸本)3540371893

The growing popularity of wireless sensor network applications has stimulated strong interest in extending quality of service support to existing routing protocols. Conventional wireless sensor network routing protocols usually concentrate on the constrained condition of 'shortest path' with minimum used energy. However, the path with minimum used energy can't provide the minimum end to end delay guarantee. Moreover, wireless sensor network is required to support the delay-sensitive traffic. So the reduction of the end to end delay is a new challenge for wireless sensor network. To this point, this paper mainly focuses on the node delay constrained energy efficiently routing algorithm.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：