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

Design of a network coverage analyzer for roadside-to-vehicle telematics networks

Design of a network coverage analyzer for roadside-to-vehicl...

9th International Conference on Software Engineering Artificial Intelligence, networking and Parallel/Distributed Computing

作者： Lee, Junghoon Jeju Natl Univ Dept Comp Sci & Stat Jeju Do South Korea

ISBN: (纸本)9780769532639

This paper designs a connectivity analysis scheme for the roadside-to-vehicle telematics network based on the real movement history of vehicle objects collected from taxi telematics system currently in operation, aiming at providing a useful guideline and information to build a telematics network. The implemented analyzer can locate the current and previous positions of all vehicles, decide whether it can be connected to an RSU, and calculate the duration of disconnected state, taking into account the transmission range, the number of RSUs, and RSU deployment. The RSU placement scheme can improve the network coverage exploiting the analysis result. The experiment result shows that each time the transmission range increases by 100 m, with an appropriate overlap ratio setting, the network coverage is improved by about 10 % and that the larger the transmission distance, the earlier the coverage meets the local maximum according to the overlap ratio.

关键词： vehicular telematics roadside-to-vehicle network network coverage taxi telematics system RSU placement

来源：评论

学校读者我要写书评

暂无评论

Sensing Models and Its Impact on network coverage in Wireless Sensor network

Sensing Models and Its Impact on Network Coverage in Wireles...

引用

IEEE Region 10 Colloquium/3rd International Conference on Industrial and Information Systems

作者： Hossain, Ashraf Biswas, P. K. Chakrabarti, S. Indian Inst Technol Kharagpur Dept Elect & Elect Commun Engn Kharagpur 721302 West Bengal India Indian Inst Technol Kharagpur GS Sanyal Sch Telecommun Kharagpur 721302 West Bengal India

ISBN: (纸本)9781424428052

network coverage of wireless sensor network (WSN) means how well an area of interest is being monitored by the deployed network. It depends mainly on sensing model of nodes. In this paper, we present three types of sensing models viz. Boolean sensing model, shadow-fading sensing model and Elfes sensing model. We investigate the impact of sensing models on network coverage. We also investigate network coverage based on Poisson node distribution. A comparative study between regular and random node placement has also been presented in this paper. This study will be useful for coverage analysis of WSN.

关键词： sensing model deterministic sensing model probabilistic sensing model random deployment regular deployment network coverage

来源：评论

学校读者我要写书评

暂无评论

A research of the relationship between performance of topology-based MANET routing protocol and network coverage density

A research of the relationship between performance of topolo...

引用

6th IEEE Circuits and Systems Symposium on Emerging Technologies

作者： Wen, YY Zhao, JL Wang, GX Northeastern Univ Res Ctr Network & Commun Shenyang Peoples R China

ISBN: (纸本)0780379381

In most of existing performance evaluations of ad hoe routing protocol, connectivity is not considered properly. To solve this problem, a new concept of network coverage density is adopted in study of ad hoc networking, which reflects the communication ability of nodes and the connectivity of ad hoe network. On this base, the relationship between the performance of topology-based MANET routing protocol and network coverage density is researched. Simulation shows that, the packet delivery radio heightens with the increment of network coverage density, and they form an inerratic S curve. By the definition of minimal network coverage density, a judgment criterion for applicability of routing protocol is provided in the process of ad hoc networking.

关键词： ad hoc routing protocol network connectivity network coverage performance evaluation

来源：评论

学校读者我要写书评

暂无评论

A Self-Adaptive Wireless Sensor network coverage Method for Intrusion Tolerance Based on Particle Swarm Optimization and Cuckoo Search 14

A Self-Adaptive Wireless Sensor Network Coverage Method for ...

引用

Joint 14th IEEE Int Conf on Trust, Secur and Privacy in Comp and Commun / 13th IEEE Int Symposium on Parallel and Distributed Proc with Applications / 9th IEEE Int Conf on Big Data Science and Engineering (IEEE TrustCom-ISPA-BigDataSE)

作者： Chen, Zuo Li, Xue Lv, Bin Jia, Mengyuan Chinese Acad Sci Inst Informat Engn Beijing 100093 Peoples R China Hunan Univ Coll Comp Sci & Elect Engn Changsha 410082 Hunan Peoples R China

ISBN: (纸本)9781467379526

The sensor network coverage optimization process is vulnerable to be attacked or invaded. Therefore, in the case of wireless sensor network under attacks but also able to ensure secure communications and efficient and reliable coverage is a major problem. In this paper, we through the combination of trust management model and heuristic optimization Particle Swarm Optimization and Cuckoo Search, proposed a sensor network security coverage method based on trust management of intrusion tolerance. This method evaluate the trust value of the nodes through their behavior at first, and then adjust the perception radius and decision-making radius. Finally, combine PSO and CS serial optimization in order to achieve the intrusion tolerance for efficient adaptive coverage. By comparing the simulation with a range WSN covering mechanism, this method has certain advantages over the performance of the algorithm, and in the case of the invasion can effectively protect the safety of the overlay network. The simulation results show the effectiveness of the algorithm.

