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

Impact of Metaheuristic Optimization Algorithms on Wireless network coverage Enhancement With Reconfigurable Intelligent Surfaces

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2025年第5期38卷

作者： Panuganti, Nitin Ranjan, Pinku Shukla, Anupam ABV Indian Inst Informat Technol & Management Dept Comp Sci & Engn Gwalior India ABV Indian Inst Informat Technol & Management Dept Elect & Elect Engn Gwalior India

Reconfigurable intelligent surfaces are a transformative technological advancement in wireless networks toward enhancing coverage and signal strength by exploiting intelligent, programmable surfaces. This paper discusses the application of metaheuristic optimization to configure reconfigurable intelligent surfaces for performance enhancement in wireless communications. Reconfigurable intelligent surface (RIS) technology based on programmable surfaces dynamically adjusts a radio environment, thereby having an impact on signal quality enhancement and coverage. We test several optimization algorithms, including genetic algorithm (GA), cuckoo search (CS), harmony search (HS), ant colony optimization (ACO), differential evolution (DE), dual annealing, gradient descent, tabu search, and the bee algorithm. The results show that GA explores the solution space. CS and HS balance well between exploration and exploitation. ACO and DE find paths and parameters efficiently, and dual annealing excels in escaping local optima. Tabu search and the bee algorithm also provide strong performance in the avoidance of local minima. RIS elements can integrate highly into the network to enhance its performance, leading to better-received signal strength and improved coverage. The results have the potential to optimize wireless networks by combining the use of RIS technology with advanced algorithms such as those described here and call for further research in hybrid optimization approaches and complex network scenarios.

关键词： differential evolution dual annealing Nelder-Mead network coverage reconfigurable intelligent surfaces (RISs) signal strength wireless network optimization

来源：评论

学校读者我要写书评

暂无评论

IQABC-Based Hybrid Deployment Algorithm for Mobile Robotic Agents Providing network coverage

引用

Tsinghua Science and Technology 2024年第2期29卷 589-604页

作者： Shuang Xu Xiaojie Liu Dengao Li Jumin Zhao College of Computer Science and Technology(College of Data Science) Taiyuan University of TechnologyTaiyuan 030024China Pengcheng Laboratory Shenzhen 518055China College of Information and Computer Taiyuan University of TechnologyTaiyuan 030024China

Working as aerial base stations,mobile robotic agents can be formed as a wireless robotic network to provide network services for on-ground mobile devices in a target ***,a challenging issue is how to deploy these mobile robotic agents to provide network services with good quality for more users,while considering the mobility of on-ground *** this paper,to solve this issue,we decouple the coverage problem into the vertical dimension and the horizontal dimension without any loss of optimization and introduce the network coverage model with maximum coverage ***,we propose a hybrid deployment algorithm based on the improved quick artificial bee *** algorithm is composed of a centralized deployment algorithm and a distributed *** proposed deployment algorithm deploy a given number of mobile robotic agents to provide network services for the on-ground devices that are independent and identically *** results have demonstrated that the proposed algorithm deploys agents appropriately to cover more ground area and provide better coverage uniformity.

关键词： wireless robotic networks network coverage deployment algorithm improved quick artificial bee colony

来源：评论

学校读者我要写书评

暂无评论

Joint Base Station and IRS Deployment for Enhancing network coverage: A Graph-Based Modeling and Optimization Approach

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2023年第11期22卷 8200-8213页

作者： Mei, Weidong Zhang, Rui Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu 611731 Peoples R China Chinese Univ Hong Kong Sch Sci & Engn Shenzhen 518172 Peoples R China Shenzhen Res Inst Big Data Shenzhen 518172 Peoples R China Natl Univ Singapore Dept Elect & Comp Engn Singapore 117583 Singapore

Intelligent reflecting surface (IRS) can be densely deployed in complex environment to create cascaded line-of-sight (LoS) paths between multiple base stations (BSs) and users via tunable IRS reflections, thereby significantly enhancing the coverage performance of wireless networks. To achieve this goal, it is vital to optimize the deployed locations of BSs and IRSs in the wireless network, which is investigated in this paper. Specifically, we divide the coverage area of the network into multiple non-overlapping cells and decide whether to deploy a BS/IRS in each cell given a total number of BSs/IRSs available. We show that to ensure the network coverage/communication performance, i.e., each cell has a direct/cascaded LoS path with at least one BS, as well as such LoS paths have the average number of IRS reflections less than a given threshold, there is a fundamental trade-off with the deployment cost or the number of BSs/IRSs needed. To optimally characterize this trade-off, we formulate a joint BS and IRS deployment problem based on graph theory, which, however, is difficult to be optimally solved due to the combinatorial optimization involved. To circumvent this difficulty, we first consider a simplified problem with given BS deployment and propose the optimal as well as an efficient suboptimal IRS deployment solution to it, by applying the branch-and-bound method and iteratively removing IRSs from the candidate locations, respectively. Next, an efficient sequential update algorithm is proposed for solving the joint BS and IRS deployment problem. Numerical results are provided to show the efficacy of the proposed design approach and optimization algorithms for the joint BS and IRS deployment. The trade-off between the network coverage performance and the number of deployed BSs/IRSs with different cost ratios is also unveiled.

