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

筛选
英文 中文
Robustness of network-wide broadcasts in MANETs manet中全网广播的鲁棒性
IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542796
Paul C. Rogers, N. Abu-Ghazaleh
{"title":"Robustness of network-wide broadcasts in MANETs","authors":"Paul C. Rogers, N. Abu-Ghazaleh","doi":"10.1109/MAHSS.2005.1542796","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542796","url":null,"abstract":"Network-wide broadcast (NWB) is a common operation in mobile ad hoc networks (MANETs), which are used to discover routes in routing protocols and to disseminate information in group communication operations. NWB is commonly performed via flooding, which has been shown to be expensive in dense MANETs due to its high redundancy. Existing NWB algorithms target reducing the overhead of NWB operations. In this work, we target another problem that can substantially impact the success of NWBs: since MAC level broadcasts are unreliable, it is possible for critical rebroadcasts to be lost, leading to a significant drop in the node coverage. This is especially true under heavy load and in sparse topologies. We show that the techniques that target reducing the overhead of flooding reduce its inherent redundancy and harm its reliability","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"1 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":"132026038","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
SERAN: a semi random protocol solution for clustered wireless sensor networks SERAN:集群无线传感器网络的半随机协议解决方案
IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542819
A. Bonivento, C. Fischione, A. Sangiovanni-Vincentelli, F. Graziosi, F. Santucci
{"title":"SERAN: a semi random protocol solution for clustered wireless sensor networks","authors":"A. Bonivento, C. Fischione, A. Sangiovanni-Vincentelli, F. Graziosi, F. Santucci","doi":"10.1109/MAHSS.2005.1542819","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542819","url":null,"abstract":"SERAN is a two-layer (routing and MAC) protocol for wireless sensor networks in manufacturing plants. At both layers, SERAN combines a randomized and a deterministic approach. While the randomized component provides robustness over unreliable channels, the deterministic component avoids an explosion of packet collisions and allows our protocol to scale with network size. Our solution is based on a mathematical model that characterizes performance accurately without extensive simulations. SERAN is robust against node failures and clock drifts, supports data aggregation algorithms and is easily implementable in any of the existing hardware platforms. Although SERAN was designed for manufacturing plants applications, it can be used in any type of clustered topology. We consider a representative case study and we present simulation results to show SERAN efficiency","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"115 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":"133398074","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
Improving power save protocols using carrier sensing for dynamic advertisement windows 利用载波感知改进动态广告窗口的节能协议
IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542834
Matthew J. Miller, N. Vaidya
{"title":"Improving power save protocols using carrier sensing for dynamic advertisement windows","authors":"Matthew J. Miller, N. Vaidya","doi":"10.1109/MAHSS.2005.1542834","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542834","url":null,"abstract":"Energy efficient protocols are important in ad hoc networks since battery life for wireless devices is limited. The IEEE 802.11 protocol specifies a simple power save mechanism (PSM) to conserve energy. Packets are advertised for a fixed length of time, known as an advertisement window, at epochs known as beacon intervals. However, the protocol needlessly wastes energy when traffic is relatively light in a network. In this paper, we address this problem by proposing the use of carrier sensing to dynamically adjust the size of the advertisement windows. The adjustment is based on the amount of traffic that needs to be advertised in the current window as opposed to the static window size used by 802.11 PSM. Carrier sensing is used for two different aspects of our protocol. First, carrier sensing is used as an energy efficient method to provide a binary signal which lets neighbors know if a node intends to advertise any packets in the upcoming window. Second, carrier sensing is used as a mechanism for nodes to keep track of whether their neighbors have already stopped listening for advertisements and possibly returned to sleep. Using the ns-2 simulator we show that our techniques can significantly reduce the energy consumption of 802.11 PSM while only slightly increasing latency","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"44 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":"115812685","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
A cross-layer based intrusion detection approach for wireless ad hoc networks 一种基于跨层的无线自组网入侵检测方法
IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542882
Geethapriya Thamilarasu, A. Balasubramanian, S. Mishra, R. Sridhar
{"title":"A cross-layer based intrusion detection approach for wireless ad hoc networks","authors":"Geethapriya Thamilarasu, A. Balasubramanian, S. Mishra, R. Sridhar","doi":"10.1109/MAHSS.2005.1542882","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542882","url":null,"abstract":"Wireless ad-hoc networks are vulnerable to various kinds of security threats and attacks due to relative ease of access to wireless medium and lack of a centralized infrastructure. In this paper, we seek to detect and mitigate the denial of service (DoS) attacks that prevent authorized users from gaining access to the networks. These attacks affect the service availability and connectivity of the wireless networks and hence reduce the network performance. To this end, we propose a novel cross-layer based intrusion detection system (CIDS) to identify the malicious node(s). Exploiting the information available across different layers of the protocol stack by triggering multiple levels of detection, enhances the accuracy of detection. We validate our design through simulations and also demonstrate lower occurrence of false positives","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":"125558598","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}
引用次数: 69
Contributory group key agreement protocols, revisited for mobile ad-hoc groups 贡献组密钥协议协议,重新为移动自组织组
IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542876
M. Manulis
{"title":"Contributory group key agreement protocols, revisited for mobile ad-hoc groups","authors":"M. Manulis","doi":"10.1109/MAHSS.2005.1542876","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542876","url":null,"abstract":"Security of various group-oriented applications for mobile ad-hoc groups requires a group secret shared between all participants. Contributory group key agreement (CGKA) protocols, originally designed for peer groups in localand wide-area wired networks, can also be used in ad-hoc scenarios because of the similar security requirements and trust relationship between participants that excludes any trusted central authority (e.g., a group manager) from the computation of the group key. We revise original protocols from the perspective of the mobile ad-hoc communication, classify mobile ad-hoc groups based on the performance of involved mobile devices, specify trust relationship between participants, propose further optimizations to original protocols to achieve better communication, computation and memory complexities","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"4 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":"129919428","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}
引用次数: 31
PSGR: priority-based stateless geo-routing 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.1542858
Yingqi Xu, Wang-Chien Lee, Jianliang Xu, Gail Mitchell
{"title":"PSGR: priority-based stateless geo-routing in wireless sensor networks","authors":"Yingqi Xu, Wang-Chien Lee, Jianliang Xu, Gail Mitchell","doi":"10.1109/MAHSS.2005.1542858","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542858","url":null,"abstract":"Volunteer forwarding, as an emerging routing idea for large scale, location-aware wireless sensor networks, recently has attracted a significant amount of research attention. However, several critical research issues raised by volunteer forwarding, including priority assignment, acknowledgement collisions and communication voids, have not been well addressed by the existing work. In this paper, we propose a priority-based stateless geo-routing (PSGR) protocol to address these issues. Based on PSGR, sensor nodes are able to locally determine their priority to serve as the next relay node using dynamically estimated network density. This effectively suppresses potential communication collisions without prolonging routing delays. PSGR also overcomes the communication void problem using two alternative stateless schemes, rebroadcast and bypass. We analyze energy consumption and delivery rate of PSGR as functions of transmission range. An extensive performance evaluation has been conducted to compare PSGR with competing protocols, including GeRaf, IGF, GPSR and flooding. Simulation results show that PSGR exhibits superior performance in terms of energy consumption, routing latency and delivery rate, and soundly outperforms all of the compared protocols","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"13 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":"129945043","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}
引用次数: 68
BAM: branch aggregation multicast for wireless sensor networks BAM:用于无线传感器网络的分支聚合组播
IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542820
Akihito Okura, T. Ihara, A. Miura
{"title":"BAM: branch aggregation multicast for wireless sensor networks","authors":"Akihito Okura, T. Ihara, A. Miura","doi":"10.1109/MAHSS.2005.1542820","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542820","url":null,"abstract":"In this paper, we propose a multicast protocol, called BAM: branch aggregation multicast, for wireless sensor networks. The main contribution of BAM is a reduction in the radio communication load, which is a dominant factor of sensor energy consumption. BAM does not use any control packet such as join/leave messages and does not manage multicast groups. BAM is highly compatible with existing wireless sensor protocols, such as routing protocols, MAC protocols, and other kinds of energy efficient protocols. BAM implementation is quite simple and BAM works on various networks even if some sensors are not BAM-capable. BAM is composed of two aggregation techniques. One is single hop aggregation (S-BAM) and the other is multiple paths aggregation (M-BAM). S-BAM aggregates radio transmission within single hop and enables just single transmission to multiple intended receivers. M-BAM aggregates multiple paths into fewer ones and limits the range of radio transmission. S-BAM is designed to reduce redundant communication at every branch and M-BAM is designed to reduce the number of branches. SM-BAM, the combination of S-BAM and M-BAM, can reduce the radio communication load thus enabling energy efficient multicast communication. We evaluated BAM in three ways, qualitative evaluation by theoretical analysis, quantitative evaluation through computer simulations, and experiments using CrossBow's MICA2. Our results show that BAM is a very energy efficient multicast protocol that well supports wireless sensor networks","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"1 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":"131159961","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}
引用次数: 39
Efficient routing protocols for a free space optical sensor network 自由空间光传感器网络的有效路由协议
IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542807
U. N. Okorafor, D. Kundur
{"title":"Efficient routing protocols for a free space optical sensor network","authors":"U. N. Okorafor, D. Kundur","doi":"10.1109/MAHSS.2005.1542807","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542807","url":null,"abstract":"For very low power, high bandwidth applications, free space optical sensor networks (FSOSN) have shown potential. They promise increasing node functionality, lower energy consumption, lower cost and smaller sizes. However, the new optical communication architecture yields new routing challenges. The objective of our paper is to introduce novel routing protocols for FSOSN that take into account the line-of-sight requirement for optical communications. Our network is modeled as a directed hierarchical random sector geometric graph, in which sensors route their data via multi-hop paths, to a powerful base station, through a cluster head. Following the dominant communication pattern in sensor networks, we propose a new efficient routing algorithm for local neighborhood discovery and a base station (up-link and down-link) discovery algorithm. We show that our routing protocols require Olog(n) storage at each node, versus O(n) seen in the literature, and present analytical and simulation results to evaluate the proposed protocols","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"138 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":"134217292","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}
引用次数: 31
Energy efficient data management for wireless sensor networks with data sink failure 具有数据接收器故障的无线传感器网络的节能数据管理
IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542801
Hyunyoung Lee, A. Klappenecker, Kyoungsook Lee, Lan Lin
{"title":"Energy efficient data management for wireless sensor networks with data sink failure","authors":"Hyunyoung Lee, A. Klappenecker, Kyoungsook Lee, Lan Lin","doi":"10.1109/MAHSS.2005.1542801","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542801","url":null,"abstract":"This paper proposes an energy efficient protocol for sensor data management. The protocol employs replicated data sinks to achieve (1) resiliency to data sink failure, and (2) efficiency in storing and retrieving sensor data. A simple address assignment scheme is introduced that partitions the sensor field into cells, where each cell contains one data sink and all sensors that are closest to this data sink. It is shown that this scheme is scalable and resilient against data sink and sensor node failures. Furthermore, the scheme has a reasonably low message complexity and a high energy efficiency","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"73 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":"116544019","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}
引用次数: 20
Mobility and routing management for heterogeneous multi-hop wireless networks 异构多跳无线网络的移动性和路由管理
IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542777
Bin Xie, Anup Kumar, D. Cavalcanti, D. Agrawal, S. Srinivasan
{"title":"Mobility and routing management for heterogeneous multi-hop wireless networks","authors":"Bin Xie, Anup Kumar, D. Cavalcanti, D. Agrawal, S. Srinivasan","doi":"10.1109/MAHSS.2005.1542777","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542777","url":null,"abstract":"This paper proposes a new heterogeneous multi-hop cellular IP (MCIP) network that integrates multi-hop communication with cellular IP. MCIP increases the coverage of the wireless network and improves the network robustness against adverse propagation phenomena by supporting communication in dead zones and areas with poor radio coverage. MCIP includes three components: location management, connection management and route reconfiguration. Location management is responsible for maintaining the location information for mobile stations (MSs) in a local domain. Connection management establishes an initial path for data transmission and a route reconfiguration mechanism is proposed to take advantage of various multi-hop connection alternatives available based on terminal interfaces, network accessibility and topology. Our simulation results show that MCIP performs well in networks of various sizes","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"76 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":"121733501","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}
引用次数: 13
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学术官方微信