In recent years, multi-access edge computing (MEC) has become a promising technology used in 5G networks based on its ability to offload computational tasks from mobile devices (MDs) to edge servers in order to address MD-specific limitations. Despite considerable research on computation offloading in 5G networks, this activity in multi-tier multi-MEC server systems continues to attract attention. Here, we investigated a two-tier computation-offloading strategy for multi-user multi-MEC servers in heterogeneous networks. For this scenario, we formulated a joint resource-allocation and computation-offloading decision strategy to minimize the total computing overhead of MDs, including completion time and energy consumption. The optimization problem was formulated as a mixed-integer nonlinear program problem of NP-hard complexity. Under complex optimization and various application constraints, we divided the original problem into two subproblems: decisions of resource allocation and computation offloading. We developed an efficient, low-complexity algorithm using particle swarm optimization capable of high-quality solutions and guaranteed convergence, with a high-level heuristic (i.e., meta-heuristic) that performed well at solving a challenging optimization problem. Simulation results indicated that the proposed algorithm significantly reduced the total computing overhead of MDs relative to several baseline methods while guaranteeing to converge to stable solutions.

Multi-access edge computing (MEC) enables autonomous vehicles to handle time-critical and data-intensive computational tasks for emerging Internet-of-Vehicles (IoV) applications via computation offloading. However, a massive amount of data generated by colocated vehicles is typically redundant, introducing a critical issue due to limited network bandwidth. Moreover, on the edge server side, these computation-intensive tasks further impose severe pressure on the resource-finite MEC server, resulting in a low performance efficiency of applications. To solve these challenges, we model the data redundancy and collaborative task computing scheme to efficiently reduce the redundant data and utilize the idle resources in nearby MEC servers. First, the data redundancy problem is formulated as a set-covering problem according to the spatiotemporal coverage of captured images. Next, we exploit the submodular optimization technique to design an efficient algorithm to minimize the number of images transferred to the MEC servers without degrading the quality of IoV applications. To facilitate the task execution in the MEC server, we then propose a collaborative task computing scheme, where a MEC server intentionally encourages nearby resource-rich MEC servers to participate in a collaborative computing group. Accordingly, a cost model is formulated as an optimization problem, the objective of which is to prompt the MEC server to judiciously allocate computing tasks to nearby MEC servers with the goal of achieving the minimal cost, while the latency of tasks is guaranteed. Experimental results show that the proposed scheme can efficiently mitigate data redundancy, conserve network bandwidth consumption, and achieve the lowest cost for processing tasks.

In Steganography, the total message will be invisible into a cover media such as text, audio, video, and image in which attackers don't have any idea about the original message that the media contain and which algorithm use to embed or extract it. In this paper, the proposed technique has focused on Bitmap image as it is uncompressed and convenient than any other image format to implement LSB Steganography method. For better security AES cryptography technique has also been used in the proposed method. Before applying the Steganography technique, AES cryptography will change the secret message into cipher text to ensure two layer security of the message. In the proposed technique, a new Steganography technique is being developed to hide large data in Bitmap image using filtering based algorithm, which uses MSB bits for filtering purpose. This method uses the concept of status checking for insertion and retrieval of message. This method is an improvement of Least Significant Bit (LSB) method for hiding information in images. It is being predicted that the proposed method will able to hide large data in a single image retaining the advantages and discarding the disadvantages of the traditional LSB method. Various sizes of data are stored inside the images and the PSNR are also calculated for each of the images tested. Based on the PSNR value, the Stego image has higher PSNR value as compared to other method. Hence the proposed Steganography technique is very efficient to hide the secret information inside an image.

Multi-access edge computing (MEC) can improve the users’ computational capacity and battery life by moving computing services to the network edge. In addition, data-content caching on a MEC server improves the user quality of experience and decreases the backhaul network congestion. Moreover, non-orthogonal multiple access (NOMA) has recently been implemented to increase network throughput and capacity. Combining these techniques can improve the user performance and benefit the network. This paper investigates a combined computational offloading and data-content caching problem for NOMA-MEC systems. The aim was to achieve the minimum total completion latency of all users by jointly optimizing the offloading decision, caching strategy, computational resource, and power allocation. This satisfies the constraints within the scope of the potential violation for energy consumption, offloading decision, and the computation and storage capacity of the MEC server. The formulated problem is a mixed-integer non-linear programming and a non-convex problem. To solve this challenging problem, a block successive upper-bound minimization method was implemented to obtain efficient solutions. Numerous simulation results were presented to demonstrate the convergence and efficacy of the proposed algorithm. Compared with other schemes of all-offloading, local-only, and equal resources, our proposed algorithm can approximately reduce the total completion latency by 17.68%, 26.02%, and 70.98%.

Text summarization, a field of data mining, is very important for developing various real-life applications. Many techniques have been developed for summarizing English text(s). But, a few attempts have been made for Bengali text because of its some multifaceted structure. This paper presents a method for text summarization which extracts important sentences from a single or multiple Bengali documents. The input document(s) should be pre-processed by tokenization, stemming operation etc. Then, word score is calculated by Term-Frequency/Inverse Document Frequency (TF/IDF) and sentence score is determined by summing up its constituent words' scores with its position. Cue and skeleton words have also been considered to calculate the sentence score. For single or multiple documents, K-means clustering algorithm has been applied to produce the final summary. The experimental result shows satisfactory outputs in comparison to the existing approaches possessing linear run time complexity.