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 b...
详细信息
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.
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...
详细信息
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.
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 a...
详细信息
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.
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 rou...
详细信息
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...
详细信息
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.
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 chal...
详细信息
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-ah...
详细信息
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 at...
详细信息
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.
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 expresse...
详细信息
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.
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 f...
详细信息
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.
暂无评论