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

A distributed protocol for detection of packet dropping attack in mobile ad hoc networks

A distributed protocol for detection of packet dropping atta...

IEEE International Conference on Telecommunications/IEEE Malaysia International Conference on Communications (ICT-MICC 2007)

作者： Sen, Jaydip Chandra, M. Girish Balamuralidhar, P. Harihara, S. G. Reddy, Harish Tata Consultancy Serv Embedded Syst Res Grp Bangalore 560066 Karnataka India

ISBN: (纸本)9781424410934

In multi-hop mobile ad hoc networks (MANETs), mobile nodes cooperate with each other without using any infrastructure such as access points or base stations. Security remains a major challenge for these networks due to their features of open medium, dynamically changing topologies, reliance on cooperative algorithms, absence of centralized monitoring points, and lack of clear lines of defense. Among the various attacks to which MANETs are vulnerable, malicious packet dropping attack is very common where a malicious node can partially degrade or completely disrupt communication in the network by consistently dropping packets. In this paper, a mechanism for detection of packet dropping attack is presented based on cooperative participation of the nodes in a MANET. The redundancy of routing information in an ad hoc network is utilized to make the scheme robust so that it works effectively even in presence or transient network partitioning and Byzantine failure of nodes. The proposed scheme is fully cooperative and thus more secure as the vulnerabilities of any election algorithm used for choosing a subset of nodes for cooperation are absent. Simulation results show the effectiveness of the protocol.

关键词： distributed algorithm mobile ad hoc network packet dropping attack routing security

来源：评论

学校读者我要写书评

暂无评论

Video multicast over wireless ad hoc networks using distributed optimization

引用

8th Pacific Rim Conference on Multimedia

作者： He, Yifeng Lee, Ivan Guan, Ling Ryerson Univ Dept Elect & Comp Engn Toronto ON Canada

ISBN: (纸本)9783540772545

Video multicast over wireless ad hoc networks is a quite challenging task. In this paper, we propose an optimized video multicast scheme. Firstly, we apply prioritized coding scheme and network coding scheme to eliminate the decoding hierarchy and delivery redundancy. Then, we maximize the aggregate throughput at all the receivers by jointly optimizing both the source rate allocation and the routing scheme. The proposed algorithm is fully distributed, thus very suitable for wireless ad hoc networks. Simulation results show that the proposed video multicast scheme yields a superior video quality compared to the double-tree routing scheme.

关键词： video multicast wireless ad hoc network network coding convex optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Feedback-based adaptive packet marking for proportional bandwidth allocation

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2007年第2期18卷 225-239页

作者： Park, Eun-Chan Choi, Chong-Ho Samsung Elect Co LTD Telecommun R&D Ctr Suwon 443742 Gyeonggi Do South Korea Seoul Natl Univ Sch Elect Engn & Comp Sci Seoul 151744 South Korea

Differentiated service (DiffServ) networks have been proposed to assure the achievable minimum bandwidth to aggregate flows. However, analyses in the literature show that the current DiffServ networks are biased in favor of an aggregate flow that has a smaller committed information rate (CIR) when aggregate flows with different CIRs share a bottleneck link. In order to mitigate this unfairness problem, we propose an adaptive marking scheme which provides the relative bandwidth assurance in proportion to the CIRs of the aggregates. By introducing a virtual target rate (VTR) and adjusting it depending on the provision level of the network, each aggregate can obtain its fair share of the bandwidth, regardless of traffic load. This scheme is based on a feedback approach. It utilizes only two-bit feedback information conveyed in the packet header and can be implemented in a distributed manner. Furthermore, the proposed scheme does not require calculating fair shares of aggregates or any additional signaling protocol. Using steady state analysis and extensive simulations, we show that the scheme can provide aggregate flows with their fair shares of bandwidth, which is proportional to the CIRs, under various network conditions.

关键词： proportional bandwidth allocation fairness Quality of Service DiffServ networks distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Bidding protocols for deploying mobile sensors

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2007年第5期6卷 515-528页

作者： Wang, Guiling (Grace) Cao, Guohong Berman, Piotr La Porta, Thomas F. New Jersey Inst Technol Dept Comp Sci Newark NJ 07102 USA Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA

Constructing a sensor network with a mix of mobile and static sensors can achieve a balance between sensor coverage and sensor cost. In this paper, we design two bidding protocols to guide the movement of mobile sensors in such sensor networks to increase the coverage to a desirable level. In the protocols, static sensors detect coverage holes locally by using Voronoi diagrams and bid mobile sensors to move. Mobile sensors accept the highest bids and heal the largest holes. Simulation results show that our protocols achieve suitable trade-off between coverage and sensor cost.

