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

Delay optimization using knapsack algorithm for multimedia traffic over MANETs

EXPERT SYSTEMS WITH APPLICATIONS 2015年第20期42卷 6819-6827页

作者： Ahmad, Syed Jalal Reddy, V. S. K. Damodaram, A. Krishna, P. Radha JB Inst Engn & Technol Hyderabad Andhra Pradesh India Malla Reddy Coll Engn & Technol Hyderabad Andhra Pradesh India Jawaharlal Nehru Technol Univ Hyderabad Andhra Pradesh India Infosys Ltd Infosys Labs Hyderabad Andhra Pradesh India

Multimedia transmission over Mobile Ad-hoc Networks (MANETs) is crucial to many applications. However, MANETs possess several challenges including transmitting large size packets, minimizing delay, loss-tolerant and buffer size estimation. For effective multimedia transmission, delay should be minimized and packets should be received in the defined order. The existing standards such as 802.11b and 802.11e perform well in wireless networks, but exhibit poor response in MANETs for multimedia traffic, especially in multi-hop networks. In this paper, we first establish the dependency of delay on buffer size and packet size, and then present a delay optimization approach for multimedia traffic in MANETs. We use knapsack algorithm for buffer management to maximize the in-order packets and minimize the out-of-order packets simultaneously. Our approach exploits the buffer internals and dynamically adjusts the buffer usage so that a node transmits the packets in the desired order to its successive nodes. Careful estimation of packet size and buffer size helps in minimizing the delay, improving the capability of receiving packets in the correct order and reducing out-of-order packets in the buffer at intermediate nodes. Our approach also controls the loss of multimedia data packets during transmission. We validate our approach with real-world examples using network simulator. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Buffer size Packet size Delay knapsack algorithm QoS Multimedia data NS2

来源：评论

学校读者我要写书评

暂无评论

A combination of the knapsack algorithm and MIVES for choosing optimal temporary housing site locations: A case study in Tehran

引用

INTERNATIONAL JOURNAL OF DISASTER RISK REDUCTION 2018年 27卷 265-277页

作者： Amin Hosseini, S. M. Pons, Oriol de la Fuente, Albert Univ Politecn Cataluna Dept Civil & Environm Engn Jordi Girona 1-3 ES-08034 Barcelona Spain Univ Politecn Cataluna Dept Architectural Technol Av Diagonal 649 E-08028 Barcelona Spain

In the aftermath of natural disasters, decision-makers often clash when tackling the challenge of choosing suitable temporary housing unit (THU) site locations. Site location considerably impacts temporary housing (TH) delivery time and the displaced population's (DP's) satisfaction. At the same time, selecting a suitable site isimportant to help increase the performance of the THUs in their subsequent life. To this end, this study aimed todesign a new model for selecting site location based on sustainability concepts. The new model combines theintegrated value model for sustainable assessment (MIVES) and the knapsack algorithm to identify a subset ofsustainable sites amongst the possible options based on the required area. The new model was applied to determinethe best subset of sites for THUs for a seismic hazard along the Mosha fault in Tehran, Iran. The results show that weighting techniques can result in inappropriate weights for some indicators.

关键词： Temporary housing Disaster recovery Site location MCDM MIVES knapsack algorithm

来源：评论

学校读者我要写书评

暂无评论

DATA ACQUISITION AND DELAY OPTIMIZATION IN WSN USING knapsack algorithm IN PRESENCE OF TRANSFAULTY NODES

DATA ACQUISITION AND DELAY OPTIMIZATION IN WSN USING KNAPSAC...

引用

International Conference on Intelligent Computing and Control (I2C2)

作者： Shamna, T. P. Praveen, P. N. MEA Engn Coll Dept Elect & Commun Perinthalmanna Kerala India

ISBN: (纸本)9781538603741

The wireless sensors has wide range of applications. The sensor network consist of many tiny sensors and each sensor is assigned to perform specific mission that is some node are transmitting node some are receiving and others are intermediate sensing nodes. Once sensor nodes are deployed, thereafter no additional actions are performed. In typical WSNs, the sensor nodes collect the information from the environment and the collection of the data is done in the intermediate nodes. The collected data is the send to the base station. Reliable communication, power efficiency and network survivability issues are critical concerns, because all the operation is done in sensor nodes. Energy consumption and end to end delay is a major issue in WSNs [8]. In this work we propose a scheme named data acquisition along with knapsack algorithm for reliable and efficient data transmission and delay optimization in the presence of transfaulty nodes. To prevent information loss in WSN due to transfaulty behavior of sensor nodes, in the proposed scheme we construct the network using sensor nodes having dual mode of communication-RF, acoustic and also we use knapsack algorithm for reliable data transmission. knapsack algorithm is to increase the in-order packets and decrease the out-of-order packets simultaneously, which helps for delay optimization.

