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

Enabling disaster-resilient communication using multi-hop device-to-device framework

WIRELESS NETWORKS 2021年第1期27卷 649-661页

作者： Peer, Mansi Bohara, Vivek Ashok Srivastava, Anand IIIT Delhi Dept ECE Wirocomm Res Grp New Delhi India

With the occurrence of a disaster, the conventional cellular network becomes non-functional. To provide connectivity to the affected users in such a scenario, we propose a novel multi-hop device-to-device (D2D) communication framework to connect to an active base station (BS). The goal of the proposed work is to maximize the number of covered users in the disaster-affected area within a given time frame. Joint routing and scheduling is imperative in a multi-hop network;however, the existing works on joint routing and scheduling optimization consider that the source-destination (user-BS) pairs are known beforehand or fixed. This is an inefficient approach when maximizing the number of covered users in a time-bounded communication set-up. Consequently, we propose a novel multi-hop D2D framework with joint source-destination pairing, routing and scheduling optimization. The optimization problem is formulated as an integer linear programming (ILP) problem. Further, due to the high time complexity of ILP, a low complexity graph-based scheduling constraint aware routing and pairing algorithm is proposed, resulting in a significant reduction in processing time compared to the optimal solution. The proposed algorithm also outperforms shortest path routing based scheduling in terms of users covered in the disaster-affected area.

关键词： Multi-hop D2D Disaster-resilient communication Joint source– destination pairing coverage maximization

来源：评论

学校读者我要写书评

暂无评论

Self-deployment of mobile underwater acoustic sensor networks for maximized coverage and guaranteed connectivity

引用

AD HOC NETWORKS 2015年 34卷 170-183页

作者： Senel, Fatih Akkaya, Kemal Erol-Kantarci, Melike Yilmaz, Turgay Antalya Int Univ Dept Comp Engn TR-07190 Antalya Turkey Florida Int Univ Dept Elect & Comp Engn Miami FL 33174 USA Clarkson Univ Dept Elect & Comp Engn Potsdam NY 13699 USA Middle E Tech Univ Dept Comp Engn TR-06531 Ankara Turkey

Self-deployment of sensors with maximized coverage in Underwater Acoustic Sensor Networks (UWASNs) is challenging due to difficulty of access to 3-D underwater environments. The problem is further compounded if the connectivity of the final network is desired. One possible approach to this problem is to drop the sensors on the water surface and then move them to certain depths in the water to maximize the 3-0 coverage while maintaining the initial connectivity. In this paper, we propose a fully distributed node deployment scheme for UWASNs which only requires random dropping of sensors on the water surface. The idea is based on determining the connected dominating set (CDS) of the initial network on the surface and then adjust the depths of all neighbors of a particular dominator node (i.e., the backbone of the network) for minimizing the coverage overlaps among them while still keeping the connectivity with the dominator. The process starts with a leader node and spans all the dominators in the network for repositioning them. In addition to depth adjustment, we studied the effects of possible topology alterations due to water mobility caused by several factors such as waves, winds, currents, vortices or random surface effects, on network coverage and connectivity performance. On the one hand the mobility of nodes may help the topology to get stretched in 2-D, which helps to maximize the coverage in 3-0. On the other hand the mobility may cause the network to get partitioned where some of the nodes are disconnected from the rest of the topology. We investigated the best node deployment time where 2-D coverage is maximized and the network is still connected. To simulate the mobility of the sensors, we implemented meandering current mobility model which is one of the existing mobility models for UWASNs that fits our needs. The performance of the proposed approach is validated through simulation. Simulations results indicate that connectivity can be guaranteed regardle

关键词： Self-deployment coverage maximization Connectivity Underwater acoustic sensor networks Mobility model

来源：评论

学校读者我要写书评

暂无评论

Novel Graph-Theoretical Multiple Access-Point/Router Deployment Approach for Full Line-of-Sight coverage Over Arbitrary Indoor Polygonal/Prismatic Areas

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2024年第9期72卷 5924-5940页

作者： Gadiraju, Venkata Wu, Hsiao-Chun Tsai, Hao-Yu Huang, Scott C. -H. Busch, Costas Neupane, Prasanga Liu, Guannan Chang, Shih Yu Louisiana State Univ Sch Elect Engn & Comp Sci Baton Rouge LA 70803 USA Yuan Ze Univ Innovat Ctr AI Applicat Taoyuan 32003 Zhongli Taiwan Natl Tsing Hua Univ Dept Elect Engn Hsinchu 30013 Taiwan Augusta Univ Sch Comp & Cyber Sci Augusta GA 30912 USA CGI Inc Burlington VT 05401 USA San Jose State Univ Dept Appl Data Sci San Jose CA 95192 USA

