摘要
SAS(Structured Addressing Scheme)是针对传感器网络资源受限、且存储空间不足的问题提出的结构化地址分配方案.当网络中的节点的邻居较少时,SAS可以通过n维的超立方结构来对各节点分配n维的地址空间,使得网络中的路由方式简单且更加健壮.然而,SAS不适用于密集分布的传感器网络,虽然增加地址维数的方式易于扩展,但对每个节点的存储开销是巨大的;同时,通过SAS方式配置的网络结构相比原密集网络,在网络相似度上也难以控制.本文基于SAS提出了一种密集网络下的改进方案,它能为节点分配二维的地址并尽量保证网络的相似度.本文通过给出分布式算法的机制及仿真结果,表明新的结构化地址分配方法对密集传感器网络具有实用价值.
SAS (Structured Addressing Scheme) was a structured addressing scheme used in sensor networks where the resources for nodes in a network were scarce and could not afford to maintain routing tables. As the number of neighbors for one node was some- times limited, SAS could use n-tuple addresses to indicate nodes in an n-dimensional hyper-cube. As a result, routing in such a net- work was simplified and also more robust. However, SAS is not suitable for a dense distributed sensor network. Although the addres- ses in a larger dimensional space are more scalable, it will cause a considerable storage cost for every node. Meanwhile, there are problems in network similarity compared with the real network after address configuration in SAS. In this paper, the original SAS for dense sensor networks is improved so as to control the network similarity with only 2-tuple addresses. The mechanism of distribute al- gorithm and also the simulation results axe given out, which show that the new scheme is useful in dense sensor networks.
出处
《小型微型计算机系统》
CSCD
北大核心
2013年第6期1221-1225,共5页
Journal of Chinese Computer Systems
基金
国家重大专项项目(2011ZX03005-006)资助
关键词
传感器网络
组网算法
拓扑控制
虚拟坐标
sensor networks
networking algorithm
topology control
virtual coordinate