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

A Near-Optimal Distributed QoS Constrained routing algorithm for Multichannel Wireless Sensor Networks

SENSORS 2013年第12期13卷 16424-16450页

作者： Lin, Frank Yeong-Sung Hsiao, Chiu-Han Yen, Hong-Hsu Hsieh, Yu-Jen Natl Taiwan Univ Dept Informat Management Taipei 106 Taiwan Shih Hsin Univ Dept Informat Management Taipei 116 Taiwan

One of the important applications in Wireless Sensor Networks (WSNs) is video surveillance that includes the tasks of video data processing and transmission. Processing and transmission of image and video data in WSNs has attracted a lot of attention in recent years. This is known as Wireless Visual Sensor Networks (WVSNs). WVSNs are distributed intelligent systems for collecting image or video data with unique performance, complexity, and quality of service challenges. WVSNs consist of a large number of battery-powered and resource constrained camera nodes. End-to-end delay is a very important Quality of Service (QoS) metric for video surveillance application in WVSNs. How to meet the stringent delay QoS in resource constrained WVSNs is a challenging issue that requires novel distributed and collaborative routing strategies. This paper proposes a Near-Optimal Distributed QoS Constrained (NODQC) routing algorithm to achieve an end-to-end route with lower delay and higher throughput. A Lagrangian Relaxation (LR)-based routing metric that considers the “system perspective” and “user perspective” is proposed to determine the near-optimal routing paths that satisfy end-to-end delay constraints with high system throughput. The empirical results show that the NODQC routing algorithm outperforms others in terms of higher system throughput with lower average end-to-end delay and delay jitter. In this paper, for the first time, the algorithm shows how to meet the delay QoS and at the same time how to achieve higher system throughput in stringently resource constrained WVSNs.

关键词： Wireless Sensor Networks Wireless Visual Sensor Networks system perspective user perspective QoS Near-Optimal Distributed QoS Constrained (NODQC) routing algorithm Lagrangian Relaxation

来源：评论

学校读者我要写书评

暂无评论

A WSN routing and Sleeping algorithm in Agriculture Intermittent Data Collection

A WSN Routing and Sleeping Algorithm in Agriculture Intermit...

引用

International Conference on Advances in Materials Science and Information Technologies in Industry (AMSITI)

作者： Huang, Feng Zhao, Chunjiang Li, Feifei Wu, Huarui Beijing Univ Technol Coll Comp Sci Beijing 100124 Peoples R China

ISBN: (纸本)9783038350125

Farmland environment is away from power facilities and its information collection lasts long time. These characteristics make the wireless sensor networks in agriculture face the problem of energy constraint. Efficient routing and sleeping algorithm can save energy. Considering the node residual energy and the collection cycle of the destination nodes, this paper improved a WSN routing and sleeping algorithm based on the AODV routing algorithm. This algorithm establishes routing path based on the node residual energy and the node collection cycle. Node sleeping cycle determined after the routing path has been established. By routing path selection and appropriate sleeping cycle this algorithm can reduce overall energy consumption and avoid excessive energy consumption of some individual nodes.

关键词： wireless sensor networks routing algorithm node sleeping intermittent data collection AODV

来源：评论

学校读者我要写书评

暂无评论

Traffic Dynamics Evaluation for the Future NFV Deployment

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2020年第10期67卷 2214-2218页

作者： Jiang, Zhongyuan Chen, Xi Ma, Jianfeng Zhang, Yasheng Gu, Jujuan Xidian Univ Sch Cyber Engn Xian 710071 Peoples R China Sci & Technol Commun Networks Lab Shijiazhuang 050081 Hebei Peoples R China 54th Res Inst CETC Shijiazhuang 050081 Hebei Peoples R China

