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

10th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)

作者： Romaniello, Gabriele Alphand, Olivier Duda, Andrzej Guizzetti, Roberto CNRS Grenoble Inst Technol Grenoble Informat Lab UMR 5217 F-75700 Paris France STMicroelectronics Crolles France

ISBN: (纸本)9781479950416

Multi-hop harvested wireless sensor networks (HWSN) face two challenges. First, each node must control its energy consumption through duty cycle adaptation to spend less energy than nodes obtain from the environment. Second, nodes must efficiently adapt topology so that packets use the most efficient paths towards the sink. In this paper, we address the challenges in the specific context of beacon-enabled IEEE 802.15.4 networks that harvest energy from the light. We analyze and discuss the integration of duty cycle adaptation and topology reconfiguration algorithms in this kind of networks. We propose a novel scheme to identify the best route using the Expected Delay metric (ED). ED synthesizes several network path factors in a single monotonic value that may be used to choose the parent node in topology construction. We have evaluated the performance of the proposed scheme and compared it with the DEHAR routing protocol. Our simulations show the better performance of the proposed scheme.

关键词： IEEE 802.15.4 Beacon-enabled Mode Wireless Sensor Networks Duty Cycle Adaptation Multi-hop Multi-channel Networks Harvested Networks routing algorithms Performance

来源：评论

学校读者我要写书评

暂无评论

Quality of Multicast Trees in Ad-Hoc Networks with Topology Control 9

Quality of Multicast Trees in Ad-Hoc Networks with Topology ...

引用

9th International Symposium on Communication Systems, Networks & Digital Signal Processing (CSNDSP)

作者： Piechowiak, Maciej Zwierzykowski, Piotr Stachowiak, Krzysztof Bartczak, Tomasz Kazimierz Wielki Univ Inst Mech & Comp Sci Bydgoszcz Poland Poznan Univ Tech Chair Commun & Comp Networks Poznan Poland

ISBN: (纸本)9781479925810

The article analyzes and explores the performance of multicast heuristic algorithms and quality of multicast trees in ad-hoc networks. It also provides a detailed analysis and a description of the implementation of methods for the topology generation in ad-hoc networks with the application of topology control protocols. Network topology planning and performance analysis are crucial challenges for wire and wireless network designers. They are also involved in the research on routing algorithms and protocols for ad-hoc networks. In addition, it is worth to emphasize that the generation of realistic network topologies makes it possible to construct and study routing algorithms, protocols and traffic characteristics for ad-hoc networks.

关键词： ad-hoc networks topology control network topology multicast routing routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Cloud Computing Environment Via Autonomic Meta-Director Framework 6

Energy Efficient Cloud Computing Environment Via Autonomic M...

引用

Sixth International Conference on Developments in eSystems Engineering (DeSE)

作者： Baker, Thar Ngoko, Yanik Tolosana-Calasanz, Rafael Rana, Omer F. Randles, Martin Liverpool John Moores Univ Sch Comp & Math Sci Liverpool Merseyside England Paris Nord Inst Gallillee Lab Informat Paris France Univ Zaragoza Dept Informat & Ingn Sistemas Zaragoza Spain Cardiff Univ Sch Comp Sci & Informat Cardiff S Glam Wales

ISBN: (纸本)9781479952649

The ever-increasing density in cloud computing users, services, and data centres has led to significant increases in network traffic and the associated energy consumed by its huge infrastructure, e.g. extra servers, switches, routers, which is required to respond quickly and effectively to users requests. Transferring data, via a high bandwidth connection between data centres and cloud users, consumes even larger amounts of energy than just processing and storing the data on a cloud data centre, and hence producing high carbon dioxide emissions. This power consumption is highly significant when transferring data into a data centre located relatively far from the user's geographical location. Thus, it became high-necessity to locate the lowest energy consumption route between the user and the designated data centre, while making sure the user's requirements, e.g. response time, are met. This paper proposes a high-end autonomic meta-director framework to find the most energy efficient route to the green data centre by utilising the linear programming approach. The framework is, first, formalised by the situation calculus, and then evaluated against shortest path algorithm with minimum number of nodes traversed.

关键词： cloud computing computer centres energy conservation green computing linear programming power aware computing power consumption autonomic metadirector framework carbon dioxide emissions cloud data centres data transfer energy consumption route energy efficient cloud computing environment green data centre linear programming approach shortest path algorithm situation calculus Cloud computing Data models Educational institutions Energy consumption Green products Logic gates Power demand Cloud Computing Energy Efficiency routing algorithms Cloud Computing data center Power consumption Shortest path algorithms power aware computing linear programming Energy efficiency Green products routing algorithms Power demand data models Educational institutions data transmission Logic gates energy consumption

