基于低占空比技术的机会网络性能研究

doi:10.3969/j.issn.1000-3428.2013.03.024

计算机工程 ›› 2013, Vol. 39 ›› Issue (3): 123-127.doi: 10.3969/j.issn.1000-3428.2013.03.024

基于低占空比技术的机会网络性能研究

卓碧华¹，郭振乾²，徐正坤³，张靖宇²，陈良银²

(1. 武警警官学院信息技术教研室，成都 610213；2. 四川大学计算机学院，成都 610064； 3. 中国人民解放军78020部队，昆明 650000)

收稿日期:2012-02-22 出版日期:2013-03-15 发布日期:2013-03-13
作者简介:卓碧华(1975－)，女，副教授、硕士，主研方向：机会网络，软件工程；郭振乾，硕士研究生；徐正坤，硕士；张靖宇，讲师、博士；陈良银，副教授、博士
基金项目:
四川省科技支撑计划基金资助项目(2010GZ0170)；四川大学青年教师科研启动基金资助项目(2011SCU11091)

Performance Study of Opportunistic Network Based on Low Duty Cycle Technology

ZHUO Bi-hua ¹, GUO Zhen-qian ², XU Zheng-kun ³, ZHANG Jing-yu ², CHEN Liang-yin²

(1. Teaching and Research Section of Information Technology, Armed Police Official College, Chengdu 610213, China; 2. College of Computer Science, Sichuan University, Chengdu 610064, China; 3. 78020 PLA Troops, Kunming 650000, China)

Received:2012-02-22 Online:2013-03-15 Published:2013-03-13

摘要/Abstract

摘要： 为延长机会网络生命周期，将低占空比技术引入到机会网络，研究低占空比环境下节点相遇的概率问题。分析节点移动速度、通信半径、占空比等参数的变化对于节点相遇概率和低占空比机会网络生命周期的影响。仿真实验结果表明，低占空比机会网络能够在损失少量节点相遇机会的前提下，大幅延长网络生命周期。

关键词: 低占空比技术, 机会网络, 物理相遇, 逻辑相遇, 相遇概率

Abstract: This paper imports Low Duty Cycle(LDC) technology into opportunistic networks for enlarging the life cycle of opportunistic network. The nodes encounter problem in LDC is studies. The effect on encounter probability of nodes and LDC opportunistic network with the change of node moving speed, communication range and duty cycle are analysed. Simulation results show that low duty cycle technology can significantly extend the life cycle of opportunistic network while losing a small number of meet opportunities.

Key words: Low Duty Cycle(LDC) technology, opportunistic network, physical encounter, logical encounter, encounter probability

中图分类号:

TP393

卓碧华, 郭振乾, 徐正坤, 张靖宇, 陈良银. 基于低占空比技术的机会网络性能研究[J]. 计算机工程, 2013, 39(3): 123-127.

ZHUO Bi-Hua, GUO Zhen-Gan, XU Zheng-Kun, ZHANG Jing-Yu, CHEN Liang-Yin. Performance Study of Opportunistic Network Based on Low Duty Cycle Technology[J]. Computer Engineering, 2013, 39(3): 123-127.

参考文献