To adapt the rapid upgradation of the communication technology (e.g., from 5G to 6G) and reduce the redeployment cost, the Network Functions Virtualization (NFV) is regarded as a key technology to reduce the capital expenditures (CAPEX) and operating expenses (OPEX) by decoupling traditional network functions from proprietary hardware appliances to software appliances. However, with increasing data transmission requirements, the limited traffic capacity is still the bottleneck of NFV network and strongly related to three aspects: 1) NFV network structure construction;2) resource allocation;3) routing design for packet navigation. In this brief, we first present a preferential link attachment mechanism to model the growth evolution of the NFV network. Secondly, we propose to efficiently allocate virtual resource for every Virtualized Network Fucntion (VNF). Thirdly, we propose a new routing mechanism to fully make use of the network resource and enhance the traffic capacity. Finally, extensive experiments demonstrate that our integrated solution systematically formulates the traffic dynamics for the future NFV deployment.

关键词： routing Hardware Virtualization Programmable logic arrays Resource management Physical layer Communication networks Network functions virtualization (NFV) traffic capacity resource distribution routing algorithm

来源：评论

学校读者我要写书评

暂无评论

An Elite Hybrid Metaheuristic Optimization algorithm for Maximizing Wireless Sensor Networks Lifetime With a Sink Node

引用

IEEE SENSORS JOURNAL 2020年第10期20卷 5634-5649页

作者： Wang, Hui Li, Kangshun Pedrycz, Witold South China Agr Univ Coll Math & Informat Guangzhou 510642 Peoples R China Univ Alberta Dept Elect Comp Engn Edmonton AB T6G 2B4 Canada Guangdong Key Lab Big Data Anal & Proc Guangzhou 510006 Peoples R China Univ Alberta Dept Elect & Comp Engn Edmonton AB T6R 2V4 Canada Polish Acad Sci Syst Res Inst Warsaw Poland King Abdulaziz Univ Fac Engn Jeddah 21589 Saudi Arabia

Energy saving becomes a central issue in the design of wireless sensor networks routing algorithms. The objective of this study is to maximize the survival time of wireless sensor networks routing with a sink node by developing an efficient routing algorithm based on the elite hybrid metaheuristic optimization algorithm. The proposed algorithm comes as an original method that innovatively brings together the global search abilities of the particle swarm optimization algorithm, difference operator of differential algorithm and pheromones of ant-colony optimization algorithm in order to avoid local search and retain diversity of the population. As a result, the method quickly finds an optimal solution. A novel routing algorithm based on the proposed elite hybrid metaheuristic optimization algorithm is designed. Comprehensive simulation studies show that the proposed algorithm can increase maximum lifetime of wireless sensor networks by 38% in comparison with the results being produced with the state-of-the art algorithm routing algorithms based on other population-based optimization algorithms.

关键词： Elite hybrid metaheuristic optimization algorithm routing algorithm energy saving sink node global search difference operator pheromones

来源：评论

学校读者我要写书评

暂无评论

Agent-Based Distributed routing algorithm with Traffic Prediction for LEO Satellite Network

引用

INTERNATIONAL JOURNAL OF FUTURE GENERATION COMMUNICATION AND NETWORKING 2013年第3期6卷 67-84页

作者： Na, Zhenyu Gao, Zihe Cui, Yang Chen, Liming Guo, Qing Dalian Maritime Univ Sch Informat Sci & Technol Dalian Peoples R China China Acad Space Technol Inst Telecommun Satellite Beijing Peoples R China Harbin Inst Technol Inst Sci & Technol Harbin Heilongjiang Peoples R China Harbin Inst Technol Commun Res Ctr Harbin Heilongjiang Peoples R China

Satellite network, especially low earth orbit (LEO) satellite network, which has advantages of global coverage and short round-trip time (RTT), has played an increasingly important role in the future generation of global communication network. Due to fast velocity, frequent handover and time-varying topology, designing effective routing algorithm for LEO satellite network has always been challenging. An Agent-based distributed routing algorithm with Traffic Prediction (TPARA) is proposed in this paper. TPARA algorithm, which fully takes traffic density of the surface of the Earth into account, consists of two parts: traffic prediction and routing decision. In the former, not only the heterogeneity of traffic on the ground is considered, but upcoming traffic from terrestrial terminals is predicted using an improved Kalman filtering as well. In the latter, mobile agents (MAs) are used to explore satellite network and collect routing information. The ultimate routing decision is determined by both current status and future status of satellite network. Simulation results show that, compared with the classical algorithm of ACO, TPARA not only has shorter delay, but alleviates congestion as well.

