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

International Conference on High Performance Computing and Applications (ICHPCA)

作者： Das, Tathagata Roy, Sarbani Alumnus Software Ltd Kolkata India Jadavpur Univ Dept Comp Sci & Engn Kolkata India

ISBN: (纸本)9781479959587

In the present scenario, there are substantial amount of applications where mobile wireless sensor network (MWSN) would be preferred over static wireless sensor network. coverage is one of those areas where MWSN provides better solution. coverage in static WSN depends on the initial deployment strategy whereas in MWSN, mobility of sensor nodes can be utilized to enhance the coverage of the network. One of the fundamental problems of MWSN is how to coordinate these mobile sensors in such a way that they can move together to accomplish the given task. Here, we study a generalized case of this problem. In this paper, we present a game theory inspired coordination based motion control (GT-CBMC) scheme where all mobile nodes form a group such that they cover an area by exchanging some key information between themselves. This is a continuation of our previous work on coordination based motion control (CBMC). The objective of the proposed scheme is to minimize the travel distance of each sensor node. The concept of cooperative game theory is used here. In this scheme, mobile sensors form a co-operative group and movement of one sensor influences the movements of its neighbors. Objective of this cooperative group is to minimize the overlap in the coverage path of sensor nodes. NS-3 simulation shows the effectiveness of the scheme. The proposed scheme is compared CBMC, random way-point mobility model (RWP) and three other variants of RWP.

关键词： Mobile Wireless Sensor Network (MWSN) coverage problem Cooperative Game Theory Coalition Motion NS-3

来源：评论

学校读者我要写书评

暂无评论

Nature-Inspired Fault Tolerant Area Monitoring in Sensor Network

Nature-Inspired Fault Tolerant Area Monitoring in Sensor Net...

引用

International Conference on Soft Computing for problem Solving (SocProS 2011)

作者： Tripathi, Rameshwar Nath Verma, Shekhar Rao, S. V. Indian Inst Informat Technol Dept Informat Technol Allahabad 211012 Uttar Pradesh India Indian Inst Technol Dept Comp Sci Gauhati 781039 Assam India

ISBN: (纸本)9788132204862

Effective network coverage and operational life span is key concern of randomly deployed Wireless Sensor Network (WSN) for performing monitoring function in designated region. Intrinsically, WSN consists of resource constraints sensor nodes. For effective coverage, it is undesirable activating all deployed set of nodes for getting the desired degree of coverage if the same result can be obtained by activating a small subset of deployed nodes for providing the sensing function in the concerned region. We study the problem of extending the life span of the sensor network for fault tolerant area coverage. The proposed genetic algorithm based approach aims to cover a sensed area with minimum number of active nodes and compute the maximum number of Sensing Cover Set (SCS) so that network life time can be prolonged by calculating the working schedule of cover set. Each SCS has been assigned the cover set ID. Each SCS works for the specified amount of time in an alternate fashion. Simulation experiment indicates that genetic algorithm based approach is able to optimally partition the nodes into different SCS.

关键词： coverage problem Sensing cover set Genetic algorithm Fault tolerant

来源：评论

学校读者我要写书评

暂无评论

Adaptive and distributed sensor activation in WSN

Adaptive and distributed sensor activation in WSN

引用

7th IEEE International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Zhang, Mengyi Goupil, Alban Colas, Maxime Gelle, Guillaume Univ Reims CReSTIC Reims France

ISBN: (纸本)9781467376877

The selection of active units is an essential task for sensor networks because it allows to increase the service life of the networks while guaranteeing coverage. In this paper, we propose a fully distributed method for active units selection that automatically adapts to sensors extinction without activating unnecessary idle units. This method relies on both of the use of homology and the discrete Morse theory.

关键词： coverage problem sensor's activation Homology groups distributed algorithm discrete vector field

来源：评论

学校读者我要写书评

暂无评论

Optimizing Roadside Advertisement Dissemination in Vehicular Cyber-Physical Systems 35

Optimizing Roadside Advertisement Dissemination in Vehicular...

引用

2015 IEEE 35th International Conference on Distributed Computing Systems

作者： Zheng, Huanyang Wu, Jie Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA

ISBN: (纸本)9781467372145

