检索结果-内蒙古大学图书馆

9th ACM International Symposium on Mobility Management and Wireless Access

作者： Munishwar, Vikram P. Abu-Ghazaleh, Nael B. SUNY Binghamton Binghamton NY USA

ISBN: (纸本)9781450309011

Visual sensor networks (VSNs) are networks made up of a possibly large number of cameras that together monitor an area or targets of interest. In VSNs, camera coverage control is necessary to allow automatic tracking of targets without human intervention, allowing these systems to scale. In this paper, we consider the problem of automatic control of cameras to maximize the number of targets covered. This is an NP-hard problem, and efficient centralized and semi-centralized heuristics exist that provide near-optimal performance. However, such schemes are hard to scale with the size of the network, and thus demand for efficient distributed solutions. The existing distributed approach results in significantly less coverage, compared to the optimal. In this paper, we extend the existing approach by considering inter-dependencies among cameras and target distributions, and show that the proposed techniques significantly improve the performance of the distributed solution.

关键词： Camera sensors Coverage distributed protocol

来源：评论

学校读者我要写书评

暂无评论

Secure Position Verification for Wireless Sensor Networks in Noisy Channels

引用

10th International Conference on Ad-Hoc Networks and Wireless (ADHOC-NOW)

作者： Mandal, Partha Sarathi Ghosh, Anil K. Indian Inst Technol Gauhati 781039 India Indian Stat Inst Kolkata 700108 India

ISBN: (纸本)9783642224492;9783642224508

Position verification in wireless sensor networks (WSNs) is quite tricky in presence of attackers (malicious sensor nodes), who try to break the verification protocol by reporting their incorrect positions (locations) during the verification stage. In the literature of WSNs, most of the existing methods of position verification use trusted verifiers, which are in fact vulnerable to attacks by malicious nodes. They also depend on some distance estimation techniques, which are not accurate in noisy channels (mediums). In this article, we propose a secure position verification scheme for WSNs in noisy channels without relying on any trusted entities. Our verification scheme detects and filters out all malicious nodes from the network with a very high probability.

关键词： distributed protocol Quantiles Location verification Distance estimation 3 sigma limit Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Maximum Metric Spanning Tree Made Byzantine Tolerant

引用

25th International Symposium on distributed Computing (DISC 2011)

作者： Dubois, Swan Masuzawa, Toshimitsu Tixeuil, Sebastien UPMC Sorbonne Univ CNRS REGALLIP6 UMR7606LIP6 Inria F-75252 Paris France Osaka Univ 2-2 Yamadaoka Suita Osaka 5650871 Japan

ISBN: (纸本)9783642240997

Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. This paper focuses on systems that are both self-stabilizing and Byzantine tolerant. We consider the well known problem of constructing a maximum metric tree in this context. Combining these two properties is known to induce many impossibility results. In this paper, we first provide two new impossibility results about the construction of a maximum metric tree in presence of transient and (permanent) Byzantine faults. Then, we propose a new self-stabilizing protocol that provides optimal containment to an arbitrary number of Byzantine faults.

关键词： Byzantine fault distributed protocol Fault tolerance Stabilization Spanning tree construction

来源：评论

学校读者我要写书评

暂无评论

Optimal Topology Design for Dynamic Networks

Optimal Topology Design for Dynamic Networks

引用

IEEE Conference on Decision and Control

作者： Ran Dai Mehran Mesbahi Department of Aeronautics and Astronautics University of Washington Seattle WA

ISBN: (纸本)9781612848006

In this paper, we examine optimization-based methods for designing the network topology when the desired topology should have certain global variational properties, such as minimal power consumption for information exchange links, or supporting fast convergence of consensus-based distributed protocols. We first classify the optimization-based methodology for three distinct categories, namely, for construction of optimal non-geometric networks, time-invariant geometric networks, and time-varying geometric networks. We then proceed to propose optimization-based algorithms for each class of problems that aim to allocate the limited resources, e.g., communication ranges, in the most efficient way while achieving optimal performance. Examples and applications of the developed methodology are also examined.

