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

Proposing a centralized algorithm to minimize message broadcasting energy in wireless sensor networks using directional antennas

引用

APPLIED SOFT COMPUTING 2018年 64卷 272-281页

作者： FallahHoseini, Mohsen Rafeh, Reza Arak Univ Dept Comp Engn Arak Iran Waikato Inst Technol Ctr Business Informat Technol & Enterprise Hamilton New Zealand

Wireless Sensor Networks(WSN) are utilized in many fields such as environmental monitoring and military applications. The nodes of WSNs are not rechargeable, so energy conservation in these networks is important. One of the important issues in these networks is to optimize energy in message broadcasting. Depending on the ability of nodes and antennas, broadcasting is done in two means: directional and omni-directional antennas. There are centralized algorithms to broadcast message in wireless networks either by directional or omni-directional antennas. The problem of minimizing energy in broadcasting and multicasting is Non-polynomial-hard. In this paper, a centralized algorithm is proposed to improve energy and running time of the algorithm by using directional antennas. As evolutionary algorithms by omni-directional antenna are better than heuristic algorithms in terms of the time and the average result;a new approach based on particle swarm optimization (PSO) as an evolutionary algorithm is proposed in this paper. We have also considered and evaluated most of famous evolutionary algorithms such as Simulated Annealing (SA), genetic algorithm (GA), Teaching-Learning-Based Optimization (TLBO), Harmony Search (HS) and Ant Colony Optimization (ACO). The experiment results indicate that the proposed method is effective especially in term of energy conservation. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Wireless sensor network Multicasting Broadcasting Omni-directional antenna Directional antenna Particle swarm optimization centralized algorithm

来源：评论

学校读者我要写书评

暂无评论

Analysis Technique of Cell Zooming Using Lower-to-Higher Scheme on centralized algorithm Towards Green Cellular Network in Surabaya 18

Analysis Technique of Cell Zooming Using Lower-to-Higher Sch...

引用

18th IEEE International Electronics Symposium (IES)

作者： Yuanita, Rosabella Ika Puspitorini, Okkie Mahmudah, Haniah EEPIS ITS Telecommun Engn Kampus PENSJalan Raya ITS Sukolilo Surabaya 60111 Indonesia

ISBN: (纸本)9781509016402

Cellular communication system is the most widely used communication system as commercial purpose. Mobile phones have become much more than mere communication devices. The encouragement for Telecommunication operators towards the energy consumption problem is to optimize the utilization of network equipment. Energy consumption of BSs is considerable even when traffic load is low. In our study, we consider UMTS scenario with a simplified traffic model describing. This paper offers a mechanism of energy efficient with dynamically operation depends on traffic load, bit rate and cellular capacity. In this paper, concept of cell zooming by using centralized algorithm is investigated, and simulation result shows that the proposed algorithm can greatly reduces the energy consumption up to 70%, which leads to green cellular network.

关键词： traffic load cell zooming centralized algorithm efficiency energy green cellular network

来源：评论

学校读者我要写书评

暂无评论

4-DMWM Approach for Caching Based Optimal D2D Pairing and Channel Allocation: centralized and Distributed algorithm Design

引用

IEEE ACCESS 2016年 4卷 9213-9224页

作者： Miao, Lu Bai, Bo Chen, Wei Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

Caching popular contents at mobile devices can potentially improve the quality of service for mobile users and relieve traffic burden of base station in cellular networks. In this paper, we jointly consider the resource allocation, the cached contents, and the distance between two devices for the optimal device pairing problem in centralized and distributed cases, where the BS is the central controller in the centralized case. The joint optimization problem of device-to-device (D2D) caching with channel allocation is formulated as a weighted four-uniform hypergraph model. The optimal solution for the problem is 4-D maximum weighted matching (4-DMWM), which is NP-hard unfortunately. To approach the 4-DMWM with low-complexity, we adopt the greedy algorithm and the squareIMP algorithm in the centralized case. Moreover, distributed algorithms are also designed for the caching problem in both synchronous and asynchronous cases. The simulation results will illustrate that the squareIMP algorithm can be used to get a better transmission rate with the complexity of O(n(5)), while the greedy algorithm can be used in the case with stringent latency requirement for centralized 4-DMWM problem. The sum rate of distributed asynchronous algorithm is close to the centralized greedy algorithm with the complexity of O(n(2)) for each device. However, the simulation result of the synchronous algorithm is slightly lower than the centralized algorithm, where each device performs O(n(2)) computational operations in each iteration. Therefore, the algorithms proposed in this paper can be used in different cases for solving optimal D2D pairing and channel allocation problem.

关键词： D2D caching weighted 4-uniform hypergraph 4-dimensional maximum weighted matching (4-DMWM) centralized algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A new robust centralized DMX algorithm

A new robust centralized DMX algorithm

引用

International Conference on Parallel and Distributed Computing and Networks

