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

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

来源：评论

学校读者我要写书评

暂无评论

The development of localized algorithms in wireless sensor networks

引用

SENSORS 2002年第7期2卷 286-293页

作者： Qi, HR Kuruganti, PT Xu, YY Univ Tennessee Dept Elect & Comp Engn Knoxville TN 37996 USA

Advances in sensor technology and wireless communications have made networked microsensors possible, where each sensor individually senses the environment but collaboratively achieves complex information gathering and dissemination tasks. These networked sensors, however, possess several characteristics that have challenged many aspects of traditional computer network design, such as the scalability issue caused by the sheer amount of sensor nodes, the infrastructureless network, and the stringent resource onboard the sensors. These new features call for a re-design of overall structure of applications and services. It has been widely accepted that practical localized algorithms is probably the best solution to wireless sensor networks. In this article, we discuss recent research results on localized algorithms design in supporting services and applications in sensor networks.

关键词： localized algorithm wireless sensor networks energy-efficient communication collaborative signal and information processing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Distributed k-Coverage Verification algorithm based on localized Distance Information in WSNs

Distributed k-Coverage Verification Algorithm based on Local...

引用

IEEE International Conference on Networking, Architecture, and Storage

作者： Zhang, Xia Wang, Cheng Huazhong Univ Sci & Technol Digital Engn & Simulat Res Ctr Wuhan 430074 Hubei Peoples R China

ISBN: (纸本)9780769537412

It is essential to equip the sensor nodes with simple and efficient coverage boundary detection mechanisms for ensuring the network reliability and providing the required quality of service. The existing coverage boundary detection solutions require accurate knowledge of the sensors locations, which cannot be easily obtained, or they cannot provide guarantees on the coverage quality. Therefore, we propose a distributed algorithm for individual sensor nodes to identify whether they are on the coverage boundary, by using only localized distance information. Furthermore, we extend the algorithm to k-coverage boundary detection scheme. We show the correctness and efficiency of our algorithm by theoretical proofs.

关键词： coverage boundary detection computer geometry localized algorithm wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Self-coordinating localized fair queueing in wireless ad hoc networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2004年第1期3卷 86-98页

作者： Luo, HY Cheng, J Lu, SW Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90095 USA

Distributed fair queueing in a multihop, wireless ad hoc network is challenging for several reasons. First, the wireless channel is shared among multiple contending nodes in a spatial locality. Location-dependent channel contention complicate's the fairness notion. Second, the sender of a flow does not have explicit information regarding the contending flows originated from other nodes. Fair queueing over ad hoc networks is a distributed scheduling problem by nature. Finally, the wireless channel capacity is a scarce resource. Spatial channel reuse, i.e., simultaneous transmissions of flows that do not interfere with each other, should be encouraged whenever possible. In this paper, we reexamine the fairness notion in an ad hoc network using a graph-theoretic formulation and extract the fairness requirements that an ad hoc fair queueing algorithm should possess. To meet these requirements, we propose Maximize-Local-Minimum Fair Queueing (MLM-FQ), a novel distributed packet scheduling algorithm where local schedulers;self-coordinate their scheduling decisions and collectively achieve fair bandwidth sharing. We then propose Enhanced MLM-FQ (EMLM-FQ) to further improve the spatial channel reuse and limit the impact of inaccurate scheduling information resulted from collisions. EMLM-FQ achieves statistical short-term throughput and delay bounds over the shared wireless channel. Analysis and extensive simulations confirm the effectiveness and efficiency of our self-coordinating localized design in providing global fair channel access in wireless ad hoc networks.

关键词： localized algorithm packet scheduling MANET fair queueing

来源：评论

学校读者我要写书评

暂无评论

LASEC: A localized Approach to Service Composition in Pervasive Computing Environments

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2015年第7期26卷 1948-1957页

作者： Siebert, Joanna Cao, Jiannong Lai, Yi Guo, Peng Zhu, Weiping Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China

