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

3rd International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2007)

作者： Hong, Yongfa Xu, Juan Jiang, Changjun Tongji Univ Coll Elect & Informat Engn Shanghai 200092 Peoples R China Shandong Univ Sci & Technol Coll Informat Sci & Technol Qingdao Peoples R China

ISBN: (纸本)9781424413119

The lifetime is a critical parameter for wireless sensor networks, which is defined as the maximum time of delivering certain data to the sink node before sensor node runs out of energy under an initial energy is given. In this paper, we propose a distributed algorithm for data gathering in wireless sensor networks with the assistance of network coding, such that the network lifetime is maximized. We prove rigorously that the proposed algorithm converge to the optimal solution of regularized problem.

关键词： network lifetime wireless sensor networks subgradient algorithm distributed algorithm network coding

来源：评论

学校读者我要写书评

暂无评论

Maximum energy welfare routing in wireless sensor networks

引用

6th International IFIP-TC 6 Networking Conference

作者： Ok, Changsoo Mitra, Prasenjit Lee, Seokcheon Kumara, Soundar Penn State Univ Dept Ind Engn University Pk PA 16802 USA Penn State Univ Coll Informat Sci & Technol University Pk PA 16802 USA Purdue Univ Sch Ind Engn W Lafayette IN 47907 USA

ISBN: (纸本)97830540726050

Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the sensors on the efficient paths are depleted quickly, and consequently the sensor networks become incapable of monitoring events from some parts of their target areas. In many sensor network applications, the events have uncertainties in positions and generation patterns. Therefore, routing algorithms should be designed to consider not only energy efficiency, but also the amount of energy left in each sensor to avoid sensors running out of power early. This paper introduces a new metric, called Energy-Welfare, devised to consider average and balance of sensors' remaining energies simultaneously. Using this metric, we design the Maximum Energy Welfare Routing algorithm, which achieves energy efficiency and energy balance of sensor networks simultaneously. Moreover, we demonstrate the effectiveness of the proposed routing algorithm by comparing with three existing routing algorithms.

关键词： sensor network distributed algorithm energy aware routing energy welfare social welfare energy balance

来源：评论

学校读者我要写书评

暂无评论

Byzantine consensus with few synchronous links 1

引用

11th International Conference on Principles of distributed Systems

作者： Hamouma, Moumen Mostefaoui, Achour Tredan, Gilles Univ A Mira Dept Informat Bejaia 06000 Algeria Univ Rennes 1 IRISA F-35042 Rennes France

ISBN: (数字)9783540770961

ISBN: (纸本)9783540770954

This paper tackles the consensus problem in asynchronous systems prone to byzantine failures. One way to circumvent the FLP impossibility result consists in adding synchrony assumptions (deterministic solution). In the context of crash failures (at most t processes may crash), the weakest partially synchronous system model assumes at least one correct process with outgoing links that eventually permit a bounded transmission delay with at least t neighbors (the set of neighbors may change over time). Aguilera et al. provided the main result for systems where at most t processes may exhibit a byzantine behavior. They assume a correct process with all its outgoing and incoming links eventually timely. This paper considers a system model with at least one correct process connected with x privileged neighbors with eventually timely outgoing and incoming links. In this system model, a byzantine consensus protocol is proposed. It uses authentication and assumes x > 2t.

关键词： asynchronous distributed system Byzantine process consensus distributed algorithm eventually timely link fault tolerance resilience

来源：评论

学校读者我要写书评

暂无评论

From an intermittent rotating star to a leader

From an intermittent rotating star to a leader

引用

11th International Conference on Principles of distributed Systems

作者： Anta, Antonio Fernandez Raynal, Michel Univ Rey Juan Carlos GSyC LADyR Mostoles 28933 Spain Univ Rennes 1 IRISA F-35042 Rennes France

ISBN: (纸本)9783540770954

