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

Advancing security and efficiency in MANET using dynamic algorithm switching

PEER-TO-PEER NETWORKING AND APPLICATIONS 2024年第5期17卷 2796-2809页

作者： Anand, M. Vijay Krishnamurthy, Anand Subramanian, Karuppiah Raju, Saravanan Saveetha Engn Coll Autonomous Dept Comp Sci & Engn Chennai Tamil Nadu India Rajalakshmi Engn Coll Autonomous Dept Comp Sci & Engn Thandalam Tamil Nadu India St Josephs Coll Engn Dept MBA Chennai Tamil Nadu India Rajalakshmi Inst Technol Comp Sci & Engn Thandalam Tamil Nadu India

MANET is widely utilized for interactions among devices without relying on a central governing body. The frequent changes in network topologies expose it to various security vulnerabilities. Enhancing security within MANET is of paramount concern and demands resolution. Addressing these security-related issues stands as the sole approach to ensuring proper data sharing in MANET. Numerous security-oriented techniques have been introduced, but they have encountered several challenges, leading to increased costs and time complexity. These difficulties have necessitated additional resources to be allocated towards mitigating issues and grappling with the growing complexity, thereby introducing a layer of complexity that can impede seamless implementation and efficacy. In this context, a dynamic algorithm Switching (DAS) algorithm is proposed to strengthen security in MANET. The process begins with Node clustering, followed by cluster formation through the implementation of the Modified Density-Based Spatial Clustering of Applications (DBSCAN). The proposed method incorporates Cluster Head selection (CHS), which in turn enhances energy efficiency within MANET. The effectiveness of the DAS method is evaluated through experimentation, measuring key aspects such as Packet Delivery Ratio (PDR), end-to-end delay, throughput97.9, network lifetime, and energy consumption with the attained values 98.7%, 15.81mas, 97.9% 952 s as well as 11 J/s respectively. However the existing approaches such as ANFIS-EESC, QoSDSBS, EBR and IBADConBE achieved rate of PDR as 98.3%, 97.6%, 97.1% and 96.9% that diminished the performance. Comparative analysis demonstrates that the proposed method outperforms other techniques across all metrics, establishing its superior efficiency.

关键词： Mobile ad-hoc networks Cluster-based detection Cluster formation Energy efficiency Network lifetime Node clustering dynamic algorithm

来源：评论

学校读者我要写书评

暂无评论

Broadcast tree construction framework in tactile internet via dynamic algorithm

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2018年 136卷 59-73页

作者： Ren, Jiankang Lin, Chi Liu, Qian Obaidat, Mohammad S. Wu, Guowei Tan, Guozhen Dalian Univ Technol Sch Comp Sci & Technol 2 Linggong Rd Dalian 116023 Peoples R China Dalian Univ Technol Sch Software Technol Dalian 116620 Peoples R China Key Lab Ubiquitous Network & Serv Software Liaoni Rd 8 Dalian 116620 Peoples R China Fordham Univ Comp & Informat Sci Bronx NY 10458 USA

Extremely low-latency and real-time communications are required in Tactile Internet to transfer physical tactile experiences remotely. In addition, its traffic has stringent requirements on bandwidth and quality of service (QoS). To minimize total costs of establishing the network and satisfy a pre-defined global upper delay-bound on the paths from the server to any other client for message broadcast in Tactile Internet, this paper presents a Rooted Delay-Constrained Minimum Spanning Tree (RDCMST) construction framework based on dynamic algorithm. The network is modeled as a connected weighted and undirected graph. Infeasible and suboptimal edges are discarded first by preprocessing techniques to reduce the processing complexity of the algorithm. Then the edges of the graph are processed based on a dynamic graph algorithm, which can maintain a single-source shortest path tree for the online edge deletions, such that total costs can be minimized while ensuring the delay-constraint and the tree structure. Experimental results show that our proposed approach greatly outperforms existing competing RDCMST formation algorithms, in terms of both average cost and stability of solutions. (C) 2017 Elsevier Inc. All rights reserved.

关键词： Tactile Internet dynamic algorithm Rooted delay-constrained minimum spanning tree Real-time

来源：评论

学校读者我要写书评

暂无评论

A dynamic algorithm for the control of automotive painted body storage