关键词： Wireless sensor Networks Transfaulty Nodes Data Acquisition knapsack algorithm Data Fusion Acoustic Communication

来源：评论

学校读者我要写书评

暂无评论

Optimizing Walking Routes for Step Goals using knapsack algorithm 2

Optimizing Walking Routes for Step Goals using Knapsack Algo...

引用

2nd International Conference on Technology Innovation and Its Applications, ICTIIA 2024

作者： Purba, Susi Eva Maria Tambunan, Sarah Rosdiana Pardede, Chandro Institut Teknologi Del Dept. of Information System Toba Indonesia

ISBN: (纸本)9798350351613

Health and mortality in humans are influenced by various factors, with daily step count being a significant contributor to overall well-being. This study introduces a novel approach to identify the optimal walking route that ensures the minimum daily step requirement is met, using recorded daily activities as a basis. By determining the most efficient route, the study provides personalized recommendations for the best paths to follow, helping individuals achieve their daily step goals. The study successfully identifies the optimal route using the knapsack algorithm. The recommended route is derived from analyzing the step activity records. It is then suggested as the preferred path to help individuals meet the standard minimum step count necessary for maintaining a healthy lifestyle. © 2024 IEEE.

关键词： health knapsack algorithm step style walk

来源：评论

学校读者我要写书评

暂无评论

Multiple-choice knapsack-based heuristic algorithm for the two-stage two-dimensional cutting stock problem in the paper industry

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2014年第19期52卷 5675-5689页

作者： Kim, Kyungdoc Kim, Byung-In Cho, Hyunbo Pohang Univ Sci & Technol Dept Ind & Management Engn Pohang South Korea

This study examines a two-stage two-dimensional cutting stock problem encountered by a paper mill company. The problem includes various machine-related and operational constraints based on real-world situations. Paper products are manufactured using two major cutting processes. Each cutting machine has a specific minimum and maximum width for input and output rolls and is limited by the maximum number of rolls it can cut at the same time. A mathematical model is presented to formally address the problem and an efficient multiple-choice knapsack-based heuristic algorithm is proposed to solve the problem. To demonstrate the efficiency of the proposed heuristic algorithm, computational experiments are conducted on test data-set generated from real-world data provided by a large paper mill company in the Republic of Korea.

关键词： two-stage cutting stock problem cutting stock problem multiple-choice knapsack problem knapsack algorithm paper mill industry

来源：评论

学校读者我要写书评

暂无评论

A Greedy Dynamic Task Offloading and Service Management in V2V Networks 11

A Greedy Dynamic Task Offloading and Service Management in V...

引用

11th International Conference on Vehicle Technology and Intelligent Transport Systems, VEHITS 2025

作者： Xing, Hanyang Chengdu China

ISBN: (纸本)9789897587450

This paper introduces an advanced framework for optimizing task offloading and service caching in Vehicle-to-Vehicle (V2V) communication networks. The proposed approach leverages a greedy algorithm to address key challenges such as offloading latency, energy consumption, and system overhead. By incorporating practical factors such as task size, server storage capacity, and task popularity, the framework efficiently allocates tasks, thereby reducing computational delays and enhancing network performance. The effectiveness of the algorithm is validated through comprehensive simulations that demonstrate significant improvements in both time efficiency and resource utilization compared to existing methodologies. The results underscore the potential for future advancements in V2V networks, particularly in enhancing network stability under high-speed conditions and developing robust communication systems that maximize the use of roadside computational resources. Copyright © 2025 by SCITEPRESS - Science and Technology Publications, Lda.

关键词： Decision Tree Game Theory knapsack algorithm Vehicle-to-Vehicle Communication

来源：评论

学校读者我要写书评

暂无评论

Day-Ahead Scheduling Method for Multi-Type Resource Demand Response for Power Grid Regulation Demand

Day-Ahead Scheduling Method for Multi-Type Resource Demand R...

引用

2025 International Conference on Electrical Automation and Artificial Intelligence, ICEAAI 2025

作者： Pan, Jia Qi, Zhenxin Li, Hao Meng, Shuo Pei, Jiangnan Li, Tianshu State Grid Laiwu Power Supply Company Jinan China

ISBN: (纸本)9798331506797