Considering an asynchronous system made up of n processes and where up to t of them can crash, finding the weakest assumptions that such a system has to satisfy for a common leader to be eventually elected is one of the holy grail quests of fault-tolerant asynchronous computing. This paper is a step in such a quest. It has two main contributions. First, it proposes an asynchronous system model, in which an eventual leader can be elected, that is weaker and more general than previous models. This model is captured by the notion of intermittent rotating t-star. An x-star is a set of x + 1 processes: a process p (the center of the star) plus a set of x processes (the points of the star). Intuitively, assuming logical times rn (round numbers), the intermittent rotating t-star assumption means that there are a process p, a subset of the round numbers rn, and associated sets Q(rn) such that each set {p} UQ(rn) is a t-star centered at p, and each process of Q(rn) receives from p a message tagged rn in a timely manner or among the first (n - t) messages tagged rn it ever receives. The star is called t-rotating because the set Q(rn) is allowed to change with rn. It is called intermittent because the star can disappear during finite periods. This assumption, not only combines, but generalizes several synchrony and time-free assumptions that have been previously proposed to elect an eventual leader (e.g., eventual t-source, eventual t-moving source, message pattern assumption). Each of these assumptions appears as a particular case of the intermittent rotating t-star assumption. The second contribution of the paper is an algorithm that eventually elects a common leader in any system that satisfies the intermittent rotating t-star assumption. That algorithm enjoys, among others, two noteworthy properties. Firstly, from a design point of view, it is simple. Secondly, from a cost point of view, only the round numbers can increase without bound. This means that, be the execution f

关键词： assumption coverage asynchronous system distributed algorithm eventual t-source eventual leader failure detector fault-tolerance message pattern moving source omega partial synchrony process crash system model timely link

来源：评论

学校读者我要写书评

暂无评论

EM2NET: an energy-saving Explicit Multicast protocol for MANETs

EM2NET: an energy-saving Explicit Multicast protocol for MAN...

引用

IEEE Global Telecommunications Conference (GLOBECOM 07)

作者： Benslimane, Abderrahim Ferrari, Cedric Hafid, Abdelhakim Univ Avignon Comp Sci Lab BP 1228 F-84911 Avignon France Univ Montreal Network Res Lab Montreal PQ H3C 3J7 Canada

ISBN: (纸本)9781424410422

In this paper, we propose a new Explicit Multicast protocol for MANET, called EM2NET. The objective of EM2NET is to efficiently support large number of small multicast groups in MANETs. EM2NET strikes a nice balance between the characteristics of explicit multicast protocols (e.g., Xcast and (EM)-M-2) and these of tree/mesh-based multicast protocols (e.g., ODMRP and MAODV). Indeed, it combines the encoding of destinations addresses in the packet header and the maintenance of multicast state information in carefully selected nodes. Simulations show that EM2NET outperforms (a) explicit multicast protocols and (b) tree/mesh based protocols in the case of small size multicast groups.

关键词： adhoc network multicast routing energy conservation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A dual-token-based fault tolerant mutual exclusion algorithm for MANETs

A dual-token-based fault tolerant mutual exclusion algorithm...

引用

3rd International Conference on Mobile Ad-Hoc and Sensor Networks

作者： Wu, Weigang Cao, Jiannong Raynal, Michel Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China Univ Rennes 1 IRISA F-35042 Rennes France

ISBN: (纸本)9783540770237

Most existing mutual exclusion algorithms for mobile ad hoc networks (MANETs) adopt a token-based approach. In traditional wired networks, timeout-based mechanisms are commonly used to detect token losses. However, in MANETs, it is difficult to set a proper timeout value due to the network dynamics. In this paper, we propose a dual-token-based mutual exclusion algorithm, which can tolerate token losses without using timeout. Two tokens are concurrently circulated in the system to monitor each other by using sequence numbers. If one token is lost, the other token can detect the loss and regenerate a new token. Simulations have been carried out to evaluate the effectiveness and performance of the proposed algorithm in comparison with the timeout-based approach. The results show that the timeout-based algorithm may falsely claim the loss of a token, thus cannot guarantee the correctness of mutual exclusion algorithms. On the contrary, our proposed algorithm can avoid false detection of token losses and satisfy all the correctness requirements of mutual exclusion, though it costs a bit more messages and longer time.

关键词： mutual exclusion distributed algorithm MANET mobile computing token loss

来源：评论

学校读者我要写书评

暂无评论

Optimization based rate control for multicast with network coding

Optimization based rate control for multicast with network c...

引用

26th IEEE Conference on Computer Communications (INFOCOM 2007)

作者： Chen, Lijun Ho, Tracey Low, Steven H. Chiang, Mung Doyle, John C. CALTECH Div Engn & Appl Sci Pasadena CA 91125 USA Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

ISBN: (纸本)9781424410460

