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

Improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath routing

IEEE TRANSACTIONS ON MOBILE COMPUTING 2005年第5期4卷 443-457页

作者： Valera, AC Seah, WKG Rao, SV Inst Infocomm Res Commun & Devices Div Singapore 117674 Singapore

A mobile ad hoc network is an autonomous system of infrastructure-less, multihop, wireless mobile nodes. Reactive routing protocols perform well in this environment due to their ability to cope quickly against topological changes. This paper proposes a new routing protocol named CHAMP (CacHing And Multiple Path) routing protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route failures. We show through extensive simulation results that these two techniques yield significant improvement in terms of packet delivery, end-to-end delay and routing overhead. We also show that existing protocol optimizations employed to reduce packet loss due to frequent route failures, namely local repair in AODV and packet salvaging in DSR, are not effective at high mobility rates and high network traffic.

关键词： routing protocols algorithm/protocol design and analysis

来源：评论

学校读者我要写书评

暂无评论

Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and algorithmic Approaches for Tolerating Malicious Interference

引用

IEEE COMMUNICATIONS SURVEYS AND TUTORIALS 2011年第4期13卷 617-641页

作者： Young, Maxwell Boutaba, Raouf Univ Waterloo David R Cheriton Sch Comp Sci Waterloo ON N2L 3G1 Canada

Interference is an unavoidable property of the wireless communication medium and, in sensor networks, such interference is exacerbated due to the energy-starved nature of the network devices themselves. In the presence of antagonistic interference, reliable communication in sensor networks becomes an extremely challenging problem that, in recent years, has attracted significant attention from the research community. This survey presents the current state of affairs in the formulation of theoretical models for adversarial interference in sensor networks and the different algorithmic remedies developed by the research community. There is a particular focus on jamming adversaries and Byzantine faults as these capture a wide range of benign faults as well as malicious attacks. The models in the literature are examined and contrasted with the aim of discerning the underlying assumptions that dictate analytical bounds with regards to feasibility and a number of performance metrics such as communication complexity, latency, and energy efficiency. Limitations are also highlighted with a focus on how various results impact real world applications and, conversely, how the current sensor network technology informs newer models. Finally, directions for future research are discussed.

关键词： Sensor networks security adversary Byzantine fault jamming reliable broadcast algorithm/protocol design and analysis fault tolerance.

来源：评论

学校读者我要写书评

暂无评论

Overlay networks with linear capacity constraints

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2008年第2期19卷 159-173页

作者： Zhu, Ying Li, Baochun UOIT Fac Business & Informat Technol Oshawa ON L1H 7K4 Canada UOIT Fac Engn & Appl Sci Oshawa ON L1H 7K4 Canada Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada

Overlay networks are virtual networks residing over the IP network;consequently, overlay links may share hidden lower level bottlenecks. Previous work has assumed an independent overlay model: a graph with independent link capacities. We introduce a model of overlays that incorporates correlated link capacities and linear capacity constraints (LCC) to formulate hidden shared bottlenecks;we refer to these as LCC-overlays. We define metrics to qualitatively measure overlay quality in terms of its accuracy ( in representing the true network topology) and efficiency ( that is, performance). Through analysis and simulations, we show that LCC-overlay is perfectly accurate and, hence, enjoys much higher efficiency than the inaccurate independent overlay. We discover that even a highly restricted LCC class-node- based LCC-yields near-optimal accuracy and significantly higher efficiency. We study two network flow problems in the context of LCC-graphs: widest path and maximum flow. We prove that Widest Path with LCC is NP-complete. We formulate Maximum Flow with LCC as a linear program and propose an efficient distributed algorithm to solve it. Based on the LCC model, we further study the problem of optimizing delay while still maintaining optimal or near-optimal bandwidth. We also outline a distributed algorithm to efficiently construct an overlay with node-based LCC.

关键词： overlay networks network protocols algorithm/protocol design and analysis network topology