关键词： LEO satellite network routing algorithm traffic prediction mobile agent

来源：评论

学校读者我要写书评

暂无评论

Differential back-pressure routing for single-queue time-varying wireless networks

引用

IET COMMUNICATIONS 2019年第18期13卷 3117-3123页

作者： Wang, Nan Zhao, Hai Hai, Long Northeastern Univ Comp Sci & Engn Shenyang 110819 Liaoning Peoples R China Shenyang Univ Sch Informat Engn Shenyang 110044 Liaoning Peoples R China Shenzhen Polytech Sch Comp Engn Shenzhen 518055 Guangdong Peoples R China

Dynamic resource control and routing are important for realising the intelligent control of data transmission in wireless multi-hop networks. It is well known that back-pressure routing based on a max-weight policy maximises network throughput and optimises resource allocation in multi-hop wireless networks with time-varying channels. Due to the slow routing convergence and complex control of data queues, however, back-pressure routing also results in large end-to-end delays and a waste of network resources, particularly when the network loads are light or moderate. In this study, a differential back-pressure routing scheme with single-queue management is proposed to improve the packet delay performance and simplify the management of data queues. Unlike in traditional back-pressure routing, the authors use the differences in the rates of change in data queue length to calculate data pressure. Compared with the method of data backlog calculation based on queue length differences, this method achieves faster routing convergence. They also consider the ceiling problem for a single queue and enhance the effect of the queue cap on the routing metric by means of dynamic weighting. Simulation results show that the proposed routing algorithm achieves a 20% decrease in end-to-end delay in grid and random networks.

关键词： optimisation telecommunication traffic radio networks delays routing protocols queueing theory resource allocation time-varying channels wireless channels telecommunication network routing single-queue time-varying wireless networks intelligent control data transmission wireless multihop networks network throughput optimises resource allocation multihop wireless networks time-varying channels slow routing convergence complex control data queues end-to-end delay network resources network loads differential back-pressure single-queue management traditional back-pressure routing data pressure data backlog calculation queue length differences single queue queue cap routing metric routing algorithm random networks

来源：评论

学校读者我要写书评

暂无评论

Energy and cluster based efficient routing for broadcasting in mobile ad hoc networks

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2019年第1-Sup期22卷 661-671页

作者： Venu, Sivakumar Rahman, A. M. J. Md. Zubair Anna Univ Chennai 600025 Tamil Nadu India Al Ameen Engn Coll Erode India

Mobile ad hoc network is momentarily forming the network without any base or centralized nodes. In general, AODV will find the best route from the basis to endpoint for transfer the data or message. In our proposed approach is Restricted Predictive Flooding based Ad hoc On-Demand Vector (RPFAODV) protocol. RPFAODV concentrate to identify the destination node, predict the route, based on the energy level at each node, end node address through route request packet and route response packet messages. After receiving route response packet from an end node to a source node, now it initialized as a cluster for transmission of data packet towards a destination. In this proposed protocol is restricted unwanted node traversal by predicting the route from the network. It can broadcast the data or message from destination to nodes cover in their surroundings of other network broadcast area. It produces better performance compare with another prevailing routing protocol. In this paper RPFAODV protocol as well as reactive protocols AODV were studied and their individualities with admiration to different movement are evaluated based on message delivery rate, end-to-end delay, number of packets dropped and throughput using network simulator (NS2).

关键词： RPFAODV AODV Broadcasting MANETs routing algorithm Mobile ad hoc routing protocol

来源：评论

学校读者我要写书评

暂无评论

S2DIO: an extended scalable 2D mesh network-on-chip routing reconfiguration for efficient bypass of link failures

引用

JOURNAL OF SUPERCOMPUTING 2019年第10期75卷 6855-6881页

