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

21st International Joint Conference on Artificial Intelligence (IJCAI-09)

作者： Du, Jingzhe Kranakis, Evangelos Nayak, Amiya Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada Univ Ottawa Sch Informat Technol & Engn Ottawa ON K1N 6N5 Canada

ISBN: (纸本)9781424454686

We describe a Fast Delivery Guaranteed Face Routing (FDGF) in ad hoc wireless networks. Since it is expensive for wireless nodes to get the whole network topology information, geometric routing decisions should be made locally by nodes using location information of neighboring nodes which are at most k hops away. In this paper, we first define k-local algorithm and obtain two local geometric graphs, i.e., k-Local Delauany Triangulation Graph (k-LDTG) and k-Local Minimum Weight Spanning Tree (k-LMWST), which are more efficient than existing definitions. We present problems with existing face routing protocols and propose FDGF to counter possible long delivery delay with high probability. The performance of face routing differs on different planar graphs. We compare face routing characteristics of four different underlying routing graphs which include k-LDTG, Gabriel Graph (GG), Relative Neighbor Graph (RNG) and k-LMWST. Due to different attributes of these graphs, the message delivery delay, routing hop and minimum energy consumption differ greatly. Through experimentation in the NS-2 simulator, we have shown that the proposed face routing protocol achieves 100% delivery ratio on Unit Disk Graph (UDG) when source to destination connection path exists. Face routing on k-LDTG is fast with less relay hops and face routing on k-LMWST is energy efficient. RNG achieves desirable minimum energy consumption attribute, better than all the others when the propagation model is free space and close to k-LMWST when the propagation model is Two Ray Ground.

关键词： face routing localized algorithm Delaunay triangulation minimum spanning tree relative neighbor graph Gabriel graph

来源：评论

学校读者我要写书评

暂无评论

Multi-path Protocol for High Data Confidentiality and Reliability in Wireless Sensor Networks Using Non-dominated Dynamic Compensation

Multi-path Protocol for High Data Confidentiality and Reliab...

引用

10th International Symposium on Pervasive Systems, algorithms, and Networks

作者： Zeng Yong Pei Qinqi Ma Jianfeng Moon, SangJae Xidian Univ Sch Comp Sci & Technol Xian Peoples R China Inst China Elect Syst Engn Corp Beijing Peoples R China Xidian Uinv Key Lab Comp Networks & Informat Secur Minst Educ Xian Peoples R China Kyungpook Natl Univ Mobiel Network Secur Technol Res Ctr Daegu South Korea

ISBN: (纸本)9781424454037

This paper present a novel packet delivery mechanism only using local information for probabilistic non-dominated guarantee of high data confidentiality and reliablebility in wireless sensor networks. In the data confidentiality domain, a secret message is transformed into multiple shares by secret sharing schemes and then forwarding towards destination via multiple neighbours so that even if a small number of relay nodes are compromised, the secret as a whole is not compromised. In the reliable domain, various reliability requirements are supported by probabilistic multipath forwarding in a localized way by employing localized geographic packet forwarding. However, the two domains may conflict. So we propose non-dominated dynamic assignment strategy, which compensates for both local decision inaccuracies and the possible conflict as a packet travels towards its destination. This way, proposed scheme can guarantee end-to-end secure and reliable requirements in a localized way. Simulation results show the correctness and effectiveness of proposed scheme.

关键词： Wireless Sensor Networks Security Reliability Multipath Routing localized algorithm

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient localized topology control algorithm for wireless ad hoc and sensor networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2008年第11期21卷 1205-1220页

作者： Liu, Haitao Zhang, Baoxian Zheng, Jun Mouftah, Hussein T. Univ Ottawa Sch Informat Technol & Engn Ottawa ON K1N 6N5 Canada Chinese Acad Sci Shanghai Inst Microsyst & Informat Technol Key Lab Wireless Sensor Network & Commun Shanghai 200050 Peoples R China Chinese Acad Sci Grad Univ Coll Comp & Commun Engn Beijing 100049 Peoples R China

Topology control plays an important role in the design of wireless ad hoc and sensor networks and has demonstrated its high capability in constructing networks with desirable characteristics such as sparser connectivity, lower transmission power, and smaller node degree. However, the enforcement of a topology control algorithm in a network may degrade the energy-draining balancing capability of the network and thus reduce the network operational lifetime. For this reason, it is important to take into account energy efficiency in the design of a topology control algorithm in order to achieve prolonged network lifetime. In this paper, we propose of a localized energy-efficient topology control algorithm for wireless ad hoc and sensor networks with power control capability in network nodes. To achieve prolonged network lifetime, we introduce a concept called energy criticality avoidance and propose an energy criticality avoidance strategy in topology control and energy-efficient routing. Through theoretical analysis and simulation results. We prove that the proposed topolgy control algorithm can maintain the global network connectivity with low complexity and can significantly prolong the lifetime of a multi-hop wireless network as compared with existing topology control algorithms with little additional protocol ovehea. Copyright (C) 2008 John Wiley & Sons, Ltd.