来源：评论

学校读者我要写书评

暂无评论

Comments on "Optimal Resource Allocation in Overlay Multicast"

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2008年第4期19卷 572-573页

作者： Yan, Jinyao May, Martin Plattner, Bernhard ETH Swiss Fed Inst Technol Comp Engn & Networks Lab CH-8092 Zurich Switzerland Commun Univ China Comp & Network Ctr Beijing 100024 Peoples R China

In this comments paper, we revisit the network model introduced in [1]. We discuss the inaccuracy of the model and, to correct the network model, we propose to apply directed capacity constraints for directed flows. Based on a comparison of numerical results, we show that the corrected model leads to better accuracy than the original model.

关键词： multicast algorithm/protocol design and analysis nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

The RNA Metaprotocol

The RNA Metaprotocol

引用

17th International Conference on Computer Communications and Networks

作者： Touch, Joseph D. Pingali, Venkata K. USC Inst Informat Sci Marina Del Rey CA 90292 USA

ISBN: (纸本)9781424423897

The Recursive Network Architecture (RNA) explores the relationship of layering to protocol and network architecture. RNA examines the implications of using a single, tunable protocol, called a metaprotocol, for different layers of the protocol stack, reusing basic protocol operations across different protocol layers to avoid reimplementation. Its primary goal is to encourage cleaner cross-layer interaction, to support dynamic service composition, and to gain an understanding of how layering affects architecture. This paper provides a description of RNA and a recently completed initial prototype. The prototype extends the Click modular router with control capabilities including dynamic composition and discovery. These capabilities are used to demonstrate simple but flexible stacks of instances of a metaprotocol that are customizable at runtime.

关键词： algorithm/protocol design and analysis Internet Network Architecture and design protocols

来源：评论

学校读者我要写书评

暂无评论

Impact of human mobility on opportunistic forwarding algorithms

Impact of human mobility on opportunistic forwarding algorit...

引用

IEEE INFOCOM 2006 Conference/25th IEEE International Conference on Computer Communications

作者： Chaintreau, Augustin Hui, Pan Crowcroft, Jon Diot, Christophe Gass, Richard Scott, James Thomson Res F-92648 Boulogne France Univ Cambridge Cambridge CB3 0FD England Microsoft Res Cambridge CB3 0FB England Intel Res Pittsburgh PA 15213 USA

We study data transfer opportunities between wireless devices carried by humans. We observe that the distribution of the intercontact time (the time gap separating two contacts between the same pair of devices) may be well approximated by a power law over the range [10 minutes;1 day]. This observation is confirmed using eight distinct experimental data sets. It is at odds with the exponential decay implied by the most commonly used mobility models. In this paper, we study how this newly uncovered characteristic of human mobility impacts one class of forwarding algorithms previously proposed. We use a simplified model based on the renewal theory to study how the parameters of the distribution impact the performance in terms of the delivery delay of these algorithms. We make recommendations for the design of well-founded opportunistic forwarding algorithms in the context of human-carried devices.

关键词： computer systems organization communication/networking and information technology mobile computing algorithm/protocol design and analysis mobile environments mathematics of computing probability and statistics

来源：评论

学校读者我要写书评

暂无评论

The effects of channel errors on coordinated and non-coordinated medium access control protocols

The effects of channel errors on coordinated and non-coordin...

引用

IEEE International Conference on Wireless and Mobile Computing, Networking and Communications

作者： Numanoglu, T Tavli, B Heinzelman, W Univ Rochester Dept Elect & Comp Engn Rochester NY 14627 USA

ISBN: (纸本)0780391810

