移动自组网络中低能耗邻居发现算法  

Research on Optimization of Low Energy Neighbor Discovery Algorithm in Mobile Ad Hoc Networks

作　　者：施艳昭 SHI Yanzhao(Department of Economic Management,Anhui Vocational College of Electronics and Information Technology,Bengbu 233000,China)

机构地区：[1]安徽电子信息职业技术学院经济管理系,安徽蚌埠233000

出　　处：《新乡学院学报》2020年第9期43-45,49,共4页Journal of Xinxiang University

基　　金：安徽省高等学校质量工程项目(2019kfkc264)。

摘　　要：提出了一种实用的能耗模型,该模型考虑了过渡状态的能耗和持续时间。以该能耗模型为基础,提出一种具有低能耗的异步邻居发现算法。该算法可以在低能耗的情况下大大减少最坏情况下的发现延迟,并用仿真实验验证所提出算法的有效性。This article first proposes a more practical energy consumption model that takes into account the energy consumption and duration of the transition state.Then,based on the energy consumption model,a Low Energy Asynchronous Neighbor Discovery(LEAND)algorithm with low energy consumption is proposed.This algorithm can greatly reduce the worst-case discovery delay with low energy consumption.Finally,we perform simulation experiments to verify the effectiveness of the proposed LEAND algorithm.

关 键 词：移动自组网络 邻居发现 低能耗 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]