关键词： topology control localized algorithm energy-efficient routing ad hoc and sensor networks

来源：评论

学校读者我要写书评

暂无评论

C-kNN Query Processing in Object Tracking Sensor Networks

引用

3rd International Conference on Wireless algorithms, Systems and Applications

作者： Zhu, Jinghua Li, Jianzhong Luo, Jizhou Zhang, Wei Wang, Hongzhi Harbin Inst Technol Sch Comp Sci & Technol Harbin 150001 Peoples R China

ISBN: (纸本)9783540885818

Wireless sensor networks (WSNs) are being developed for a variety of applications. Continuous k nearest neighbors (C-kNN) query is an essential class of spatial query in object tracking applications. Due to the limited power of individual node, energy is the most critical resource in sensor networks. In order to always report the up-to-date results, a centralized solution requires the transmission of a large number of location update messages. Intuitively, current information is necessary only for objects that may influence some query results. Motivated by this observation. we propose a threshold-based C-kNN search algorithm with the minimal message transmissions. The key idea is to set thresholds for moving objects corresponding to each query so that only the location updates which affect the final results are transmitted. The proposed method can be used with multiple, static or moving queries. The experiments results show the effectiveness and efficiency of our approach in terms of energy and latency.

关键词： Wireless sensor networks Moving object tracking C-kNN query processing localized algorithm

来源：评论

学校读者我要写书评

暂无评论

Construction algorithms for k-Connected m-Dominating Sets in Wireless Sensor Networks

Construction Algorithms for k-Connected m-Dominating Sets in...

引用

9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

作者： Wu, Yiwei Li, Yingshu Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

ISBN: (纸本)9781605580739

A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a k-Connected m-Dominating Set (kmCDS) is necessary for fault tolerance and routing flexibility. Some approximation algorithms have been proposed to construct a kmCDS. However, most of them only consider some special cases where k = 1,2 or k <= m, or are not easy to implement, or have high message complexity. In this paper, we propose a novel distributed algorithm LDA with low message complexity to construct a kmCDS for general k and m whose size is guaranteed to be within a small constant factor of the optimal solution when the maximum node degree is a constant. We also propose one centralized algorithm ICGA with a constant performance ratio to construct a kmCDS. Theoretical analysis as well as simulation results are shown to evaluate the proposed algorithms.

关键词： Connected Dominating Set k-Connected m-Dominating Set Fault-tolerance Wireless Sensor Networks localized algorithm

来源：评论

学校读者我要写书评

暂无评论

localized operations for distributed minimum energy multicast algorithm in mobile ad hoc networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007年第2期18卷 186-198页

作者： Guo, Song Yang, Oliver Univ British Columbia Dept Elect Engn Vancouver BC Canada Univ Ottawa Sch Informat Technol & Engn Ottawa ON Canada

To explore the advantages of power saving offered by the wireless multicast advantage property, we consider the case of source-initiated multicast traffic. Current research activity for the Minimum Energy Multicast (MEM) problem has been focused on devising efficient centralized greedy algorithms for static ad hoc networks. In this paper, we consider mobile ad hoc networks (MANETs) that use omnidirectional antennas and have limited energy resources. We propose the design and initial evaluation of the Distributed Minimum Energy Multicast (DMEM) algorithm for MANETs that attempts to reduce as much as possible the total RF energy required by the multicast communication. Several localized operations are presented for the DMEM algorithm, in which each node requires only the knowledge of and distances to all neighboring tree nodes. Through extensive simulation studies, we show that these operations are very efficient both in terms of energy saving and operation overhead.

关键词： mobile ad hoc networks energy efficient multicast localized algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient localized topology control algorithm

Efficient localized topology control algorithm

引用

Workshop on High Performance Switching and Routing

作者： Zhang, Baoxian Zhao, Zhuang Ma, Jian Mouftah, Hussein T. Chinese Acad Sci Grad Univ Coll Comp & Commun Engn 19A Yuquan Rd Beijing 100049 Peoples R China Nokia Res ctr Beijing 100013 Peoples R China Univ Ottawa Sch Infotech & Engn Ottawa ON K1N 6N5 Canada