Nowadays, wireless local-area networks (WLANs) are widely deployed in residential and commercial areas. The coverage quality is essential to users. The full coverage appears to be one of the most crucial problems to be considered during the network and access-point/router deployment (placement). We formulate the light-of-sight (LoS) coverage problem using the visibility-graph framework. In this work, for arbitrary multiply-connected or simply-connected polygonal/prismatic fields-of-interest subject to an arbitrary link-range restriction, we investigate how the full LoS coverage can be achieved by a minimum number of access-points/routers. Based on the new mathematical lemmas we derive, we design a novel graph-theoretical approach accordingly. Our proposed new scheme can be deemed the first-ever systematic approach to the best of our knowledge. Our proposed new approach is also evaluated in terms of the coverage efficiency, the number of access-points/routers, and the peak link-distance ratio for full LoS coverage in comparison with the existing solution to the art gallery problem.

关键词： Three-dimensional displays Systematics Indoor environment Wireless networks Quality of experience Millimeter wave communication Wireless fidelity Multiple access-point/router deployment/placement visibility graph maximal clique coverage maximization art gallery problem (AGP) link-range restriction peak link-distance ratio (PLDR)

来源：评论

学校读者我要写书评

暂无评论

A Parallel Zeroth-Order Framework for Efficient Cellular Network Optimization

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2024年第11期23卷 17522-17538页

作者： He, Pengcheng Lu, Siyuan Xu, Fan Kang, Yibin Yan, Qi Shi, Qingjiang Tongji Univ Sch Software Engn Shanghai 201804 Peoples R China Chinese Univ Hong Kong Shenzhen Shenzhen Res Inst Big Data Shenzhen 518172 Peoples R China Huawei Technol Cent Media Technol Inst Shanghai 201206 Peoples R China Peng Cheng Lab Shenzhen 518066 Peoples R China Huawei Technol Networking & User Experience Lab Shenzhen 518129 Peoples R China

Network optimization plays a crucial role in wireless communications. However, the optimization of contemporary 5G networks is challenging due to its black-box nature and huge searching space. To address these challenges, this paper introduces efficient zeroth-order (ZO) algorithms and a parallel framework for optimizing large-scale networks. By leveraging the gradient-based searching strategy, the proposed algorithms, namely ZO projected gradient descent (ZO-PGD) and ZO block coordinate projected gradient descent (ZO-BCPGD), can significantly improve optimization quality and computational efficiency. Both algorithms guarantee a convergence towards stationary points under mild conditions, eliminating inherent errors in traditional ZO methods. We further propose a parallel framework for optimizing the network parameters in a simultaneous manner. By partitioning the entire network into manageable subnetworks, the original network optimization problem is reformulated as a consensus optimization problem and tackled in parallel using the penalty dual decomposition (PDD) method. We have also designed a tailored size-constrained grid clustering algorithm for network partitioning to ensure load balance among parallel working nodes. The efficacy of our proposed schemes is verified by extensive numerical results. Our ZO algorithms outperform existing methods in both computational efficiency and solution quality. Moreover, the parallel framework significantly reduces execution time without sacrificing network performance.

关键词： Optimization Interference Base stations 5G mobile communication Wireless communication Computational efficiency Knowledge engineering Cellular network zeroth-order optimization coverage maximization parallel computation size-constrained clustering

来源：评论

学校读者我要写书评

暂无评论

VirFID: A Virtual Force (VF)-based Interest-Driven moving phenomenon monitoring scheme using multiple mobile sensor nodes

引用

AD HOC NETWORKS 2015年 27卷 112-132页

作者： Van Le, Duc Oh, Hoon Yoon, Seokhoon Univ Ulsan Dept Elect & Comp Engn Ulsan 680749 South Korea

In this paper, we study mobile sensor network (MSN) architectures and algorithms for monitoring a moving phenomenon in an unknown and open area using a group of autonomous mobile sensor (MS) nodes. Monitoring a moving phenomenon involves challenges due to limited communication/sensing ranges of MS nodes, the phenomenon's unpredictable changes in distribution and position, and the lack of information on the sensing area. To address the challenges and meet the objective of the maximization of weighted sensing coverage, we propose a novel scheme, namely VirFID (Virtual Force (VF)-based Interest-Driven moving phenomenon monitoring). In VirFID, MS nodes move toward the positions where more interesting sensing data can be obtained by utilizing the virtual force, which is calculated based on the distance between MS nodes and sensed values in the area of interest. MS nodes also perform network-wise information sharing to increase the weighted sensing coverage. Depending on the level of information used, three variants of VirFID are evaluated: VirFID-LIB (Local Information-Based), VirFID-GHL (Global Highest and Lowest), and VirFID-IBN (Interests at Boundary Nodes). In addition, an analytical model for estimating MSN speed is designed. Simulations are performed to compare the performance of three VirFID variants with other approaches. Our simulation results show that VirFID algorithms outperform other schemes in terms of the weighted coverage efficiency, and VirFID-IBN achieves the highest weighted coverage efficiency among VirFID variants. (C) 2014 The Authors. Published by Elsevier B.V.

