检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京理工大学泰州科技学院电子电气工程学院,江苏泰州225300
出 处:《电子器件》2016年第1期199-204,共6页Chinese Journal of Electron Devices
摘 要:为实现智能家居远程控制,指令将经路由器转发至Zig Bee协调节点,并通过Zig Bee网络实现设备的控制。因Cluster-tree算法传输时延长,损耗大,对树型拓扑发现和地址分配机制进行了优化,通过定义组别,选择合适节点作为中继节点。若目的节点为源节点的邻节点,则将数据传送至目的节点,否则创建目的节点的组别,选择合适的中继节点。仿真表明,当节点数越多时,改进的算法可减少30%的能耗,并随时间的增长,死亡节点数将降低10%,有效地均衡了网络负载。To realize the remote control of the smart home,the order will be forward to the ZigBee coordinator node, then the ZigBee network will control terminal equipment. As cluster-tree algorithm easily leads to increased transmission delay,and the route loss is too large,therefore,the original algorithm is improved:a tree network topology discovery and address allocation mechanisms have been optimized. Through defining a group of nodes,we will select the appropriate node as a relay node from those nodes. If the destination node belongs to an adjacent node of the source node,then the data can be directly transfered to the destination node,otherwise you must first create the relevant constituencies of the destination node,then select the appropriate relay nodes,The Simulation results show that when the more number of nodes increasing,the improved algorithm can reduce 30%energy consumption,along with the time,the number of death nodes will effectively reduce 10%,then it will balance the network load effectively.
关 键 词:智能家居 Cluster-tree算法 中继节点 死亡节点数 网络负载
分 类 号:TP13[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.213