Digital Communications and Networks最新文献_第7页

Sensor Networks with Decentralized Binary Detection: Clustering and Lifetime 具有去中心化二值检测的传感器网络:聚类和寿命

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288525

G. Ferrari, M. Martalò

引用次数: 0

Mobility Metrics for Adaptive Routing 自适应路由的移动性度量

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288564

L. Qin, T. Kunz

引用次数: 3

Topology Discovering Mechanism for Power Saving in Ad-hoc Wireless Networks 自组织无线网络节能的拓扑发现机制

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288581

A. Zabian

引用次数: 2

Security Services in Wireless Sensor Networks Using Sparse Random Coding 基于稀疏随机编码的无线传感器网络安全服务

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288407

F. Delgosha, Erman Ayday, K. Chan, F. Fekri

{"title":"Security Services in Wireless Sensor Networks Using Sparse Random Coding","authors":"F. Delgosha, Erman Ayday, K. Chan, F. Fekri","doi":"10.1109/SAHCN.2006.288407","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288407","url":null,"abstract":"The task of providing security services for wireless sensor networks is not trivial due to the resource constraints of the sensor nodes. An adversary may launch a wide range of attacks including eavesdropping, message forgery, packet dropping, and noise injection. In this paper, we propose random coding security (RCS) that provides protection against all the aforementioned attacks. For this purpose, the proposed protocol makes extensive use of node collaboration and data redundancy. Moreover, using location information, we both localize adversarial activities to the area under attack and enhance routing the data toward the sink. The objectives of using the novel idea of sparse random coding in RCS are twofold. First, every node generates correlated data by calculating random linear combinations of the received packets. Hence, the availability of the data at the receiver is guaranteed with a high probability. The second advantage is the feasibility of implementing the RCS in the real case scenario in which the communication media between the sensors is usually modeled as the erasure channel. The existing protocols cannot be trivially modified to suit this realistic situation. In the overall, RCS provides many security services with computation and communication overheads comparable with other schemes","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"57 1","pages":"40-49"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77037085","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

Clustering Ad Hoc Networks: Schemes and Classifications 聚类自组织网络:方案和分类

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288583

D. Wei, A. Chan

引用次数: 78

Optimal Worst-Case Coverage of Directional Field-of-View Sensor Networks 定向视场传感器网络的最优最坏情况覆盖

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288438

Jacob Adriaens, S. Megerian, M. Potkonjak

{"title":"Optimal Worst-Case Coverage of Directional Field-of-View Sensor Networks","authors":"Jacob Adriaens, S. Megerian, M. Potkonjak","doi":"10.1109/SAHCN.2006.288438","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288438","url":null,"abstract":"Sensor coverage is a fundamental sensor networking design and use issue that in general tries to answer the questions about the quality of sensing (surveillance) that a particular sensor network provides. Although isotropic sensor models and coverage formulations have been studied and analyzed in great depth recently, the obtained results do not easily extend to, and address the coverage of directional and field-of-view sensors such as imagers and video cameras. In this paper, we present an optimal polynomial time algorithm for computing the worst-case breach coverage in sensor networks that are comprised of directional \"field-of-view\" (FOV) sensors. Given a region covered by video cameras, a direct application of the presented algorithm is to compute \"breach\", which is defined as the maximal distance that any hostile target can maintain from the sensors while traversing through the region. Breach translates to \"worst-case coverage\" by assuming that in general, targets are more likely to be detected and observed when they are closer to the sensors (while in the field of view). The approach is amenable to the inclusion of any sensor detection model that is either independent of, or inversely proportional to distance from the targets. Although for the sake of discussion we mainly focus on square fields and model the sensor FOV as an isosceles triangle, we also discuss how the algorithm can trivially be extended to deal with arbitrary polygonal field boundaries and sensor FOVs, even in the presence of rigid obstacles. We also present several simulation-based studies of the scaling issues in such coverage problems and analyze the statistical properties of breach and its sensitivity to node density, locations, and orientations. A simple grid-based approximation approach is also analyzed for comparison and validation of the implementation","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"3 1","pages":"336-345"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74976411","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}

引用次数: 95

Reducing the Computational Cost of Bayesian Indoor Positioning Systems 降低贝叶斯室内定位系统的计算成本

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288512

Konstantinos Kleisouris, R. Martin

{"title":"Reducing the Computational Cost of Bayesian Indoor Positioning Systems","authors":"Konstantinos Kleisouris, R. Martin","doi":"10.1109/SAHCN.2006.288512","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288512","url":null,"abstract":"In this work we show how to reduce the computational cost of using Bayesian networks for localization. We investigate a range of Monte Carlo sampling strategies, including Gibbs and Metropolis. We found that for our Gibbs samplers, most of the time is spent in slice sampling. Moreover, our results show that although uniform sampling over the entire domain suffers occasional rejections, it has a much lower overall computational cost than approaches that carefully avoid rejections. The key reason for this efficiency is the flatness of the full conditionals in our localization networks. Our sampling technique is also attractive because it does not require extensive tuning to achieve good performance, unlike the Metropolis samplers. We demonstrate that our whole domain sampling technique converges accurately with low latency. On commodity hardware our sampler localizes up to 10 points in less than half a second, which is over 10 times faster than a common general-purpose Bayesian sampler. Our sampler also scales well, localizing 51 objects with no location information in the training set in less than 6 seconds. Finally, we present an analytic model that describes the number of evaluations per variable using slice sampling. The model allows us to analytically determine how flat a distribution should be so that whole domain sampling is computationally more efficient when compared to other methods","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"91 1","pages":"555-564"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73651512","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

Topology Control to Simultaneously Achieve Near-Optimal Node Degree and Low Path Stretch in Ad hoc Networks 在Ad hoc网络中同时实现近最优节点度和低路径拉伸的拓扑控制

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288499

Ece Gelal, G. Jakllari, S. Krishnamurthy, N. Young

{"title":"Topology Control to Simultaneously Achieve Near-Optimal Node Degree and Low Path Stretch in Ad hoc Networks","authors":"Ece Gelal, G. Jakllari, S. Krishnamurthy, N. Young","doi":"10.1109/SAHCN.2006.288499","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288499","url":null,"abstract":"Our objective in this paper is to design topology control algorithms such that (i) nodes have low degree and (ii) paths in the network have few hops. Low node degree is desirable in networks equipped with smart antennas and to reduce access contention. Short paths are desirable for minimizing communication delays and for better robustness to channel impairments and to mobility. Given any arbitrary unit-disc graph G representing all feasible links, our algorithms find a sparse subgraph G' having a maximum node degree of six and, for each pair of vertices u, v, having hopsG'(u, v) = O(hopsG(u,v) + logDelta), where Delta is the maximum node degree in G and hops G(u, v) denotes the shortest path length from u to v in G. This result is near-optimal: (i) there is a connected UDG G in which no connected subgraph has degree less than five, and (ii) for any graph G, any bounded-degree subgraph G' must have hopsG'(u, v) = Omega(hopsG(u, v) + logDelta) for some u, v. Our distributed algorithm scales, preserves link symmetry, does not need node synchronization, and requires only O(n) messages. We perform extensive simulations that quantify the performance of our algorithm in realistic scenarios","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"30 1","pages":"431-439"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82811246","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}

引用次数: 11

Dynamic Hybrid Multi Routing Protocol For Ad Hoc Wireless Network Ad Hoc无线网络的动态混合多路由协议

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288565

Chaorong Peng, Chang Wen Chen

引用次数: 5

Bandwidth Consumption for Providing Fair Internet Access in Wireless Mesh Networks 在无线网状网络中提供公平互联网接入的带宽消耗

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288555

T. Scherer, T. Engel

引用次数: 6