共查询到18条相似文献,搜索用时 78 毫秒
1.
该文介绍一种分层多跳无线网与其他骨干网络互连情况下的网络层移动性管理方案。它使用了包含逻辑家乡代理的宏移动性管理和将位置管理与路由和寻呼机制结合起来的微移动性管理的思想,以提高网络在战场等特殊情况下使用的可靠性和抗毁性,减小位置管理的开销,节省无线信道的带宽。 相似文献
2.
3.
针对现有云计算系统中负载均衡方法的不足,借鉴系统逻辑分层和多代理的思想,提出一种基于分层多代理的云计算负载均衡方法.通过对云计算平台逻辑分层,在任务代理层设置任务监控代理和任务子代理,根据用户任务的差异性,采用基于任务优先级和QoS目标约束的调度策略协同完成任务调度;在资源代理层设置资源监控代理和资源子代理,考虑物理节点的异构性,采用基于启发式贪婪的资源分配策略协同完成虚拟机到物理节点的映射.通过评估对比仿真实验,结果表明该方法在任务调度效率、任务完成时间、截止时间违背率和负载均衡度方面表现更优,多代理有效地分担了中心管理节点的管理负载,使云计算平台的任务处理能力、资源利用率及鲁棒性均得到了进一步的提升. 相似文献
4.
LTE正成为通信、信息、医疗以及汽车等众多领域革新的源动力.文章基于对系统整体性能的优化,结合负载均衡和自适应门限,提出了ATBLB算法,旨在动态调节系统自优化,从而更大程度地改善系统的整体性能.结果表明:与WPHPO算法和WPLBHO算法相比,ATBLB算法在保证切换失败率基本不变的情况下,使系统稳定后的掉话率分别降低了35%和15%;乒乓切换率分别降低了8%和3%;从而使整体切换性能HP提高了40%和15%.因此,ATBLB算法更能改善系统的整体性能,从而有利于LTE在其他领域的应用推广. 相似文献
5.
6.
7.
8.
多跳无线网路由协议研究进展 总被引:13,自引:0,他引:13
移动计算和无线通信的飞速发展为无线网络的应用开辟了美好前景.作为一种没有基础设施的无线网络,多跳无线网在战场、紧急救援等场合具有得天独厚的优势。多跳无线网路由协议的主要作用是监控网络拓扑变化、交换路由信息、产生和维护路由,它是目前的研究热点之一。本介绍了该领域的研究进展,首先叙述多跳无线网的8个特点及其对路由协议的7个要求.然后描述21种路由协议的原理并比较它们的特性,最后阐述了10个研究方向。 相似文献
9.
空分TDMA(STDMA)是基于TDMA的信道接入协议,该技术被应用于实时性要求较高的多跳(multi-hop)无线网络中,并可使多个在地理位置相互独立的移动终端使用相同的时隙来增加网络容量,不同移动终端之间的数据传输通过对终端调度安排来实现。调度算法一般分为基于节点或基于链路的分配方式。对这两种方式对比发现,在一定条件下两者都有不理想的特性。因此,结合两种方式优点提出了一种新颖的分配策略。仿真结果表明:该分配策略在高业务负载情况下能满足链路分配的高吞吐量,也能达到低业务负载下节点分配的低延迟。 相似文献
10.
对欧洲电信标准化协会(ETSI)提出的针对移动边缘主机(MEH)服务器的切换机制进行了补充和完善,提出了基于负载均衡的MEH静态切换机制。该机制通过将用户设备对应应用实例迁移到与其所属本地高负载服务器相邻的某个低负载服务器,实现了缓解原控制服务器处瓶颈效应、均衡网络节点间负载、优化信令平均等待时延的目的。分析和仿真结果表明,提出的静态切换机制能够在均衡网络负载和提升用户满意度方面对ETSI规范提供有效的补充和完善。 相似文献
11.
Maher A. Al-Sanabani Subramaniam K. Shamala Mohamed Othman Zuriati A. Zukarnain 《Wireless Personal Communications》2008,46(2):143-163
Next generation of wireless cellular networks aim at supporting a diverse range of multimedia services to Mobile Terminal
(MT) with guaranteed Quality of Service (QoS). The challenge is to maintain the playing continuity of multimedia streams during
handoff. In this paper, a bandwidth reservation scheme based on mobility prediction is proposed, to enable high accurate prediction
of next crossing cell (target cell) which a MT is going to, in order to avoid too early or over reservation resulting in a
waste of resources. The amount of bandwidth to be reserved is dynamically adjusted according to (a) the current position (location)
and the extrapolated direction of MT and; (b) the sector and zones of the cell. A Call Admission Control scheme (CAC) is also
considered to further guarantee the QoS of real time traffic. The performance of the system is evaluated through discrete
event simulation of the wireless cellular environment. Simulation results show that the proposed scheme as compared to several
existing schemes is able to reduce the Handoff Call Dropping Probability (HCDP) of real time traffic and the number of terminated
ongoing calls of non-real time traffic. In addition, it is efficient to reduce the number of cancelled reservation and subsequently
increase the system bandwidth utilization.
相似文献
Maher A. Al-SanabaniEmail: |
12.
Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks 总被引:2,自引:0,他引:2
The topology of a multi-hop wireless network can be controlled by varying the transmission power at each node. The life-time
of such networks depends on battery power at each node. This paper presents a distributed fault-tolerant topology control
algorithm for minimum energy consumption in multi-hop wireless networks. This algorithm is an extension of cone-based topology
control algorithm [19, 12]. The main advantage of this algorithm is that each node decides on its power based on local information
about the relative angle of its neighbors and as a result of these local decisions, a fault-tolerant connected network is
formed on the nodes. It is done by preserving the connectivity of a network upon failing of, at most, k nodes (k is a constant) and simultaneously minimize the transmission power at each node to some extent. In addition, simulations are
studied to support the effectiveness of this algorithm. Finally, it is shown how to extend this algorithm to 3-dimensions.
An extended abstract version of this paper appeared in the 11th IEEE International Conference on Computer Communications and
Networks(ICCCN02).
Mohsen Bahramgiri born in 1979, recieved the Bachelor's degree in Mathematical Sciences from Sharif University of Technology, Tehran, Iran
in 2000. He is now a PhD candidate in Mathematics Department at Massachusetts Institute of Technology. His research interests
include Symplectic Hodge Theory on Higher dimentional Geometry, Kahler Geometry, Mathematical Physics and Geometric Analysis
on one hand, and algorithmic Graph Theory and Combinatorics on the other hand.
MohammadTaghi Hajiaghayi received the Bachelor's degree in computer engineering from Sharif University of Technology in 2000. He received the Master's
degree in Computer Science from the University of Waterloo in 2001. Since 2001, he is a Ph.D. candidate in Computer Science
and Artificial Intelligence Laboratory at the Massachusetts Institute of Technology. During his Ph.D. studies, he also worked
at the IBM T.J. Watson Research Center (Department of Mathematical Sciences) and at the Microsoft Research (Theory group).
His research interests are algorithmic graph theory, combinatorial optimizations, distributed and mobile computing, computational
geometry and embeddings, game theory and combinatorial auctions, and random structures and algorithms.
Vahab S. Mirrokni received the Bachelor's degree in computer engineering from Sharif University of Technology, Tehran, Iran in 2001. Since
2001, he is a Ph.D. candidate in Computer Science and Artificial Intelligence Laboratory at the Massachusetts Institute of
Technology. During his Ph.D. studies, he also worked at the Bell-Laboratories (Networking Center and Department of Fundamental
Mathematics). His research interests include approximation algorithms, combinatorial optimization, computational game theory,
mobile computing, network mannagement, and algorithmic graph theory. 相似文献
13.
14.
15.
针对多跳无线网络中广播的转发冗余问题,该文提出了一种无需邻节点信息的空间覆盖广播(Space-Covered Broadcast,SCB)算法。SCB算法通过优化转发节点的空间分布达到利用最少数目的转发节点实现对网络空间的覆盖,从而在保证较高送达率的同时明显降低了广播的转发次数。由于无需邻节点信息和网络拓扑信息,SCB算法降低了带宽和存储计算等开销;并且,转发节点的选择由接收节点通过延时转发机制来完成,因而SCB算法能够自动适应信道状况,避免信道变化造成的传输错误。仿真结果表明:该算法在不同的节点密度和网络负载条件下能够明显提高广播的传输效率。 相似文献
16.
17.
IP微移动是一种能够在移动过程中有效改善移动节点通信质量的移动性管理方式,其核心部分为切换管理。该文首先分析了IP微移动的切换过程,并从网络层切换和链路层切换的关系及其交互性的新视角提出了切换管理的分类方法,详细分析和研究了目前典型的IP微移动协议的特点和存在的问题,并给出对这些协议的性能比较,最后讨论了IP微移动切换管理的未来研究方向。 相似文献
18.
未来的移动通信网应发展成以异步传模式(ATM) 为基础,支持多媒体业务的网络。为了在这种环境下实现无缝隙、快速切换,提出了在相邻基站间备用永久虚连接(PVC) 的一种快速切换管理方案,并计算了给定PVC 带宽时的切换阻塞概率。本方案与Acam pora 的虚连接树(VCT) 相比,有效地节省了有线链路资源,并在切换过程中保持本地小区序列的完整性 相似文献