引用

SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL 2005年第11期81卷 773-787页

作者： Moon, DH Song, C Ha, JH Changwon Natl Univ Dept Ind & Syst Engn Gyeongnam 641773 South Korea Hebei Univ Sci & Technol Dept Management Sci & Engn Hebei 050018 Peoples R China

This article introduces a simulation study relating to the dynamic operating algorithm for the painted body storage (PBS) in an automotive factory. The manufacturing process in the trim shop of an automotive factory is a typical example of the mixed-model assembly production. In the paint shop, which comes before the trim shop, same-colored bodies are grouped together to reduce the changeover cost. Therefore, the PBS is located between the paint shop and the trim shop to allow for the rescheduling of the input sequence of cars to the assembly line. In this article, a case study on PBS in an automotive factory is presented. The storage/retrieval algorithms are suggested, and the proposed system is verified using simulation models. A sensitivity analysis for operating factors is also carried out.

关键词： painted body storage dynamic algorithm automotive painting shop trim shop

来源：评论

学校读者我要写书评

暂无评论

Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers

引用

DISCRETE APPLIED MATHEMATICS 2003年第2-3期129卷 449-460页

作者： Klavzar, S Vesel, A Univ Maribor PEF Dept Math SLO-2000 Maribor Slovenia

Rotagraphs generalize all standard products of graphs in which one factor is a cycle. A computer-based approach for searching graph invariants on rotagraphs is proposed and two of its applications are presented. First, the lambda-numbers of the Cartesian product of a cycle and a path are computed, where the lambda-number of a graph G is the minimum number of colors needed in a (2,1)-coloring of G. The independence numbers of the family of the strong product graphs C-7 boxed times C-7 boxed times C2k+1 are also obtained. (C) 2002 Elsevier B.V. All rights reserved.

关键词： rotagraph dynamic algorithm (2,1)-coloring independence number Cartesian product of graphs strong product of graphs

来源：评论

学校读者我要写书评

暂无评论

A Fully dynamic algorithm for k-Regret Minimizing Sets 37

A Fully Dynamic Algorithm for k-Regret Minimizing Sets

引用

37th IEEE International Conference on Data Engineering (IEEE ICDE)

作者： Wang, Yanhao Li, Yuchen Wong, Raymond Chi-Wing Tan, Kian-Lee Univ Helsinki Helsinki Finland Singapore Management Univ Singapore Singapore Hong Kong Univ Sci & Technol Hong Kong Peoples R China Natl Univ Singapore Singapore Singapore Alibaba Zhejiang Univ Joint Res Inst Frontier Tec Hangzhou Peoples R China Natl Univ Singapore NUS Singapore Singapore

ISBN: (纸本)9781728191843

Selecting a small set of representatives from a large database is important in many applications such as multi-criteria decision making, web search, and recommendation. The k-regret minimizing set (k-RMS) problem was recently proposed for representative tuple discovery. Specifically, for a large database P of tuples with multiple numerical attributes, the k-RMS problem returns a size-r subset Q of P such that, for any possible ranking function, the score of the top-ranked tuple in Q is not much worse than the score of the k th-ranked tuple in P. Although the k-RMS problem has been extensively studied in the literature, existing methods are designed for the static setting and cannot maintain the result efficiently when the database is updated. To address this issue, we propose the first fully-dynamic algorithm for the k-RMS problem that can efficiently provide the up-to-date result w.r.t. any tuple insertion and deletion in the database with a provable guarantee. Experimental results on several real-world and synthetic datasets demonstrate that our algorithm runs up to four orders of magnitude faster than existing k-RMS algorithms while providing results of nearly equal quality.

关键词： regret minimizing set dynamic algorithm set cover top-k query skyline

来源：评论

学校读者我要写书评

暂无评论

An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs

引用

24th Annual Symposium on Theoretical Aspects of Computer Science

作者： Tedder, Marc Corneil, Derek Univ Toronto Dept Comp Sci 10 Kings Coll RdRoom 3302 Toronto ON M5S 3G4 Canada

ISBN: (纸本)9783540709176

