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

12th IEEE International Conference on Programming and Systems (ISPS)

作者： Gherbi, Chirihane Aliouat, Zibouda Benmohammed, Mohammed Univ OEB Dept Math & Comp Sci Oum El Bouaghi Algeria Ferhat Abbes Univ Dept Sci Setif Algeria Mentouri Univ Dept Comp Sci Constantine Algeria

ISBN: (纸本)9781479977000

Hierarchical routing is an efficient way to lower energy consumption within a cluster, performing data aggregation and fusion in order decrease the number of transmitted messages to the BS. In this paper, a novel hierarchical approach called distributed energy efficient adaptive clustering protocol with Data Gathering (DEACP) is proposed for Wireless sensor network. Since nodes in a sensor network have limited energy, prolonging the network lifetime and improving scalability become important. we have proposed (DEACP) approach to reach the following objectives: reduce the overall network energy consumption, balance the energy consumption among the sensors and extend the lifetime of the network, the clustering must be completely distributed, the clustering should be efficient in complexity of message and time, the cluster-heads should be well-distributed across the network, the load balancing should be done well, the clustered WSN should be fully-connected. As a result transmission power of the node is reduce which subsequently reduces the energy consumption of the node. Our proposed work is simulated through Network Simulator (NS-2). We consider the problem of conserving energy in a single node in a wireless sensor network by turning off the node's radio for periods of a fixed time length. While packets may continue to arrive at the node's buffer during the sleep periods, the node cannot transmit them until it wakes up. The objective is to design sleep control laws that minimize the expected value of a cost function representing both energy consumption costs and holding costs for backlogged packets. The network scenario is established by considering 1000 X 1000 area and displaying randomly moving nodes using TCL. The resource reservation is used to decompose the total simulation time of network into smaller time slots depending upon number of nodes in the network using TDMA technique. Simulations show that (DEACP) clusters have good performance characteristics.

关键词： Energy saving distributed algorithm Cluster-based Routing Wireless Sensor Network

来源：评论

学校读者我要写书评

暂无评论

Discovery Through Gossip

引用

RANDOM STRUCTURES & algorithmS 2016年第3期48卷 565-587页

作者： Haeupler, Bernhard Pandurangan, Gopal Peleg, David Rajaraman, Rajmohan Sun, Zhifeng Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA Nanyang Technol Univ Div Math Sci Singapore 637371 Singapore Brown Univ Dept Comp Sci Providence RI 02912 USA Univ Houston Dept Comp Sci Houston TX 77204 USA Weizmann Inst Sci Dept Comp Sci & Appl Math IL-76100 Rehovot Israel Northeastern Univ Coll Comp & Informat Sci Boston MA 02115 USA

We study randomized gossip-based processes in dynamic networks that are motivated by information discovery in large-scale distributed networks such as peer-to-peer and social networks. Awell-studied problem in peer-to-peer networks is resource discovery, where the goal for nodes (hosts with IP addresses) is to discover the IP addresses of all other hosts. Also, some of the recent work on self-stabilization algorithms for P2P/overlay networks proceed via discovery of the complete network. In social networks, nodes (people) discover new nodes through exchanging contacts with their neighbors (friends). In both cases the discovery of new nodes changes the underlying network new edges are added to the network - and the process continues in the changed network. Rigorously analyzing such dynamic (stochastic) processes in a continuously changing topology remains a challenging problem with obvious applications. This paper studies and analyzes two natural gossip-based discovery processes. In the push discovery or triangulation process, each node repeatedly chooses two random neighbors and connects them (i. e., "pushes" their mutual information to each other). In the pull discovery process or the two-hop walk, each node repeatedly requests or "pulls" a random contact from a random neighbor and connects itself to this two-hop neighbor. Both processes are lightweight in the sense that the amortized work done per node is constant per round, local, and naturally robust due to the inherent randomized nature of gossip. Our main result is an almost-tight analysis of the time taken for these two randomized processes to converge. We show that in any undirected n-node graph both processes take O(n log(2) n) rounds to connect every node to all other nodes with high probability, whereas Omega(n log n) is a lower bound. We also study the two-hop walk in directed graphs, and show that it takes O(n(2) log n) time with high probability, and that the worst-case bound is tight for arbitrary dir

关键词： random process resource discovery social network gossip-based algorithm distributed algorithm probabilistic analysis

来源：评论

学校读者我要写书评

暂无评论

Reducing synchronization cost in distributed multi-resource allocation problem 44

Reducing synchronization cost in distributed multi-resource ...

引用

44th Annual International Conference on Parallel Processing Workshops (ICPPW)

作者： Lejeune, Jonathan Arantes, Luciana Sopena, Julien Sens, Pierre Ecole Mines Nantes EMN LINA Inria Nantes France Univ Paris 06 Sorbonne Univ CNRS InriaLIP6 F-75005 Paris France