关键词： mobile sensor networks sensor deployment distributed algorithm bidding protocol

来源：评论

学校读者我要写书评

暂无评论

An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity

引用

INFORMATION PROCESSING LETTERS 2007年第1期102卷 27-34页

作者： Tsin, Yung H. Univ Windsor Sch Comp Sci Windsor ON N9B 3P4 Canada

The functionality of a self-stabilizing algorithm for determining cut-vertices and biconnected components of distributed computer networks, are discussed. A self-stabilizing algorithm is a distributed algorithm that determines all the bridges and determines all bridge-connected components. It is a modification of the self-stabilizing depth-first search algorithm of Collin and Dolev and it is a adaptation of Tarjan's sequential algorithm for biconnectivity to the self-stabilizing model. The time complexity and memory requirement of the algorithm is similar to that of the depth-first spanning tree algorithm. The algorithm require O(m log n) bits per processor and it efficiently determines bridge-connected components in comparison of Chaudhari's composite algorithm for bridge-connected components. It determines biconnected components of distributed computer networks using spanning subtrees.

关键词： self-stabilizing algorithm fault tolerance distributed computing distributed algorithm cut-vertex biconnected component bridge bridge-connected component

来源：评论

学校读者我要写书评

暂无评论

Design and performance evaluation of efficient consensus protocols for mobile ad hoc networks

引用

IEEE TRANSACTIONS ON COMPUTERS 2007年第8期56卷 1055-1070页

作者： Wu, Weigang Cao, Jiannong Yang, Jin Raynal, Michel Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China Univ Rennes 1 IRISA F-35042 Rennes France

Designing protocols for solving the consensus problem faces new challenges in mobile computing environments. Among others, how we can achieve message efficiency for saving resource consumption has been the focus of research. In this paper, we present the HC protocol, a message efficient consensus protocol for MANETs. We consider the widely used system model where the hosts fall by crashes and the system is equipped with Chandra-Toueg's unreliable failure detectors. Unlike existing. consensus protocols, the HC protocol uses a two-layer hierarchy based on clusters to achieve message efficiency. The messages from and to the hosts in the same cluster are merged so as to reduce the message cost. However, adding such a hierarchy is not trivial. Due to host movements and failures, the hierarchy changes from time to time and this may cause message loss. In designing HC, we also propose methods to handle such message losses. Extensive simulations have been carried out to evaluate and compare the performance of the HC protocol and similar protocols in a MANET environment. Simulation results show that, in most cases, our protocol can significantly reduce both the message cost and time cost. With increases in the system scale or the percentage of faulty hosts, the advantage of our protocol becomes more obvious.

关键词： consensus mobile ad hoc network mobile computing distributed algorithm failure detector fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Clustering wireless ad hoc networks with weakly connected dominating set

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2007年第6期67卷 727-737页

作者： Han, Bo Jia, Weijia Univ Maryland Dept Comp Sci College Pk MD 20742 USA City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China

The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports self-configuration and self-management. Efficient clustering protocol for constructing virtual backbone is becoming one of the most important issues in wireless ad hoc networks. The weakly connected dominating set (WCDS) is very suitable for cluster formation. As finding the minimum WCDS in an arbitrary graph is a NP-Hard problem, we propose an area-based distributed algorithm for WCDS construction in wireless ad hoc networks with time and message complexity O(n). This Area algorithm is divided into three phases: area partition, WCDS construction for each area and adjustment along the area borders. We confirm the effectiveness of our algorithm through analysis and comprehensive simulation study. The number of nodes in the WCDS constructed by this Area algorithm is up to around 50% less than that constructed by the previous well-known algorithm. (c) 2007 Elsevier lnc. All rights reserved.

关键词： wireless ad hoc networks clustering dominating set weakly connected dominating set distributed algorithm simulation

来源：评论

学校读者我要写书评

暂无评论

Autonomous spectrum balancing for digital subscriber lines

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2007年第8期55卷 4241-4257页

作者： Cendrillon, Raphael Huang, Jianwei Chiang, Mung Moonen, Marc Marvell Hong Kong Ltd Mongkok Hong Kong Peoples R China Princeton Univ Dept Elect Engn Princeton NJ 08544 USA Katholieke Univ Leuven Dept Elect Engn ESAT SISTA B-3001 Louvain Belgium

