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

Maximise lifetime of wireless sensor networks via a distributed cooperative routing algorithm

TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES 2012年第5期23卷 414-428页

作者： Zhai, Chao Liu, Ju Zheng, Lina Xu, Hongji Chen, He Shandong Univ Sch Informat Sci & Engn Jinan 250100 Peoples R China Southeast Univ State Key Lab Mobile Commun Nanjing Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xian Peoples R China

Combining cooperative diversity, truncated automatic repeat request scheme and distributed energy-aware routing strategy, a novel cooperative routing algorithm adopting decode-and-forward fashion is proposed to maximise the lifetime of wireless sensor networks from the cross-layer design perspective. In this algorithm, the transmission power is optimally allocated while satisfying the per-link symbol error rate or the end-to-end throughput requirement. The average total consumed power weighted by the normalised remaining energy of every participating node is used as the link cost to avoid the overuse of certain nodes with extremely little energy. With the use of the traditional distributed shortest path algorithm, the best route that includes a cascade of single-relay building blocks is constructed with polynomial complexity. In contrast to the non-cooperative routing schemes, this cooperative routing algorithm can significantly prolong the network lifetime and improve the energy efficiency by reducing the total network residual energy. Copyright (C) 2012 John Wiley & Sons, Ltd.

关键词： cooperative diversity truncated ARQ distributed routing

来源：评论

学校读者我要写书评

暂无评论

A distributed multicast routing protocol for real-time multicast applications

引用

COMPUTER NETWORKS 1999年第1-2期31卷 101-110页

作者： Jia, XH Zhang, YC Pissinou, N Makki, K City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Univ So Queensland Dept Maths & Comp Toowoomba Qld 4350 Australia Univ SW Louisiana Ctr Adv Comp Studies Lafayette LA 70508 USA Univ SW Louisiana Ctr Telecommun Studies Lafayette LA 70508 USA

Multicast routing is establishing a tree which is rooted from the source node and contains all the multicast destinations. A delay bounded routing tree is a tree in which the accumulated delay from the source node to any destination along the tree does not exceed a pre-specified bound. This paper presents a distributed routing protocol which constructs delay bounded routing trees for real-time multicast connections. A constructed routing tree has a near optimal network cost under the delay bound constraint. The proposed algorithm is fully distributed, efficient in terms of the number of messages required, and flexible in multicast membership changes. A large number of simulations have been done to show the network cost of the routing trees generated by our method is better than the other major existing algorithms. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： multicast routing delay bounded routing distributed routing real-time communication

来源：评论

学校读者我要写书评

暂无评论

distributed Tree routing Scheme for Large-Scale Wireless Sensor Networks

Distributed Tree Routing Scheme for Large-Scale Wireless Sen...

引用

International Applied Science on Precision Engineering Conference

作者： Lin, Yih-Chuan Zhong, Jia-Hong Natl Formosa Univ Dept Comp Sci & Informat Engn Yunlin 63201 Taiwan

ISBN: (纸本)9783037859476

This paper addresses the problem of how to make efficient energy consumption on routing communications among the set of wireless sensor nodes deployed randomly in a large-scale manner. Tree-based routing topology is considered in the study with regarding to its simplicity of routing process. To minimize the energy dissipation of tree-routing, centralized coordination schemes are usually used to construct an optimal tree routing topology. In this paper, a distributed-based tree routing protocol is proposed not only to improve the scalability of the centralized tree routing schemes but also handle the balance consumption among the sensor nodes. With computer simulation, the effectiveness of the proposed routing scheme is verified and shown to be useful in large-scale wireless sensor networks.

关键词： Wireless sensor network Tree-based routing Energy-efficient routing distributed routing

来源：评论

学校读者我要写书评

暂无评论

An Active distributed QoS routing for LEO Satellite Communication Network 10

An Active Distributed QoS Routing for LEO Satellite Communic...

引用

10th International Conference on Communications and Networking in China (CHINACOM)

作者： Na, Zhen-Yu Deng, Zhi-An Chen, Nan Gaoz, Zi-He Guo, Qing Dalian Maritime Univ Sch Informat Sci & Technol Dalian 116026 Peoples R China China Acad Space Technol Inst Telecommun Satellite Beijing 100094 Peoples R China Harbin Inst Technol Commun Res Ctr Harbin 150086 Peoples R China

ISBN: (纸本)9781479987955

