发布求助
文献互助 智能选刊 最新文献

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems最新文献

筛选
英文 中文
Clustering Mesh-Like Wireless Sensor Networks with an Energy-Efficient Scheme (an Extended Abstract) 基于节能方案的类网格无线传感器网络聚类(扩展摘要)
2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-01 DOI: 10.1504/IJSNET.2010.033203
Dajin Wang
{"title":"Clustering Mesh-Like Wireless Sensor Networks with an Energy-Efficient Scheme (an Extended Abstract)","authors":"Dajin Wang","doi":"10.1504/IJSNET.2010.033203","DOIUrl":"https://doi.org/10.1504/IJSNET.2010.033203","url":null,"abstract":"In this paper the WSN model called COSMOS (cluster-based heterogeneous model for sensor networks) is described. A WSN model aiming at large size and scalability, COSMOS features a cluster-based, hierarchical network architecture. It comprises of a large number of low power, low cost sensors, presumably distributed in a large physical environment. The clusterheads of the whole WSN form a mesh-like topology which is equipped with more powerful transceiver that can communicate with any node within the cluster","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123682913","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}
引用次数: 21
Light-weight Detection of Spoofing Attacks in Wireless Networks 无线网络中欺骗攻击的轻量级检测
2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-01 DOI: 10.1109/MOBHOC.2006.278663
Qing Li, W. Trappe
{"title":"Light-weight Detection of Spoofing Attacks in Wireless Networks","authors":"Qing Li, W. Trappe","doi":"10.1109/MOBHOC.2006.278663","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278663","url":null,"abstract":"Many wireless networks are susceptible to spoofing attacks, whereby an adversary imitates the network identifiers of legitimate devices. Conventionally, assuring the identity of the communicator and thereby detecting an adversarial presence is performed via device authentication. Unfortunately, full-scale authentication is not always desirable as it requires key management and more extensive computations. In this paper we argue that it is desirable to have a functionality complementary to traditional cryptographic authentication that can detect device spoofing with little or no dependency on cryptographic material. To accomplish this, we introduce the notion of forge-resistant relationships associated with transmitted packets, as well as forge-resistant consistency checks, which allow other network entities to detect anomalous activity. We then provide two practical examples of forge-resistant relationships for detecting anomalous network activity: we explore the use of a supplemental identifier field that evolves in time according to a reverse one-way function chain, and the use of signal strength readings for source discrimination. We validate the usefulness of these methods for anomalous \"spoofed\" traffic scenarios involving multiple sources sharing the same MAC address through experiments conducted on the ORBIT wireless testbed","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131029114","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
RGP: Active Route Guiding Protocol for Wireless Sensor Networks with Obstacles 有障碍物无线传感器网络的主动路由引导协议
2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-01 DOI: 10.1109/MOBHOC.2006.278576
Chih-Yung Chang, K. Shih, Shih-Chieh Lee, Sheng-Wen Chang
{"title":"RGP: Active Route Guiding Protocol for Wireless Sensor Networks with Obstacles","authors":"Chih-Yung Chang, K. Shih, Shih-Chieh Lee, Sheng-Wen Chang","doi":"10.1109/MOBHOC.2006.278576","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278576","url":null,"abstract":"In wireless sensor networks, a geographic region without functionality of sensing and communication can be generally treated as an obstacle, which significantly impacts the performance of existing location-based routing. In a WSN, an obstacle can be dynamically formed due to unbalanced deployment, failure or power exhaustion of sensors, animus interference, or physical obstacles such as mountains or buildings. This paper proposes a novel algorithm, namely RGP, to enable the existing location-based routing protocols resisting obstacles. Applying the proposed RGP, border nodes that surround the obstacles will actively establish a forbidden region for concave obstacles and make the obstacle information transparent. Then packets will be guided to overcome the obstacle and move along the shortest path from the encountered border node to the sink node. Simulation results show that RGP creates low overhead and significantly reduces the average route length and therefore improves the energy consumption and end-to-end delay for a wireless sensor network with obstacles","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123701023","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}
引用次数: 21
A Dual Approach for The Worst-Case-Coverage Deployment Problem in Ad-Hoc Wireless Sensor Networks Ad-Hoc无线传感器网络中最坏情况覆盖部署问题的双重方法
2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-01 DOI: 10.1109/MOBHOC.2006.278583
Rung-Hung Gau, Yi Peng
{"title":"A Dual Approach for The Worst-Case-Coverage Deployment Problem in Ad-Hoc Wireless Sensor Networks","authors":"Rung-Hung Gau, Yi Peng","doi":"10.1109/MOBHOC.2006.278583","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278583","url":null,"abstract":"In this paper, we propose and evaluate algorithms for solving the worst-case-coverage deployment problem in ad-hoc wireless sensor net works. The worst-case-coverage deployment problem is to deploy additional sensors in the wireless sensor field to optimize the worst-case coverage. We derive a duality theorem that reveals the close relation between the maximum breach path and the minimum Delaunay cut. The duality theorem is similar to the well-known max-flow-mm-cut theorem in the field of network optimization. The major difference lies in the fact that the object function we study in this paper is nonlinear rather than linear. Based on the duality theorem, we propose an efficient dual algorithm to solve the worst- case-coverage deployment problem. In addition, we propose a genetic algorithm for deploying a number of additional sensors simultaneously. We use analytical proofs and simulation results to justify the usage of the proposed approaches","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115814424","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}
引用次数: 15
Network-centric Actuation Control in Sensor/Actuator Networks based on Bio-inspired Technologies 基于仿生技术的传感器/执行器网络中以网络为中心的驱动控制
2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-01 DOI: 10.1109/MOBHOC.2006.278633
F. Dressler
{"title":"Network-centric Actuation Control in Sensor/Actuator Networks based on Bio-inspired Technologies","authors":"F. Dressler","doi":"10.1109/MOBHOC.2006.278633","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278633","url":null,"abstract":"Self-organization mechanisms have been developed to efficiently operate networked embedded systems. Special focus was given to wireless sensor networks (WSN) and sensor/actuator networks (SANET). Looking at the most pressing issues in such networks, the limited resources and the huge amount of interoperating nodes, the proposed solutions primarily intend to solve the scalability problems by reducing the overhead in data communication. Well-known examples are data-centric routing approaches and probabilistic techniques. In this paper, we intend to go one step further. We are about to also move the operation and control for WSN and SANET into the network. Inspired by the operation of complex biological systems such as the cellular information exchange, we propose a network-centric approach. Our method is based on three concepts: data-centric operation, specific reaction on received data, and simple local behavior control using a policy-based state machine. In summary, these mechanisms lead to an emergent system behavior that allows to control the operation of even large-scale sensor/actuator networks","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116563395","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}
引用次数: 14
Mobility and Density Self-Adaptive Routing Strategies in Ad Hoc Networks Ad Hoc网络中的移动性和密度自适应路由策略
2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-01 DOI: 10.1109/MOBHOC.2006.278634
F. Jaddi, B. Paillassa
{"title":"Mobility and Density Self-Adaptive Routing Strategies in Ad Hoc Networks","authors":"F. Jaddi, B. Paillassa","doi":"10.1109/MOBHOC.2006.278634","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278634","url":null,"abstract":"Network conditions suddenly and unpredictably vary in wireless ad hoc networks. Ad hoc protocols should adjust their behavior to network dynamics in order to improve their performance. Hierarchical routing makes ad hoc routing protocols more scalable with respect to the network size while flat protocols are well adapted to small networks. Therefore, a main routing adaptation is to switch between a Structure-Less routing to a Structure-Extended one according to network conditions. These network conditions are expressed in terms of node mobility and node density. This paper presents a framework to dynamically adapt the routing mode. Different adaptation metrics are discussed and the example of the cluster source routing extension combined to the dynamic source routing protocol illustrates the routing adaptation strategy","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"67 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131922176","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
Load Balance and Energy Efficient Data Gathering in Wireless Sensor Networks 无线传感器网络中的负载平衡和节能数据采集
2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-01 DOI: 10.1002/wcm.492
D. Mandala, Xiaojiang Du, Fei Dai, Chao You
{"title":"Load Balance and Energy Efficient Data Gathering in Wireless Sensor Networks","authors":"D. Mandala, Xiaojiang Du, Fei Dai, Chao You","doi":"10.1002/wcm.492","DOIUrl":"https://doi.org/10.1002/wcm.492","url":null,"abstract":"Many data gathering protocols for wireless sensor networks use clustering technology for prolonging the network lifetime. Cluster-based protocols reduce the total energy consumption via data aggregation, and balance energy consumption via clusterhead rotation. However, most existing protocols focus on load balance within each cluster. The energy consumption of the entire network is still unbalanced, and this uneven energy dissipation can significantly reduce the network lifetime. We propose an even energy dissipation protocol (EEDP) for efficient cluster-based data gathering in wireless sensor networks. In EEDP, the sensor data are forwarded to the base station via multiple chains of clusterheads. Each chain uses a rotation scheme to balance energy consumption among clusterheads and avoid the formation of a hot spot. We developed efficient algorithms to organize clusterheads into multiple chains, such that the traffic load is evenly distributed among different chains. Analysis and simulation results show that EEDP achieves better load balance than several existing protocols and significantly increases network lifetime","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134287105","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}
引用次数: 62
Smart Gossip: An Adaptive Gossip-based Broadcasting Service for Sensor Networks 智能八卦:一种基于自适应八卦的传感器网络广播服务
2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-01 DOI: 10.1109/MOBHOC.2006.278671
Pradeep Kyasanur, Romit Roy Choudhury, Indranil Gupta
{"title":"Smart Gossip: An Adaptive Gossip-based Broadcasting Service for Sensor Networks","authors":"Pradeep Kyasanur, Romit Roy Choudhury, Indranil Gupta","doi":"10.1109/MOBHOC.2006.278671","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278671","url":null,"abstract":"A network-wide broadcast service is often used for information dissemination in sensor networks. Sensor networks are typically energy-constrained and prone to failures. In view of these constraints, the broadcast service should minimize energy consumption by reducing redundant transmissions, and be tolerant to frequent node and link failures. We propose \"smart gossip\", a probabilistic protocol that offers a broadcast service with low overheads. Smart gossip automatically and dynamically adapts transmission probabilities based on the underlying network topology. The protocol is capable of coping with wireless losses and unpredictable node failures that affect network connectivity over time. The resulting protocol is completely decentralized. We present thorough experimental results to evaluate our \"smart gossip\" proposal, and demonstrate its benefits over existing protocols","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115119683","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}
引用次数: 191
Localization Algorithm using Expected Hop Progress in Wireless Sensor Networks 基于期望跳数的无线传感器网络定位算法
2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-01 DOI: 10.1109/MOBHOC.2006.278574
Yun Wang, Xiaodong Wang, Demin Wang, D. Agrawal
{"title":"Localization Algorithm using Expected Hop Progress in Wireless Sensor Networks","authors":"Yun Wang, Xiaodong Wang, Demin Wang, D. Agrawal","doi":"10.1109/MOBHOC.2006.278574","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278574","url":null,"abstract":"In this paper, we propose a novel localization algorithm using expected hop progress (LAEP) to predict the positions of sensor nodes in WSNs. Our algorithm is based on a hop progress analytical model for a given network topology. By deriving relationship between node connectivity and expected-hop progress from the model, the distance between any two nodes can be accurately computed. As the distance estimation is a key issue in positioning system of WSNs, our expected-hop progress based localization algorithm also achieves reasonable performance in anchor-based WSNs with very few anchors. In addition, we considered the impact of deterministic anchor placement on the algorithm performance when the sensors are random deployed. Both grid and triangular placement of anchor nodes have been examined in this paper. Simulation results are seen to be in good agreement with the theoretical analysis and substantiate the validity of our proposed scheme LAEP","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116016036","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}
引用次数: 23
Dropped Edges and Faces' Size in Gabriel and Relative Neighborhood Graphs 加布里埃尔图和相对邻域图中的掉落边和面大小
2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-01 DOI: 10.1109/MOBHOC.2006.278580
Bratislav Milic, M. Malek
{"title":"Dropped Edges and Faces' Size in Gabriel and Relative Neighborhood Graphs","authors":"Bratislav Milic, M. Malek","doi":"10.1109/MOBHOC.2006.278580","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278580","url":null,"abstract":"We have developed a mathematical model for calculation of expected value of share of edges being dropped while constructing a Gabriel or a relative neighborhood graph starting from a random geometrical graph created by a homogeneous Poisson point process on a plane. The expressions for the expected values of number of faces and face size are derived as well. All expressions are given as functions of deployment configuration. The results are verified through detailed comparison with extensive simulation results. Since Gabriel and relative neighborhood graphs are used for various applications in ad hoc networking we believe that our model simplifies theoretical analysis of functionality and performance of such networks","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122454024","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}
引用次数: 10
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信