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

IEEE Wireless Communications and Networking Conference

作者： Berman, P Calinescu, G Shah, C Zelikovsky, A Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA

ISBN: (纸本)0780383443

Optimizing the energy consumption in wireless sensor networks has recently become the most important performance objective. We assume the sensor network model in which sensors can interchange idle and active modes. Given monitoring regions, battery life and energy consumption rate for each sensor, we formulate the problem of maximizing sensor network lifetime, i.e., time during which the monitored area is (partially or fully) covered. Our contributions include (1) an efficient data structure to represent the monitored area with at most n(2) points guaranteeing the full coverage which is superior to the previously used approach based on grid points, (2) efficient provably good centralized algorithms for sensor monitoring schedule maximizing the total lifetime including (1 + ln (1 - q)(-1))-approximation algorithm for the case when a q-portion of the monitored area is required to cover, e.g., for the 90% area coverage our schedule guarantees to he at most 3.3 times shorter than the optimum, (4) a family of efficient distributed protocols with trade-off between communication and monitoring power consumption, (5) extensive experimental study of the proposed algorithms showing significant advantage in quality, scalability and flexibility.

关键词： wireless sensor networks telecommunication network management condition monitoring distributed algorithms protocols optimisation power efficient monitoring management wireless sensor network energy consumption optimization sensor mode battery life consumption network lifetime data structure grid point centralized algorithm sensor monitoring schedule distributed protocol power consumption

来源：评论

学校读者我要写书评

暂无评论

A Mediation-based Approach for distributed Digital Library Services

A Mediation-based Approach for Distributed Digital Library S...

引用

2004 International Symposium on distributed Computing and Applications to Business, Engineering and Science

作者： Yu Jianghong~1,Fang Wei~2 1 Zhuzhou Institute of technology,Hunan,China,412008 2 Wuhan University of Technology,Hubei,China,430070

In a distributed library environment,we can distinguish between metadata for information objects(e.g.,documents) and metadata for information services(e.g.,search services).In this paper,we have developed a working prototype library *** libraries system(DLS) was developed and distributed as part of the Zhuzhou Institute of Technology's Electronic Libraries Programme and supports the rapid development of subject-based *** system also provides a description of an approach for supporting the user or personalization process in digital catalogue systems.

关键词： distributed protocol Z39.50 Digital library system(DLS)

来源：评论

学校读者我要写书评

暂无评论

Building low-diameter peer-to-peer networks

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2003年第6期21卷 995-1002页

作者： Pandurangan, G Raghavan, P Upfal, E Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA Ver Inc Sunnyvale CA 94089 USA Brown Univ Dept Comp Sci Providence RI 02912 USA

Peer-to-Peer (P2P) computing has emerged as a significant paradigm for providing distributed services , in particular search and data sharing. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols;they consequently suffer from frequent network overload and partitioning into disconnected pieces separated by choke points with inadequate bandwidth. In this paper, we propose a protocol for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. These properties are crucial for efficient search and data exchange. An important feature of our protocol is that it operates without global knowledge of all the nodes in the network.

关键词： distributed protocol peer-to-peer (P2P) networks stochastic analysis topology construction

来源：评论

学校读者我要写书评

暂无评论

distributed broadcast in radio networks of unknown topology

引用

THEORETICAL COMPUTER SCIENCE 2003年第1-3期302卷 337-364页

作者： Clementi, AEF Monti, A Silvestri, R Univ Roma Tor Vergata Dipartimento Matemat I-00133 Rome Italy Univ Roma La Sapienza Dipartimento Informat Rome Italy

A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the topology. A basic task in radio network is that of broadcasting a message (created by a fixed source node) to all nodes of the network. Typical operations in real-life radio networks is the multi-broadcast that consists in performing a set of r independent broadcasts. The study of broadcast operations on unknown radio network is started by the seminal paper of Bar-Yehuda et al. [J. Comput. System Sci. 45 (1992) 104] and has been the subject of several recent works. In this paper, we study the completion and the termination time of distributed protocols for both the (single) broadcast and the multi-broadcast operations on unknown networks as functions of the number of nodes n, the maximum eccentricity D, the maximum in-degree Delta, and the congestion c of the networks. We establish new connections between these operations and some combinatorial concepts, such as selective families, strongly selective families (also known as superimposed codes), and pairwise r-different families. Such connections, combined with a set of new lower and upper bounds on the size of the above families, allow us to derive new lower bounds and new distributed protocols for the broadcast and multi-broadcast operations. In particular, our upper bounds are almost tight and strongly improve over the previous bounds for a large class of networks. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： Time Families topology Upper bound distributed protocol SUPERIMPOSED CODING Radio networks Surgery Lower bound Unknown Ganglia Radio Network broadcasting family