来源：评论

学校读者我要写书评

暂无评论

Low-power multicast routing algorithm in green Internet

引用

Tongxin Xuebao/Journal on Communications 2014年 35卷 134-140页

作者： Zhang, Jin-Hong Wang, Xing-Wei Huang, Min College of Information Science and Engineering Northeastern University Shenyang110819 China

A path node-driven strategy based one-to-many multicast routing algorithm in green Internet (GIOMR) is proposed to generate a low-power shortest path tree, fully making use of the path node sharing paths and meanwhile improving user's QoS satisfaction degree. The GIOMR is implemented over CERNET2 topology by simulation. It has been shown that GIOMR has better performance on the network power consumption, the success rate of routing and the running time than efficient heuristics for energy-aware routing (EHER) algorithm. ©, 2014, Editorial Board of Journal on Communications. All right reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Interest community detecting method and routing scheme in opportunistic networks

引用

Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications 2014年第3期37卷 62-66页

作者： Liu, Qi-Lie Hu, Chun-Feng Zhu, De-Li Li, Yun Zhao, Wei-Liang Chongqing Key Laboratory of Mobile Communications Technology Chongqing University of Post and Communications Chongqing400065 China College of Computer and Information Science Chongqing Normal University Chongqing400047 China

As a result of relative stability of social relations between people in opportunistic networks, an interest community detecting method is proposed by quantifying the interests of nodes and comparing the similarity with the interest properties of nodes. Utilizing the communities generated by moving nodes and comprehensively considering the community property of nodes and the contact information among nodes, an interest community routing (ICR) scheme is presented. The ICR scheme is divided into two parts: routing within the community and routing among communities. The nodes which in the same community and contact more frequently with the destination node will be chosen as relay nodes. Simulations demonstrate the rationality and effectiveness of ICR, and shows that ICR can efficiently reduce the average overhead ratio and decrease delivery delay and increase the delivery ratio.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Decentralized Assignment for Intelligent Electric Vehicles to Recharge Stations 16

Decentralized Assignment for Intelligent Electric Vehicles t...

引用

16th UKSim-AMSS International Conference on Computer Modelling and Simulation (UKSim)

作者： Adacher, Ludovica Pascucci, Federica Oliva, Gabriele Univ Roma Tre Dipartimento Ingn Via Vasca Navale 79 I-00146 Rome Italy Univ Campus Biomedico Rome Complex Syst & Secur Lab I-00128 Rome Italy

ISBN: (纸本)9781479949236

In this paper the problem of assigning electric cars to charging stations in a distributed manner is addressed, resorting to Lagrangian-based distributed algorithms. Within such algorithms, the routing process is the result of a cooperation among several decision makers, having each one a local knowledge of the system. The decision makers are in charge to decide the type of information to be exchanged. Our focus is to investigate the performance of different algorithms based on different knowledge degrees of the system. The implementation issues and the effectiveness of the algorithms are analysed via simulation. The trade-off between knowledge degree and system performance is currently under study.

关键词： Decentralized Control Electric Vehicles Scheduling algorithms routing algorithms Decomposition methods

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Modified OLSR Protocol for MANET using ESPR Algorithm

Performance Analysis of Modified OLSR Protocol for MANET usi...

引用

International Conference on Information Communication and Embedded Systems (ICICES)

作者： Prabu, K. Subramani, A. Manonmaniam Sundaranar Univ Tirunelveli Tamil Nadu India Thiruvalluvar Univ Constituent Coll Tittagudi Tamil Nadu India KSR Coll Engn Dept Comp Applicat Tiruchengode Tamil Nadu India

ISBN: (纸本)9781479938346

Mobile Ad-hoc Network (MANET) is an emerging area of research in the communication network world. MANET is a group of wireless mobile nodes dynamically establishing a short live network without any use of network infrastructure or centralized administration. In this paper we proposed new routing algorithm named Energy Saver Path routing using Optimized Link State routing (ESPR-OLSR) protocol because routing in MANET is serious issue because network topology which is changeable due to nodes mobility. routing algorithm uses specific metrics to determine the optimum path between senders and receivers such as shortest minimum cost and minimum total power transmission etc. Many routing protocols have been proposed in last few years. Especially energy efficient routing is most important because all the nodes are limited battery power. Failure of one node may affect the entire networks. If a node runs out of energy the probability of network partitioning will be increased. Since every mobile node has limited power is become one of the main threats to the lifetime of the MANET. So routing in MANET should be in such a way that it will use the remaining battery power in an efficient way to increase the life time of the node / network. This ESPR algorithm executes based on the edge node selection mechanism because choose the shortest path from source to destination with low transmission power for transfer the packet and improved Packet Delivery Ratio (PDR) and reduced End-to-End delay than ordinary OLSR.