关键词： dynamic network Network topology distributed protocol Power consumption topology Communication Research information exchange

来源：评论

学校读者我要写书评

暂无评论

Localized Multicast: Efficient and distributed Replica Detection in Large-Scale Sensor Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2010年第7期9卷 913-926页

作者： Zhu, Bo Setia, Sanjeev Jajodia, Sushil Roy, Sankardas Wang, Lingyu Concordia Univ Concordia Inst Informat Syst Engn Montreal PQ H3G 2W1 Canada George Mason Univ Dept Comp Sci Fairfax VA 22030 USA

Due to the poor physical protection of sensor nodes, it is generally assumed that an adversary can capture and compromise a small number of sensors in the network. In a node replication attack, an adversary can take advantage of the credentials of a compromised node to surreptitiously introduce replicas of that node into the network. Without an effective and efficient detection mechanism, these replicas can be used to launch a variety of attacks that undermine many sensor applications and protocols. In this paper, we present a novel distributed approach called Localized Multicast for detecting node replication attacks. The efficiency and security of our approach are evaluated both theoretically and via simulation. Our results show that, compared to previous distributed approaches proposed by Parno et al., Localized Multicast is more efficient in terms of communication and memory costs in large-scale sensor networks, and at the same time achieves a higher probability of detecting node replicas.

关键词： Wireless sensor networks security node replication attack detection distributed protocol efficiency

来源：评论

学校读者我要写书评

暂无评论

The Impact of Topology on Byzantine Containment in Stabilization

The Impact of Topology on Byzantine Containment in Stabiliza...

引用

24th International Symposium on distributed Computing

作者： Dubois, Swan Masuzawa, Toshimitsu Tixeuil, Sebastien Univ Paris 06 LIP6 UMR 7606 F-75252 Paris 05 France Osaka Univ Osaka Japan

ISBN: (纸本)9783642157622

Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. We consider the well known problem of constructing a maximum metric tree in this context. Combining these two properties proves difficult: we demonstrate that it is impossible to contain the impact of Byzantine nodes in a self-stabilizing context for maximum metric tree construction (strict stabilization). We propose a weaker containment scheme called topology-aware strict stabilization, and present a protocol for computing maximum metric trees that is optimal for this scheme with respect to impossibility result.

关键词： Byzantine fault distributed protocol Fault tolerance Stabilization Spanning tree construction

来源：评论

学校读者我要写书评

暂无评论

distributed Multi-Failure Localization protocol for All-Optical Networks

Distributed Multi-Failure Localization Protocol for All-Opti...

引用

International Conference on Optical Network Design and Modeling

作者： Khair, Mazen Zheng, Jun Mouftah, Hussein T. Univ Ottawa Sch Informat Technol & Engn Ottawa ON K1N 6N5 Canada

ISBN: (纸本)9781424441877

In this paper, we propose a distributed fault localization protocol, called Parallel Limited Perimeter Vector Matching (P-LVM) protocol, for localizing multi-link failures in all-optical networks. The P-LVM protocol is based on the Limited Perimeter Vector Matching (LVM) protocol for localizing single-link failures in all-optical networks. To handle multi-link failures, it tries to separate each failure in a small perimeter area after identifying each perimeter area with its corresponding failure and then localize the failures in parallel respectively in a distributed manner. Through simulation results, we show that the P-LVM protocol can effectively localize multi-link failures that occur simultaneously or at different times in all-optical networks.

关键词： fault localization multi-failure distributed protocol optical network

来源：评论

学校读者我要写书评

暂无评论

distributed fault tolerant computation of weakly connected dominating set in ad hoc networks

引用

JOURNAL OF SUPERCOMPUTING 2010年第1期53卷 182-195页

作者： Xu, Zhenyu Wang, James Srimani, Pradip K. Clemson Univ Sch Comp Clemson SC 29634 USA