In this paper, we address a promising application in the Vehicular Cyber-Physical Systems (VCPS) called roadside advertisement dissemination. Its application involves three elements: the drivers in the vehicles, Roadside Access Points (RAPs), and shopkeepers. The shopkeeper wants to attract as many customers as possible, through using RAPs to disseminate advertisements to the passing vehicles. Upon receiving an advertisement, the driver may detour towards the shop, depending on the detour distance. Given a fixed number of RAPs and the traffic distribution, our goal is to optimize the RAP placement for the shopkeeper to maximally attract potential customers. This application is a non-trivial extension of traditional coverage problems, the difference being that we use RAPs to cover the traffic flows. RAP placement algorithms may pose complex trade-offs. If we place RAPs at locations that can provide small detour distances to attract more customers, these locations may not necessarily be located in heavy traffic regions. While heavy traffic regions cover more flows, they can cause large detour distances, making shopping less attractive to customers. To balance this tradeoff, novel RAP placement algorithms are proposed. Since real-world traffic distributions exhibit unique patterns, here we further consider the Manhattan grid scenario and then propose corresponding near-optimal solutions. Real trace-driven experiments validate the competitive performance of the proposed algorithms.

关键词： Vehicular cyber-physical systems advertisement dissemination placement coverage problem

来源：评论

学校读者我要写书评

暂无评论

Performance Investigation of Immune Plasma Algorithm on Solving Wireless Sensor Deployment problem 9

Performance Investigation of Immune Plasma Algorithm on Solv...

引用

9th International Conference on Electrical and Electronics Engineering (ICEEE)

作者： Tasdemir, Adnan Demirci, Sercan Aslan, Selcuk Ondokuz Mayis Univ Dept Comp Engn Samsun Turkey Erciyes Univ Dept Aeronaut Engn Kayseri Turkey

ISBN: (纸本)9781665467544

Sensor node deployment is very crucial for wireless sensor networks (WSNs). Sensors' coverage plays an integral role in all types of applications that utilize WSNs. In addition to maximizing the life of the network and consuming less energy, the better positioning of the sensors makes the sensors more effective and efficient. A meta-heuristic algorithm will be used to determine where wireless sensors should be placed to maximize the coverage of the area where they are deployed. As a part of our solution, we will utilize the Immune Plasma Algorithm (IPA), which transfers plasma or the antibody-rich part of the blood from one patient to another through a process of bypassing the immune system. This optimization algorithm will be used to determine the optimal solution to the maximum coverage problem. The results of the simulation will be compared with solutions found by one research using Artificial Bee Colony (ABC), an algorithm that models the foraging behavior of bees.

关键词： WSNs ABC IPA Meta-heuristic algorithms coverage problem

来源：评论

学校读者我要写书评

暂无评论

Geometric Probability on the Sphere

引用

Jahresbericht der Deutschen Mathematiker-Vereinigung 2017年第2期119卷 93-132页

作者： Maehara, Hiroshi Martini, Horst Ryukyu University Nishihara 903-0213 Okinawa Japan Faculty of Mathematics Chemnitz University of Technology Chemnitz 09107 Germany

This is an exposition of results and methods from geometric probability on the surface of a ball (i.e., on a sphere) in three-dimensional space. We tried to make our arguments simple and intuitive. We present many concrete results together with their (mainly) elementary proofs, and also several new results are derived. In addition, the reader will also find various interesting unsolved problems. © 2017, Deutsche Mathematiker-Vereinigung and Springer-Verlag Berlin Heidelberg.

关键词： coverage problem Crofton’s formula Random great circle Random spherical polygon Santaló’s chord theorem Sylvester’s problem

来源：评论

学校读者我要写书评

暂无评论

Effects of UAV Mobility Patterns on Data Collection in Wireless Sensor Networks 4

Effects of UAV Mobility Patterns on Data Collection in Wirel...

引用

IEEE Int Conference Commun Networks Satellite

作者： Rashed, Sarmad Soyturk, Mujdat Marmara Univ Dept Comp Engn Istanbul Turkey

ISBN: (纸本)9781467382496

Sensor nodes in a Wireless Sensor Network (WSN) can be dispersed over a remote sensing area e.g. the regions that cannot be accessed by human beings (inaccessible regions). In such kind of networks, data collection becomes one of the major issues. Getting connected to each sensor node and retrieving the information in time introduces new challenges. Mobile sink usage, especially the Unmanned Aerial Vehicle (UAV), is the most convenient approach to cover the area and access each sensor node in such a large scale WSN. However, the operation of the UAV depends on some parameters such as endurance time, altitude, speed, radio type in use, and the path. In this paper, we explore various mobility patterns of UAV that follow different paths to sweep the playground in order to seek the best area coverage with maximum number of covered nodes in less amount of time needed by the mobile sink. A realistic simulation environment is used in order to compare and evaluate the performance of the system. We present the performance results for the explored UAV mobility patterns. The results are very useful to present the tradeoff between maximizing the covered nodes and minimizing the operation time for choosing the appropriate mobility pattern.