作者： Challenger, Moharram Khalilpour, Vahid Bayat, Peyman Meibodi, Mohammad Reza Islamic Azad University Shabestar Branch Iran Islamic Azad University Tafresh Branch Iran Amir-Kabir University Tehran Iran

ISBN: (纸本)9780889866379

In a distributed system, process synchronization is an important agenda. One of the major duties for process synchronization is mutual exclusion. This paper presents a new centralized fault tolerant distributed mutual exclusion algorithm based on Agrawala and El-Abbadi's algorithm. In new algorithm, once coordinator crashes, algorithm can recover lost data and return the coordinator in earlier situation. Thus fault tolerance will ascend and centralize algorithm's "single point of failure" will be omitted. So based algorithm will be more reliable. The only trade off is consuming some inappreciable time in case of coordinator's crash.

关键词： distributed system mutual exclusion fault tolerance centralized algorithm

来源：评论

学校读者我要写书评

暂无评论

centralized Channel Assignment algorithm for OSA-Enabled WLANs based on Simulated Annealing 7

Centralized Channel Assignment Algorithm for OSA-Enabled WLA...

引用

7th IEEE Latin-American Conference on Communications (LATINCOM)

作者： Novillo, Francisco Valdivieso, Carlos Velasquez, Francisco Escuela Super Politecn Litoral ESPOL GICOM CIDIS FIEC Km 30-5 Via Perimetral Guayaquil Ecuador

ISBN: (纸本)9781467384513

Channel allocation problem is a major task, especially in dense deployments of wireless local area networks (WLANs). In such cases, opportunistic spectrum access (OSA) is considered to be a promising approach to diminish congestion of the ISM band in highly dense WLANs scenarios. OSA allows to secondary users, the use of underutilized licensed channels, without affecting legacy users. In this paper, centralized simulated annealing algorithms applied to uncoordinated and congested WLANs deployments are developed. Unlike currents channel assignments mechanisms, several distinguished issues should be addressed for OSA-enabled WLANs: band prioritization and channel bandwidth. On this basis, the development and assessment of centralized simulated annealing algorithms (CSA) that cope with the OSA channel allocation problem and considers channel prioritization and channel bandwidth restrictions, are presented.

关键词： Channel Assignment centralized algorithm OSA Simulated Annealing WLAN

来源：评论

学校读者我要写书评

暂无评论

centralized asynchronous broadcast in radio networks

引用

THEORETICAL COMPUTER SCIENCE 2007年第1期383卷 5-22页

作者： Chlebus, Bogdan S. Rokicki, Mariusz A. Univ Colorado Hlth Sci Ctr Dept Comp Sci & Engn Denver CO 80217 USA Univ Paris 11 CNRS LRI UMR 8623 F-91405 Orsay France

We study asynchronous broadcasting in packet radio networks. A radio network is represented by a directed graph, in which one distinguished source node stores a message that needs to be disseminated among all the remaining nodes. An asynchronous execution of a protocol is a sequence of events, each consisting of simultaneous deliveries of messages. The correctness of protocols is considered for specific adversarial models defined by restrictions on events the adversary may schedule. A protocol specifies how many times the source message is to be retransmitted by each node. The total number of transmissions over all the nodes is called the work of the broadcast protocol;it is used as complexity measure. We study computational problems, to be solved by deterministic centralized algorithms, either to find a broadcast protocol or to verify the correctness of a protocol, for a given network. The amount of work necessary to make a protocol correct may have to be exponential in the size of network. There is a polynomial-time algorithm to find a broadcast protocol for a given network. We show that certain problems about broadcasting protocols for given networks are complete in NP and co-NP complexity classes. (c) 2007 Elsevier B.V. All rights reserved.

关键词： radio network asynchrony broadcast protocol centralized algorithm lower bound complexity class completeness

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity centralized Joint Power and Admission Control in Cognitive Radio Networks

引用

IEEE COMMUNICATIONS LETTERS 2009年第6期13卷 420-422页

作者： Gu, Hong-Yu Yang, Chen-Yang Fong, Bernard Beihang Univ Sch Elect & Informat Engn Beijing Peoples R China Hong Kong Polytech Univ Hong Kong Hong Kong Peoples R China

This letter introduces a centralized joint power and admission control algorithm for cognitive radio networks. Its novelty lies in the proposed admission metric. Unlike those in existing algorithms, our metric predetermines the admission order of N secondary users which intend to access the network. This allows us to search a group of admitted secondary users with the bisection method. The proposed algorithm is shown by simulation to achieve a comparable performance to existing alorithms, and the computational complexity is reduced from O (N-3) to O(N-2 log(2) N).

关键词： Cognitive radios power control admission control centralized algorithm link gain ratio

来源：评论

学校读者我要写书评

暂无评论

Throughput Optimization in Cognitive Radio Networks Ensembling Physical Layer Measurement

引用

Journal of Computer Science & Technology 2015年第6期30卷 1290-1305页

作者：赵彦超吴杰李文中陆桑璐 State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210023 China Department of Computer and Information Sciences Temple University Philadelphia PA 19122 U.S.A.

