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

deployment algorithms for UAV Airborne Networks Toward On-Demand Coverage

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2018年第9期36卷 2015-2031页

作者： Zhao, Haitao Wang, Haijun Wu, Weiyu Wei, Jibo Natl Univ Def Technol Coll Elect Sci Changsha 410073 Hunan Peoples R China Hunan Univ Coll Elect & Informat Engn Changsha 410082 Hunan Peoples R China

Due to the flying nature of unmanned aerial vehicles (UAVs), it is very attractive to deploy UAVs as aerial base stations and construct airborne networks to provide service for on-ground users at temporary events (such as disaster relief, military operation, and so on). In the constructing of UAV airborne networks, a challenging problem is how to deploy multiple UAVs for on-demand coverage while at the same time maintaining the connectivity among UAVs. To solve this problem, we propose two algorithms: a centralized deployment algorithm and a distributed motion control algorithm. The first algorithm requires the positions of user equipments (UEs) on the ground and provides the optimal deployment result (i.e., the minimal number of UAVs and their respective positions) after a global computation. This algorithm is applicable to the scenario that requires a minimum number of UAVs to provide desirable service for already known on-ground UEs. Differently, the second algorithm requires no global information or computation, instead, it enables each UAV to autonomously control its motion, find the UEs and converge to on-demand coverage. This distributed algorithm is applicable to the scenario where using a given number of UAVs to cover UEs without UEs' specific position information. In both algorithms, the connectivity of the UAV network is maintained. Extensive simulations validate our proposed algorithms.

关键词： Unmanned aerial vehicle (UAV) airborne network deployment algorithms on-demand coverage connectivity

来源：评论

学校读者我要写书评

暂无评论

deployment algorithms for Wireless Underground Sensor Networks using Magnetic Induction

Deployment Algorithms for Wireless Underground Sensor Networ...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Sun, Zhi Akyildiz, Ian F. Georgia Inst Technol Sch Elect & Comp Engn Broadband Wireless Networking Lab Atlanta GA 30332 USA

ISBN: (纸本)9781424456383

New propagation techniques using magnetic induction (MI) waveguide solve the problems of traditional techniques in the underground soil medium. However, the deployment of the MI waveguide to connect the wireless underground sensor networks (WUSNs) is challenging due to the high deployment cost and the complex shape of the communication range of the MI waveguides. In this paper, two algorithms are proposed to deploy the MI waveguides to connect the underground sensors in the WUSNs. To minimize the number of relay coils, the MST algorithm based on the minimum spanning tree is developed. However, the network constructed by the MST algorithm is not robust to sensor failures. To enhance the network robustness with acceptable relay coil number, the TC algorithm based on the Voronoi diagram is developed. The effectiveness of the proposed deployment algorithms is validated by simulations.

关键词： MI waveguide MST algorithm TC algorithm Voronoi diagram WUSN computational geometry deployment algorithms electromagnetic induction magnetic induction waveguide minimum spanning tree propagation techniques relay coil number sensor failures telecommunicati

来源：评论

学校读者我要写书评

暂无评论

Curve-Based deployment for Barrier Coverage in Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2014年第2期13卷 724-735页

作者： He, Shibo Gong, Xiaowen Zhang, Junshan Chen, Jiming Sun, Youxian Zhejiang Univ Key Lab Ind Control Technol Hangzhou Zhejiang Peoples R China Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ 85287 USA Zhejiang Univ State Key Lab Ind Control Technol Hangzhou Zhejiang Peoples R China

This paper studies deterministic sensor deployment for barrier coverage in wireless sensor networks. Most of existing works focused on line-based deployment, ignoring a wide spectrum of potential curve-based solutions. We, for the first time, extensively study the sensor deployment under a general setting. We first present a condition under which the line-based deployment is suboptimal, revealing the advantage of curve-based deployment. By constructing a contracting mapping, we identify the characteristics for a deployment curve to be optimal. Based on the optimal deployment curve, we design sensor deployment algorithms by introducing a new notion of distance-continuous. Our findings show that i) when the deployment curve is distance-continuous, the proposed algorithm is optimal in terms of the vulnerability corresponding to the deployment, and ii) when the deployment curve is not distance-continuous, the approximation ratio of the vulnerability corresponding to the deployment by the proposed algorithm to the optimal one is upper bounded by min (pi, parallel to(AB) over tilde parallel to/parallel to(AGB) over tilde parallel to 2n+root 2-1/2n, where parallel to(AB) over tilde parallel to and parallel to(AGB) over tilde parallel to are some constants, and n is the number of sensors. We generalize the study to the heterogeneous sensing model, and show that the proposed algorithm can provide close-to-optimal performance. Extensive numerical results corroborate our analysis.

关键词： Barrier coverage curved-based deployment optimal deployment curve deployment algorithms

来源：评论

学校读者我要写书评

暂无评论

Algorithm for Autonomous Reorganization of Mobile Wireless Camera Sensor Networks to Improve Coverage

引用

IEEE SENSORS JOURNAL 2015年第8期15卷 4428-4441页

作者： Nene, Manisha Jitendra Deodhar, Rajendra S. Patnaik, Lalit Mohan Def Res & Dev Org Minist Def Def Inst Adv Technol Dept Comp Engn Pune 411025 Maharashtra India Armament Res & Dev Estab Pune 411021 Maharashtra India Indian Inst Sci Bangalore 560012 Karnataka India

In this paper, sensing coverage by wireless camera-embedded sensor networks (WCSNs), a class of directional sensors is studied. The proposed work facilitates the autonomous tuning of orientation parameters and displacement of camera-sensor nodes in the bounded field of interest (FoI), where the network coverage in terms of every point in the FoI is important. The proposed work is first of its kind to study the problem of maximizing coverage of randomly deployed mobile WCSNs which exploits their mobility. We propose an algorithm uncovered region exploration algorithm (UREA-CS) that can be executed in centralized and distributed modes. Further, the work is extended for two special scenarios: 1) to suit autonomous combing operations after initial random WCSN deployments and 2) to improve the network coverage with occlusions in the FoI. The extensive simulation results show that the performance of UREA-CS is consistent, robust, and versatile to achieve maximum coverage, both in centralized and distributed modes. The centralized and distributed modes are further analyzed with respect to the computational and communicational overheads.

