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

American Control Conference

作者： Airlie Chapman Mehran Mesbahi Department of Aeronautics and Astronautics University of Washington WA 98105

ISBN: (纸本)9781457710957

This paper examines the set of equilibria and asymptotic stability of a large class of dynamical networks with nonidentical nonlinear node dynamics. The interconnection dynamics are defined by M-matrices. An example of such a class of systems include nonlinear consensus protocols as well as other distributed protocols of interest in cooperative control and distributed decision-making. We discuss the model's relationship to the network topology, investigate the properties of its equilibria, and provide conditions for convergence to the set of equilibria. We also provide examples of the versatility of this model in the context of a sensor coverage problem. The model is extended to incorporate additional nonlinearities;an application for this latter model is also provided in the realm of neural networks.

关键词： Stability analysis Nonlinear networks distributed decision making Network topology coordinated control asymptotic stability region nonlinearity distributed protocol Neural network

来源：评论

学校读者我要写书评

暂无评论

MUSTER: Adaptive Energy-Aware Multisink Routing in Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2011年第12期10卷 1694-1709页

作者： Mottola, Luca Picco, Gian Pietro Swedish Inst Comp Sci S-16440 Stockholm Sweden Univ Trento DISI I-38050 Povo TN Italy

Wireless sensor networks (WSNs) are increasingly proposed for applications characterized by many-to-many communication, where multiple sources report their data to multiple sinks. Unfortunately, mainstream WSN collection protocols are generally designed to account for a single sink and, dually, WSN multicast protocols optimize communication from a single source. In this paper, we present MUSTER, a routing protocol expressly designed for many-to-many communication. First, we devise an analytical model to compute, in a centralized manner, the optimal solution to the problem of simultaneously routing from multiple sources to multiple sinks. Next, we illustrate heuristics approximating the optimal solution in a distributed setting, and their implementation in MUSTER. To increase network lifetime, MUSTER minimizes the number of nodes involved in many-to-many routing and balances their forwarding load. We evaluate MUSTER in emulation and in a real WSN testbed. Results indicate that our protocol builds near-optimal routing paths, doubles the WSN lifetime, and overall delivers to the user 2.5 times the amount of raw data w.r.t. mainstream protocols. Moreover, MUSTER is intrinsically amenable to in-network aggregation, pushing the improvements up to a 180 percent increase in lifetime and a four-time increase in data yield.

关键词： Wireless sensor networks multisink routing analytical model distributed protocol performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Deterministic secure positioning in wireless sensor networks

引用

THEORETICAL COMPUTER SCIENCE 2011年第35期412卷 4471-4481页

作者： Delaet, Sylvie Mandal, Partha Sarathi Rokicki, Mariusz A. Tixeuil, Sebastien UPMC Sorbonne Univ Inst Univ France Paris France Univ Paris Sud Paris France Indian Inst Technol Gauhati India Univ Liverpool Liverpool L69 3BX Merseyside England

The position verification problem is an important building block for a large subset of wireless sensor network (WSN) applications. Indeed, the performance of the WSN degrades significantly when misbehaving nodes report false location information in order to fake their actual position. In this paper we propose the first deterministic distributed protocol for an accurate identification of faking sensors in a WSN. Our scheme does not rely on a subset of trusted nodes that cooperate and are not allowed to misbehave. Thus, any subset of nodes is allowed to try faking its position. As in previous approaches, our protocol is based on distance evaluation techniques developed for WSN. On the positive side, we show that when the received signal strength (RSS) technique is used, our protocol handles at most left perpendicular n/2 right perpendicular -2 faking sensors. When the time of flight (ToF) technique is used, our protocol manages at most eft perpendicular n/2 right perpendicular - 3 misbehaving sensors. On the negative side, we prove that no deterministic protocol can identify faking sensors if their number is inverted right perpendicular n/2 inverted left perpendicular - 1 Thus, our scheme is almost optimal with respect to the number of faking sensors. We discuss application of our technique in the trusted sensor model. More specifically, our results can be used to minimize the number of trusted sensors that are needed to defeat faking ones. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Wireless sensor network Secure positioning distributed protocol

来源：评论

学校读者我要写书评

暂无评论

Immediate neighbor scheduling (INS): An adaptive protocol for mobile ad hoc networks using direct-sequence spread-spectrum modulation

引用

AD HOC NETWORKS 2011年第3期9卷 453-467页

