摘要
针对WSNs节点地址分配中存在的控制开销大以及延迟长等问题,提出一种分散式的地址分配算法。该算法将WSNs依据网络标识分为若干树状结构的子网,节点依据占有资源多少分为根、首、终节点,除终节点外的所有节点均可以成为代理节点为新加入WSNs的节点分配唯一的地址,与依赖广播地址请求包或是重复地址检测的地址分配算法不同,代理节点为申请节点分配的地址是依据自己的地址而生成的。仿真实验表明,算法结束时,WSNs内所有节点均可以得到一个唯一地址,且与LISAA相比,该算法的控制开销更小,延迟时间更短。
In view of the problems the nodes address configuration in wireless sensor networks (WSNs) has that the control overhead is big and the latency is long, in this paper we present a distributed address configuration algorithm, which divides the WSNs into subnets with tree structure according to network ID. The nodes are divided into root, leader and leaf nodes according to their occupied resources. All nodes can be a proxy node to assign a unique address for a new node of WSNs except the leaf nodes. Different to other address configuration algorithms either relying on the broadcasting address for solicitation or detecting the duplicate address, the proxy nodes assign addresses for the new nodes on the basis of their own addresses. Simulation experiments show that all nodes within WSNs are assigned the globally unique IP address at the termination of the algorithm. It takes smaller control overhead and shorter delay compared with LISAA.
出处
《计算机应用与软件》
CSCD
北大核心
2014年第3期116-119,共4页
Computer Applications and Software
基金
山西省留学基金项目(2009-28)
山西省自然科学基金项目(2009011022-2)
关键词
无线传感器网络
子树
分散
代理节点
R
Wireless sensor networks (WSNs) Tree structure Distributed Proxy node R