Handbook of Sensor Networks最新文献_第2页

Data-Centric Protocols for Wireless Sensor Networks 无线传感器网络的数据中心协议

Handbook of Sensor Networks Pub Date : 2005-09-23 DOI: 10.1002/047174414X.CH13

I. Stojmenovic, S. Olariu

引用次数: 92

Energy-Efficient Backbone Construction, Broadcasting, and Area Coverage in Sensor Networks 传感器网络中节能骨干结构、广播和区域覆盖

Handbook of Sensor Networks Pub Date : 2005-09-23 DOI: 10.1002/047174414X.CH11

D. Simplot-Ryl, I. Stojmenovic, Jie Wu

{"title":"Energy-Efficient Backbone Construction, Broadcasting, and Area Coverage in Sensor Networks","authors":"D. Simplot-Ryl, I. Stojmenovic, Jie Wu","doi":"10.1002/047174414X.CH11","DOIUrl":"https://doi.org/10.1002/047174414X.CH11","url":null,"abstract":"A backbone is a subset of sensors that is sufficient for performing assigned tasks. The exact definition depends on the task or the particular desirable properties of a backbone. We discuss two specific kinds of backbones, neighbor and area dominating sets, that we believe are the essential and perhaps only backbones required for sensor networks. A sensor is covered by a backbone if it is in the backbone or is a neighbor to a sensor in the backbone. This type of backbone is referred to here as neighbor-dominating sets, or simply dominating sets. A point within a monitoring area is covered by a sensor backbone if it is within sensing range of at least one sensor from the backbone. This type of backbone is called area-dominating set. In a broadcasting (also known as data-dissemination) task, a message is sent from one node, which could be a monitoring center, to all nodes in the network. Sensors, which are randomly placed in an area, decide which of them should be active and monitor an area, and which of them may sleep and become active at a later time. The communication connectivity is important so that the measured data can be reported to a monitoring center. This problem is known as the sensor-area coverage problem, and needs to be solved efficiently to enable sensor functioning for a prolonged time. Sensors may also be placed deterministically in an area to optimize coverage and reduce power consumption. Most solutions considered in this chapter are based","PeriodicalId":210570,"journal":{"name":"Handbook of Sensor Networks","volume":"8 13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133890013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 92

Data Gathering and Fusion in Sensor Networks 传感器网络中的数据采集与融合

Handbook of Sensor Networks Pub Date : 2005-09-23 DOI: 10.1002/047174414X.CH15

Wei-Peng Chen, J. Hou

引用次数: 13

The Wireless Sensor Network MAC 无线传感器网络MAC

Handbook of Sensor Networks Pub Date : 2005-09-23 DOI: 10.1002/047174414X.CH8

E. Callaway

引用次数: 10

Geographic and Energy-Aware Routing in Sensor Networks 传感器网络中的地理和能量感知路由

Handbook of Sensor Networks Pub Date : 2005-09-23 DOI: 10.1002/047174414X.CH12

Hannes Frey, I. Stojmenovic

{"title":"Geographic and Energy-Aware Routing in Sensor Networks","authors":"Hannes Frey, I. Stojmenovic","doi":"10.1002/047174414X.CH12","DOIUrl":"https://doi.org/10.1002/047174414X.CH12","url":null,"abstract":"Typical communication patterns within a sensor network are data delivery from sensor nodes to one of selected information sinks, and information sinks requesting a certain physical phenomenon or requesting sensor nodes lying within a sensed area. In general, addressing is achieved by utilizing sensor locations. Geographic routing algorithms allow routers to be nearly stateless since packet forwarding is achieved by utilizing location information about candidate nodes in vicinity and the location of the final destination only. By their localized nature, geographic routing algorithms are highly scalable solutions which do not require any additional control overhead when network topology changes due to mobility or energy conserving sleep cycles. Recent work investigated that location information may be utilized to define new link metrics aiming on energy and physical layer optimized routing paths instead of only minimizing the number of hops needed to reach the desired destination. This chapter reviews geographic and energy aware routing algorithms for sensor networks. It includes simple heuristic greedy forwarding strategies, strategies which obtain guaranteed delivery by memorizing information about all ongoing routing task, memoryless recovery strategies, energy aware link metrics and routing strategies aiming on increased network lifetime, and routing without information about their neighbor nodes. The majority of geographic routing protocols assume a simplified network model which does not take into account random variations in correct message receipt. This chapter also discusses physical","PeriodicalId":210570,"journal":{"name":"Handbook of Sensor Networks","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115109700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 32