Low earth orbit (LEO) satellite network has many advantages of global coverage and short delay, playing an important role in future global communications. To design effective routing strategy has always been a challenging task to LEO satellite network because of frequent handover, fast speed, time-varying topology and surging demands on multimedia traffic around the globe. An active distributed QoS routing strategy was proposed in this paper. First, three types of mobile agents (MAs) were used in the strategy to accomplish routing process. Second, traffic prediction was adopted to avoid congestion and make routing decision. Third, link duration was introduced into a cost function to find optimum path which simultaneously satisfy multiple QoS constraints. Simulation results show that the proposed strategy has better CBP and CDP.

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

来源：评论

学校读者我要写书评

暂无评论

FBICM: Efficient Congestion Management for High-Performance Networks Using distributed Deterministic routing

引用

15th International Conference on High Performance Computing (HiPC 2008)

作者： Escudero-Sahuquillo, Jesus Garcia, Pedro Quiles, Francisco Flich, Jose Duato, Jose Univ Castilla La Mancha Dept Comp Syst E-13071 Ciudad Real Spain Univ Politecn Valencia Dept Comp Engn Valencia Spain

ISBN: (纸本)9783540898931

As the number of components in cluster-based systems increases, cost and power consumption also increase. One way to reduce both problems is using smaller networks with adequate congestion management mechanisms. Recent successful proposals (RECN) eliminate the negative effects of congestion, the Head-of-Line (HOL) blcoking, leaving congestion harmless. RECN relies on source-based networks architectures, where the entire route is placed at packet headers before injection. Unfortunately, distributed table-based routing is also common in cluster-based networks, being InfiniBand the most prominent example. We propose a novel congestion management technique for distributed table-based routing. The mechanism relies on additional congestion information located at routing tables. With this information HOL blocking is minimized by smartly using switch queues. Detailed memory organizatinon and the way congestion information is updated/propagated is described. Preliminary results indicate that with modest resource requirements maximum network performance is kept regardless of congestion.

关键词： High-Performance Interconnects Congestion Control distributed routing

来源：评论

学校读者我要写书评

暂无评论

distributed Detour routing Scheme for Link Failure with Minimized Overhead in LEO Satellite Networks

引用

SENSORS 2023年第23期23卷 9590-9590页

作者： Im, Jeongju Youn, Jiseung Kim, Soohyeong Park, Joohan Lee, Sejong Kwon, Yongseok Cho, Sunghyun Hanyang Univ Dept Appl Artificial Intelligence Bioartificial Intelligence Ansan 15588 South Korea Hanyang Univ Dept Comp Sci & Engn Bioartificial Intelligence Ansan 15588 South Korea Hanyang Univ Dept Comp Sci & Engn Ansan 15588 South Korea

The mobility of low Earth orbit (LEO) satellites causes the LEO satellite network to experience topology changes. Topology change includes periodic topology change that occurs naturally and unpredictable topology change that occurs due to instability of the inter-satellite link between satellites. Periodic and unpredictable topology change causes frequent topology change, requiring massive communications throughout the network due to frequent route convergence. LEO satellites have limited onboard power because they operate on batteries. The waste of limited satellite onboard resources shortens the lifespan of the satellite, and achieving stable end-to-end transmission is challenging for the network. In this regard, minimizing communication overhead is a fundamental consideration when designing a routing scheme. In this paper, we propose a distributed detour routing scheme with minimal communication overhead. This routing scheme consists of a rapid detour, selective flooding, and link recovery procedures. When a link failure occurs in the network, a rapid detour can detect link failure using only a precalculated routing table. Subsequently, selective flooding searches for the optimal detour point within the minimum hop region and flood to detour point. After link recovery, a procedure is defined to traverse the pre-detour path and switch it back to the original path. The simulation results show that the proposed routing scheme achieves a reduction of communication overhead by 97.6% compared with the n-hop flooding approach.

关键词： LEO satellite distributed routing flooding communication overhead link failure

来源：评论

学校读者我要写书评

暂无评论

distributed Adaptive routing Algorithms for Communication Networks

引用

IFAC Proceedings Volumes 1988年第19期21卷 77-83页

作者： J. Bernussou G. Authié Laboratoire d'Automatique et d'Analyse des Systèms du CNRS (LAAS) Toulouse. France LAAS et Institute National des sciences appliquées de Toulouse France

The problem of adaptive routing in communication networks, i.e routing policy able to react to traffic variations, can be under quasi-static assumptions, formulated as non linear multiflow optimisation *** routing is then equivalent in finding distributed algorithm solving the optimisation problem. Distribution means that decision (here computation) tasks are defined at each commutation node of the network, their coordination to achieve an overall optimum for the whole network being done trough information exchanges between the nodes. Different distributed algorithms based on primal or dual methods are presented and discussed with respect to their practical implementation