Recent advances in network coding have shown great potential for efficient information multicasting in communication networks, in terms of both network throughput and network management. In this paper, we address the problem of rate control at end-systems for network coding based multicast flows. We develop two adaptive rate control algorithms for the networks with given coding subgraphs and without given coding subgraphs, respectively. With random network coding, both algorithms can be implemented in a distributed manner, and work at transport layer to adjust source rates and at network layer to carry out network coding. We prove that the proposed algorithms converge to the globally optimal solutions for intra-session network coding. Some related issues are discussed, and numerical examples are provided to complement our theoretical analysis.

关键词： rate control network coding multicast coding subgraph distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A self-stabilizing distributed algorithm for the Steiner tree problem

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2004年第2期E87D卷 299-307页

作者： Kamei, S Kakugawa, H Hiroshima Univ Dept Informat Engn Higashihiroshima 7398527 Japan

Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. In this paper, we investigate the Steiner tree problem in distributed systems, and propose a self-stabilizing heuristic solution to the problem. Our algorithm is constructed by four layered modules (sub-algorithms): construction of a shortest path forest, transformation of the network, construction of a minimum spanning tree, and pruning unnecessary links and processes. Competitiveness is 2(1 - 1/l), where l is the number of leaves of optimal solution.

关键词： distributed algorithm fault-tolerant self-stabilizing algorithm fair composition Steiner tree problem

来源：评论

学校读者我要写书评

暂无评论

Local MST Computation with Short Advice 07

Local MST Computation with Short Advice

引用

19th Annual Symposium on Parallelism in algorithms and Architectures

作者： Fraigniaud, Pierre Korman, Amos Lebhar, Emmanuelle CNRS F-75700 Paris France

ISBN: (纸本)9781595936677

We use the recently introduced advising scheme framework for measuring the difficulty of locally distributively computing a Minimum Spanning Tree (MST). An (m, t)-advising scheme for a distributed problem P is a way, for every possible input I of P, to provide an "advice" (i.e., a bit string) about I to each node so that: (1) the maximum size of the advices is at most m bits;and (2) the problem P can be solved distributively in at roost t rounds using the advices as inputs. In case of MST, the output returned by each node of a weighted graph G is the edge leading to its parent in some rooted MST T of G. Clearly, there is a trivial (inverted right perpendicularlog ninverted left perpendicular, 0)-advising scheme for MST (each node is given the local port number of the edge leading to the root of some MST T), and it is known that any (0, t,)-advising scheme satisfies t >= (Omega) over bar(root n). Our main result is the construction of an (O(1), O(log n))-advising scheme for MST. That is, by only giving a constant number of bits of advice to each node, one can decrease exponentially the distributed computation time of MST in arbitrary graph, compared to algorithms dealing with the problem in absence of any a priori information. We also consider tire average size of the advices. On the one hand;we show that any (m, 0)-advising scheme for MST gives advices of average size Omega(log n). On the other hand we design an (m, 1)-advising scheme for MST with advices of constant;average size, that is one round is enough to decrease the average size of the advices from log n to constant.

关键词： Minimum spanning tree distributed algorithm local computation

来源：评论

学校读者我要写书评

暂无评论

A scheme for the solutions of the h-out of-k mutual exclusion problems using k-arbiters

A scheme for the solutions of the h-out of-k mutual exclusio...

引用

2007 10th International Conference on Computer and Information Technology, ICCIT

作者： Rahman, Mohammad Ashiqur Alam, M. Shafiul Military Institute of Science and Technology Dhaka Bangladesh Ahsanullah University of Science and Technology Dhaka Bangladesh

ISBN: (纸本)1424415519

The k-arbiter is a well-established solution for the problem of the h-out of-k mutual exclusion. Though the solution using k-arbiters are simple and highly fault tolerant, the size of the quorums is high comparing to that of 1-coteries and for large values of k it becomes worse. A k-arbiter needs to have intersection between any k+1 quorums. Here we propose k(h)-arbiter, an efficient and general solution, for the h-out of-k mutual exclusion problems. It is an extension to k-arbiter. Here the quorum construction, using k-arbiters, considers h. The quorum size is variable and inversely proportional to the value of h for a specific value of k. The quorum size is smaller than that of k-arbiters for h>1. We apply this technique on two simple k-arbiter construction schemes, uniform k-arbiter and binomial k-arbiter. ©2007 IEEE.

关键词： Arbiter distributed algorithm Mutual exclusion Quorum Scheme

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：