关键词： unmanned aerial vehicle UAV cluster head mobility pattern coverage problem utilization quality of service

来源：评论

学校读者我要写书评

暂无评论

Mobile Wireless Sensor Networks coverage Maximization by Firefly Algorithm 27

Mobile Wireless Sensor Networks Coverage Maximization by Fir...

引用

27th International Conference on Radioelektronika (RADIOELEKTRONIKA)

作者： Tuba, Eva Tuba, Milan Beko, Marko Univ Belgrade Fac Math Belgrade Serbia John Naisbitt Univ Grad Sch Comp Sci Belgrade Serbia Univ Lusofona Humanidades & Tecnol Comp Engn Dept Lisabon Portugal

ISBN: (纸本)9781509045914

Wireless sensor networks have many applications and accordingly represent an active research area. coverage maximization of the area of interest by sensors that have limited sensing radius is an important hard optimization problem. Since sensors are initially often deployed randomly one way of solving maximal coverage problem is by using mobile sensors that move to optimal positions. Since power in sensor nodes is limited, minimization of the sensor nodes movement is secondary optimization goal. In this paper we propose use of recent swarm intelligence algorithm, firefly algorithm, for optimization of that hard multiobjective problem. We tested our approach on standard benchmark data and compared results with other techniques from literature. Our proposed approach was better considering all quality measures: coverage, energy consumption, robustness and convergence speed.

关键词： wireless sensor networks mobile sensors coverage problem firefly algorithm swarm intelligence metaheuristic optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Wireless Sensor Networks: Target-Barrier coverage with Static and Mobile Sensors 12

Wireless Sensor Networks: Target-Barrier Coverage with Stati...

引用

12th International Conference on Networks, Communication and Computing (ICNCC)

作者： Cheng, Chien-Fu Chen, Bo-Ming Natl Taiwan Ocean Univ Dept Comp Sci & Engn Keelung Taiwan Tamkang Univ Dept Comp Sci & Informat Engn New Taipei Taiwan

ISBN: (纸本)9798400709265

This paper investigates the issue of target-barrier coverage in wireless sensor networks that utilize both static and mobile sensors, resulting in enhanced fault tolerance and reliability. The main objective is to establish a reliable and dependable protective barrier around the target and detect any intrusion within its perimeter. The introduction of distance limits, namely boundlow and boundup, can ensure that the constructed barrier provides sufficient response time to report detected intrusions. This methodology is particularly well-suited for applications that demand high levels of dependability and fault tolerance, such as battlefield monitoring and intruder detection. Furthermore, by introducing mobile sensors in conjunction with static sensors, it will help increase the success rate of target-barrier construction and reduce the number of required scattered static sensors. Experimental simulations validate the proposed method and illustrate that it offers superior network lifetime compared to alternative approaches, while maintaining high levels of fault tolerance and reliability.

关键词： Target-barrier coverage coverage problem wireless sensor networks fault tolerance reliability

来源：评论

学校读者我要写书评

暂无评论

An Efficient coverage in Wireless Sensor Networks Using Fuzzy Logic-Based Control for the Mobile Node Movement

An Efficient Coverage in Wireless Sensor Networks Using Fuzz...

引用

Advances in Wireless and Optical Communications (RTUWO) Conference

作者： Banimelhem, Omar Naserllah, Muhammad Abu-Hantash, Alaa Jordan Univ Sci & Technol Dept Network Engn & Secur Irbid Jordan

ISBN: (纸本)9781538605851

In large scale Wireless Sensor Networks (WSNs), the random deployment of the sensor nodes does not guarantee the desired level of the area coverage especially when the network is sparse. One of the solutions to overcome this problem is to use a mobile robot that is equipped with, in addition to the sensing unit, an actuator unit that controls its movement. In this case, the mobile robot is considered as a mobile sensor node that has the capability to monitor the uncovered regions in the sensor field. However, the main challenge in this case is how to control the movement of the mobile robot such that the area coverage is maximized and the time required to sample the uncovered regions is minimized. In this paper, we propose a fuzzy logic-based approach that controls the mobile robot movement in the sensor field in order to maximize the area coverage. The inputs of the fuzzy system determine the next point that the mobile node will select when it moves in the sensor field. Simulation results have shown that the proposed approach outperforms the random and standard moving patterns.

关键词： Wireless Sensor Networks Fuzzy Logic Mobile Nodes coverage problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：