来源：评论

学校读者我要写书评

暂无评论

Service time optimal self-stabilizing token circulation protocol on anonymous unidrectional rings

Service time optimal self-stabilizing token circulation prot...

引用

21st IEEE Symposium on Reliable distributed Systems

作者： Johnen, C Univ Paris 11 CNRS LRI F-91405 Orsay France

ISBN: (纸本)0769516599

We present a self-stabilizing token circulation protocol on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm). The protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), it reaches (with probability 1) a legitimate configuration (i.e. a configuration with only one token in the network). All previous randomized self-stabilizing token circulation protocols design to work under unfair distributed schedulers have the same drawback: once stabilized, the service time is slow (in the best case, it is bounded by 2N where N is the ring size). Once stabilized, our protocol provides an optimal service: after :V computation steps, each processor has obtained one time the token. The protocol can be used to implement a fair distributed mutual exclusion in any ring topology network.

关键词： distributed protocol fault-tolerant mutual exclusion self-stabilization anonymous ring token circulation unfair scheduler service time.

来源：评论

学校读者我要写书评

暂无评论

An unbiased global coin flipping protocol on synchronous distributed systems

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2001年第1期E84D卷 40-47页

作者： Yoda, K Okabe, Y Kanazawa, N Kyoto Univ Grad Sch Engn Div Appl Syst Sci Kyoto 6068501 Japan Kyoto Univ Grad Sch Informat Kyoto 6068501 Japan Kyoto Univ Data Proc Ctr Kyoto 6068501 Japan

We present a distributed protocol for achieving totally unbiased global coin flipping in the presence of an adversary. We consider a synchronous system of n processors at most t of which may be corrupted and manipulated by a malicious adversary. and assume a complete network where every two processors are connected via a private channel. Our protocol is deterministic and assumes a very powerful adversary. Although the adversary cannot eavesdrop, it is computationally unbounded, capable of rushing and dynamic. This is the same model that is adopted in Yao's global coin flipping protocol. which we use as the base of our protocol. Our protocol tolerates almost n/3 processor failures: and terminates in t + 4 rounds. The resilience of our protocol is greatly improved from that of Yao's protocol at the slight expense of running time, which is only added just two rounds.

关键词： distributed protocol global coin flipping synchronous distributed system adversary

来源：评论

学校读者我要写书评

暂无评论

Termination detection protocols for mobile distributed systems

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2001年第6期12卷 558-566页

作者： Tseng, YC Tan, CC Natl Chiao Tung Univ Dept Comp Sci & Informat Engn Hsinchu 30050 Taiwan

This paper studies a fundamental problem, the termination defection problem, in distributed systems. Under a wireless network environment, we show how to handle the host mobility and disconnection problems. in particular, when some distributed processes are temporarily disconnected, we show how to capture a weakly terminated state where silence has been reached only by those currently connected processes. A user may desire to know such a state to tell whether the mobile distributed system is still running or is silent because some processes are disconnected. Our protocol tries to exploit the network hierarchy by combining two existing protocols together. It employs the weight-throwing scheme [9], [16], [21] on the wired network side, and the diffusion-based scheme [5], [13] on each wireless cell. Such a hybrid protocol can better pave the gaps of computation and communication capability between static and mobile hosts, thus more scalable to larger distributed systems. Analysis and simulation results are also presented.

关键词： distributed computing distributed protocol mobile computing operating system termination detection wireless network

来源：评论

学校读者我要写书评

暂无评论

Frame-level interleaving approach to VC merging in input-buffered ATM switch

引用

ELECTRONICS LETTERS 2000年第12期36卷 1090-1091页

作者： Pao, DCW Chan, KS City Univ Hong Kong Dept Elect Engn Kowloon Hong Kong Peoples R China