The main performance bottleneck of modern digital subscriber line (DSL) networks is the crosstalk among different lines (i.e., users). By deploying dynamic spectrum management (DSM) techniques and reducing excess crosstalk among users, a network operator can dramatically increase the data rates and service reach of broadband access. However, current DSM algorithms suffer from either substantial suboptimality in typical deployment scenarios or prohibitively high complexity due to centralized computation. This paper develops, analyzes, and simulates a new suite of DSM algorithms for DSL interference-channel models called autonomous spectrum balancing (ASB). The ASB algorithms utilize the concept of a "reference line," which mimics a typical victim line in the interference channel. In ASB, each modem tries to minimize the harm it causes to the reference line under the constraint of achieving its own target data-rate. Since the reference line is based on the statistics of the entire network, rather than any specific knowledge of the binder a modern operates in, ASB can be implemented autonomously without the need for a centralized spectrum management center. ASB has a low complexity and simulations using a realistic simulator show that it achieves large performance gains over existing autonomous algorithms, coming close to the optimal rate region in some typical scenarios. Sufficient conditions for convergence of ASB are also proved.

关键词： digital subscriber lines (DSLs) distributed algorithm dual decomposition interference channel multicarrier power allocation spectrum management

来源：评论

学校读者我要写书评

暂无评论

Joint topology control and routing in IEEE 802.11-based multiradio multichannel mesh networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2007年第5期56卷 3123-3136页

作者： Chen, Lin Zhang, Qian Li, Minglu Jia, Weijia Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200240 Peoples R China Hong Kong Univ Sci & Technol Dept Comp Sci Kowloon Peoples R China City Univ Hong Kong Dept Comp Sci Kowloon Peoples R China

Due to low cost, ease of deployment, increased coverage, and enhanced capacity, multiradio mesh networks that utilize inexpensive and readily available Institute of Electrical and Electronics Engineers (IEEE) 802.11 wireless interfaces are touted as the new frontier of wireless networking. In a multihop mesh system, the close interaction between topology control and routing selection affects the system throughput of a wireless network. This paper proposes a novel joint topology control and routing (JTCR) protocol for a multiradio multichannel wireless mesh network to exploit both channel diversity and spatial reusability. It resides between medium access control and the network layer and aims to improve the network throughput by coordinating transmission power, channel assignment, and route selection among multiple nodes in a distributed way. JTCR jointly coordinates the transmission power at each node, the channel selection on each wireless interface, and the route selection among interfaces based on the traffic information that is measured and exchanged among two-hop neighbor nodes. An equivalent channel air time metric (EC AT M) is presented to quantify the difference of various adjustment candidates. This protocol achieves the efficient utilization of available channels by selecting a feasible adjustment candidate with the smallest EC AT M value and coordinating affected nodes to realize the adjustment. Our NS-2-based simulation results show that the network throughput can be significantly improved by using our proposed solution.

关键词： distributed algorithm IEEE 802.11 routing topology control wireless mesh

来源：评论

学校读者我要写书评

暂无评论

Decentralized key generation scheme for cellular-based heterogeneous wireless ad hoc networks

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2007年第9期67卷 981-991页

作者： Gupta, Ananya Mukherjee, Anindo Xie, Bin Agrawal, Dharma P. Univ Cincinnati Dept Comp Sci OBR Ctr Distributed & Mobile Comp Cincinnati OH 45221 USA

With the support of cellular system a cellular-based mobile ad hoc network (MANET) offers promising communication scenarios while entails secure data exchange as other wireless systems. In this paper, we propose a novel decentralized key generation mechanism using shared symmetric polynomials in which the base stations (BSs) carry out an initial key generation by a symmetric polynomial in a distributed manner and then pass on the key material to mobile stations (MSs). Thereafter, our proposed key generation scheme enables each pair of MSs to establish a pairwise key without any intervention from the 13S, thus reducing the management cost for the BS. The shared key between two NISs is computed without any interaction between them. In addition, the trust among NISs is derived from the cellular infrastructure, thus enjoying an equal security level as provided in the underlying cellular network. Simulations are done to observe the system performance and the results are very encouraging. (c) 2007 Elsevier Inc. All rights reserved.

关键词： ad hoc networks base station cellular networks distributed algorithm heterogeneous networks multi-interface mobile station pairwise keys polynomial symmetric key

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：