关键词： Mobile sensor networks Mobile sensor nodes Moving phenomenon monitoring coverage maximization

来源：评论

学校读者我要写书评

暂无评论

Non-Orthogonal Multiple Access for Unmanned Aerial Vehicle Assisted Communication

引用

IEEE ACCESS 2018年 6卷 22716-22727页

作者： Sohail, Muhammad Farhan Leow, Chee Yen Won, Seunghwan Univ Teknol Malaysia Wireless Commun Ctr Fac Elect Engn Johor Baharu 81310 Malaysia Natl Univ Modern Languages Dept Elect Engn Islamabad 44000 Pakistan Univ Southampton Sch Elect & Comp Sci Malaysia Campus Johor Baharu 79200 Malaysia

The future wireless networks promise to provide ubiquitous connectivity to a multitude of devices with diversified traffic patterns wherever and whenever needed. For the sake of boosting resilience against faults, natural disasters, and unexpected traffic, the unmanned aerial vehicle (UAV)-assisted wireless communication systems can provide a unique opportunity to cater for such demands in a timely fashion without relying on the overly engineered cellular network. However, for UAV-assisted communication, issues of capacity, coverage, and energy efficiency are considered of paramount importance. The case of non-orthogonal multiple access (NOMA) is investigated for aerial base station (BS). NOMA's viability is established by formulating the sum-rate problem constituting a function of power allocation and UAV altitude. The optimization problem is constrained to meet individual user-rates arisen by orthogonal multiple access (OMA) bringing it at par with NOMA. The relationship between energy efficiency and altitude of a UAV inspires the solution to the aforementioned problem considering two cases, namely, altitude fixed NOMA and altitude optimized NOMA. The latter allows exploiting the extra degrees of freedom of UAV-BS mobility to enhance the spectral efficiency and the energy efficiency. Hence, it saves joules in the operational cost of the UAV. Finally, a constrained coverage expansion methodology, facilitated by NOMA user rate gain is also proposed. Results are presented for various environment settings to conclude NOMA manifesting better performance in terms of sum-rate, coverage, and energy efficiency.

关键词： Non-orthogonal multiple access (NOMA) orthogonal multiple access (OMA) unmanned aerial vehicle (UAV) sum-rate maximization coverage maximization aerial cells energy efficiency

来源：评论

学校读者我要写书评

暂无评论

coverage-aware connectivity-constrained unattended sensor deployment in underwater acoustic sensor networks

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2016年第14期16卷 2052-2064页

作者： Senel, Fatih Antalya Int Univ Dept Comp Engn TR-07190 Antalya Turkey

Careful deployment of nodes in underwater acoustic sensor networks in a distributed manner with the goal of maximized coverage and guaranteed connectivity is a challenging problem because it is very difficult and costly to access the 3D underwater environment. This paper presents a novel algorithm for self-deployment of nodes in underwater acoustic sensor networks assuming that the nodes are randomly dropped to the water surface and form a densely populated connected network at the water surface. The idea of the algorithm is based on calculating an optimized depth for each node in the network in such a way that the possible sensing coverage overlaps are minimized and the connectivity of final topology is guaranteed. The algorithm has three main phases. In the first phase, nodes are organized in a tree structure that is rooted at the surface station. In the second phase, the depths for all nodes are computed iteratively at surface station. In the final phase, the calculated depths are distributed to nodes so that the nodes start sinking. The performance of the proposed approach is validated through simulation. We observed that the proposed approach performs at least 10% better in terms of network coverage than contemporary schemes in the literature. Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： underwater acoustic sensor networks self node deployment coverage maximization connectivity

来源：评论

学校读者我要写书评

暂无评论

Sustainable Wireless Services With UAV Swarms Tailored to Renewable Energy Sources

引用

IEEE TRANSACTIONS ON SMART GRID 2023年第4期14卷 3296-3308页

作者： Donevski, Igor Virgili, Marco Babu, Nithin Nielsen, Jimmy Jessen Forsyth, Andrew J. Papadias, Constantinos B. Popovski, Petar Aalborg Univ Dept Elect Syst DK-9100 Aalborg Denmark Univ Manchester Sch Elect & Elect Engn Manchester M13 9PL England Lyra Elect Ltd Res & Dev Dept Wellesbourne CV35 9EF England Amer Coll Greece SWIFT Lab Res Technol & Innovat Network ALBA Athens 15125 Greece