[1] 熊永平, 孙利民, 牛建伟, 等. 机会网络[J]. 软件学报, 2009, 20(1): 124-137.
[2] Chen Liangyin, Shuo Guo, Shu Yuanchao, et al. Poster: Selective Reference Mechanism for Neighbor Discovery in Low-duty-cycle Wireless Sensor Networks[C]//Proc. of the 9th ACM Conference on Embedded Network Sensor System. New York, USA: ACM Press, 2011.
[3] Purohit A, Priyantha B, Liu Jie. WiFlock: Collaborative Group Discovery and Maintenance in Mobile Sensor Networks[C]//Proc. of the 10th International Conference on Information Processing in Sensor Networks. Chicago, USA: ACM Press, 2011.
[4] Karowski N, Viana A C, Wolisz A. Optimized Asyn- chronous Multi-channel Neighbor Discovery[C]//Proc. of the 30th IEEE International Conference on Computer Communications. [S. l.]: IEEE Press, 2011.
[5] Cao Qing, Abdelzaher T, He Tian, et al. Towards Optimal Sleep Scheduling in Sensor Networks for Rare-event Detection[C]//Proc. of the 4th International Conference on Information Processing in Sensor Networks. New York, USA: ACM Press, 2005.
[6] Lai Shouwen, Zhang Bo, Ravindran B, et al. CQS-pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks[C]//Proc. of the 12th International Conference on Principles of Distributed Systems. Berlin, Germany: Springer, 2008: 295-310.
[7] Dutta P, Culler D. Practical Asynchronous Neighbor Discovery and Rendezvous for Mobile Sensing Applications[C]//Proc. of the 9th ACM Conference on Embedded Network Sensor System. New York, USA: ACM Press, 2008.
[8] Kandhalu A, Lakshmanan K, Rajkumar R R. U-connect: A Low Latency Energy-efficient Asynchronous Neighbor Discovery Protocol[C]//Proc. of the 10th International Conference on Information Processing in Sensor Networks. New York, USA: ACM Press, 2010.
[9] Guo Shuo, Gu Yu, Jiang Bo, et al. Opportunistic Flooding in Low-duty-cycle Wireless Sensor Networks with Unreliable Links[C]//Proc. of the 15th Annual Inter- national Conference on Mobile Computing and Net- working. New York, USA: ACM Press, 2010.
[10] Bettstetter C, Wagner C. The Spatial Node Distribution of the Random Waypoint Model Proc[C]//Proc. of the 1st German Workshop on Mobile Ad Hoc Networks. Berlin, Germany: Springer, 2003: 257-269.
[11] Broch J, Maltz D A, Johnson D B, et al. A Performance Comparison of Multi-hop Wireless Ad Hoc Network Routing Protocols[C]//Proc. of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking. Dallas, USA: ACM Press, 1998.
[12] Wang Yong, Jain S, Martonosi M, et al. Erasure-coding Based Routing for Opportunistic Networks[C]//Proc. of ACM SIGCOMM Workshop on Delay-tolerant Net- working. Philadelphia, USA: ACM Press, 2005.

[1]	张英杰,李建波,李英. 基于自私性与中心性的机会网络数据分流算法[J]. 计算机工程, 2019, 45(6): 152-159.
[2]	和何,李琳琳,路云飞. 相遇概率与中心方向位置在战场容迟容断网络分簇中的应用[J]. 计算机工程, 2018, 44(7): 98-102,108.
[3]	余翔,刘志红,闫冰冰. 基于社交关系的移动机会网络路由算法[J]. 计算机工程, 2017, 43(12): 98-102.
[4]	李豪,陈志刚,吴嘉. 基于社区与社会性的机会网络路由算法[J]. 计算机工程, 2015, 41(12): 64-68,74.
[5]	王银涛, 高媛. 机会网络中高效的文件传输机制UH-EC[J]. 计算机工程, 2012, 38(23): 79-83,87.
[6]	吕翊, 樊思龙, 吴大鹏, 孔晓龙. 带有扩散程度估计的机会网络分组调度机制[J]. 计算机工程, 2012, 38(06): 104-106.
[7]	刘期烈, 祝孟伟, 黄巍, 唐丽均, 李云, 潘英俊. 机会网络中无线链路统计特性的研究[J]. 计算机工程, 2011, 37(7): 1-3.
[8]	陈凯, 白星振. 机会网络中元数据交换的改进方法[J]. 计算机工程, 2011, 37(6): 91-93.
[9]	孙践知, 刘乃瑞, 张迎新, 韩忠明, 陈丹. 机会网络典型路由算法性能分析[J]. 计算机工程, 2011, 37(16): 86-89.
[10]	蔡青松, 牛建伟. 基于边独立演化的机会网络时间演化图模型[J]. 计算机工程, 2011, 37(15): 17-22.
[11]	张翼, 周四望. 基于历史相遇间隔的机会网络路由协议[J]. 计算机工程, 2011, 37(14): 85-87.
[12]	蔡青松, 牛建伟, 刘畅. 一种机会网络中的消息发布/订阅算法[J]. 计算机工程, 2011, 37(12): 19-22.
[13]	陈果, 叶晖, 赵明. 机会网络节点协作缓存策略设计与实现[J]. 计算机工程, 2010, 36(18): 85-87.

基于低占空比技术的机会网络性能研究

Performance Study of Opportunistic Network Based on Low Duty Cycle Technology

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 13

Metrics

本文评价

推荐阅读 10