2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems最新文献_第6页

PriorityCast: Efficient and Time-Critical Decision Making in First Responder Ad-Hoc Networks PriorityCast:第一响应者自组织网络中高效和时间关键的决策制定

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-09 DOI: 10.1109/MOBHOC.2006.278563

V. Bhandari, Indranil Gupta

{"title":"PriorityCast: Efficient and Time-Critical Decision Making in First Responder Ad-Hoc Networks","authors":"V. Bhandari, Indranil Gupta","doi":"10.1109/MOBHOC.2006.278563","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278563","url":null,"abstract":"First responders equipped with PDAs in disaster recovery scenarios may need to make decisions that select the best out of multiple options. Each of these options may originate from different parts of the network (e.g., risk assessment of various entrances to a collapsed building). Yet the highest priority option needs to be spread to all nodes within a time deadline and in an efficient manner, i.e., by preventing lower priority options from spreading too far. We define this problem as PriorityCast, and study a wide range of possible solutions. The emphasis is on solutions that are scalable, and resilient to unreliability and unpredictability. Our basic scheme, called flood and suppress, suppresses lower priority options from being forwarded by a node that has seen other higher priority options. We then augment this basic scheme using probabilistic approaches, background gossiping techniques, and delayed propagation. We quantify the impact of using various combinations of the mentioned approaches, by presenting mathematical analysis for the flood and suppress protocol, and evaluating a suite of composable PriorityCast protocols via simulations. The results provide insight into the feasibility and scalability of this class of solutions. While the focus of this paper is on the PriorityCast problem, these solutions are also relevant as potential building blocks for other distributed operations in ad-hoc networks","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115412811","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}

引用次数: 1

Two Standards for Rigorous MANET Routing Protocol Evaluation MANET路由协议严格评估的两个标准

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-09 DOI: 10.1109/MOBHOC.2006.278564

S. Kurkowski, T. Camp, W. Navidi

{"title":"Two Standards for Rigorous MANET Routing Protocol Evaluation","authors":"S. Kurkowski, T. Camp, W. Navidi","doi":"10.1109/MOBHOC.2006.278564","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278564","url":null,"abstract":"In this paper we look at issues with the simulation of generic mobile ad hoc network (MANET) routing protocols. MANET simulation-based research is an involved process driven by the scenarios used in the simulations. Scenarios must be properly constructed in order to be effective in evaluating the performance of generic MANET routing protocols. For example, in scenarios with a low average hop count, little routing is needed, and poor protocols might appear successful. On the other hand, in scenarios with a high degree of partitioning, many pairs of nodes have no usable route between them, and good protocols might appear unsuccessful. Many standards are needed to establish rigorous evaluations for MANET simulation research, from simulation scenario standards to random number generator standards to results analysis standards. We do not attempt to standardize all of these areas. We do, however, propose two standards that should be employed to ensure long routes are available and used in the evaluation of generic MANET routing protocols. That is, we qualify a simulation scenario to be used for rigorous generic MANET routing protocol evaluation, based on the scenario's average shortest-path hop count and its amount of network partitioning. We construct several simulation scenarios that meet our two standards, using example metric values for our two standards. We note that our method can be modified to generate scenarios with different metric values that a researcher finds appropriate","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116830741","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}

引用次数: 35

Simple and Effective Carrier Sensing Adaptation for Multi Rate Ad-Hoc MESH Networks 简单有效的多速率Ad-Hoc MESH网络载波感知自适应

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-09 DOI: 10.1109/MOBHOC.2006.278653

Hui Ma, Sumit Roy

引用次数: 12

Cross-layer Optimal Decision Policies for Spatial Diversity Forwarding in Wireless Ad Hoc Networks 无线Ad Hoc网络空间分集转发的跨层最优决策策略

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-09 DOI: 10.1109/MOBHOC.2006.278552

J. Ai, A. Abouzeid, Z. Ye

{"title":"Cross-layer Optimal Decision Policies for Spatial Diversity Forwarding in Wireless Ad Hoc Networks","authors":"J. Ai, A. Abouzeid, Z. Ye","doi":"10.1109/MOBHOC.2006.278552","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278552","url":null,"abstract":"In order to adapt to the time-varying nature of wireless channels, various channel-adaptive schemes have been proposed to exploit inherent spatial diversity in wireless ad hoc networks where there are usually alternate forwarding nodes available at a given forwarding node. However, existing schemes along this line are designed based on heuristics, implying room for performance enhancement. Thereby, to seek a theoretical foundation for improving spatial diversity gain, we formulate the selection of the next-hop relay as a sequential decision problem and derive a general \"optimal stopping relaying (OSR)\" framework for designing such spatial-diversity schemes. As a particular example, assuming Rayleigh fading channels, we implement an OSR strategy to optimize information efficiency (IE) in a protocol stack consisting of greedy perimeter stateless routing (GPSR) and IEEE 802.11 MAC protocols. We present an analysis of the algorithm for a single node. In addition, we perform extensive simulations (using QualNet) to evaluate the end-to-end performance of the proposed forwarding strategy. The results demonstrate the superiority of OSR over other existing schemes","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117215741","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}

引用次数: 12

Dynamic Authentication-Key Re-assignment for Reliable Report Delivery 动态认证-密钥重新分配可靠的报告交付

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-09 DOI: 10.1109/MOBHOC.2006.278587

Weijia Li, Youtao Zhang, Jun Yang

引用次数: 2

Providing Resource Oriented Security Solution for Heterogeneous Clustered Sensor Networks 面向资源的异构集群传感器网络安全解决方案

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-09 DOI: 10.1109/MOBHOC.2006.278642

Xiaomei Cao, Guihai Chen, Bo Yu

引用次数: 1

Localized Hybrid Data Delivery Scheme using K-hop Clustering Algorithm in Ad Hoc Networks 基于K-hop聚类算法的Ad Hoc网络局部混合数据传输方案

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-09 DOI: 10.1109/MOBHOC.2006.278631

A. Derhab, N. Badache

引用次数: 8

Temporal Analysis of Routing Activity for Anomaly Detection in Ad hoc Networks Ad hoc网络中用于异常检测的路由活动时间分析

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-09 DOI: 10.1109/MOBHOC.2006.278595

Haitao Liu, Rajiv Gupta

引用次数: 14

Challenges of Secure Routing in MANETs: A Simulative Approach using AODV-SEC manet中安全路由的挑战:一种使用AODV-SEC的模拟方法

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-09 DOI: 10.1109/MOBHOC.2006.278589

S. Eichler, Christian Roman

引用次数: 63

S2RP: a Secure and Scalable Rekeying Protocol for Wireless Sensor Networks S2RP:一种安全且可扩展的无线传感器网络密钥交换协议

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems Pub Date : 2006-10-09 DOI: 10.1109/MOBHOC.2006.278586

G. Dini, I. M. Savino

引用次数: 43