ISBN: (纸本)9781467375887

Generalized distributed mutual exclusion algorithms allow processes to concurrently access a set of shared resources. However, they must ensure an exclusive access to each resource. In order to avoid deadlocks, many of them are based on the strong assumption of a prior knowledge about conflicts between processes' requests. Some other approaches, which do not require such a knowledge, exploit broadcast mechanisms or a global lock, degrading message complexity and synchronization cost. We propose in this paper a new solution for shared resources allocation which reduces the communication between non-conflicting processes without a prior knowledge of processes conflicts. Performance evaluation results show that our solution improves resource use rate by a factor up to 20 compared to a global lock based algorithm.

关键词： distributed algorithm generalized mutual exclusion multi-resource allocation drinking philosophers performance evaluation

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2010年第4期18卷 1067-1076页

作者： Guo, Song Leung, Victor C. M. Univ Aizu Sch Comp Sci & Engn Aizu Wakamatsu Fukushima 9658580 Japan Univ British Columbia Dept Elect & Comp Engn Vancouver BC V6T 1Z4 Canada

We consider the problem of finding a multicast tree rooted at the source node and including all the destination nodes such that the maximum weight of the tree arcs is minimized. It is of paramount importance for many optimization problems, e.g., the maximum-lifetime multicast problem in multihop wireless networks, in the data networking community. We explore some important properties of this problem from a graph theory perspective and obtain a min-max-tree max-min-cut theorem, which provides a unified explanation for some important while separated results in the recent literature. We also apply the theorem to derive an algorithm that can construct a global optimal min-max multicast tree in a distributed fashion. In random networks with it nodes and m arcs, our theoretical analysis shows that the expected communication complexity of our distributed algorithm is in the order of 0(m). Specifically, the average number of messages is 2(n - 1 - gamma) - 2ln(n - 1) + m, at most, in which gamma is the Euler constant. To our best knowledge, this is the first contribution that possesses the distributed and scalable properties for the min-max multicast problem and is especially desirable to the large-scale resource-limited multihop wireless networks, like sensor networks.

关键词： Communication complexity distributed algorithm min-max tree Steiner tree

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Single-Source Reachability 15

Brief Announcement: Distributed Single-Source Reachability

引用

34th Annual ACM Symposium on Principles of distributed Computing (PODC)

作者： Ghaffari, Mohsen Udwani, Rajan MIT Cambridge MA 02139 USA

ISBN: (纸本)9781450336178

In the directed single-source reachability problem, input is a directed graph G = (V,E) and a source s is an element of V, and the objective is to identify nodes t for which there is a directed path in G from s to t. Recently Nanongkai [2] presented a distributed algorithm that solves this problem in (O) over tilde (D + root nD(1/2)) rounds, where D and n respectively denote the network diameter and the number of nodes. This note presents an algorithm that improves the round complexity to (O) over tilde (D + root nD(1/4)), thus getting closer to the (Omega) over tilde (D + root n) lower bound of Das Sarma et al. [1].

关键词： distributed algorithm Reachability Directed Graphs

来源：评论

学校读者我要写书评

暂无评论

distributed CFG-based Symbolic Execution for Assembly Programs 4

Distributed CFG-based Symbolic Execution for Assembly Progra...

引用

IEEE 4th Global Conference on Consumer Electronics GCCE

作者： Adachi, Takumi Yamane, Satoshi Sakurai, Kohei Kanazawa Univ Kanazawa Ishikawa 9201192 Japan

ISBN: (纸本)9781479987511

Symbolic execution is one of the effective dynamic verification methods and there are some researches on application of it to assembly programs. However, symbolic execution has well-known problems: First, symbolic execution can't deal with some programs with containing loops. Second, symbolic execution sometimes causes the path explosion. In particular, assembly programs more often suffer from these problems because of its characteristic control flow such as interruptions. In this paper, we propose the distributed CFG(Control Flow Graph)-based Symbolic Execution to solve these problems.

关键词： symbolic execution distributed algorithm assembly program verification

来源：评论

学校读者我要写书评

暂无评论

A distributed Game-Theoretic Power Control Mechanism for Device-to-Device Communications Underlaying Cellular Network 10th

A Distributed Game-Theoretic Power Control Mechanism for Dev...

引用

10th International Conference on Wireless algorithms, Systems, and Applications (WASA)

作者： Huang, Jun Sun, Yi Xing, Cong-Cong Zhao, Yanxiao Chen, Qianbin Chongqing Univ Posts & Telecommun Sch CIE Chongqing 400065 Peoples R China Nicholls State Univ Dept Math & Comp Sci Thibodaux LA 70310 USA South Dakota Sch Mines & Technol ECE Dept Rapid City SD 57701 USA

ISBN: (纸本)9783319218373;9783319218366