关键词： End-to-End Delay ESPR routing algorithms PDR Energy Efficient

来源：评论

学校读者我要写书评

暂无评论

Pre-Deployment of Regenerators in DWDM Networks and the Impact of Mismatches between Planning and Operation

Pre-Deployment of Regenerators in DWDM Networks and the Impa...

引用

Optical Fiber Communications Conference and Exhibition (OFC)

作者： Pedro, Joao Coriant Portugal P-2720093 Amadora Portugal Inst Super Tecn Inst Telecomunicacoes P-1049001 Lisbon Portugal

Pre-deploying regenerators is vital for fast service provisioning in long-haul networks. This paper compares regenerator placement strategies exploiting different degrees of network and traffic information and assesse... 详细信息

ISBN: (纸本)9781557529930

关键词： Dense wavelength division multiplexing Neodymium routing algorithms Surface plasmon resonance Networks (060.4250) Switching, circuit (060.6718)

来源：评论

学校读者我要写书评

暂无评论

OpenFlow-based Load Balancing for Wireless Mesh Infrastructure

OpenFlow-based Load Balancing for Wireless Mesh Infrastructu...

引用

IEEE 11th Consumer Communications and Networking Conference (CCNC)

作者： Yang, Fan Gondi, Vamsi Hallstrom, Jason O. Wang, Kuang-Ching Eidson, Gene Clemson Univ Dept Elect & Comp Engn Clemson SC 29634 USA Clemson Univ Sch Comp Clemson SC 29634 USA Clemson Univ Inst Computat Ecol Clemson SC 29634 USA Clemson Univ Clemson SC 29634 USA

ISBN: (纸本)9781479923557

Wireless mesh-based backhaul infrastructure is intended to provide reliable data transmission, with high throughput across large-scale networks. Load balancing is essential over a long period of operation to provide high throughput and uninterrupted service to end users. Load across mesh nodes is highly variable as the traffic depends on the number of clients connected to the nodes, as well as the services they use. Existing load balancing solutions are based on theoretical analysis and simulations. Most require distributed routing algorithms executed over compute-intensive routing nodes. It is also challenging to provide practical support for real-time traffic redirection using traditional mesh nodes. In this paper, we develop a prototype mesh infrastructure where flows from a source node can take multiple paths through the network. OpenFlow, an emerging technology that makes network switches programmable via a standard interface, allows flexible control of data flow paths. The Better Approach To Mobile Ad-hoc Networking (B.A.T.M.A.N) mesh protocol is used to provide mesh topology and link quality information. The OpenFlow controller decides the best data path based on this information to ensure high throughput data transfer. To demonstrate the usefulness of our approach, we have implemented three test cases to enable data path setup and redirection with low complexity and overhead. Our test case measurements confirm that OpenFlow is a promising complementary technology to traditional mesh routing protocols for wireless networks.

关键词： Load balancing channels (data transmission) Wireless networks CASING INSPECTION Medical Subject Headings data transmission redirection Ganglia standard interface INFRASTRUCTURE long period operation routing algorithms Mesh Mesh Wireless mesh networks

来源：评论

学校读者我要写书评

暂无评论

Experimental Demonstration and Benefits of Self-Healing Hard-Wired and Synthetic ROADMs

Experimental Demonstration and Benefits of Self-Healing Hard...

引用

Optical Fiber Communications Conference and Exhibition (OFC)

作者： Dzanko, Matija Furdek, Marija Gonzalez, Norberto Amaya Zervas, Georgios Mikac, Branko Simeonidou, Dimitra Univ Zagreb Fac Elect Engn & Comp Dept Telecommun Zagreb 41000 Croatia Univ Bristol Dept Elect & Elect Engn Bristol BS8 1TH Avon England Royal Inst Technol KTH ICT Sch Kista Sweden

Novel hard-wired and synthetic ROADM architectures with self-healing capabilities are experimentally demonstrated. Simulation results show significant improvements of availability and recovery time due to node-level r... 详细信息

ISBN: (纸本)9781557529930

关键词： Deformable mirrors Optical components Optical systems Reconfigurable optical add drop multiplexers routing algorithms Wavelength selective switches Networks, combinatorial network design (060.4254) Networks, network survivability (060.4257) Networks, protection and restoration (060.4261)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：