Our purpose in this paper is to propose a self-stabilizing protocol for weakly connected dominating set (WCDS) set in a given ad hoc network graph. WCDS is a particular variant of graph domination predicates which play an important role in routing in ad hoc networks. There are many variants of domination problems in bidirectional networks;WCDS is also useful in forming clusters in ad hoc networks. There are many heuristic and distributed algorithms to compute WCDS in network graphs while almost all of them will need complete information about the network topology and most of them are not fault tolerant or mobility tolerant. Self-stabilization is a protocol design paradigm that is especially useful in resource constrained infrastructure-less networks since nodes can make moves based on local knowledge only and yet a global task is accomplished in a fault tolerant manner;it also facilitates for nodes to enter and exit the network freely. There exist self-stabilizing protocols for minimal spanning tree, total domination, and others. We have shown that the paradigm is capable of designing a protocol for WCDS. Our objective is to mathematically prove the correctness and the convergence of the protocol in any worst-case scenario, as is usually done for self-stabilizing protocols for other graph predicates used for ad hoc networks.

关键词： distributed protocol Fault tolerance Ad hoc network Weakly connected dominating set

来源：评论

学校读者我要写书评

暂无评论

Hidden primary user awareness in cognitive radio routing: the SBBO protocol

Hidden primary user awareness in cognitive radio routing: th...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Salvo, Pierpaolo Cuomo, Francesca Abbagnale, Anna Univ Roma La Sapienza Dept Info Com I-00184 Rome Italy

ISBN: (纸本)9781424456383

We propose a distributed routing scheme for cognitive radio ad hoc networks which, besides the awareness of the dynamic behavior of the primary users, also considers that some primary users may be hidden to secondary nodes, thus creating asymmetry in the spectrum opportunity availability. We identify this "Hidden Primary User" problem and we introduce in our distributed protocol a mechanism for being aware of it during the routing. To this aim our protocol creates priority lists at the secondary nodes used to have different possibilities to route the data on a path while the primary users activate and deactivate. The tradeoff between packet loss and delay is shown and discussed in the performance analysis.

关键词： SBBO protocol ad hoc networks ad hoc networks cognitive radio cognitive radio routing distributed protocol distributed routing hidden primary user awareness packet delay packet loss routing protocols spectrum best back opportunity spectrum opportunity ava

来源：评论

学校读者我要写书评

暂无评论

The Smallville Effect: Social Ties Make Mobile Networks More Secure Against Node Capture Attack

The Smallville Effect: Social Ties Make Mobile Networks More...

引用

8th ACM International Symposium on Mobility Management and Wireless Access

作者： Conti, Mauro Di Pietro, Roberto Gabrielli, Andrea Mancini, Luigi V. Mei, Alessandro Vrije Univ Amsterdam Dept Comp Sci NL-1081 HV Amsterdam Netherlands

ISBN: (纸本)9781450302777

Mobile Ad Hoc networks, due to the unattended nature of the network itself and the dispersed location of nodes, are subject to several unique security issues. One of the most vexed security threat is node capture. A few solutions have already been proposed to address this problem;however, those solutions are either centralized or focused on theoretical mobility models alone. In the former case the solution does not fit well the distributed nature of the network while, in the latter case, the quality of the solutions obtained for realistic mobility models severely differs from the results obtained for theoretical models. The rationale of this paper is inspired by the observation that re-encounters of mobile nodes do elicit a form of social ties. Leveraging these ties, it is possible to design efficient and distributed algorithms that, with a moderated degree of node cooperation, enforce the emergent property of node capture detection. In particular, in this paper we provide a proof of concept proposing a set of algorithms that leverage, to different extent, node mobility and node cooperation that is, identifying social ties to thwart node capture attack. In particular, we test these algorithms on a realistic mobility scenario. Extensive simulations show the quality of the proposed solutions and, more important, the viability of the proposed approach.

关键词： Ad Hoc network security social network node capture attack detection distributed protocol resilience efficiency node revocation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：