In this paper, we investigate the effects of channel noise on the performance of coordinated and non-coordinated MAC protocols. Comparative evaluations of these protocols under a perfect channel assumption have shown that coordinated MAC protocols, which regulate channel access locally, outperform non-coordinated channel access schemes in terms of energy efficiency and throughput. However, coordinated MAC protocols are more vulnerable than non-coordinated MAC protocols to channel noise due to their dependence on the robustness of the control traffic. In order to observe the degradation in performance of a coordinated MAC protocol (MH-TRACE), we investigate the impact of losing control packets. Furthermore, the performance in terms of throughput, delay, and energy efficiency of both coordinated (MH-TRACE) and non-coordinated (IEEE 802.11) MAC protocols is explored using a general error model that takes into account the length of the packets. Our results show that despite its higher level of vulnerability, the coordinated MAC protocol's performance is superior to the performance of the non-coordinated MAC protocol even when error rates are high.

关键词： energy-aware systems distributed networks wireless communication network protocols protocol verification algorithm/protocol design and analysis mobile communication systems access schemes

来源：评论

学校读者我要写书评

暂无评论

On the Suitability of LSP and DAP for Domain-Specific Languages

On the Suitability of LSP and DAP for Domain-Specific Langua...

引用

ACM/IEEE International Conference on Model Driven Engineering Languages and Systems (MODELS)

作者： Enet, Josselin Bousse, Erwan Tisi, Massimo Sunye, Gerson Nantes Univ CNRS Ecole Cent Nantes IMT AtlantiqueLS2NUMR 6004 Nantes France

ISBN: (纸本)9798350324983

Domain-Specific Languages (DSLs) help manage the growing complexity of systems by facilitating their description and execution or simulation via tailored languages. A large part of the development costs of a DSL comes from building the associated tools it requires, such as an editor or a debugger. To reduce these costs, the Language Server protocol (LSP) and Debug Adapter protocol (DAP) enable the creation of generic tooling interfaces which rely on standardized services exposed by languages. However, as these protocols have been designed for General Purpose Languages (GPLs), their applicability to DSLs has no yet been extensively studied. In this paper, we analyze both LSP and DAP, with an emphasis regarding their relevance for the development of tooling for DSLs. We provide both a high-level insight into these protocols, such as a dependency graph of their services, and a more fine-grained qualitative analysis of each service. We show that while some services defined by these two protocols can be provided by any DSL, others make strong assumptions on the concepts that should be part of the considered DSL. Conversely, domain-specific concepts available in some DSLs are not exploitable through these protocols, thus reducing the capabilities of generic tools.

关键词： Programming Languages and Software algorithm/protocol design and analysis Testing and Debugging Document and Text Editing

来源：评论

学校读者我要写书评

暂无评论

Impact of human mobility on opportunistic forwarding algorithms

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2007年第6期6卷 606-620页

来源：评论

学校读者我要写书评

暂无评论

GREEDY PERIMETER STATELESS ROUTING IN MANET'S

GREEDY PERIMETER STATELESS ROUTING IN MANET'S

引用

International Conference on Information Communication and Embedded Systems (ICICES)

作者： Sujatha, G. Sridivya, N. Arunai Engn Coll Dept ECE Tiruvannamalai India

ISBN: (纸本)9781479938346

In dynamic topology of the MANET's nodes are having the high mobility in nature. Because of the dynamic nature of nodes very difficult to find the exact location of node in network for data delivery. Here we proposed that to find the exact location of node and ensure the data delivery to destination. In existing system, the location aided routing mechanism where used to find location of node. In this there is load balancing problem and drop tail problem is there. To overcome drop tail problem to implement using the TCP protocol in the geographical routing. Greedy Perimeter Routing protocol which is used to reduce link cost and improve the routing performance. We propose the Adaptive Position Update (APU) strategy for geographic routing, which dynamically adjusts the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. APU is based on two simple principles: 1) nodes whose movements are harder to predict update their positions more frequently (and vice versa), and (ii) nodes closer to forwarding paths update their positions more frequently (and vice versa).

关键词： Wirelesscommunication algorithm/protocol design and analysis routing protocols

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：