Multipoint-to-multipoint communication can be efficiently supported in ATM networks with VC merging. In the AALS adaptation layer, individual cells do not carry the sender ID. When multiple data streams are merged into one outgoing data stream at a merge point, the cell interleaving needs to be controlled such that the receiver can reassemble the massages from different senders. For an input-buffered ATM switch, VC merging can be implemented effectively using the frame-level interleaving approach. Cells belonging to a packet are sent together without any interleaving from other packets of the merged VC. A distributed protocol is presented to arbitrate the transmission order of packers subject to the transmission priority of the packets.

关键词： protocols cell interleaving switching networks ATM networks multipoint-to-multipoint communication distributed protocol broadband networks Communication switching packet switching transport protocols VC merging multiple data streams merging input-buffered ATM switch transmission priority AAL5 adaptation layer frame-level interleaving packet transmission order asynchronous transfer mode arbitration protocol

来源：评论

学校读者我要写书评

暂无评论

An improved scheme for self-healing in ATM networks

引用

COMPUTER COMMUNICATIONS 1999年第15-16期22卷 1400-1414页

作者： Panicker, KKV Murthy, CSR Mittal, R Indian Inst Technol Dept Comp Sci & Engn Madras 600036 Tamil Nadu India Hewlett Packard India Software Operat Ltd Bangalore 560052 Karnataka India Hughes Software Syst Electr City 122015 Gurgaon India

Broadband networks based on ATM technology can carry a large volume of data and can support diverse services Like audio, video, and data uniformly. The reliability and availability levels provided by such networks should be very high. Self-healing is an elegant concept in this direction to provide highly reliable networks. A self-healing network can detect failures such as link/node failures and reroute the failed connections automatically using distributed control mechanisms. In this paper, we consider link and node failures including the VP terminating nodes unlike Kawamura and Tokizawa (Self-healing in ATM networks based on virtual path concept, IEEE Journal on Selected Areas in Communications 12 (1) (1994) 120-127). We present here an improved scheme for self-healing in ATM networks based on the concept of backup VPs. The problems we address are. (i) self-healing scheme;and (ii) backup VP routing. Two issues are addressed in the self-healing scheme: (i) backup VP activation protocol;and (ii) dynamic backup VP routing. We propose a new backup VP activation protocol which uses a VC packing strategy which allows the fast and prioritized restoration of critical VCs that were carried by failed VPs. We also propose a distributed dynamic backup VP routing algorithm which reduces the resource contention that may occur when multiple source-destination pairs contend for the routes simultaneously. The objective of the backup VP routing problem is to find a backup VP for each of the working VPs so that the cost of providing the backup is minimized. We propose a heuristic based solution for the backup VP routing problem using the concept of minimum cost shortest paths. We conducted simulation experiments to evaluate the performance of the proposed schemes. The results show that the proposed schemes are effective. Comparison of the results with these of the earlier schemes (R. Kawamura, I. Tokizawa, Self-healing in ATM networks based on virtual path concept, IEEE Journal on S

关键词： self-healing backup VP restoration dynamic routing distributed protocol

来源：评论

学校读者我要写书评

暂无评论

The time complexity of updating snapshot memories

引用

INFORMATION PROCESSING LETTERS 1998年第1期65卷 33-40页

作者： Israeli, A Shirazi, A Netanya Acad Coll Sch Comp Sci & Math Netanya Israel Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel

An atomic snapshot memory enables a set of processes, called scanners, to obtain a consistent picture of the shared memory while other processes, called updaters, keep updating memory locations concurrently. Implementations of atomic snapshot memory are key tools in designing distributed protocols in shared memory systems. Such an implementation consists of two;protocols: an update protocol and a scan protocol, executed by updaters and scanners, respectively. Clearly, the time complexity of the scan protocol is at least linear, and there exists an implementation which matches the lower bound. In this paper we show that the time complexity of an optimal update protocol is Theta(n), where n is the number of updaters and scanners. The time complexity of the scan protocol remains O(n log n). The lower bound is valid even when the updates are serial, meaning, no two updates overlap. In addition, the lower bound does not assume that the protocols are uniform or that the processors use bounded registers. (C) 1998 Published by Elsevier Science B.V.

关键词： snapshot memory distributed protocol fault tolerance lower bound

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：