关键词： Intelligent reflecting surface (IRS) base station deployment IRS deployment network coverage performancecost trade-off graph theory

来源：评论

学校读者我要写书评

暂无评论

Analysis of network coverage Optimization Based on Feedback K-Means Clustering and Artificial Fish Swarm Algorithm

引用

IEEE ACCESS 2020年 8卷 42864-42876页

作者： Feng, Yingying Zhao, Shasha Liu, Hui Fuyang Normal Univ Coll Informat Engn Fuyang 236041 Peoples R China

There is a certain energy loss in the process of wireless sensor network information collection. Moreover, the current network protocols and network coverage methods are not sufficient to effectively reduce system energy consumption. In order to improve the operating efficiency and service life of wireless sensor networks, this study analyzes the classic LEACH protocol, summarizes the advantages and disadvantages, and proposes a targeted clustering method based on the K-means algorithm. At the same time, in order to maximize the network coverage and minimize the energy consumption on the basis of ensuring the quality of service, a wireless sensor network coverage optimization method based on an improved artificial fish swarm algorithm was proposed. In addition, a controlled experiment is designed to analyze the effectiveness and practical effects of the proposed algorithm. The experimental results show that the method proposed in this paper has certain advantages over traditional methods and can provide theoretical references for subsequent related research.

关键词： Feedback K-means clustering artificial fish swarm algorithm network coverage algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

No Blind Spot: network coverage Enhancement Through Joint Cooperation and Frequency Reuse

引用

JOURNAL OF COMMUNICATIONS AND networkS 2016年第5期18卷 773-783页

作者： Zhong, Yi Qiao, Pengcheng Zhang, Wenyi Zheng, Fu-chun Univ Sci & Technol China Dept Elect Engn & Informat Sci EEIS POB 4 Hefei 230027 Anhui Peoples R China USTC Dept EEIS Hefei 230027 Peoples R China SUTD Informat Syst Technol & Design ISTD Pillar Singapore 487372 Singapore IFLYTEK CO LTD Hefei Peoples R China Univ Reading Reading Berks England

Both coordinated multi-point transmission and frequency reuse are effective approaches to mitigate inter-cell interference and improve network coverage. The motivation of this work is to explore the manner to effectively utilize the spectrum resource by reasonably combining cooperation and frequency reuse. The Matern cluster process, which is appropriate to model networks with hot spots, is used to model the spatial distribution of base stations. Two cooperative mechanisms, coherent and non-coherent joint transmission (JT), are analyzed and compared. We also evaluate the effect of multiple antennas and imperfect channel state information. The simulation reveals that the proposed approach to combine cooperation and frequency reuse is effective to improve the network coverage for users located at both the center and the boundary of the cooperative region.

关键词： Coordinated multi-point transmission frequency reuse Matern cluster process network coverage stochastic geometry

来源：评论

学校读者我要写书评

暂无评论

Maximizing network coverage in a multichannel short-range underwater acoustic sensor network

引用

COMPUTER networkS 2019年 160卷 1-10页

作者： Ghannadrezaii, Hossein Bousquet, Jean-Francois Dalhousie Univ Elect & Comp Engn Halifax NS Canada

In this paper, a Media Access Control (MAC) protocol is investigated for multichannel underwater acoustic sensor networks and a distributed channel allocation scheme is proposed for acoustic nodes equipped with a multichannel bi-directional transceiver. To ensure that a minimum of one channel is allocated for each transmitter-receiver pair, a novel distributed channel allocation scheme, the High coverage High Fairness (HCHF) algorithm, is proposed. The algorithm requires the exchange of channel sensing information among neighbor nodes at the beginning of each transmission time slot. To compare HCHF and existing schemes, various performance metrics are assessed including spectrum utilization, coverage, fairness, and control packet overhead. Simulation results indicate that the HCHF scheme can improve the coverage and fairness in comparison to other schemes without sacrificing much on the spectrum utilization. The performance improvement of HCHF is constrained by a higher control message overhead, since local packet exchange between neighbor nodes is required to share spectrum sensing information. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Underwater acoustic sensors network Distributed channel allocation network coverage Fair channel allocation Interference graph

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Social network coverage and Reach 4

Efficient Algorithms for Social Network Coverage and Reach

引用

IEEE International Congress on Big Data

作者： Puthal, Deepak Nepal, Surya Paris, Cecile Ranjan, Rajiv Chen, Jinjun Univ Technol Sydney Fac Engn & Informat Technol Sydney NSW Australia CSIRO Digital Prod Flagship Canberra ACT Australia

ISBN: (纸本)9781467372787

