The drill bit is the most essential tool in drilling operation and optimum bit selection is one of the main challenges in planning and designing new wells. Conventional bit selections are mostly based on the historical performance of similar bits from offset wells. In addition, it is done by different techniques based on offset well logs. However, these methods are time consuming and they are not dependent on actual drilling parameters. The main objective of this study is to optimize bit selection in order to achieve maximum rate of penetration (ROP). In this work, a model that predicts the ROP was developed using artificial neural networks (ANNs) based on 19 input parameters. For the modeling part, a one-dimension mechanical earth model (1D MEM) parameters, drilling fluid properties, and rig- and bit-related parameters, were included as inputs. The optimizing process was then performed to propose the optimum drilling parameters to select the drilling bit that provides the maximum possible ROP. To achieve this, the corresponding mathematical function of the ANNs model was implemented in a procedure using the genetic algorithm (GA) to obtain operating parameters that lead to maximum ROP. The output will propose an optimal bit selection that provides the maximum ROP along with the best drilling parameters. The statistical analysis of the predicted bit types and optimum drilling parameters comparing the actual flied measured values showed a low root mean square error (RMSE), low average absolute percentage error (AAPE), and high correction coefficient (R2). The proposed methodology provides drilling engineers with more choices to determine the best-case scenario for planning and/or drilling future wells. Meanwhile, the newly developed model can be used in optimizing the drilling parameters, maximizing ROP, estimating the drilling time, and eventually reducing the total field development expenses.
In the presence of deep submicron noise, providing reliable and energy‐efficient network on‐chip operation is becoming a challenging objective. In this study, the authors propose a hybrid automatic repeat request (HARQ)‐based coding scheme that simultaneously reduces the crosstalk induced bus delay and provides multi‐bit error protection while achieving high‐energy savings. This is achieved by calculating two‐dimensional parities and duplicating all the bits, which provide single error correction and six errors detection. The error correction reduces the performance degradation caused by retransmissions, which when combined with voltage swing reduction, due to its high error detection, high‐energy savings are achieved. The res
... Show MoreThis paper presents a meta-heuristic swarm based optimization technique for solving robot path planning. The natural activities of actual ants inspire which named Ant Colony Optimization. (ACO) has been proposed in this work to find the shortest and safest path for a mobile robot in different static environments with different complexities. A nonzero size for the mobile robot has been considered in the project by taking a tolerance around the obstacle to account for the actual size of the mobile robot. A new concept was added to standard Ant Colony Optimization (ACO) for further modifications. Simulations results, which carried out using MATLAB 2015(a) environment, prove that the suggested algorithm outperforms the standard version of AC
... Show MoreThe majority of the environmental outputs from gas refineries are oily wastewater. This research reveals a novel combination of response surface methodology and artificial neural network to optimize and model oil content concentration in the oily wastewater. Response surface methodology based on central composite design shows a highly significant linear model with P value <0.0001 and determination coefficient R2 equal to 0.747, R adjusted was 0.706, and R predicted 0.643. In addition from analysis of variance flow highly effective parameters from other and optimization results verification revealed minimum oily content with 8.5 ± 0.7 ppm when initial oil content 991 ppm, tempe
The transmitting and receiving of data consume the most resources in Wireless Sensor Networks (WSNs). The energy supplied by the battery is the most important resource impacting WSN's lifespan in the sensor node. Therefore, because sensor nodes run from their limited battery, energy-saving is necessary. Data aggregation can be defined as a procedure applied for the elimination of redundant transmissions, and it provides fused information to the base stations, which in turn improves the energy effectiveness and increases the lifespan of energy-constrained WSNs. In this paper, a Perceptually Important Points Based Data Aggregation (PIP-DA) method for Wireless Sensor Networks is suggested to reduce redundant data before sending them to the
... Show MoreTor (The Onion Routing) network was designed to enable users to browse the Internet anonymously. It is known for its anonymity and privacy security feature against many agents who desire to observe the area of users or chase users’ browsing conventions. This anonymity stems from the encryption and decryption of Tor traffic. That is, the client’s traffic should be subject to encryption and decryption before the sending and receiving process, which leads to delay and even interruption in data flow. The exchange of cryptographic keys between network devices plays a pivotal and critical role in facilitating secure communication and ensuring the integrity of cryptographic procedures. This essential process is time-consuming, which causes del
... Show MoreEnergy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit
... Show More