In order to solve the problem of long solving time caused by the complexity of the optimization model in the optimal scheduling of distribution network, this paper proposes a multi-type resource demand response day-ahead scheduling method for grid regulation demand. Firstly, aiming at the difference of different types of resources participating in the reduction, a multi-type resource adjustable potential evaluation model was proposed. Secondly, a multi-type resource scheduling model was established. With the maximum total profit of the virtual power plant as the objective function, a user incentive cost model was formulated according to the principle that the electricity price was higher when the resource scheduling amount was closer to its upper limit. Then, the knapsack algorithm is used for optimization. The proposed method is tested in the example analysis. The solution results show that the knapsack algorithm can allocate various resources more effectively to meet the regulation needs of the power grid, and reduce the cost and shorten the solving time of the model. © 2025 IEEE.

关键词： grid regulation demand knapsack algorithm Multi-type resource Scheduling

来源：评论

学校读者我要写书评

暂无评论

knapsack based ECC for digital signature authentication

引用

INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND DISTRIBUTED SYSTEMS 2009年第4期3卷 384-392页

作者： Rajaram, R. Prabakar, M. Amutha Devi, M. Indra Thiagarajar Coll Engn Dept CSE Madurai 625015 Tamil Nadu India Thiagarajar Coll Engn Dept IT Madurai 625015 Tamil Nadu India

Elliptic curve cryptography (ECC) provides a secure means of exchanging keys among communicating hosts using the Diffie Hellman key exchange algorithm. Encryption and decryption of texts and messages have also been attempted. This paper presents the ECC implementation for digital signature authentication and then applying the knapsack algorithm on ECC signing message. In this paper, we attempt to provide more secure digital signature scheme by using knapsack based ECC. We compare our proposed algorithm with RSA based digital signature authentication algorithm and show that our algorithm is better due to the high degree of sophistication and complexity involved. It is almost infeasible to attempt a brute force attack. Moreover, only one parameter namely the knapsack vector ai needs to be kept secret. On the contrary in RSA, three parameters such as the modulus n, its factors p and q need to be kept secret.

关键词： elliptic curve cryptography ECC public key cryptography knapsack algorithm discrete logarithm RSA algorithm communication network

来源：评论

学校读者我要写书评

暂无评论

Computational Burden Analysis for Integer knapsack Problems Solved with Dynamic Programming 14

Computational Burden Analysis for Integer Knapsack Problems ...

引用

14th International Conference on Informatics in Control, Automation and Robotics (ICINCO)

作者： Horla, Dariusz Poznan Univ Tech Fac Elect Engn Inst Control & Informat Engn Ul Piotrowo 3a PL-60965 Poznan Poland

ISBN: (纸本)9789897583049

The paper presents the results concerning computational burden analysis of dynamic programming and bottom-up algorithms when solving knapsack problems. It presents the efficiency of the algorithms information expressed both in calculation time, as well as mean number of iterations in knapsack problems up to 15,000 items and capacity of the knapsack equal to 10,000. The aim of the paper is to present the this knowledge what of practical use when solving optimization problems where estimate of execution time of the algorithm is important.

关键词： Optimization Computational Burden Dynamic Programming knapsack algorithm

来源：评论

学校读者我要写书评

暂无评论

An algorithm for a cutting problem in window frame production

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2016年第14期54卷 4327-4339页

作者： Kim, Byung-In Ki, Youngmin Son, Donghee Bae, Byungjoo Park, Jun-Seo POSTECH Pohang Univ Sci & Technol Ind & Management Engn Pohang South Korea LG Prod Engn Res Inst Pyeongtaek Si South Korea Korea Railrd Res Inst Uiwang Si South Korea

This research discusses the cutting problem encountered by a real-life window frame manufacturer. In the problem, four types of bars (upper, bottom, left and right) should be cut from raw material aluminium profiles for each window frame order. These bars must be cut such that trim loss is minimised. Moreover, the bars should be assigned to the same raw material profile if possible to increase productivity;otherwise, they should be assigned to neighbouring raw material profiles. Furthermore, the numbers of bar types as derived from a raw material profile should not be unbalanced because this scenario induces subsequent machine load imbalance. In this study, we develop a mixed integer programming model and a knapsack-based heuristic approach that minimises the weighted sum of trim loss, bar type imbalance and the degree of order spreading. The results of computational experiments demonstrate the effectiveness of the proposed algorithm, and the proposed approach outperforms the legacy system of the company. Thus, this method is currently being used by the firm in question.

关键词： window frame cutting stock problem knapsack algorithm order spread

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：