关键词： trust value network coverage invasive tolerant wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

3D MANETs: Link Probability, Node Degree, network coverage and Applications

3D MANETs: Link Probability, Node Degree, Network Coverage a...

引用

IEEE Wireless Communications and networking Conference (WCNC)

作者： Vieira, Luiz Filipe M. Almiron, Marcelo G. Loureiro, Antonio A. F. Univ Fed Minas Gerais Dept Comp Sci Belo Horizonte MG Brazil

ISBN: (纸本)9781612842547

Underwater Sensor networks (UWSNs) and Aeronautical Ad Hoc networks (AANETs) are Mobile Ad Hoc networks (MANETs) that need to consider the 3D nature of the network. UWSN presents the opportunity for many applications such as coast surveillance, and 4D monitoring (space and time) for ocean and biology studies. In AANET, aircrafts can communicate among each other and enhance situation awareness. In this work we study the fundamental properties of 3D MANETs: Link Probability, Node Degree and network coverage. This work was motivated by fundamental problems currently faced in the deployment of underwater sensor networks and aeronautical ad hoc networks. Link Probability is important in MAC protocols development. Determining network coverage is important for sensing applications, i.e., how to guarantee sensing coverage. Node degree is useful in scheduling duty cycles. Since energy is a limited resource, utilizing duty cycles is a major technique to improve network lifetime. We present analytical results for link probability, node degree and network coverage for 3D MANETs assuming random uniform distribution. These results may be applied to a variety of scenarios, platforms and applications. In addition, we describe applications that would benefit from our results.

关键词： 3D MANET 4D monitoring AANET Ad hoc networks Equations MAC protocol Mathematical model Media Access Protocol Mobile computing Sensors Three dimensional displays UWSN access protocols aeronautical ad hoc network aircraft communication aircraft communication coast surveillance duty cycle scheduling link probability mobile ad hoc network mobile ad hoc networks network coverage network lifetime node degree probability radio links random processes random uniform distribution sensing application sensing coverage situation awareness underwater acoustic communication underwater sensor network

来源：评论

学校读者我要写书评

暂无评论

Heuristic for network coverage Optimization Applied in Finding Organizational Change Agents 1

Heuristic for Network Coverage Optimization Applied in Findi...

引用

1st European network Intelligence Conference (ENIC)

作者： Zak, Blazej Zbieg, Anita Wroclaw Univ Technol Fac Comp Sci & Mgmt PL-50370 Wroclaw Poland Wroclaw Univ Econ Univ Wroclaw Inst Psychol Wroclaw Poland

ISBN: (纸本)9781479969142

Authors compare different ways of selecting change agents within network analysis paradigm and propose a new algorithm of doing so. All methods are evaluated against network coverage measure that calculates how many network members can be directly reached by selected nodes. Results from the analysis of organizational network show that compared to other methods the proposed algorithm provides better network coverage, at the same time selecting change agents that are well connected, influential opinion leaders.

关键词： sna ona organizational network analysis organizational change change agents network coverage

来源：评论

学校读者我要写书评

暂无评论

Research on Wireless Sensor network coverage Based on Improved Particle Swarm Optimization Algorithm

Research on Wireless Sensor Network Coverage Based on Improv...

引用

International Conference on Computer network, Electronic and Automation (ICCNEA)

作者： Li Changxing Zhang Long-yao Qing, Zhang Xian Univ Postsand Telecommun Coll Sci Xian Shaanxi Peoples R China

ISBN: (纸本)9781538639818

In order to improve the network coverage, this paper presents the research on wireless sensor network coverage based on improved particle swarm optimization algorithmfor wireless sensor nodes that are randomly deployed in a certain area. In this paper, we use the regional network coverage as the target objective function, and combine various improved particle swarm optimization algorithms to optimize the deployment location of all nodes to enhance the area coverage. The experimental results show that the influence levelof different perceived radius on the optimization performance of the network coverage is different. At the same time, the optimization performance comparison graph of improving the network coverage by using the standard particle swarm optimization algorithm, the chaos particle swarm optimization algorithm and the breeding particle swarm optimization algorithm is given, and it is proved that the latter twoalgorithms solve the wireless sensornetwork coverage better than the firstalgorithm.

关键词： Wirelesssensor Node network coverage Particle swarm optimization Perceivedradius

来源：评论

学校读者我要写书评

暂无评论

On Directional Bias for network coverage

On Directional Bias for Network Coverage

引用

9th International Conference on Bio-Inspired Computing - Theories and Applications (BIC-TA)

作者： Smith, Graeme Sanders, J. W. Li, Qin Univ Queensland Sch Informat Technol & Elect Engn Brisbane Qld 4072 Australia African Inst Math Sci Cape Town South Africa Univ Stellenbosch Dept Math Sci Stellenbosch South Africa

