高级检索
    李志刚 肖 侬 褚福勇. 大规模无线传感器网络中基于振荡轨迹的数据存储与发现机制[J]. 计算机研究与发展, 2010, 47(11): 1911-1918.
    引用本文: 李志刚 肖 侬 褚福勇. 大规模无线传感器网络中基于振荡轨迹的数据存储与发现机制[J]. 计算机研究与发展, 2010, 47(11): 1911-1918.
    Li Zhigang, Xiao Nong, and Chu Fuyong. A Bouncing-Track Based Data Storage and Discovery Scheme in Large-Scale Sensor Networks[J]. Journal of Computer Research and Development, 2010, 47(11): 1911-1918.
    Citation: Li Zhigang, Xiao Nong, and Chu Fuyong. A Bouncing-Track Based Data Storage and Discovery Scheme in Large-Scale Sensor Networks[J]. Journal of Computer Research and Development, 2010, 47(11): 1911-1918.

    大规模无线传感器网络中基于振荡轨迹的数据存储与发现机制

    A Bouncing-Track Based Data Storage and Discovery Scheme in Large-Scale Sensor Networks

    • 摘要: 在大规模无线传感器网络中,在不存在基站节点的情况下,节点组成对等网络,任何一个节点都有可能成为数据消费者节点或者数据生产者节点.传感器网络是一种资源受限的自组织网络,节点的能量和计算能力不足以支持复杂协议的设计.如何让随机产生的消费者节点和生产者节点能够有效迅速地发现对方并进行数据查询工作是传感器网络研究中的一个难点.利用数据为中心的存储策略,提出了一种振荡轨迹的数据存储发现机制.该方案要求消费者节点和生产者节点将查询或者数据存储到相应的振荡路径上.该方案不需要节点存储全局的网络信息,每个节点根据局部信息和预设的反射角度进行路由选择和数据转发.理论上,所有的振荡轨迹满足两两相交的特性,保证了数据查询成功率,而且消费者节点在查询数据时所需要的跳步距离是有界的,同时该方案能够保证数据负载的平衡.

       

      Abstract: In a large scale wireless sensor network, all nodes comprise a peer-to-peer network in the case that the sink node does not exist. Any node has probability to become a data consumer node or data producer node. Sensor network is a kind of Ad-hoc network, meanwhile the energy and computation of an individual sensor node is limited, so complicated protocol design cannot be supported. How to make every random generated consumer node and producer node discover each other and search the useful data is a big research challenge in sensor networks. In this paper we propose a bouncing track based data storage and discovery scheme to solve this problem. It is a data-centric storage approach, which needs the consumer nodes and producer nodes to disseminate their queries or data along their relevant bouncing track. This scheme need not an individual node to keep global information of the whole network. Each node determines how to forward their data only using local information and a predefined reflection angle value. In theory, any two bouncing tracks intersect with each other, which guarantees successful data retrieval. This scheme can also satisfy hop distance bounded search cost when a consumer queries data. It can also guarantee data load balance.

       

    /

    返回文章
    返回