Wireless networks are developed under the fashion of wider spectrum utilization （e.g., cognitive radio） and multi-hop communication （e.g., wireless mesh networks）. In these paradigms, how to effectively allocate the spectrum to different transmission links with minimized mutual interference becomes the key concern. In this paper, we study the throughput optimization via spectrum allocation in cognitive radio networks （CRNs）. The previous studies incorporate either the conflict graph or SINR model to characterize the interference relationship. However, the former model neglects the accumulative interference effect and leads to unwanted interference and sub-optimal results, while the work based on the latter model neglects its heavy reliance on the accuracy of estimated RSS （receiving signal strength） among all potential links. Both are inadequate to characterize the complex relationship between interference and throughput. To this end, by considering the feature of CRs, like spectrum diversity and non-continuous OFDM, we propose a measurement-assisted SINR-based cross-layer throughput optimization solution. Our work concerns features in different layers： in the physical layer, we present an efficient RSS estimation algorithm to improve the accuracy of the SINR model; in the upper layer, a flow level SINR-based throughput optimization problem for WMNs is modelled as a mixed integer non-linear programming problem which is proved to be NP-hard. To solve this problem, a centralized （1 -ε）-optimal algorithm and an efficient distributed algorithm are provided. To evaluate the algorithm performance, the real-world traces are used to illustrate the effectiveness of our scheme.

关键词： cognitive radio network wireless mesh network throughput optimization centralized algorithm distributedalgorithm spectrum allocation

来源：评论

学校读者我要写书评

暂无评论

Convergecast and Broadcast by Power-Aware Mobile Agents

引用

algorithmICA 2016年第1期74卷 117-155页

作者： Anaya, Julian Chalopin, Jeremie Czyzowicz, Jurek Labourel, Arnaud Pelc, Andrzej Vaxes, Yann Univ Quebec Outaouais Gatineau PQ J8X 3X7 Canada CNRS LIF F-13288 Marseille France Aix Marseille Univ F-13288 Marseille France

A set of identical, mobile agents is deployed in a weighted network. Each agent has a battery-a power source allowing it to move along network edges. An agent uses its battery proportionally to the distance traveled. We consider two tasks: convergecast, in which at the beginning, each agent has some initial piece of information, and information of all agents has to be collected by some agent;and broadcast in which information of one specified agent has to be made available to all other agents. In both tasks, the agents exchange the currently possessed information when they meet. The objective of this paper is to investigate what is the minimal value of power, initially available to all agents, so that convergecast or broadcast can be achieved. We study this question in the centralized and the distributed settings. In the centralized setting, there is a central monitor that schedules the moves of all agents. In the distributed setting every agent has to perform an algorithm being unaware of the network. In the centralized setting, we give a linear-time algorithm to compute the optimal battery power and the strategy using it, both for convergecast and for broadcast, when agents are on the line. We also show that finding the optimal battery power for convergecast or for broadcast is NP-hard for the class of trees. On the other hand, we give a polynomial algorithm that finds a 2-approximation for convergecast and a 4-approximation for broadcast, for arbitrary *** the distributed setting, we give a 2-competitive algorithm for convergecast in trees and a 4-competitive algorithm for broadcast in trees. The competitive ratio of 2 is proved to be the best for the problem of convergecast, even if we only consider line networks. Indeed, we show that there is no ()-competitive algorithm for convergecast or for broadcast in the class of lines, for any .

关键词： Convergecast Broadcast Mobile agent Power-aware centralized algorithm Distributed algorithm Competitive ratio Graph

来源：评论

学校读者我要写书评

暂无评论

Multimedia resource allocation strategy of wireless sensor networks using distributed heuristic algorithm in cloud computing environment

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2020年第47-48期79卷 35353-35367页

作者： Yang, Jian Xiang, Zhen Mou, Lisha Liu, Shumu Sichuan Engn Tech Coll Informat Ctr Deyang 618000 Sichuan Peoples R China Sichuan Engn Tech Coll Deyang 618000 Sichuan Peoples R China Sichuan Engn Tech Coll Elect & Informat Engn Dept Deyang 618000 Sichuan Peoples R China

The virtualized resource allocation (mapping) algorithm is the core issue of network virtualization technology. Universal and excellent resource allocation algorithms not only provide efficient and reliable network resources sharing for systems and users, but also simplify the complexity of resource scheduling and management, improve the utilization of basic resources, balance network load and optimize network performance. Based on the application of wireless sensor network, this paper proposes a wireless sensor network architecture based on cloud computing. The WSN hardware resources are mapped into resources in cloud computing through virtualization technology, and the resource allocation strategy of the network architecture is proposed. The experiment evaluates the performance of the resource allocation strategy. The proposed heuristic algorithm is a distributed algorithm. The complexity of centralized algorithms is high, distributed algorithms can handle problems in parallel, and reduce the time required to get a good solution with limited traffic.

关键词： Resource allocation Sensor network Cloud storage environment Distributed heuristic algorithm centralized algorithm

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：