版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Chung Ang Univ Sch EEE Seoul 06974 South Korea Hankyong Natl Univ Dept EEC Gyeonggi Do 17579 South Korea
出 版 物:《INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS》 (分布式传感网络国际杂志)
年 卷 期:2016年第2016卷第4期
页 面:7296359-7296359页
核心收录:
学科分类:0810[工学-信息与通信工程] 081203[工学-计算机应用技术] 08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:Agency for Defense Development [ADD-IBR-245] Chung-Ang University Excellent Student Scholarship National Research Foundation of Korea [22A20152213084] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
主 题:RESOURCE allocation COMPUTER algorithms TIME division multiple access DISTRIBUTED sensors SENSOR networks INTERNET of things
摘 要:Many studies on distributed resource-allocation algorithms have been conducted recently because of the increasing number of network nodes and the rapidly changing network environments in the Internet of Things (IoT). In this paper, we propose the multihop DESYNC algorithm, which is a bioinspired Time Division Multiple Access- (TDMA-) based distributed resource-allocation scheme for distributed sensor networks. We define a detailed frame structure for the proposed multihop DESYNC algorithm and a firing message, which acts as a reference for resource allocation. In addition, operating procedures for resource allocation and collision detection avoidance under multihop DESYNC are explained. Simulations show that multihop DESYNC effectively resolves the hidden-node problem and that it fairly shares resources among nearby nodes in multihop networks. Moreover, it achieves better performance than the CSMA/CA algorithm in terms of channel reuse gain and average throughput.