IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.最新文献_第2页

IEEE 802.11 DCF based MAC protocols for multiple beam antennas and their limitations 基于IEEE 802.11 DCF的多波束天线MAC协议及其局限性

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542833

V. Jain, Anurag Gupta, Dhananjay Lal, D. Agrawal

引用次数: 17

Multicasting in ad hoc networks in the context of multiple channels and multiple interfaces 多通道和多接口环境下的自组织网络组播

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542768

M. Spohn, J. Garcia-Luna-Aceves

{"title":"Multicasting in ad hoc networks in the context of multiple channels and multiple interfaces","authors":"M. Spohn, J. Garcia-Luna-Aceves","doi":"10.1109/MAHSS.2005.1542768","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542768","url":null,"abstract":"Multicast routing protocols based on shared trees employ one or more rendezvous points (usually called cores) for coordination. To address fault tolerance in case of core failure, multiple cores can be deployed. The location of cores is crucial for the performance of the protocol. In this context, the problem of finding the location for the cores is similar to the (k, r)-predominating set problem, (k, r)-DS, in graph theory. That is, (k, r)-DS is defined as the problem of selecting a subset of nodes D such that the remaining nodes are within distance r from at least k nodes in D. In mobile ad hoc networks (MANETs), finding the location of cores should be computed distributively, because the topology may change frequently. We present a distributed solution to the (k, r)-DS problem, named DKR, which is used for core selection in a novel multicast protocol named core hierarchical election for multicasting in ad hoc networks (CHEMA). CHEMA is designed to operate in the context of multiple channels and multiple interfaces. One interface is dedicated for the communication among cores and members, using a non-interfering channel. The performance of CHEMA is compared against one of the best performing multicast protocols to date. CHEMA is shown to perform better in all scenarios considered","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"77 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126021846","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}

引用次数: 3

Iterative local solutions for connected dominating set in ad hoc wireless networks 自组织无线网络中连通支配集的迭代局部解

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542847

Jie Wu, Fei Dai, Shuhui Yang

{"title":"Iterative local solutions for connected dominating set in ad hoc wireless networks","authors":"Jie Wu, Fei Dai, Shuhui Yang","doi":"10.1109/MAHSS.2005.1542847","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542847","url":null,"abstract":"We propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs). This approach uses an iterative application of a selected local solution. Each application of the local solution enhances the result obtained from the previous iteration, but each is based on a different node priority scheme. Then, we integrate this iterative process into the process for handling dynamic network topology and propose two extensions: cyclic iterative local solution (CILS) and seamless iterative local solution (SILS). CILS offers a natural extension of ILS to the dynamic environment, but suffers from broken CDS and non-adaptiveness. With a novel use of a monotonically increasing sequence number for dynamic node priority, SILS offers an extension with the desirable properties of correctness, progressiveness, locality, and seamlessness. Extensive simulations are conducted to evaluate the effectiveness of the proposed approach in both static and dynamic environments","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128338688","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}

引用次数: 24

An efficient key management scheme in hierarchical sensor networks 一种有效的分层传感器网络密钥管理方案

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542880

Xiao Chen, J. Drissi

引用次数: 27

A study of safety applications in vehicular networks 车辆网络安全应用研究

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542781

C. Merlin, W. Heinzelman

引用次数: 25

Authenticated flooding in large-scale sensor networks 大规模传感器网络中的身份验证洪水

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542841

Ju-Hyung Son, Haiyun Luo, S. Seo

{"title":"Authenticated flooding in large-scale sensor networks","authors":"Ju-Hyung Son, Haiyun Luo, S. Seo","doi":"10.1109/MAHSS.2005.1542841","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542841","url":null,"abstract":"Two asymmetric mechanisms are often employed in large-scale systems to achieve scalable and efficient authenticated broadcast. However, cryptographic asymmetry based on public-key schemes is computationally expensive, while time asymmetry based on delayed-key release requires time synchronization cross the entire network and temporal buffering of messages at receivers. Neither approach is suitable for large-scale sensor networks composed of computation and storage constrained low-end sensor nodes. In this paper, we propose novel flooding authentication mechanism based on our \"information asymmetry\" model. Our design is built on top of symmetric cryptography for computation efficiency, and leverages the asymmetric key distribution between the sink and sensor nodes. Through intensive analysis we demonstrate optimized tradeoff between the resilience to compromised sensor nodes and the scalability to system size through space-efficient bloom filters as the authenticator. With a novel \"false negative\" tuning knob introduced in the construction of bloom filter, we show that the scalability of the authentication primitive can be greatly improved at the cost of small controlled degradation of security, therefore rendering a practical authenticated flooding for large-scale sensor networks","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123164146","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

Extended energy model for the low rate WPAN 低速率WPAN的扩展能量模型

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542815

I. Howitt, Rogelio Neto, Jing Wang, J. Conrad

引用次数: 37

On multiple point coverage in wireless sensor networks 无线传感器网络中的多点覆盖

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542868

Shuhui Yang, Fei Dai, M. Cardei, Jie Wu

引用次数: 73

Energy-efficient, application-aware medium access for sensor networks 用于传感器网络的节能、应用感知介质访问

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542852

V. Rajendran, J. Garcia-Luna-Aceves, K. Obraczka

{"title":"Energy-efficient, application-aware medium access for sensor networks","authors":"V. Rajendran, J. Garcia-Luna-Aceves, K. Obraczka","doi":"10.1109/MAHSS.2005.1542852","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542852","url":null,"abstract":"We introduce FLAMA (flow-aware medium access), an energy-efficient medium-access control (MAC) protocol designed for wireless sensor networks. FLAMA achieves energy efficiency by preventing idle listening, data collisions and transmissions to a node that is not ready to receive packets. It adapts medium access schedules to the traffic flows exhibited by the application. FLAMA is simple enough so that it can be run by nodes with limited processing, memory, communication, and power capabilities. We evaluate the performance of FLAMA through simulations and test-bed experimentation. Simulation results indicate that, in terms of reliability, queuing delay and energy savings, FLAMA outperforms TRAMA, the first traffic-adaptive, schedule-based MAC proposed for sensor networks, and S-MAC, a contention-based energy-efficient MAC. FLAMA achieves significantly smaller delays (up to 75 times) when compared to TRAMA with significant improvement in energy savings and reliability, demonstrating the importance of application awareness in medium access scheduling. Our simulation and test-bed results show that FLAMA achieves better end-to-end reliability with significant energy savings compared to S-MAC","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131832540","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}

引用次数: 167

Distributed data aggregation in sensor networks by regression based compression 基于回归压缩的传感器网络分布式数据聚合

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542811

T. Banerjee, K. Chowdhury, D. Agrawal

引用次数: 21