首页 | 本学科首页   官方微博 | 高级检索  
     

随机接入网络的组网时间复杂性
引用本文:于路,王桥,李立宏,向继东. 随机接入网络的组网时间复杂性[J]. 信息与控制, 2006, 35(2): 193-200
作者姓名:于路  王桥  李立宏  向继东
作者单位:1. 东南大学无线电工程系,江苏,南京,210096
2. 中兴通讯中心研究院,广东,深圳,518057
摘    要:针对无线传感器网络,研究了几种核心随机接入方法在一跳网络内组网的时间复杂性问题.对无反馈和有反馈策略下时隙ALOHA(Additive Link On-line HAwaii system)与CSMA(Carrier Sense Multiple Access)接入方法的组网时间进行了精确的理论分析,给出了期望和方差的理论结果.通过仿真证实了上述性能分析的正确性.

关 键 词:无线传感器网络  随机多址接入  组网复杂性
文章编号:1002-0411(2006)02-0193-08
收稿时间:2006-01-20
修稿时间:2006-01-20

Time Complexity of Establishing Network with Random Multiple Access System
YU Lu,WANG Qiao,LI Li-hong,XIANG Ji-dong. Time Complexity of Establishing Network with Random Multiple Access System[J]. Information and Control, 2006, 35(2): 193-200
Authors:YU Lu  WANG Qiao  LI Li-hong  XIANG Ji-dong
Affiliation:1. Department of Radio Engineering, Southeast University, Nanfing 210096, China ; 2. Central Institute, ZTE Corporation, Shenzhen 518057, China
Abstract:Time complexity of establishing network with random multiple access methods in one-hop network for wireless sensor network is presented.Rigorous analysis is made on the theoretic expectation and variance of the time of establishing network in Slotted ALOHA(Additive Link On-line HAwaii system)and Slotted CSMA(Carrier Sense Multiple Access) scheme with and without a specific ACK(ACKnowledgement) strategy.Simulation results validate the performance analysis.
Keywords:wireless sensor network    random multiple access    complexity of establishing network
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《信息与控制》浏览原始摘要信息
点击此处可从《信息与控制》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号