期刊文献+

GPRS长距离通信中的冲突消除方法仿真分析

GPRS Conflict Elimination Method Simulation of Long Distance Communication
下载PDF
导出
摘要 研究无线通信优化传输率问题,由于在长距离的无线通信过程中,信号传输距离过长,传输过程不可控,引起节点失效,传输率降低。传统的方法都是采用中继通信的方法,但是一旦通信距离过长,会造成节点在检测过程中发生冲突,时间间隙很难做到有效调度,造成GPRS通信冲突。为解决上述问题,提出一种K-means不定聚类的GPRS冲突消除方法,采用K-means算法对通信任务进行聚类处理,确保聚类后的分组内任务具有较高的相似性,在不同信号分组中采用非固定概率模型检测失效GPRS支持节点信息组,并进行过滤,完成对GPRS通信冲突的有效处理,确保通信信号的准确传输。仿真结果表明,改进方法具有较强的GPRS通信冲突处理能力。 In the process of long distance wireless communication, signal transmission distance is too long, and transmission process is not controllabl. The paper put forward a K - means uncertain clustering GPRS conflict elimi-nation method. We used K - means algorithm to cluster the communication task, and to ensure that the clustering task within group has high similarity. We used the fixed probability model in different signal grouping to test failure GPRS support node block and filter it, and dealt effectively with conflict of GPRS communication to ensure the accu-rate transmission of communication signals. Simulation experiment results show that the method has stronger GPRS communication conflict processing performance, and the method of GPRS communication network has strong ability to survive.
出处 《计算机仿真》 CSCD 北大核心 2013年第12期191-194,共4页 Computer Simulation
基金 北京理工大学珠海学院青年教师科研资助项目(2011B001)
关键词 长距离通信 冲突消除 不定聚类 Long distance communication Conflict resolution Fuzzy clustering
  • 相关文献

参考文献6

二级参考文献31

  • 1胡海江,张凤登.一种新的无线传感器网络分簇模型[J].传感技术学报,2006,19(2):477-480. 被引量:17
  • 2沈波,张世永,钟亦平.无线传感器网络分簇路由协议[J].软件学报,2006,17(7):1588-1600. 被引量:267
  • 3[1]Foster I,Kesselman C,M.Nick J,et al.The physiology of the grid:An Open Grid Services Architecture for Distributed Systems Intergration.http://www.globus.org/alliance/publications/papers/ogsa,pdf.2002-6-12.
  • 4[2]Braun T D,Siegel H J,Beck N.A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems.Parallel and Distributed Computing.2001,61 (6):810 -837.
  • 5[3]Hou Y,Yu J and Turgun,NDA -MM:A New Adaptive Task Scheduling Algorithm Based on the Non -dedicated Constraint Grid,Sixth International Conference on Grid and Cooperative Computing,2007,8:275-281.
  • 6[4]He XiaoShan,Sun XianHe,Von Laszewski Gregor.QoS Guided Min-Min Heuristic for Grid Task Scheduling.Journal of Computer Science and Technology,2003,18(4):442 -451.
  • 7Marco Dorigo, Gambardella, Luca Maria. Ant colonies for the traveling salesman problem. Biosystems, 1997, 43(2): 73~81.
  • 8Marco Dorigo, Gambardelh, Luca Maria. Ant colony system: A cooperative learning approach to the traveling salesaum problem. IEEE Trans on Evolutionary Computation, 1997, 1(1) : 53~66.
  • 9Marco Dorigo, Eric Bonabeau, Theranlaz Guy. Ant algorithms and stigmergy. Future Generation Computer System, 2000, 16(8) : 851~871.
  • 10Thomas Stutzle, Holger H Hoos et al. MAX-MIN ant system. Future Generation Computer System, 2000, 16(8) : 889~914.

共引文献338

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部