共查询到19条相似文献,搜索用时 234 毫秒
1.
《计算机工程与应用》2016,(21):105-110
跟踪移动用户同时减少信令开销是通信系统位置管理研究中重要的方面。跟踪区列表是LTE系统中新引入的概念,它由多个跟踪区构成用来减少位置管理信令开销。受生活、工作、学习方面的影响,大部分用户具有固定的移动方式。提出了一种基于跟踪区关联性的跟踪区列表设计方法,它通过从用户历史移动路径中获取各跟踪区之间的关联性并建立各跟踪区的关联表,当跟踪区更新消息发生时,网络获取该消息中提供的上次访问跟踪区和用户当前所在跟踪区结合关联表进行跟踪区列表设计。该方法能够随不同上次访问跟踪区动态分配跟踪区列表,特别适用于大规模网络中。最后运用里斯本城镇网络数据,实验比较了基于跟踪区关联性的跟踪区列表设计方法和rule of thumb设计方法在一整天的信令开销。结果显示该方法在减少位置管理信令开销方面性能至少提升了11.5%。 相似文献
2.
3.
4.
5.
6.
7.
8.
9.
自治异构数据源聚集模型与算法研究 总被引:1,自引:0,他引:1
自治异构数据源信息共享的主要问题是如何在P2P环境下对自治数据节点的信息进行统一访问.采用分层结构组织数据源节点能够提高查询效率,减小计算开销,但需要节点根据彼此相似度实现局部的聚类.给出了数据源节点信息发布的形式化描述,提出了基于模式元素匹配的自治异构数据源多重聚集模型以及聚类组织构建过程,采用TA算法解决top-K聚类节点搜索问题,并在此基础上提出TAL算法.实验结果表明,TA和TAL算法能够高效地解决节点聚类排序的问题,特别是TAL算法在聚类节点范围较大时计算性能优于TA. 相似文献
10.
11.
In Long Term Evolution (LTE), the cells (the radio coverages of base stations) are grouped into the Tracking Areas (TAs), and the TAs are further grouped into the TA List (TAL). The location of the User Equipment (UE) is tracked at the TAL level. To better capture the “movement locality” of the UE, when the UE leaves the current TAL, the UE is assigned a new TAL whose central TA is the TA where the UE currently resides. This paper investigates the performance of the central-based LTE mobility management scheme, and compares this scheme with the previously proposed central-based mobility management schemes: the movement-based and the distance-based schemes. Our study indicates that under some traffic/mobility patterns, the LTE scheme yields the best performance. 相似文献
12.
Sara Modarres RazaviAuthor Vitae Di YuanAuthor Vitae Fredrik GunnarssonAuthor VitaeJohan MoeAuthor Vitae 《Computer Networks》2012,56(1):157-168
Tracking Area (TA) design is one of the key tasks in location management of Long Term Evolution (LTE) networks. TA enables to trace and page User Equipments (UEs). As UEs distribution and mobility patterns change over time, TA design may have to undergo revisions. For revising the TA design, the cells to be reconfigured typically have to be temporary torn down. Consequently, this will result in service interruption and “cost”. There is always a trade-off between the performance in terms of the overall signaling overhead of the network and the reconfiguration cost. In this paper, we model this trade-off as a bi-objective optimization problem to which the solutions are characterized by Pareto-optimality. Solving the problem delivers a host of potential trade-offs among which the selection can be based on the preferences of a decision maker. An integer programming model has been developed and applied to the problem. Solving the integer programming model for various cost budget levels leads to an exact scheme for Pareto-optimization. In order to deliver Pareto-optimal solutions for large networks in one single run, a Genetic Algorithm (GA) embedded with Local Search (LS) is applied. Unlike many commonly adopted approaches in multi-objective optimization, our algorithm does not consider any weighted combination of the objectives. Comprehensive numerical results are presented in this study, using large-scale realistic or real-life network scenarios. The experiments demonstrate the effectiveness of the proposed approach. 相似文献
13.
14.
车联网在生活中扮演着越来越重要的角色,它可以有效地防止交通拥堵从而减少交通事故。然而,在车联网中总是有非法车辆试图接入车联网并发布虚假消息。此外,现有方案多数存在计算效率低下的问题。针对上述存在的问题进行了研究,提出了一种车联网中基于雾计算和多TA的条件隐私保护认证方案。在保护车辆用户身份的条件下实现了车辆、雾节点、TA三者之间的身份认证,且在车辆追踪阶段可以还原车辆用户的真实身份,从而实现条件隐私保护。雾计算的使用降低了方案的计算和通信开销,同时多TA模型的使用也解决了单TA单点故障的问题。安全性证明和性能分析的结果表明该方案是安全且高效的。最后对当前方案进行了总结以及对未来研究作出了展望。 相似文献
15.
LinkLPA: A Link‐Based Label Propagation Algorithm for Overlapping Community Detection in Networks
下载免费PDF全文
![点击此处可从《Computational Intelligence》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Heli Sun Jiao Liu Jianbin Huang Guangtao Wang Xiaolin Jia Qinbao Song 《Computational Intelligence》2017,33(2):308-331
Community detection is an important methodology for understanding the intrinsic structure and function of complex networks. Because overlapping community is one of the characteristics of real‐world networks and should be considered for community detection, in this article, we propose an algorithm, called link‐based label propagation algorithm (LinkLPA), to detect overlapping communities. Because the link partition is conceptually natural for the problem of overlapping community detection, LinkLPA first transforms node partition problem into link partition problem and employs a new label propagation algorithm with preference on links instead of nodes to detect communities due to the simplicity and efficiency of label propagation algorithm. Then the proposed LinkLPA performs a postprocessing to refine the detected overlapping communities by avoiding over‐overlapping and incorrect partition of weak ties. Experimental results on a large number of real‐world and synthetic networks show that the proposed method achieves high accuracy on detecting overlapping communities in networks. 相似文献
16.
复杂网络大数据中重叠社区检测算法 总被引:3,自引:1,他引:2
大数据时代互联网用户数量呈爆炸性增长,社交网络、电商交易网络等复杂网络规模快速发展,准确有效地检测复杂网络大数据中重叠社区结构对用户兴趣点推荐和热点传播具有重要意义。提出一种新的面向复杂网络大数据的重叠社区检测算法DOC(Detecting Overlapping Communities over complex network big data),时间复杂度为O(nlog2(n)),算法基于模块度聚类和图计算思想应用新的节点和边的更新方法,利用平衡二叉树对模块度增量建立索引,基于模块度最优的思想设计一种新的重叠社区检测算法。相对于传统重叠节点检测算法,对每个节点分析的频率大大降低,可以在较低的算法运行时间下获得较高的识别准确率。复杂网络大数据集上的算法测试结果表明:DOC算法能够有效地检测出网络重叠社区,社区识别准确率较高,在大规模LFR基准数据集上其重叠社区检测标准化互信息指标NMI最高能达到0.97,重叠节点检测指标F-score的平均值在0.91以上,且复杂网络大数据下的运行时间明显优于传统算法。 相似文献
17.
Locating users in mobile environment is an essential problem in PCS that becomes more challenging as the network size increases and the user population grows. In third generation mobile systems, the signaling traffic and processing overhead of location updates is expected to grow tremendously leading to poor performance. Therefore location management schemes should aim at reducing the cost of updates. Yet, the lookup delay should be kept minimum. This paper aims at classifying the various approaches used for location management of mobile users by grouping them into two main categories. The first category comprises techniques that focused on reducing the cost of looking up a user and adjusted the update process accordingly. These are classified into replication, caching and selective paging techniques. The second category consists of techniques that focused on reducing the cost of updates and maneuvered the update policy to reduce the lookup cost by informing the system with the maximum possible information about user's mobility. This could be achieved by the use of statistic collection, estimation or prediction processes. We classify those schemes into three main classes: schemes based on forwarding pointers, learning-based schemes and prediction-based schemes. By investigating the technical significance of each class a new direction for future research is proposed which favors the second category of location techniques and emphasis the importance of adopting suitable learning and prediction techniques to optimize the overall location cost. 相似文献
18.
在基于位置的社交网络中用户链接与位置链接之间具有一定的内在关联,而且不同的用户在社交网络中的表现也存在差异,因此对于以上问题提出一种协作式个性化链接预测算法。针对用户的个性化特征,采用核密度估计方式对用户在时间和空间维度建模,基于兴趣组对用户进行重叠社团划分,并通过社团、好友以及签到关系进行个性化用户链接预测;基于个性化用户链接预测结果,利用从社团重启的随机游走预测用户的个性化位置链接;协作式个性化链接预测算法通过用户链接预测和位置链接预测的迭代使得两者性能相互提升。实验结果表明,所提算法相比于现有算法具有更好的预测性能。 相似文献
19.
语义社会网络是一种由信息节点及社会关系构成的新型复杂网络,传统语义社会网络分析算法在进行社区挖掘时需要预先设定社区个数,且无法发现重叠社区.针对这一问题,提出一种面向语义社区发现的link-block算法.该算法首先以LDA模型为语义信息模型,创新性地建立了以link为核心的block区域LBT(link-block-topic)取样模型;其次,根据link-block语义分析结果,建立可度量link-block区域的语义链接权重方法,实现了语义信息的可度量化;最后,根据语义链接权重建立了以link-block为单位的聚类算法以及可评价语义社区的SQ模型,并通过实验分析,验证了该算法及SQ模型的有效性及可行性. 相似文献