Unmanned Aerial Vehicle (UAV) swarms are often required in off-grid scenarios, such as disaster-struck, war-torn or rural areas, where the UAVs have no access to the power grid and instead rely on renewable energy. Considering a main battery fed from two renewable sources, wind and solar, we scale such a system based on the financial budget, environmental characteristics, and seasonal variations. Interestingly, the source of energy is correlated with the energy expenditure of the UAVs, since strong winds cause UAV hovering to become increasingly energy-hungry. The aim is to maximize the cost efficiency of coverage at a particular location, which is a combinatorial optimization problem for dimensioning of the multivariate energy generation system under non-convex criteria. We have devised a customized algorithm by lowering the processing complexity and reducing the solution space through sampling. Evaluation is done with condensed real-world data on wind, solar energy, and traffic load per unit area, driven by vendor-provided prices. The implementation was tested in four locations, with varying wind or solar intensity. The best results were achieved in locations with mild wind presence and strong solar irradiation, while locations with strong winds and low solar intensity require higher Capital Expenditure (CAPEX) allocation.

关键词： coverage maximization drone swarms energy balancing photovoltaics UAV base station wind turbines

来源：评论

学校读者我要写书评

暂无评论

SpatialRecruiter: Maximizing Sensing coverage in Selecting Workers for Spatial Crowdsourcing

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2017年第6期66卷 5229-5240页

作者： Zhang, Xinglin Yang, Zheng Gong, Yue-Jiao Liu, Yunhao Tang, Shaohua South China Univ Technol Sch Comp Sci & Engn Guangzhou 510006 Guangdong Peoples R China Tsinghua Univ Sch Software Beijing 100084 Peoples R China Tsinghua Univ Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

Spatial crowdsourcing and crowdsensing are two emerging crowdsourcing paradigms, which enable a variety of location-based query and sensing tasks. In spatial crowdsourcing, mobile workers are required to travel physically to target locations in order to complete query tasks. Most existing work, hence, has focused on designing efficient query task assignment schemes to maximize the task completion rate under traveling constraints of workers for spatial crowdsourcing systems. In crowdsensing, on the other hand, sensor recordings of workers' smartphones are of interest and have been collected to build various applications. Therefore, work concerning crowdsensing has strived to maximize the coverage area of sensor trajectories by selecting a set ofworkers. In this paper, we investigate the integration of these two paradigms. We notice a key link between these paradigms: While a worker is traveling to the target location of a query task, his trajectory may provide valuable coverage for a sensing task. Therefore, we propose a task management framework, named SpatialRecruiter, to efficiently match workers to the merged query and sensing tasks. We propose two coverage estimation functions to compute the coverage potential of a worker. Then, we design a greedy heuristic to select and assignworkers. The experimental results on a real-world dataset demonstrate that the proposed strategies are efficient and effective in meeting the requirements of both paradigms.

关键词： coverage maximization crowdsensing spatial crowdsourcing task assignment

来源：评论

学校读者我要写书评

暂无评论

Almost Optimal Streaming Algorithms for coverage Problems 17

Almost Optimal Streaming Algorithms for Coverage Problems

引用

29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)

作者： Bateni, MohammadHossein Esfandiari, Hossein Mirrokni, Vahab Google Res New York NY 10011 USA Univ Maryland College Pk MD 20742 USA

ISBN: (纸本)9781450345934

Maximum coverage and minimum set cover problems-here collectively called coverage problems-have been studied extensively in streaming models. However, previous research not only achieves suboptimal approximation factors and space complexities but also study a restricted set-arrival model which makes an explicit or implicit assumption on oracle access to the sets, ignoring the complexity of reading and storing the whole set at once. In this paper, we address the above shortcomings and present algorithms with improved approximation factor and improved space complexity, and prove that our results are almost tight. Moreover, unlike most of the previous work, our results hold in a more general edge-arrival model. More specifically, consider an instance with n sets, together covering m elements. Information arrives in the form of "edges" from sets to elements (denoting membership) in arbitrary order. (1) We present (almost) optimal approximation algorithms for maximum coverage and minimum set cover problems in the streaming model with an (almost) optimal space complexity of (O) over tilde (n);i.e., the space is independent of the size of the sets or the size of the ground set of elements. These results not only improve the best known algorithms for the set-arrival model, but also are the first such algorithms for the more powerful edge-arrival model. (2) In order to achieve the above results, we introduce a new general sketching technique for coverage functions: One can apply this sketching scheme to convert an alpha-approximation algorithm for a coverage problem to a (1-epsilon) alpha-approximation algorithm for the same problem in streaming model. (3) We show the significance of our sketching technique by ruling out the possibility of solving coverage problems via accessing (as a black box) a (1 +/-epsilon)-approximate oracle (e.g., a sketch function) that estimates the coverage function on any subfamily of the sets. Finally, we show that our streaming algorithms achiev

关键词： set cover distributed algorithm coverage maximization submodular maximization streaming algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：