ISBN: (纸本)9781424412051

Topology control plays a critical role in the design of wireless ad hoc and sensor networks. It can assign reduced transmit powers to nodes so as to create reduced topologies with certain desired properties. In this paper, we design an energy-efficient localized topology control algorithm. The design objective is to prolong the operational time of networks resulted by the implementation of localized topology controlling at nodes in network. For this purpose, our designed algorithm introduces the strategy of energy criticality avoidance in assigning nodal transmit powers as well as in selecting energy-efficient routes for packet deliveries. Simulation results demonstrate the high performance of our designed algorithm in prolonging the network lifetime as compared with related work.

关键词： topology control localized algorithm energy-efficient routing wireless ad hoc and sensor networks

来源：评论

学校读者我要写书评

暂无评论

3-D localized position-based routing with nearly certain delivery in mobile ad hoc networks

3-D localized position-based routing with nearly certain del...

引用

2nd International Symposium on Wireless Pervasive Computing

作者： Kao, George Fevens, Thomas Opatrny, Jaroslav Concordia Univ Dept Comp Sci & Software Engn 1455 Maisonneuve Blvd W Montreal PQ H3G 1M8 Canada

ISBN: (纸本)9781424405220

We present a novel 3-D routing algorithm, Adaptive Least-Squares Projective FACE routing algorithm, for wireless mobile ad hoc networks. This algorithm is based on three heuristics, least-squares projection (LSP) plane, adaptive behavior scale (ABS) and multi-projection-plane strategy, as well as the algorithm of Projective FACE routing on two orthogonal planes proposed in [5]. The resultant algorithm of Adaptive Least-Squares Projective FACE routing with 16 or more projection planes available gives nearly certain delivery, e.g. a 100% delivery rate shown by our simulations, on the unit disk graph (UDG). We also provide a comparison of performance for routing in 2-D and in 3-D. Two randomized versions, half-space partition and quadrant-space partition, of certain deterministic routing algorithms are also proposed to accommodate randomized routing in 3-D.

关键词： three-dimension position-based routing ad hoc network localized algorithm MANET wireless network routing algorithm

来源：评论

学校读者我要写书评

暂无评论

The r-neighborhood graph:: An adjustable structure for topology control in wireless ad hoc networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007年第4期18卷 536-549页

作者： Jeng, Andy An-Kai Jan, Rong-Hong Natl Chiao Tung Univ Dept Comp & Informat Sci Hsinchu 300 Taiwan

In wireless ad hoc networks, constructing and maintaining a topology with lower node degrees is usually intended to mitigate excessive traffic load on wireless nodes. However, keeping lower node degrees often prevents nodes from choosing better routes that consume less energy. Therefore, the trade-off is between the node degree and the energy efficiency. In this paper, an adjustable structure, named the r-neighborhood graph, is proposed to control the topology. This structure has the flexibility to be adjusted between the two objectives through a parameter r, 0 <= r <= 1. More explicitly, for any set of n nodes, the maximum node degree and power stretch factor can be bounded from above by some decreasing and increasing functions of r, respectively. Specifically, the bounds can be constants in some ranges of r. Even more, the r-neighborhood graph is a general structure of both RNG and GG, two well-known structures in topology control. Compared with YGk, another famous adjustable structure, our method always results in a connected planar with symmetric edges. To construct this structure, we investigate a localized algorithm, named PLA, which consumes less transmitting power during construction and executes efficiently in O(n log n) time.

关键词： wireless ad hoc networks topology control energy-efficient localized algorithm

来源：评论

学校读者我要写书评

暂无评论

Greedy anti-void routing protocol for wireless sensor networks

引用

IEEE COMMUNICATIONS LETTERS 2007年第7期11卷 562-564页

作者： Liu, Wen-Jiunn Feng, Kai-Ten Natl Chiao Tung Univ Dept Commun Engn Hsinchu Taiwan

The unreachability problem (i.e. the so-called void problem) which exists in the greedy routing algorithms has been studied for the wireless sensor networks. However, most of the current research work can not fully resolve the problem (i.e. to ensure the delivery of packets) within their formulation. In this letter, the Greedy Anti-void Routing (GAR) protocol is proposed, which solves the void problem by exploiting the boundary finding technique for the Unit Disk Graph (UDG). The proposed Rolling-ball UDG boundary Traversal (RUT) is employed to completely guarantee the delivery of packets from the source to the destination node. The proofs of correctness for the proposed GAR protocol are also given at the end of this letter.

关键词： greedy routing void problem unit disk graph localized algorithm wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：