关键词： distributed routing distributed multiflow optimisation communication data networks

来源：评论

学校读者我要写书评

暂无评论

FBICM: efficient congestion management for high-performance networks using distributed deterministic routing 08

引用

Proceedings of the 15th international conference on High performance computing

作者： Jesús Escudero-Sahuquillo Pedro García Francisco Quiles Jose Flich Jose Duato Dept. of Computing Systems University of Castilla-La Mancha Spain Dept. of Computer Engineering Technical University of Valencia Spain

ISBN: (纸本)9783540898931

As the number of components in cluster-based systems increases, costand power consumption also increase. One way to reduce both problems is usingsmaller networks with adequate congestion management mechanisms. Recentsuccessful proposals (RECN) eliminate the negative effects of congestion,the Head-of-Line (HOL) blocking, leaving congestion harmless. RECN relies onsource-based networks architectures, where the entire route is placed at packetheaders before injection. Unfortunately, distributed table-based routing is alsocommon in cluster-based networks, being InfiniBand the most prominent *** propose a novel congestion management technique for distributed tablebasedrouting. The mechanism relies on additional congestion information locatedat routing tables. With this information HOL blocking is minimized bysmartly using switch queues. Detailed memory organization and the way congestioninformation is updated/propagated is described. Preliminary results indicatethat with modest resource requirements maximum network performance is keptregardless of congestion.

关键词： congestion control distributed routing high-performance interconnects

来源：评论

学校读者我要写书评

暂无评论

Fully distributed Algorithms for Minimum Delay routing Under Heavy Traffic

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2014年第5期13卷 1048-1060页

作者： Jeon, Sang-Woon Jung, Kyomin Chang, Hyunseok Andong Natl Univ Dept Informat & Commun Engn Andong 760749 South Korea Seoul Natl Univ Dept Elect & Comp Engn Seoul 151744 South Korea Korea Adv Inst Sci & Technol Dept Elect Engn Taejon 606081 South Korea

We study a minimum delay routing problem in the context of distributed networks with and without partial load information. Even though a general minimum delay routing problem is NP hard, assuming uniformly distributed K source-destination (SD) pairs at random, we provide a lower bound on the average delay and demonstrate by simulation that it is tight for a certain classes of regularly deployed networks. We also show that some routing in a distributed manner is enough to achieve asymptotically optimal load balancing with high probability as K tends to infinity. In order to set such routing, however, each SD pair should know global load information, which is unrealistic for most networks. We propose novel predetermined path routing algorithms in which each SD pair chooses its routing path only among a set of predetermined paths. We then propose an efficient way of distributed construction for predetermined paths that are able to distribute traffic over a network. Our predetermined path routing algorithms work in a fully distributed manner with very limited load information or without any load information. In various network models, we demonstrate by simulation that the delay of the predetermined path routing algorithms quickly converges to that of the distributed routing with global load information.

关键词： Delay minimization distributed routing load balancing low complexity routing algorithm multi-source network partial network information

来源：评论

学校读者我要写书评

暂无评论

distributed Energy-Efficient Cooperative routing in Wireless Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2008年第10期7卷 3930-3941页

作者： Ibrahim, Ahmed S. Han, Zhu Liu, K. J. Ray Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA Univ Houston Dept Elect & Comp Engn Houston TX 77004 USA

Recently, the merits of cooperative communication in the physical layer have been explored. However, the impact of cooperative communication on the design of the higher layers has not been well-understood yet. Cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing power-efficient routing algorithms. Most of the existing cooperation-based routing algorithms are implemented by finding a shortest-path route first and then improving the route using cooperative communication. As such, these routing Algorithms do not fully exploit the merits of cooperative communications, since the optimal cooperative route might not be similar to the shortest-path route. In this paper, we propose a cooperation-based routing algorithm, namely, the Minimum Power Cooperative routing (MPCR) algorithm, which makes full use of the cooperative communications while constructing the minimum-power route. The MPCR algorithm constructs the minimum-power route, which guarantees certain throughput, as a cascade of the minimum-power single-relay building blocks from the source to the destination. Thus, any distributed shortest path algorithm can be utilized to find the optimal cooperative route with polynomial complexity. Using analysis, we show that the MPCR algorithm can achieve power saving of 65.61% in regular linear networks and 29.8% in regular grid networks compared to the existing cooperation-based routing algorithms, where the cooperative routes are constructed based on the shortest-path routes. From simulation results, MPCR algorithm can have 37.64% power saving in random networks compared to those cooperation-based routing algorithms.

关键词： Cooperative diversity distributed routing power saving QoS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：