ISBN: (纸本)9783662450482

Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random walks that are biased towards their current heading. In this paper, we investigate whether or not complementing random walks with directional bias can decrease the expected discovery and coverage times in networks. To do so, we use a macro-level model of a directionally biased random walk based on Markov chains. By focussing on regular, connected networks, the model allows us to efficiently calculate expected coverage times for different network sizes and biases. Our analysis shows that directional bias can significantly reduce the coverage time, but only when the bias is below a certain value which is dependent on the network size.

关键词： Random walks Markov chains network coverage

来源：评论

学校读者我要写书评

暂无评论

Wireless sensor network coverage of improved sea lion algorithm

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2024年第18期37卷

作者： Kagi, Swati Shivakumar Mallapur, Sujata Veeresh Sharnbasva Univ Dept Artificial Intelligence & Machine Learning Kalaburagi 585105 Karnataka India

The base station receives the environmental data from a predetermined field that is collected and transferred by the sensors for processing and analysis. However, coverage maximization is the major issue that requires the deployment of varied sensor nodes (SNs), in such a way that optimizes network coverage while enduring practical limitations. This is pointed out to be a significant challenge in constructing WSNs. Since this is considered to be a well-known NP-hard issue, metaheuristic methods must be used for solving the realistic problem sizes. Hence, our work considers the problem of finding the best placement to ensure good network coverage in WSN. Accordingly, the solution to the above-mentioned problem is modeled by covering a new 2-D distance evaluation based on weighted Minkowski. Further, we deploy the Self Improved Sealion with Opposition Behavior (SI-SLOB) algorithm for determining the optimal placement of given sensor nodes. In the end, we perform varied evaluations on distance and coverage area to ensure the enhancement of the SI-SLOB scheme over the other state-of-the-art algorithms. The proposed method achieves minimum distance mean value in target node 25, which is 4.1%, 4.0%, 2.3%, 5.1%, 3.5%, 3.0%, and 4.1% better than the other methods such as SLO, GWO, PSO, BMO, BOA, RHSO, and WOA, respectively. Thus the proposed WSN node coverage models have diverse applications across various domains, contributing to improved efficiency, safety, and resource management. The sensors gather and communicate environmental data to the base station, which processes and analyzes it. The data comes from a predefined field. The focal point of our suggested approach is a target that is served by a minimum quantity of sensor nodes. Drawing from this methodology, we additionally provide an algorithm to prolong the network's lifespan, ensuring the observation of every target through the creation of subsets of sensor nodes. The proposed SI-SLOB intended to solve the issue o

关键词： distance network coverage SI-SLOB model weighted Minkowski wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Chew's first Delaunay triangulation refinement scheme-based positioning of road side units for optimal network coverage in vehicular ad-hoc networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2022年第15期35卷 e5299-e5299页

作者： Selvakumari, PrabathKumar Lakshmi, Sree Rathna Sheela, Divakaran Chinnasamy, Ambayiram Tagore Engn Coll Dept Comp Sci & Engn Kelambakkam Vandalur Rd Chennai 600127 Tamil Nadu India Agni Coll Technol Dept Elect & Commun Engn Chennai Tamil Nadu India Saveetha Sch Engn Dept ECE SIMATS Chennai Tamil Nadu India Dept Data Sci & Business Syst SRMIST Kattankulathur Campus Chennai Tamilnadu Chennai Tamil Nadu India

The temporal network fragmentation and uncertain vehicle mobility are considered to impact the communication connectivity among the vehicular nodes of the network. In this context, road side units (RSUs) play an anchor role in enhancing the vehicle-to-vehicle (V2V) communication connectivity and support vehicle-to-infrastructure (V2I) communication. In the current scenario, deploying a huge number of RSUs in the vehicular networks at an initial stage is completely impossible as it incurs high installation cost and authority restriction. Moreover, the optimal placement of RSUs in the vehicular network needs to be enforced for attaining maximized network coverage. In this paper, Chew's first Delaunay triangulation refinement scheme (CFDTRS) is proposed for optimal positioning of RSUs in order to attain optimal network coverage in the vehicular network with minimized cost. This CFDTRS considered the factors of vehicular density, number of obstacles in the map, intersection popularity, and global coverage into account during the placement of RSUs. It is proposed with the objective of deploying required number of RSUs within the range of data transmission in order to achieve maximal coverage in the convex map, such that each area of the convex map is completely covered with at least a single RSU in the existence of multiple number of obstacles. The simulation results of the proposed CFDTRS attained from the real time situations of simplex, moderate, and complex maps confirmed improved packet delivery rate of 9.32%, throughput by 10.74% with minimized packet loss of 9.14%, and reduced end-to-end delay of 19.31$, compared to the benchmarked schemes considered for investigation.

关键词： Chew's first Delaunay triangulation refinement convex maps intersection popularity network coverage optimal RSUs placement road side units (RSUs)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：