作者： Wolf, Brian J. Russell, Harlan B. Clemson Univ Dept Elect & Comp Engn Clemson SC 29631 USA

We investigate a new approach for scheduling transmissions in a mobile ad hoc network employing direct-sequence spread-spectrum (DSSS). Multiple-access interference may be better tolerated in these systems, allowing higher levels of spatial reuse and a reduction in the overhead required to schedule transmissions. We present a protocol which leverages these features of DSSS to support greater end-to-end throughput and terminal mobility rates. A protocol extension allows terminals to adjust protocol overhead in order to preserve network connectivity in sparse networks. For each transmission, terminals use a combination of common and transmitter-oriented spreading sequences in a format which allows for discovery of nearby terminals and adaptation of transmission rates to maximize throughput. The protocol does not operate over an artificial network graph, nor does it require an initialization phase or two-way exchange of information during a transmission slot. Through simulations, we evaluate the performance of the transmission scheduling protocol in a variety of static and mobile scenarios. For comparison, we also simulate a centralized transmission scheduling protocol with perfect knowledge of topology. (C) 2010 Elsevier B.V. All rights reserved.

关键词： distributed protocol Mobile ad hoc network Transmission scheduling Direct-sequence spread-spectrum modulation

来源：评论

学校读者我要写书评

暂无评论

distributed Detection of Clone Attacks in Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2011年第5期8卷 685-698页

作者： Conti, Mauro Di Pietro, Roberto Mancini, Luigi Vincenzo Mei, Alessandro Univ Roma La Sapienza Dipartimento Informat I-00198 Rome Italy Univ Rome Tre Dipartimento Matemat I-00146 Rome Italy

Wireless Sensor Networks (WSNs) are often deployed in hostile environments where an adversary can physically capture some of the nodes, first can reprogram, and then, can replicate them in a large number of clones, easily taking control over the network. A few distributed solutions to address this fundamental problem have been recently proposed. However, these solutions are not satisfactory. First, they are energy and memory demanding: A serious drawback for any protocol to be used in the WSN-resource-constrained environment. Further, they are vulnerable to the specific adversary models introduced in this paper. The contributions of this work are threefold. First, we analyze the desirable properties of a distributed mechanism for the detection of node replication attacks. Second, we show that the known solutions for this problem do not completely meet our requirements. Third, we propose a new self-healing, Randomized, Efficient, and distributed (RED) protocol for the detection of node replication attacks, and we show that it satisfies the introduced requirements. Finally, extensive simulations show that our protocol is highly efficient in communication, memory, and computation;is much more effective than competing solutions in the literature;and is resistant to the new kind of attacks introduced in this paper, while other solutions are not.

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

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Coverage Optimization in Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2011年第4期10卷 465-478页

作者： Liu, Changlei Cao, Guohong Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA

Mission-driven sensor networks usually have special lifetime requirements. However, the density of the sensors may not be large enough to satisfy the coverage requirement while meeting the lifetime constraint at the same time. Sometimes, coverage has to be traded for network lifetime. In this paper, we study how to schedule sensors to maximize their coverage during a specified network lifetime. Unlike sensor deployment, where the goal is to maximize the spatial coverage, our objective is to maximize the spatial-temporal coverage by scheduling sensors' activity after they have been deployed. Since the optimization problem is NP-hard, we first present a centralized heuristic whose approximation factor is proved to be 1 2, and then, propose a distributed parallel optimization protocol (POP). In POP, nodes optimize their schedules on their own but converge to local optimality without conflict with one another. Theoretical and simulation results show that POP substantially outperforms other schemes in terms of network lifetime, coverage redundancy, convergence time, and event detection probability.

关键词： Wireless sensor network coverage sensor scheduling distributed protocol parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

Finite-time consensus for multi-agent systems via terminal feedback iterative learning

引用

IET CONTROL THEORY AND APPLICATIONS 2011年第18期5卷 2098-2110页

作者： Meng, D. Jia, Y. Beihang Univ BUAA Res Div 7 Beijing 100191 Peoples R China Beihang Univ BUAA Dept Syst & Control Beijing 100191 Peoples R China Beihang Univ BUAA SMSS Key Lab Math Informat & Behav Semant Beijing 100191 Peoples R China

