【摘要】 邻居发现一直是低占空比无线传感器网络的核心问题。提出用来进行邻居发现的邻居发现矩阵。在邻居发下矩阵中,所有的第0列都是活动时隙的实际应用中经常遇到要求不改变原始数据的顺序而按关键字的大小对数据进行排序的情况,原有的一些经典排序算法不能直接用于解决该类问题。经过对选择排序算法进行研究,给出基于选择思想的不改变数据位置而对数据进行排序的算法,并利用C#语言编程对该算法的实现过程进行动态演示。更多还原

【Abstract】 For low duty cycle wireless sensors networks(LDC-WSNs),neighbor discovery is always a central issue.Puts forward a novel Discovery Matrix(DM),which is constructed with multiple contiguous time slots,to be used for neighbor discovery.In this DM,all slots of the 0 th column are set to be active slots(called Anchor slots,A slots).The other active slots(S slots) are set to be in the other first half columns,and each column has and only has one S slot.In addition,S slot is divided into two parts,i:e:,idle part(IP) and active part(AP).Through minimizing the length of AP,which accounts for the main part of energy consumption in S slot,multiple S slots can be deployed at a row,accordingly reduce the row number of DM greatly,thus enormously reduce neighbor discovery delay.Theoretical analysis and simulations show that Swift,this novel deterministic bi-directional neighbor discovery method based on our DM,can remarkably improve energy efficiency.更多还原