• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Location-aware protocols for energy-efficient information processing in wireless sensor networks.
【24h】

Location-aware protocols for energy-efficient information processing in wireless sensor networks.

机译：无线传感器网络中用于节能信息处理的位置感知协议。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The data provided by a sensor node is often useful only in the context of the location of the data source. Thus, sensor networks rely on localization schemes to provide location information to sensor nodes. The premise of this thesis is that location-aware protocols, which are based on the assumption that sensor nodes can estimate their location, improve the efficiency of data gathering and resource utilization of wireless sensor networks. Location-awareness improves the energy-efficiency of the protocols needed for routing, transport, data dissemination and self-organization of sensor net- works. In this thesis, we show how location information can be leveraged in novel ways in sensor network protocols to achieve energy efficiency. The contributions of this thesis are in four important areas related to network protocol design for wireless sensor networks: (1) self-organization; (2) data dissemination or node reprogramming; (3) service differentiation; and (4) data collection. Work on self-organization (SCARE) and data dissemination (LAF) was carried out from 2002 to 2004 and the work on service differentiation (SensiQoS) and data collection (HTDC) was carried out from 2004 to 2009.;This thesis first presents a new approach for self-configuration of ad hoc sensor networks. The self-configuration of a large number of sensor nodes requires a distributed solution. We propose a scalable self-configuration and adaptive reconfiguration (SCARE) algorithm that exploits the redundancy in sensor networks to extend the lifetime of the network. SCARE distributes the set of nodes in the sensor network into subsets of coordinator nodes and non-coordinator nodes. While coordinator nodes stay awake, provide coverage, and perform multi-hop routing in the network, non-coordinator nodes go to sleep. When nodes fail, SCARE adaptively re-configures the network by selecting appropriate non-coordinator nodes to become coordinators and take over the role of failed coordinators. This scheme only needs local topology information and uses simple data structures in its implementation. SCARE organizes nodes into coordinator and non-coordinator nodes. A recent work, termed Ripples [106] has improved upon the self-organization and reconfiguration mechanism proposed in SCARE. It uses a lightweight clustering algorithm to elect cluster heads instead of coordinator nodes based on location information as proposed by SCARE. Ripples selects fewer cluster-head nodes compared to the number of coordinator nodes elected by SCARE by varying the cluster radius and consequently realizes more energy savings while providing comparable sensing coverage.;This thesis next presents an energy-efficient protocol for data dissemination in sensor networks. Sensor networks also enable distributed collection and processing of sensed data. These networks are usually connected to the outside world with base stations or access points through which a user can retrieve the sensed data for further inference and action. Dissemination of information is a challenging problem in sensor networks because of resource constraints. Conventional methods use classical flooding for disseminating data in a sensor network. However, classical flooding suffers from disadvantages such as the broadcast storm problem. We have proposed an energy-efficient scheme that uses the concept of virtual grids to partition (self-configure) the set of nodes into groups of gateway nodes and internal nodes. While gateway nodes forward the packets across virtual grids, internal nodes forward the packets within a virtual grid. The proposed location-aided flooding protocol (LAF) reduces the number of redundant transmissions and receptions by storing a small amount of state information in a packet and inferring the information about nodes that already have the packet from the modified packet header. More recent work [55] has extended the virtual grid concept proposed by LAF to non-uniform sensor network deployments. In [55], non-uniform virtual grids are used to improve upon the energy savings provided by LAF and achieve higher energy savings for non-uniform sensor network topologies.;This thesis also addressees the challenging problem of timely data delivery in sensor networks. We propose SensiQos, which leverages the inherent properties of the data generated by events in a sensor network such as spatial and temporal correlation, and realizes energy savings through application-specific in-network aggregation of the data. This data delivery scheme is based on distributed packet scheduling, where nodes make localized decisions on when to schedule a packet for transmission to save energy and to which neighbor they should forward the packet to meet its end-to-end real-time deadline.;Finally, this thesis presents an energy-efficient data collection protocol for sensor networks. It is based on a combination of geographic hash table and mobile sinks that leverage mobile sinks to achieve energy-efficiency in event-driven sensor networks. Next, an analysis of the energy savings realized by the proposed protocol is presented. Simulation results demonstrate significant gains in energy savings for data collection with change in various parameter values. (Abstract shortened by UMI.)
机译：传感器节点提供的数据通常仅在数据源位置的上下文中才有用。因此，传感器网络依靠定位方案来向传感器节点提供位置信息。本文的前提是基于位置感知的协议，该协议基于传感器节点可以估计其位置的假设，从而提高了无线传感器网络的数据收集效率和资源利用率。位置感知提高了路由，传输，数据分发和传感器网络自组织所需的协议的能效。在本文中，我们展示了如何在传感器网络协议中以新颖的方式利用位置信息来实现能源效率。本文的研究主要涉及无线传感器网络网络协议设计的四个重要领域：（1）自组织； （2）数据分发或节点重编程； （3）服务差异化； （4）数据收集。自2002年至2004年进行了自组织（SCARE）和数据分发（LAF）工作，并于2004年至2009年进行了服务差异（SensiQoS）和数据收集（HTDC）工作。自组织传感器网络自配置的新方法。大量传感器节点的自配置需要分布式解决方案。我们提出了一种可扩展的自配置和自适应重配置（SCARE）算法，该算法利用传感器网络中的冗余来延长网络的寿命。 SCARE将传感器网络中的节点集分为协调器节点和非协调器节点的子集。当协调器节点保持苏醒，提供覆盖范围并在网络中执行多跳路由时，非协调器节点将进入睡眠状态。当节点发生故障时，SCARE通过选择适当的非协调器节点以成为协调器并接管发生故障的协调器的角色，来自适应地重新配置网络。该方案仅需要本地拓扑信息，并在实现中使用简单的数据结构。 SCARE将节点组织为协调器节点和非协调器节点。称为Ripples [106]的最新工作对SCARE中提出的自组织和重新配置机制进行了改进。它根据SCARE提出的位置信息，使用轻量级聚类算法来选择簇头，而不是协调器节点。与SCARE选择的协调器节点数量相比，涟漪通过改变簇半径选择的簇头节点数量更少，因此在提供可比的传感覆盖率的同时实现了更多的节能效果;本论文接下来提出了一种用于传感器网络中数据分发的节能协议。 。传感器网络还支持分布式收集和处理感测数据。这些网络通常通过基站或接入点连接到外界，用户可以通过基站或接入点检索感测到的数据以进行进一步的推断和采取措施。由于资源的限制，信息的传播在传感器网络中是一个具有挑战性的问题。常规方法使用经典泛洪来在传感器网络中分发数据。但是，经典洪泛遭受诸如广播风暴问题的缺点。我们提出了一种节能方案，该方案使用虚拟网格的概念将节点集划分（自配置）为网关节点和内部节点组。网关节点跨虚拟网格转发数据包时，内部节点则在虚拟网格内转发数据包。所提出的位置辅助泛洪协议（LAF）通过在数据包中存储少量状态信息，并从修改后的数据包头中推断有关已经拥有该数据包的节点的信息，从而减少了冗余传输和接收的次数。最近的工作[55]将LAF提出的虚拟网格概念扩展到非均匀传感器网络部署。在[55]中，非均匀虚拟网格被用于改善LAF提供的能量节省，并为非均匀传感器网络拓扑实现更高的能量节省。；本论文还解决了传感器网络中及时数据传递的挑战性问题。我们提出了SensiQos，它利用了传感器网络中事件所生成的数据的固有属性（例如空间和时间相关性），并通过特定于应用程序的数据在网络内聚合来实现节能。该数据传送方案基于分布式数据包调度，其中节点在何时调度数据包以进行传输以节省能量以及节点应将数据包转发到哪个邻居以满足其端到端实时期限方面做出本地化决策。最后，本文提出了一种用于传感器网络的节能数据收集协议。它基于地理哈希表和移动接收器的结合，利用移动接收器在事件驱动的传感器网络中实现能源效率。接下来，对所提出的协议实现的节能进行了分析。仿真结果表明，随着各种参数值的变化，数据收集的节能效果显着提高。 （摘要由UMI缩短。）

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号