首页> 外文会议>IEEE International Conference on Advanced Information Networking and Applications;AINA 2010 >Communication Scheme to Support Sink Mobility in Multi-hop Clustered Wireless Sensor Networks
【24h】

Communication Scheme to Support Sink Mobility in Multi-hop Clustered Wireless Sensor Networks

机译:支持多跳群集无线传感器网络中接收器移动性的通信方案

获取原文

摘要

In wireless sensor networks, the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) to avoid the routing structure construction per each mobile sink by full network flooding. The BVI approach typically considers one-hop clusters and a backbone structure-based tree configured by the cluster heads (CHs). For data dissemination to a mobile sink, the head of the cluster where the mobile sink exists registers the backbone structure on behalf of the sink, and then source nodes generate the data to their CHs via the tree. Finally, the CHs deliver the data to the mobile sink. However, the one-hop cluster makes the tree organized by too many CHs so that it causes large location registration overhead according to movement of the sink. Moreover, the data delivery via the tree with a large number of CHs might lead to data delivery from source nodes to the sink though detour paths due to always delivering data via the tree. Namely, although the source nodes exist at nearest clusters from the cluster attached by the sink, if they are located in different branch of the tree, the data should be delivered via detour paths on the tree. Therefore, we propose a novel BVI-based communication protocol to support sink mobility without global position information. To reduce the number of CHs, we consider multi-hop clusters. Also, to avoid the location registration of a mobile sink to the whole CHs, we uses a rendezvous CH on which queries of the mobile sink and reporting data of a source node meet. However, such a manner also has data detour problem that the source node sends data packets to the mobile sink via the rendezvous CH. Thus, we present a scheme to find a path with fewer hop-counts between CHs where the source node and the mobile sink are located in. Simulation results show that the proposed protocol is superior to the existing protocols in terms of the control overhead and the data delivery hop counts.
机译:在无线传感器网络中,无需全球位置信息即可支持接收器移动性的研究都利用了基于骨干网的虚拟基础架构(BVI),以避免通过整个网络泛洪为每个移动接收器构建路由结构。 BVI方法通常考虑一跳群集和由群集头(CH)配置的基于主干结构的树。为了将数据分发到移动接收器,移动接收器所在的群集的头代表接收器注册骨干结构,然后源节点通过树将数据生成到其CH。最后,CH将数据传递到移动接收器。但是,单跳群集使树由太多的CH组成,从而导致根据接收器的移动产生较大的位置注册开销。而且,经由具有大量CH的树的数据传递可能导致由于总是通过树传递数据而通过de回路径而将数据从源节点传递到宿。即,尽管源节点位于与接收器连接的群集最接近的群集中,但是如果它们位于树的不同分支中,则应通过树上的de回路径来传递数据。因此,我们提出了一种新颖的基于BVI的通信协议,以支持无全球位置信息的接收器移动性。为了减少CH的数量,我们考虑使用多跳群集。另外,为避免移动接收器在整个CH上的位置注册,我们使用了一个会合CH,移动接收器的查询和源节点的报告数据在此会合。然而,这种方式也存在数据绕道的问题,即源节点经由集合点CH将数据分组发送到移动宿。因此,我们提出了一种在源节点和移动宿所在的CH之间找到跳数较少的路径的方案。仿真结果表明,在控制开销和控制开销方面,所提出的协议优于现有协议。数据传递跳数。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号