Pervasive computing environments (PvCE) are embedded with interconnected smart devices which provide users with services desired. To meet requirements of users, smart devices with different kinds of functions may need to be associated together to provide the service described in the user requirement, which is called service composition. As the service composition environment may be dynamic and large scale, centralized service composition algorithm is usually inefficient due to message cost. On the other hand, a decentralized approach, which employs pre-determined coordinators to search and compose service, may have high cost as well. In this paper, we discuss a localized approach for service composition based on the Ubiquitous Interacting Object (UIO) model we have proposed earlier. UIO is an abstraction of physical devices in PvCE with ability to find and collaborate with other devices through exposing their capabilities as services. In our localized service composition algorithm (LASEC), UIOs collaborate with each other in a bottom-up, localized manner to compose required service without requiring global knowledge. To solve the problem of blind compositions in LASEC, we propose a novel mechanism called Alien-information- based Acknowledging (A-Ack), in which a UIO decides on collaborating with another UIO only after obtaining some additional information from the collaboration candidate. Specifically, this information refers to ability of a given UIO to compose another part of the service. Proposed LASEC is message-efficient and quality-guaranteed. Extensive simulations of LASEC as well as existing decentralized and pull-based centralized algorithms have been conducted. The results show the relatively low communication cost and composition time of LASEC. Moreover, we demonstrate feasibility of our approach with a prototype implementation.

关键词： Pervasive computing environment ubiquitous interacting objects service composition localized algorithm

来源：评论

学校读者我要写书评

暂无评论

localized topology control and on-demand power-efficient routing for wireless ad hoc and sensor networks

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2019年第1期12卷 189-208页

作者： Qin, Xu Zhang, Baoxian Li, Cheng Univ Chinese Acad Sci Res Ctr Ubiquitous Sensor Network 19A Yuquan Rd Beijing 100049 Peoples R China Tianjin Chengjian Univ Sch Comp & Informat Engn Tianjin Peoples R China Mem Univ Newfoundland Fac Engn & Appl Sci St John NF A1B 3X5 Canada

Power use is a crucial design concern in wireless ad hoc and sensor networks since it corresponds directly to the network operational time. In this paper, we study the issue of power-efficient use in the following two aspects: Selecting power-efficient routes and performing efficient localized topology control to assign reduced transmit powers at nodes while preserving the global optimal connectivity. We proposed a localized topology control algorithm using two-hop neighborhood knowledge, which works to build local shortest path tree at each node independently in order to generate a reduced topology while preserving the global optimal connectivity. We derive the energy stretch ratio and maximum degree performance of our proposed algorithm as well as several existing algorithms in this aspect. We then devise three power-efficient on-demand routing protocols on top of various localized topology control algorithms, which are to acquire minimum-power paths while minimizing the associated protocol overhead for route discovery by utilizing local network state information and also packet receipt status at neighbor nodes. We further derive the asymptotical performance of the routing strategy in our protocols in terms of energy stretch ratio and route acquisition latency when network nodes operate at limited discrete power levels. Simulation results are provided to demonstrate the high performance of our topology control algorithm and also the devised routing protocols.

关键词： Topology control localized algorithm Power-aware routing On-demand routing Wireless ad hoc and sensor networks

来源：评论

学校读者我要写书评

暂无评论

On Centralized and localized Approximation algorithms for Interference-Aware Broadcast Scheduling

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2013年第2期12卷 233-247页

作者： Tiwari, Ravi Dinh, Thang N. Thai, My T. Ebay Inc San Jose CA 95126 USA Univ Florida Dept Comp & Informat Sci & Engn Gainesville FL 32611 USA