关键词： Autonomous deployments camera-embedded sensors directional sensors deployment algorithms centralized algorithms distributed algorithms self-organization self-configuration

来源：评论

学校读者我要写书评

暂无评论

Short Paper: MPOT: 3D Mote Placement Optimization algorithms for WSNs

Short Paper: MPOT: 3D Mote Placement Optimization Algorithms...

引用

1st IEEE World Forum on Internet of Things (WF-IoT)

作者： Ramadan, Rabie A. Ali, Tamer A. Khairy, Mohamed M. Cairo Univ Dept Comp Engn Cairo Egypt Cairo Univ Engn Math & Phys Dept Cairo Egypt Cairo Univ Elect & Commun Dept Cairo Egypt

ISBN: (纸本)9781479934591

This With the advances of hardware technology, WSNs have been utilized in many critical application. Some of these applications are battle field monitoring, health care monitoring, structure health monitoring, and many other applications. However, there are some other applications that require Three Dimension (3D) deployment such as smart home, smart classroom, and/or even smart city or smart University. Few researchers have studied such applications and one of their problems is the 3D deployment. Most of them use a deterministic deployment method and build all of the network measurements and consideration based on such deployment. In addition, there is a lack of 3D simulators that handles such deployment including the 3D environment, 3D channel models, and 3D optimization objectives. This paper briefly introduces a 3D Mote Placement Optimization tool (MPOT) and introduces one out of four deployment algorithms that already implemented and tested in addition to the Random deployment algorithm. This work is part of Web of Object project sponsored by ITEA 2 (UK) and ITIDA Egypt).

关键词： deployment algorithms MPOT 2D and 3D simulator

来源：评论

学校读者我要写书评

暂无评论

A Novel Access Point Placement Approach for WLAN-based Location Systems

A Novel Access Point Placement Approach for WLAN-based Locat...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Fang, Shih-Hau Lin, Tsung-Nan Yuan Ze Univ Dept Elect Engn Tao Yuan Taiwan Natl Taiwan Univ Grad Inst Commun Engn Taipei Taiwan

ISBN: (纸本)9781424463985

This paper presents a novel approach to placing access points (APs) in wireless local area networks (WLAN). Unlike the traditional methods focusing on coverage maximization, we investigate how to place APs from the perspective of an indoor location system. We present a framework for linking the placement of APs and the positioning performance. Our algorithm, namely maximizing SNR (signal-to-noise ratio), aims at choosing a proper set of APs' locations so that the signal is maximized and the noise is minimized simultaneously. The proposed algorithm regards the location discriminant information as the signal and the degree of unstable measurements as the noise. Such numerical values provide a good theoretical formulation to measure the influence of the AP deployment. In our location system, we utilize such SNR ratio to deploy APs so as to reduce the positioning errors. Our location system is developed in a real-world WLAN environment, where the realistic measurements were collected. The experimental results show that the positioning accuracy is improved based on our deployment approach in different scenarios.

关键词： WLAN AP placement deployment algorithms fingerprinting indoor positioning

来源：评论

学校读者我要写书评

暂无评论

Gateway placement and fault tolerance in QoS aware wireless mesh networks

Gateway placement and fault tolerance in QoS aware wireless ...

引用

作者： Drabu, Yasir Kent State University

学位级别：Ph.D.

Wireless Mesh Networks (WMN's), in the form of WiFi (802.11x) or WiMax (802.16x), or their integrations have been proposed as an effective communication alternative for ubiquitous last mile wireless broadband access. They can be viewed as a hybrid between traditional cellular, point-to-point wireless systems, and ad-hoc networks. They offer more flexibility, mobility, coverage and expandability compared to their traditional counterparts at the expense of complex architecture and deployment structure. Though WMNs hold great promise in abetting network ubiquity, there still remain several challenges in the design and development of WMN's to support diverse services with different quality of service (QoS) requirements and large scale deployment. The focus of this dissertation is to address some of the core issues that directly affect the QoS in terms of delay, throughput, and fault tolerance.@pqdt@break@First we look at the deployment problem of the placement of wired gateways. This aspect of WMNs has a significant impact on the network's throughput performance, cost and capacity to satisfying the quality of service requirements. In the context of gateway placement, the QoS is influenced by the number of gateways, the number of nodes served by each gateway, the location of the gateways, and the relay load on each wireless router. While finding an optimal solution to simultaneously satisfy all the above constraints is known to be an NP -hard problem, near optimal solutions can be found within the feasibility region in polynomial time using various heuristic methods. In the initial part of this dissertation, we first present a near optimal heuristics algorithm for gateway placement that facilitates QoS provisioning and fault tolerance in WMNs. We then investigate fault tolerance and recovery problems in WMNs. We present a fault recovery algorithm that can exploit the known geometry of a regular cellular mesh network. While keeping the QoS metrics intact, we consider a

关键词： Computer Science wireless mesh networks deployment algorithms fault tolerant provisioning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：