Although the Device-to-Device (D2D) technology has been extensively studied as an effective means to address the spectrum scarcity and to relieve the overload of base stations in cellular systems, the interference between D2D links and cellular links emerges as an challenging issue that must be dealt with. Among many other techniques to reduce the interference, transmitter power control plays a crucial role. In this paper, we propose a game theoretic model to acquire the compensatory power of D2D link transmitters underlaying the cellular network. This model considers not only interference between cellular links and D2D links but the interference among D2D links themselves as well. Also, it allows the compensatory power for a D2D link to be decided based on the need of this D2D link, leading to a reasonable acquisition/configuration of compensatory powers of all D2D links and an overall improvement of the communication quality. Finally, we developed a distributed compensatory power control mechanism to compute the compensatory power for each D2D link. Simulation results demonstrate the validness and rationality of this mechanism.

关键词： Device-to-Device Interference Power control Game theory distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Beamformer Design Under Mixed SINR Balancing and SINR-Target-Constraints

Distributed Beamformer Design Under Mixed SINR Balancing and...

引用

IEEE International Conference on Digital Signal Processing (DSP)

作者： Basutli, Bokamoso Lambotharan, Sangarapillai Univ Loughborough Sch Elect Elect & Syst Engn Loughborough LE11 3TU Leics England

ISBN: (纸本)9781479980581

This work outlines how mixed quality-of-service (QoS) optimization in multi-cell coordinated beamforming (MCBF) can be effectively implemented using distributed algorithms. An alternating direction method of multipliers (ADMM) based algorithm has been adopted to provide distributed beam-former design based on the joint signal-to-interference-plus-noise ratio (SINR) balancing and SINR-target criterion. It is shown through simulations that the proposed algorithm has the ability to converge to optimal centralized solution.

关键词： distributed algorithm mixed QoS alternating direction method of multipliers (ADMM) convex SINR balancing and SINR target

来源：评论

学校读者我要写书评

暂无评论

distributed Computation of Connected Dominating Set for Multi-hop Wireless Networks 6

Distributed Computation of Connected Dominating Set for Mult...

引用

6th International Conference on Emerging Ubiquitous Systems and Pervasive Networks (EUSPN) / 5th International Conference on Current and Future Trends of Information and Communication Technologies in Healthcare (ICTH)

作者： Surendran, Simi Vijayan, Sreelakshmy AMRITA Univ Kollam 690525 India

In large wireless multi-hop networks, routing is a main issue as they include many nodes that span over relatively a large area. In such a scenario, finding smallest set of dominant nodes for forwarding packets would be a good approach for better communication. Connected dominating set (CDS) computation is one of the method to find important nodes in the network. As CDS computation is an NP problem, several approximation algorithms are available but these algorithms have high message complexity. This paper discusses the design and implementation of a distributed algorithm to compute connected dominating sets in a wireless network with the help of network spectral properties. Based on local neighborhood, each node in the network finds its ego centric network. To identify dominant nodes, it uses bridge centrality value of ego centric network. A distributed algorithm is proposed to find nodes to connect dominant nodes which approximates CDS. The algorithm has been applied on networks with different network sizes and varying edge probability distributions. The algorithm outputs 40 % important nodes in the network to form back haul communication links with an approximation ratio <= 0.04 partial derivative + 1, where partial derivative is the maximum node degree. The results confirm that the algorithm contributes to a better performance with reduced message complexity. (c) 2015 The Authors. Published by Elsevier B.V.

关键词： Connected Dominating Set distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation in Cellular Systems for Applications with Random Parameters

Resource Allocation in Cellular Systems for Applications wit...

引用

International Conference on Computing, Networking and Communications

作者： Zaid Kbah Ahmed Abdelhadi University of New Haven Hume Center Virginia Tech

ISBN: (纸本)9781467385800

In this paper, we conduct a study to optimize resource allocation for adaptive real-time and delay-tolerant applications in cellular systems. To represent the user applications via several devices and equipment, sigmoidal-like and logarithmic utility functions are used. A fairness proportional utility functions policy approach is used to allocate the resources among the user equipment (UE)s in a utility percentage form in order to ensure a minimum level of customer satisfaction for all the subscribers. Meanwhile, the priority of resources allocation is given to the real-time applications. We measure the effect of the stochastic variations of the adaptive real-time applications on the optimal rate allocation process and compare the results of the deterministic and stochastic systems. Our work is distinct from the other resource allocation optimization works in that we use the bisection method besides convex optimization techniques to optimally allocate rates, and we present the adaptive real-time applications in a stochastic form. We use Microsoft Visual Basic for Applications with Arena Simulation Software interface to simulate the optimization problem. Finally, we present our optimization algorithm results.

关键词： Resource allocation QoS Robustness Real-time applications distributed algorithm Stochastic modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：