2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)最新文献

筛选
英文 中文
Link layer measurements in sensor networks 传感器网络中的链路层测量
N. Reijers, G. Halkes, K. Langendoen
{"title":"Link layer measurements in sensor networks","authors":"N. Reijers, G. Halkes, K. Langendoen","doi":"10.1109/MAHSS.2004.1392161","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392161","url":null,"abstract":"Key issues in wireless sensor networks such as data aggregation, localisation, MAC protocols and routing, all have to do with communication at some level. At a low level, these are influenced by the link layer performance between two nodes. The lack of accurate sensor network specific radio models, and the limited experimental data on actual link behaviour warrant additional investigation in this area. We present the results from extensive experiments, exploring several factors that are relevant for the link layer performance. These include (i) the effect of interference from simultaneous transmissions, which has not been looked into before, (ii) the degree of symmetry in the links between nodes, and (iii) the use of calibrated RSSI measurements. Finally, we present some guidelines on how to use the results for effective protocol design.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133141032","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}
引用次数: 143
A self-organizing, location-aware media access control protocol for DS-CDMA sensor networks 一种用于DS-CDMA传感器网络的自组织、位置感知媒体访问控制协议
B. Liu, N. Bulusu, H. Pham, S. Jha
{"title":"A self-organizing, location-aware media access control protocol for DS-CDMA sensor networks","authors":"B. Liu, N. Bulusu, H. Pham, S. Jha","doi":"10.1109/MAHSS.2004.1392197","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392197","url":null,"abstract":"This paper proposes CSMAC (CDMA Sensor MAC), a novel self-organizing, location-aware media-access control (MAC) protocol for DS-CDMA sensor networks to support applications that feature high bandwidth traffic and stringent latency requirements. Previously proposed MAC protocols for sensor networks such as SMAC (W. Ye et al, IEEE Proc. Infocom, pp. 1567-1576, 2002) primarily prioritize energy efficiency over latency. Our protocol design balances the considerations of energy efficiency, latency, accuracy, and fault-tolerance in sensor networks. CSMAC uses a combination of DS-CDMA and frequency diversity in channel allocation to reduce channel interference and consequently message latency in the network. It features two algorithms that exploit the location awareness of sensor nodes to enable intelligent and efficient network formation for collaborative sensing tasks: turn off redundant node (TORN) and select minimum neighbor (SMN).","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133775978","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}
引用次数: 7
TCP-friendly medium access control for ad-hoc wireless networks: alleviating self-contention 面向自组织无线网络的tcp友好介质访问控制:减轻自争
Dan Berger, Zhenqiang Ye, P. Sinha, S. Krishnamurthy, M. Faloutsos, S. Tripathi
{"title":"TCP-friendly medium access control for ad-hoc wireless networks: alleviating self-contention","authors":"Dan Berger, Zhenqiang Ye, P. Sinha, S. Krishnamurthy, M. Faloutsos, S. Tripathi","doi":"10.1109/MAHSS.2004.1392160","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392160","url":null,"abstract":"We focus on self-contention: contention between packets of the same transport layer connection along the path from source to destination. We observe that self-contention plays an important role in degrading TCP performance in multi-hop wireless networks and that the use of the popular IEEE 802.11 MAC protocol exacerbates self-contention. We propose and study two MAC-layer approaches to alleviate self-contention. The first approach, called quick-exchange (QE), is designed with the intent of reducing the effects of inter-flow self-contention (e.g. between packets of the same connection traveling in opposite directions). The design of our second mechanism, called fast-forward (FF), is geared towards decreasing intra-flow self-contention (e.g. between packets of the same connection traveling in the same direction). We simulate and study our proposed schemes and observe that quick-exchange consistently improves net-work aggregate goodput (by as much as 20% in string topologies, 15% in random static scenarios, and 10% in random mobile scenarios). In contrast to our expectations, fast-forward causes sporadic and often negative effects on goodput for TCP connections. Upon investigation we find that while the MAC is, in some respect, operating more efficiently, as demonstrated by improved UDP throughput; interactions with TCPs congestion control mechanism cause the goodput to degrade. We analyze various effects that cause the respective behaviors with QE and FF in detail.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115293867","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}
引用次数: 44
A study of the coverage of large-scale sensor networks 大型传感器网络的覆盖研究
Benyuan Liu, D. Towsley
{"title":"A study of the coverage of large-scale sensor networks","authors":"Benyuan Liu, D. Towsley","doi":"10.1109/MAHSS.2004.1392188","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392188","url":null,"abstract":"We study the coverage properties of large-scale sensor networks. Three coverage measures are defined to characterize the fraction of the area covered by sensors (area coverage), the fraction of sensors that can be removed without reducing the covered area (node coverage), and the capability of the sensor network to detect objects moving in the network (detectability), respectively. We approach the coverage problem from a theoretical perspective and explore the fundamental limits of the coverage of a large-scale sensor network. We characterize the asymptotic behavior of the coverage measures for a variety of sensor network scenarios. We find that the coverage of a sensor network exhibits different behaviors for different network configuration and parameters. Based on the analytical characterizations of the network coverage, we further discuss the implications to network planning and protocol performance of sensor networks.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114250246","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}
引用次数: 440
GCRP: geographic virtual circuit routing protocol for ad hoc networks 用于自组织网络的地理虚拟电路路由协议
Sophia Fotopoulou-Prigipa, A. B. McDonald
{"title":"GCRP: geographic virtual circuit routing protocol for ad hoc networks","authors":"Sophia Fotopoulou-Prigipa, A. B. McDonald","doi":"10.1109/MAHSS.2004.1392181","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392181","url":null,"abstract":"Geographic routing exploits localized information concerning explicit node locations to make forwarding decisions. This approach adapts well to the dynamic nature of ad hoc networks. However it is subject to increased overhead during the local minimum recovery process. In this paper we specify GCRP a routing protocol based on the novel geocircuit paradigm, that exploits already discovered paths to avoid repeated recoveries from the same local minimums. The proposed protocol is established to exhibit loop-freedom, while robustly eliminating mobility-induced loops. Performance analysis demonstrates significant advantage of GCRP relative to conventional geogram routing, over a wide range of network environment conditions. Gains increase as limiting network parameters are increased, namely node mobility, traffic load, network size and density. Effective repair of broken geocircuits preserves scalability in highly mobile environments.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123104641","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}
引用次数: 18
IEEE 802.11 fragmentation-aware energy-efficient ad-hoc routing protocols IEEE 802.11分片感知节能ad-hoc路由协议
T. Nadeem, A. Agrawala
{"title":"IEEE 802.11 fragmentation-aware energy-efficient ad-hoc routing protocols","authors":"T. Nadeem, A. Agrawala","doi":"10.1109/MAHSS.2004.1392081","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392081","url":null,"abstract":"We define techniques to compute energy-efficient paths, using the IEEE 802.11 fragmentation mechanism, within the framework of on-demand routing protocols. We focus on one specific on-demand routing protocol, namely the ad-hoc on-demand vector routing protocol (AODV), and show how it should be adapted to compute energy-efficient paths. The choice of energy-efficient paths depends on link error rates on different wireless links, which in turn depend on channel noise. We show how our scheme accounts for such channel characteristics in computing such paths and how it exploits the IEEE 802.11 fragmentation mechanism to generate optimum energy-efficient paths. We perform a detailed study of the AODV protocol and our energy-efficient variants, under various noise and node mobility conditions. Our results show that our proposed variants of on-demand routing protocols can achieve orders of magnitude improvement in energy-efficiency of reliable data paths.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127993442","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}
引用次数: 25
Time indexing in sensor networks 传感器网络中的时间分度
Rong L. Zheng, Guanghui He, Indranil Gupta, L. Sha
{"title":"Time indexing in sensor networks","authors":"Rong L. Zheng, Guanghui He, Indranil Gupta, L. Sha","doi":"10.1109/MAHSS.2004.1392166","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392166","url":null,"abstract":"We define the time indexing problem as the in-network storage and querying of sensor network data based solely on the time attribute. We argue qualitatively why existing storage schemes may be insufficient as solutions. We then present, analyze, and evaluate novel and lightweight solutions to both the storage and the querying sub-problems for time indexing. First, the time-indexed storage problem is formally defined, and two formulations are presented, seeking to optimize generic utility functions that are derived from concerns about energy, bandwidth usage, and storage balancing. We present and analyze decentralized protocols to solve these formulations, and prove the optimality of some of our solutions. Secondly, maintenance and use of simple overlays among rendezvous point nodes, in order to enable fault-tolerant and efficient time-indexed queries, are discussed. Finally, simulation results are presented to quantify performance characteristics of the protocols, and we find that our proposed scheme has low query overhead that scales with system size and density while exhibiting very good load balancing and fault tolerance properties.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130114887","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}
引用次数: 7
Enhancing broadcast operations in ad hoc networks with two-hop connected dominating sets 利用两跳连接支配集增强自组织网络中的广播操作
M. Spohn, J. Garcia-Luna-Aceves
{"title":"Enhancing broadcast operations in ad hoc networks with two-hop connected dominating sets","authors":"M. Spohn, J. Garcia-Luna-Aceves","doi":"10.1109/MAHSS.2004.1392202","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392202","url":null,"abstract":"We introduce the three-hop horizon pruning (THP) algorithm to make broadcast operations more efficient in ad hoc networks using contention-based MAC protocols. THP builds a two-hop connected dominating set (TCDS) of the network, which is a set of nodes such that every node in the network is within two hops from some node in the dominating set. Efficiency of broadcast operations is attained by implementing forwarding schemes that take advantage of a TCDS. More specifically, every node provides its one-hop neighbors with a list specifying one or more tuples, each with the identifier of a one-hop neighbor and a bit indicating if that neighbor dominates any two-hop neighbor. To forward a broadcast packet, a node tries to obtain the smallest subset of forwarders, which are one-hop neighbors that use some of the node's two-hop neighbors to reach any node that is three hops away. After such a selection of forwarders, the node broadcasts its packet with a header specifying the list of forwarders, and each forwarder in turn repeats the process.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134157710","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}
引用次数: 17
Selective backbone construction for topology control in ad hoc networks 面向自组网拓扑控制的选择性骨干结构
Haitao Liu, Rajiv Gupta
{"title":"Selective backbone construction for topology control in ad hoc networks","authors":"Haitao Liu, Rajiv Gupta","doi":"10.1109/MAHSS.2004.1392069","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392069","url":null,"abstract":"A key step in controlling topology in ad hoc networks is the construction of the backbone which is then used to transfer data. Nodes that are not part of the backbone can then go to sleep to save energy and increase the lifetime of the network. Centralized backbone construction algorithms give better performance but incur high communication overhead, while localized algorithms lack sufficient topology information needed to construct efficient backbones. We present selective backbone construction (SBC) which starts by selecting a small number of seed nodes in the backbone and then completes its construction by making a sweep of the network spreading outwards from the seed nodes. During the latter process, topology information is transferred to allow better coordinator selection decisions. We compared SBC with other power-saving protocols in a variety of tests featuring different mobility levels, traffic patterns, and node densities. Our experiments show that SBC is more efficient in saving energy and extending network life while providing satisfactory network performance when compared with 802.11, 802.11 PSM, and GAF.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123566041","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}
引用次数: 29
An adaptive and fault-tolerant gateway assignment in sensor networks 传感器网络中的自适应容错网关分配
W. Su, Sung-Ju Lee
{"title":"An adaptive and fault-tolerant gateway assignment in sensor networks","authors":"W. Su, Sung-Ju Lee","doi":"10.1109/MAHSS.2004.1392213","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392213","url":null,"abstract":"Gateway nodes are important elements in a sensor network since they provide the ability to establish long-range reach-back communication in order to retrieve critical data to remote locations. The gateways are however prone to failures just like any sensor nodes, and they consume significantly more energy since they transmit over longer distances compared with sensor-to-sensor links. We introduce an adaptive and fault-tolerant method for gateway assignment in sensor networks. Our approach is fully distributed and achieves the following objectives: (i) it allows surviving gateways to recover for other failed gateways; (ii) it distributes energy usage and traffic load between several gateway nodes within the sensor network. Each gateway adaptively controls its region of influence based on local conditions such as remaining energy level and traffic load. Our methodology was evaluated via simulation using a network model containing 400 sensor nodes with virtual targets. The simulation results indicate that our scheme is robust to gateway failures. Moreover, our scheme successfully balances the energy consumption and traffic load among the gateways.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122381786","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}
引用次数: 6
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信