This study is devoted to the finite-time consensus problem of multi-agent systems with higher-order dynamics, and presents a framework for effectively constructing distributed protocols which incorporate iterative learning control actions into output feedbacks. Using a terminal updating law, the feedback iterative learning protocols are shown with the ability to enable all agents to achieve the consensus at a finite time that can be prescribed. Furthermore, a model reference approach is employed to improve the feedback iterative learning protocols such that all agents can be guaranteed to achieve the consensus at any given desired terminal output. In both cases, necessary and sufficient conditions are provided which can also offer design criteria for the learning gains to ensure consensus. Simulation results are included to verify the effectiveness of the proposed theoretical results.

关键词： Feedback Agents distributed protocol Iterative DESIGN CRITERIA

来源：评论

学校读者我要写书评

暂无评论

RELIABLE COMMUNICATION ON EMULATED CHANNELS RESILIENT TO TRANSIENT FAULTS

引用

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2011年第5期22卷 1099-1122页

作者： Yamauchi, Yukiko Bein, Doina Masuzawa, Toshimitsu Nara Inst Sci & Technol Grad Sch Informat Sci Nara Japan Penn State Univ Informat Sci & Technol Div University Pk PA 16802 USA Osaka Univ Grad Sch Informat Sci & Technol Suita Osaka 565 Japan

Topology embedding enables one to execute a protocol designed for a specific (virtual) topology on another (real) topology by embedding the virtual topology on the real topology. In this paper, we propose a self-stabilizing emulation technique that provides reliable communication on a virtual topology in the presence of transient faults in real topology. The proposed protocol improves the execution slowdown of previous two protocols [19, 20] and provides adaptive message delivery delay on the emulated channels, which is a new type of adaptability against transient faults.

关键词： distributed protocol embedding fault-tolerance self-stabilization transient fault virtual topology

来源：评论

学校读者我要写书评

暂无评论

A Randomized, Efficient, and distributed protocol for the Detection of Node Replication Attacks in Wireless Sensor Networks 07

A Randomized, Efficient, and Distributed Protocol for the De...

引用

8th ACM International Symposium on Mobile Ad Hoc Networking and Computing

作者： Conti, Mauro Di Pietro, Roberto Mancini, Luigi V. Mei, Alessandro Univ Roma La Sapienza Dipartimento Informat I-00198 Rome Italy

ISBN: (纸本)9781595936844

Wireless sensor networks are often deployed in hostile environments, where an adversary can physically capture some of the nodes. Once a node is captured, the attacker can re-program it and replicate the node in a large number of clones, thus easily taking over the network. The detection of node replication attacks in a wireless sensor network is therefore a fundamental problem. A few distributed solutions have recently been proposed. However, these solutions are not satisfactory. First, they are energy and memory demanding: A serious drawback for any protocol that is to be used in resource constrained environment such as a sensor network. Further, they are vulnerable to specific adversary models introduced in this paper. The contributions of this work are threefold. First, we analyze the desirable properties of a distributed mechanism for the detection of node replication attacks. Second, we show that the known solutions for this problem do not completely meet our requirements. Third, we propose a new Randomized, Efficient, and distributed (RED) protocol for the detection of node replication attacks and we show that it is completely satisfactory with respect to the requirements. Extensive simulations also show that our protocol is highly efficient in communication, memory, and computation, that it sets out an improved attack detection probability compared to the best solutions in the literature, and that it is resistant to the new kind of attacks we introduce in this paper, while other solutions are not.

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

来源：评论

学校读者我要写书评

暂无评论

M-Backs: Mobile Backbones for Multi-hop Wireless Networks

M-Backs: Mobile Backbones for Multi-hop Wireless Networks

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Nanni, Maurizio A. Basagni, Stefano Northeastern Univ ECE Dept Boston MA 02115 USA

ISBN: (纸本)9781612842547

We present a new distributed protocol for setting up and maintaining a backbone for multi-hop mobile networks. Our solution, termed M-Backs, is effective in producing backbones with limited size, while being robust and reliable in the face of node mobility. We compare our protocol with previous solutions for mobile backbone set up and maintenance. M-Backs outperforms previous protocols, providing backbones of reasonable size, with superior connectivity, shorter route lengths, higher robustness and lower maintenance-related overhead. When running AODV over the backbones M-Backs obtains higher packet delivery ratio and lower latency than previous backbone protocols and than AODV run over the flat network topology.

关键词： AODV M-backs Mobile communication Mobile computing Network topology Peer to peer computing Robustness Routing protocols backbone protocols distributed protocol flat network topology mobile backbones mobile communication multihop mobile networks multihop wireless networks node mobility protocols

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：