作者： Jain, Anugrah Laxmi, Vijay Tripathi, Meenakshi Gaur, Manoj Singh Bishnoi, Rimpy MNIT Jaipur Dept CSE Jaipur Rajasthan India Indian Inst Technol Jammu Jammu Jammu & Kashmir India

The paradigm of computing has shifted from computation-centric to communication-centric designs. Network-on-chip has emerged as an alternative interconnect mechanism for future multi-core designs. Transistor integration is approaching its limit, and this increases the susceptibility of the interconnects toward failures. Research efforts are directed toward improving the fault tolerance of these interconnects. Fault-tolerant routing such as segment-based and up*/down* are static by nature and require reconfiguration to circumvent failures. Failures may disrupt the connectivity of the network, and new routing instance needs to be configured in case old routing instance is unable to offer full connectivity. In this paper, we identify nodes affected by the failures and propose an extended scalable routing reconfiguration, called S2DIO. It performs reconfiguration of affected nodes by taking N-2 cycles for N x N mesh network, whereas state-of-the-art (ARIADNE) consumes N-4 cycles. Instead of routing tables, we employ logic-based routing and achieve significant improvements, i.e., 30.7% in terms of area and 29% in terms of power overhead for a 16 x 16 mesh router. A novel algorithm for computation of new logic-based routing bits is also proposed in this paper. Our reconfiguration (S2DIO) improves average flit latency up to 32% and throughput up to 19% for single-link failure in 8 x 8 2D mesh network-on-chip.

关键词： Network-on-chip routing algorithm Reconfiguration Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A Wireless Sensor Networks routing algorithm Optimized Based on Potential Field

A Wireless Sensor Networks Routing Algorithm Optimized Based...

引用

2013 IEEE 4th International Conference on Software Engineering and Service Science

作者： Sun Yi Xu Lei Huang Ke-xin School of Electrical and Electronic Engineering North China Electric Power University

ISBN: (纸本)9781467349970

Motivated by characteristics of the data transmission in the Wireless Sensor Networks(WSN),this paper proposed a WSN routing algorithm optimized based on the concept of potential field in the *** routing selecting the proposed algorithm synthetically considers the factors of hops,reserving energy of node and its *** various parameter and factors,the algorithm constructs different potential fields,which move the data packets along the direction of the largest ***,this algorithm lets the energy consumption tending to keep at same level,avoids selecting the node with larger residual energy instead of lower power of its neighbours,and prolongs the lifetime of *** new algorithm has lower complexity to carry out at nodes,and experimental results illustrate that it has a better performance on balancing energy consumption and prolonging lifetime of WSN.

关键词： Wireless Sensor Networks(WSN) routing algorithm potential field

来源：评论

学校读者我要写书评

暂无评论

An Effective routing algorithm to Avoid Unnecessary Link Abandon in 2D Mesh NoCs

An Effective Routing Algorithm to Avoid Unnecessary Link Aba...

引用

16th Euromicro Conference on Digital System Design (DSD)

作者： Chen, Changlin Cotofana, Sorin D. Delft Univ Technol Delft Netherlands

ISBN: (纸本)9780769550749

In NoCs where each interconnection between neighboring routers is composed of a pair of unidirectional links, a broken link usually leads to the abandon of the entire interconnection, even if the other one is still functional. In this paper, we propose a fault tolerant routing algorithm (RA) which can efficiently utilize these fault free links when their pair broken links have available misrouting-contour sides. Constraints on the usage of Virtual Channels are adaptively applied according to the fault distribution, to avoid deadlock and unnecessary resource reservation. When compared with solid fault region tolerant RAs, which always abandon the entire interconnection, the proposed algorithm has twice higher saturation point under synthetic uniform traffics, and can on average diminish the execution time overhead for the evaluated applications, sample and satell, by 62.6% and 76.6%, respectively. Our experiments indicate that the embedding of the proposed algorithm into a baseline router increases the area cost and power consumption by 7.43% and 4.43%, respectively, which is not that significant given that the platform area is usually dominated by the computing cores area.

关键词： Networks-on-Chip Fault tolerant routing algorithm Unidirectional links

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：