Social networks, though started as a software tool enabling people to connect with each other, have emerged in recent times as platforms for businesses, individuals and government agencies to conduct a number of activities ranging from marketing to emergency situation management. As a result, a large number of social network analytics tools have been developed for a variety of applications. A snapshot of social networks at any particular time, called a social graph, represents the connectivity of nodes and potentially the flow of information amongst the nodes (or vertices) in the graph. Understanding the flow of information in a social graph plays an important role in social network applications. Two specific problems related to information flow have implications in many social network applications: (a) finding a minimum set of nodes one has to know to recover the whole graph (also known as the vertex cover problem) and (b) determining the minimum set of nodes one required to reach all nodes in the graph within a specific number of hops (we refer this as the vertex reach problem). Finding an optimal solution to these problems is NP-Hard. In this paper, we propose approximation based approaches and show that our approaches outperform existing approaches using both a theoretical analysis and experimental results.

关键词： Approximation Algorithm Complexity network coverage network Reach Social networks

来源：评论

学校读者我要写书评

暂无评论

UAV trajectory planning for 5G network coverage

UAV trajectory planning for 5G network coverage

引用

IEEE/CIC International Conference on Communications in China (ICCC)

作者： Ouyang, Chenyu Zhong, Xiaofeng Zhou, Shidong Li, Jingwei Tsinghua Univ Beijing Natl Res Ctr Informat Sci & Technol Dept Elect Engn Beijing 100084 Peoples R China

ISBN: (纸本)9798350378412

In this paper, we study the trajectory planning for fixed-wing unmanned aerial vehicles (UAVs) equipped with directional antenna to improve communication network coverage. First, to better depict the connection states between the UAV base stations and ground users, a signal coverage model for UAV equipped with directional antenna is proposed, representing the UAV-to-ground coverage area as a dynamic ellipse. Based on this, we formulate the UAV trajectory planning problem as a mixed integer nonlinear programming (MINP) problem to maximize the coverage rate, accounting for the maneuverability characteristics of fixed-wing UAVs, such as the minimum velocity and safe turning radius. To solve this, an algorithm based on sequential convex programming (SCP) is adopted. Further, for multiple UAVs, we propose to cluster users periodically and assign UAVs to each cluster aiming to decreasing computation overhead and improving overall coverage areas. The optimal trajectory in each cluster can be obtained independently utilizing the preceding algorithm. With knowledge of the time-varying clustering results, we utilize Dubins Curve to design the transition path for a UAV navigating from its current cluster to the one assigned by Hungarian algorithm in the subsequent period. Realistic measurement shows that our signal coverage model is more practical. And simulation results exhibits that our periodic clustering scheme gains improvement on coverage rate compared with baseline methods.

关键词： trajectory planning network coverage directional antenna sequential convex programming fixed-wing UAV

来源：评论

学校读者我要写书评

暂无评论

On the Impact of Node Failure on network coverage in Wireless Sensor network

On the Impact of Node Failure on Network Coverage in Wireles...

引用

5th International Conference on Computers and Devices for Communication (CODEC)

作者： Hossain, Ashraf Aliah Univ Dept Elect & Commun Engg Kolkata 700064 India

ISBN: (纸本)9781467326209;9781467326193

network coverage of wireless sensor network (WSN) means how well the entire area of interest is being monitored by a deployed network. It depends on several factors including sensing model of a node. Node failure is an important issue in WSN. The sensor nodes are prone to be non-functional due to noise and battery energy depletion. In the literature, node failure has not been considered while studying coverage. In this paper, we investigate the impact of node failure on network coverage. The network coverage has been derived for three sensing models in the event of node failure.

关键词： Node failure sensing model Elfes sening model shadow-fading sensing model network coverage coverage degree

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient Capture of Stochastic Events by Global- and Local-Periodic network coverage

Energy-efficient Capture of Stochastic Events by Global- and...

引用

10th ACM International Symposium on Mobile Ad Hoc networking and Computing

作者： He, Shibo Chen, Jiming Yau, David K. Y. Shao, Huanyu Sun, Youxian Zhejiang Univ State Key Lab Ind Control Technol Hangzhou 310003 Zhejiang Peoples R China

ISBN: (纸本)9781605585314

We consider a high density of sensors randomly placed in a geographical area for event monitoring. The monitoring regions of the sensors may have significant overlap, and a subset of the sensors can be turned off to conserve energy, thereby increasing the lifetime of the monitoring network. Prior work in this area does not consider the event dynamics. In this paper, we show that knowledge about the event dynamics can be exploited for significant energy savings, by putting the sensors on a periodic on/off schedule. We discuss energy-aware optimization of the periodic schedule for both cases of a synchronous and an asynchronous network. Under the periodic scheduling, coordinated sleep by the sensors can be applied orthogonally to minimize the redundancy of coverage and further improve the energy efficiency. We consider four points in the design space: synchronous periodic scheduling with and without coordinated sleep, and asynchronous periodic scheduling with and without coordinated sleep. We show that the asynchronous network exceeds the synchronous network in the coverage intensity, thereby increasing the effectiveness of the event capture, though it may also reduce the opportunities for coordinated sleep. When the sensor density is high, the asynchronous network with coordinated sleep can achieve extremely good event capture performance while being highly energy-efficient.

关键词： Sensor network network coverage periodic scheduling coordinated sleep protocol event capture energy efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：