Broadcast scheduling in multihop Wireless Sensor Networks (WSNs) is an effective mechanism to perform interference-aware broadcasting. Existing works provide centralized solutions, which cannot be implemented locally. Additionally, they consider very elementary network and interference models, in which, either all sensor nodes have the same transmission range or their transmission ranges are equal to their interference ranges that are not very practical. Furthermore, they entirely ignore the existence of WSNs in 3D. In this paper, we study the broadcast scheduling in 2D and 3D WSNs. We consider that sensor nodes may have different transmission ranges and their interference ranges are alpha times of their transmission ranges (where alpha > 1). We devise efficient coloring methods for coloring a hexagonal tiling in 2D plane and a truncated octahedron tiling in 3D space, based on which we propose O(1)-centralized approximation algorithms and O(1)-localized approximation algorithms for the broadcast scheduling problem in 2D and 3D WSNs, respectively. Our O(1)-centralized approximation algorithms for 3D WSNs and O(1)-localized approximation algorithms for 2D and 3D WSNs are the first approximation algorithms for the corresponding problems. Finally, we present an efficient greedy heuristic to study the effect of various priority metrics for greedily scheduling multiple interfering transmissions. Theoretical analysis and experimental results are provided to evaluate the performance of our algorithms.

关键词： Broadcast scheduling approximation algorithm localized algorithm

来源：评论

学校读者我要写书评

暂无评论

LBDP: localized Boundary Detection and Parametrization for 3-D Sensor Networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2014年第2期22卷 567-579页

作者： Li, Feng Zhang, Chi Luo, Jun Xin, Shi-Qing He, Ying Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

Many applications of wireless sensor networks involve monitoring a time-variant event (e. g., radiation pollution in the air). In such applications, fast boundary detection is a crucial function, as it allows us to track the event variation in a timely fashion. However, the problem becomes very challenging as it demands a highly efficient algorithm to cope with the dynamics introduced by the evolving event. Moreover, as many physical events occupy volumes rather than surfaces (e. g., pollution again), the algorithm has to work for 3-D cases. Finally, as boundaries of a 3-D network can be complicated 2-manifolds, many network functionalities (e. g., routing) may fail in the face of such boundaries. To this end, we propose localized Boundary Detection and Parametrization (LBDP) to tackle these challenges. The first component of LBDP is UNiform Fast On-Line boundary Detection (UNFOLD). It applies an inversion to node coordinates such that a "notched" surface is "unfolded" into a convex one, which in turn reduces boundary detection to a localized convexity test. We prove the correctness and efficiency of UNFOLD;we also use simulations and implementations to evaluate its performance, which demonstrates that UNFOLD is two orders of magnitude more time-and energy-efficient than the most up-to-date proposal. Another component of LBDP is localized Boundary Sphericalization (LBS). Through purely localized operations, LBS maps an arbitrary genus-0 boundary to a unit sphere, which in turn supports functionalities such as distinguishing interboundaries from external ones and distributed coordinations on a boundary. We implement LBS in TOSSIM and use simulations to show its effectiveness.

关键词： 3-D wireless sensor networks boundary detection convexity test inversion localized algorithm surface parametrization

来源：评论

学校读者我要写书评

暂无评论

localized routing with guaranteed delivery and a realistic physical layer in wireless sensor networks

引用

COMPUTER COMMUNICATIONS 2006年第13-14期29卷 2550-2555页

作者： Stojmenovic, Milos Nayak, Amiya Univ Ottawa SITE Ottawa ON Canada

Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where messages between nodes are received correctly if and only if the distance between them is up to the transmission radius, which is equal for all nodes. Sensor networks require localized solutions, where nodes make decisions based on their own positions, the positions of their neighbouring nodes and the position of the destination. Existing localized routing algorithms include greedy routing and GFG (with guaranteed delivery) for the unit disk graph model and expected progress routing for a physical layer model. In a physical layer model, the packet reception probability depends on the distance between nodes. We propose to combine the expected progress routing with face routing to define a localized routing algorithm that guarantees delivery under realistic physical layer models. The proposed localized routing protocol is called EFE (Expected progress-Face-Expected progress). We have implemented the proposed algorithm and compared it with the shortest weighted path scheme. They both assume an ideal medium access layer, where packets between two neighbouring nodes are delivered in the number of attempts equal to the expected hop count between them (which is the expected number of transmissions and acknowledgments). The experiments show that localized EFE is efficient compared to the globalized shortest path algorithm, especially for dense networks. (c) 2006 Elsevier B.V. All rights reserved.

关键词： wireless sensor networks routing guaranteed delivery localized algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：