The problem of dynamically recognizing a class of graphs has received much attention recently. Given an input graph and a sequence of operations (vertex and edge additions and deletions) to be performed on that graph, the algorithm must determine after each operation if the resulting graph is still a member of the class in question. This paper presents the first dynamic recognition algorithm for distance-hereditary graphs. The algorithm handles edge additions and deletions, and is optimal in that each operation can be performed in constant time. In doing so, the paper completely characterizes when an edge can be added to and removed from a distance-hereditary graph with the result remaining distance-hereditary, and develops a new represemation for these graphs in terms of cographs.

关键词： dynamic algorithm graph recognition distance-hereditary cograph

来源：评论

学校读者我要写书评

暂无评论

A dynamic algorithm of Partitioning Urban Road Network into Traffic Control Subareas

A Dynamic Algorithm of Partitioning Urban Road Network into ...

引用

2nd International Conference on Civil, Architectural and Hydraulic Engineering (ICCAHE 2013)

作者： Gong, Bowen Bie, Yiming Liu, Zhiyuan Jilin Univ Room 715Transportat BldgNanling Campus Changchun 130022 Peoples R China Harbin Inst Technol Sch Transportat Sci & Engn Harbin 150090 Peoples R China Monash Univ Clayton Vic 3800 Australia

ISBN: (纸本)9783037858585

The objective of this study is to develop a dynamic algorithm for traffic control subarea partition. Influencing factors are classified into static factors and dynamic factors. We mainly focus on the three dynamic factors which are cycle length, platoon length and traffic flow continuation. An integrated correlation model is established to quantify the correlation degree of adjacent intersections and then a dynamic partition algorithm is developed based on the model. Both this algorithm and Chang's algorithm, which is a representative achievement in subarea partition cited by Traffic control systems Handbook, are applied to a network including 20 signalized intersections in VISSIM to compare their benefits. Statistical results show that: (a) adjacent intersections with high correlation degree can be partitioned into one subarea to execute signal coordination according to our algorithm;(b) implementing our algorithm can save average vehicle delay by 8.9% and average vehicle stops by 7.8% than implementing Chang's algorithm.

关键词： Subarea partition Integrated correlation model dynamic algorithm Traffic control

来源：评论

学校读者我要写书评

暂无评论

A completely dynamic algorithm for split graphs

引用

Electronic Notes in Discrete Mathematics 2006年 27卷 69-70页

作者： Mancini, Federico Heggernes, Pinar Informatics University of Bergen Bergen Norway Informatics University of Bergen Bergen Norway

来源：评论

学校读者我要写书评

暂无评论

A Controlled Region Rearrangement dynamic algorithm for Delay-constrained Least-cost Multicast Routing

引用

The Journal of China Universities of Posts and Telecommunications 2001年第2期8卷 69-74页

作者： LIU Chen, WU Cheng lin (Nanjing University of Posts and Telecommunications, Nanjing 210003, P.R. China) Nanjing University of Posts and Telecommunications

With the proliferation of multicast technology applications in communication networks, the study of multicast routing has become more and more important. In this paper, we propose a new dynamic algorithm for delay constrained least cost multicast routing with controlled region rearrangement. We compare the performance of our algorithm by simulation with that of CRCDM [1] . The simulation results indicate that our algorithm provides better performance.

关键词： multicast routing rearrangement dynamic algorithm

来源：评论

学校读者我要写书评

暂无评论

A dynamic algorithm for Gate Assignments under Varied Flight Delay Information

A Dynamic Algorithm for Gate Assignments under Varied Flight...

引用

2010 3rd IEEE International Conference on Computer Science and Information Technology—ICCSIT 2010

作者： Ching-Hui Tang Department of Air Transportation Kainan University

Flight delays (such as early or late arrivals and late departures) are a frequent occurrence in actual day to day airport operations and it is often not possible to assign such flights to their original gates. Flight delay information may also vary with time. As a consequence, the airport authority needs to reassign flights to different gates in real-time. The traditional manual flight reassignment method is neither efficient nor effective in cases with variable flight delay information, and the reassignment is frequently time constrained. Consequently, in this study the goal is to develop a gate reassignment framework, and a systematic computerized tool, for repeatedly handling gate reassignments given varied flight delay information. The results of a test case related to Taiwan international airport operations, show that the proposed framework performs well.

关键词： dynamic algorithm real-time gate reassignment flight delays information

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：