Receiver Node Research Articles

An intelligent optimized users resource searching and nearest peer identification in Mobile networks

SummaryMobile networks have advanced in many fields to share information with others. But finding the required resources for each user to share the data is a complex task because of the moving environment. So, the present research article has introduced a novel Chimp‐based Random Forest Peer Identification Framework (CbRFPIF) in the mobile environment. Initially, the required nodes were designed dynamically in the moving background. Hence, the designed wireless moving environment has included sender, peer, and receiver nodes. Moreover, the Chimp fitness model predicted the users' requested resources in the primary stage, then the nearest peer and the user locations were predicted. Consequently, the requested resource by users was distributed to the particular closest peers, and the peer forwarded the data to the specific users. Finally, the planned model is simulated in the NS2 environment, and the communication parameters were calculated and compared with other associated models, which gained the highest throughput and search rate.

Enhancing MPTCP performance in wireless networks with PRS-MPTCP

In recent years, there has been a significant increasing demand for wireless networks, particularly mobile communication. Additionally, smart devices like mobile phones and tablets are able to use multiple interfaces simultaneously. In this regard, the concept of Multipath TCP (MPTCP) has been introduced, enabling the utilization of multiple interfaces for concurrent communication. However, packet loss and subflow heterogeneity, especially in wireless networks, cause an increase in Out-of-Order (OfO) packets at the receiver node, which leads to a decrease in the total MPTCP throughput. To address these performance-related challenges, numerous schedulers have been proposed. However, most existing methods have primarily focused on improving performance without adequately considering the impact of packet loss. This research paper provides a comprehensive overview of MPTCP schedulers. Subsequently, we propose a Practical and Robust Scheduler for MPTCP (PRS-MPTCP) with the specific aim of minimizing OfO packets to improve MPTCP performance in wireless systems. The PRS-MPTCP scheduler takes into account various characteristics of each subflow, including RTT, CWND, and the number of packet losses, to effectively decide which packets should be assigned to which subflow. By using Mininet-WiFi emulation, fair comparisons between PRS-MPTCP and the state-of-the-art schedulers have been conducted, considering throughput, the number of OfO packets, and retransmission rates as performance metrics. The evaluation results reveal the profound impact of selected parameters on the behavior of the schedulers and the overall performance of MPTCP. Ultimately, the results demonstrate that PRS-MPTCP guarantees acceptable throughput and achieves lower retransmission rates and fewer OfO packets compared to other methods. In the PRS-MPTCP, the number of OfO packets has decreased by 38 %, 37 %, 45 %, and 44 % compared to BLEST, ECF, RR, and the Default scheduler, respectively.

Implementing intelligent‐based sparse channel estimation in Multi User‐Multiple Input Multiple Output‐Orthogonal Frequency Division Multiplexing system with hybridized optimization algorithm

SummaryThe channel plays a significant role as the multipath in Multiple Input Multiple Output‐Orthogonal Frequency Division Multiplexing (MIMO‐OFDM) systems. The precoding‐based channel estimation algorithms estimate the channel capacity at the receiver node and they provide efficient channel estimates under worst case channel scenarios. To estimate the channel capacity in the mobile node, semi‐blind scenario is a crucial task in Multi User (MU) MIMO systems. Therefore, a semi blind sparse channel estimation algorithm is demonstrated in the MU‐MIMO system to provide better performance. In the transmitter side, the signal modulation is performed with the help of Quadrature Phase Shift Keying (QPSK), and the modulated signal is given to Pulse Shaping Algorithm (PSA) to reduce the inter‐carrier interference as well as inter symbol interference. At each transmitter, the Inverse Fast Fourier Transforms (IFFT) technique is used for mapping the symbols and then the mapped signal is send to the receiver. In the receiver side, the FFT, pulse reshaping, and QPSK demodulation blocks are serially connected and perform inverse operations of the transmitter in the receiver. Then, the sparse channel is estimated at the receiver by using the semi blind sparse algorithm, where the parameters are optimized by using the Hybridized Drosophila with Virus Colony Search Optimization (HD‐VCSO). The objective function of the developed sparse channel estimation is the reduction of Minimum Mean Square Error (MMSE) in the channel. The performance of the developed sparse channel estimation algorithm is analyzed through different conventional algorithms to validate the effectiveness of the proposed algorithm.

ASMTP: Anonymous secure messaging token‐based protocol assisted data security in swarm of unmanned aerial vehicles

AbstractSwarm of Unmanned Aerial Vehicles (UAVs) broaden the field of application in various fields like military surveillance, crop monitoring in agriculture, combat operations, etc. Unfortunately, they are becoming increasingly susceptible to security attacks, such as jamming, information leakage and spoofing, as they become more common and in more demand. So, there is a wider need for UAVs, which requires the design of strong security procedures to fend off such attacks and security dangers. Even though several studies focused on security aspects, many questions remain unanswered, particularly in the areas of secure UAV‐to‐UAV communication, support for perfect forward secrecy and non‐repudiation. In a battle situation, it is extremely important to close these gaps. The security requirements for the UAV communication protocol in a military setting were the focus of this study. In this paper, we present the issues faced by the UAV swarm, especially during military surveillance operations. To secure the communication link in UAV, a new protocol for UAV Swarm communication is proposed with anonymous secure messaging token‐based protocol (ASMTP). The proposed protocol secures UAV‐to‐base station communication and safeguards the metadata of the sender and receiver nodes. The proposed model maintains the confidentiality, integrity and availability of data in the UAV Swarm and achieves robustness. In addition, it provides a different strategy for the cybersecurity gaps in the swarm of UAVs during military surveillance and combat operations.

Wireless Body Area Nanonetworks via Vascular Molecular Communication.

Advancements in biotechnology and molecular communication have enabled the utilization of nanomachines in Wireless Body Area Networks (WBAN2) for applications such as drug delivery, cancer detection, and emergency rescue services. To study these networks effectively, it is essential to develop an ideal propagation model that includes the channel response between each pair of in-range nanomachines and accounts for the interference received at each receiver node. In this paper, we employ an advection-diffusion equation to obtain a deterministic channel matrix through a vascular WBAN2. Additionally, the closed forms of inter-symbol interference (ISI) and co-channel interference (CCI) are derived for both full duplex (FDX) and half duplex transmission (HDX) modes. By applying these deterministic formulations, we then present the stochastic equivalents of the ideal channel model and interference to provide an innovative communication model by simultaneously incorporating CCI, ISI, and background noise. Finally, we evaluate the results with numerous experiments and use signal-to-interference-plus-noise ratio (SINR) and capacity as metrics.

Prototipe Deteksi Letak Kebocoran Pipa dengan Optimalisasi Kinerja Penerimaan Paket LoRa menggunakan Pengkodean Parameter Fisik

The purpose of this research is to determine the effect of the physical coding of LoRa communications on monitoring water pipelines. Optimizing the performance of packet receivers in the LoRa communication system using coding on the physical parameters SF (spreading factor), BW (bandwidth), and CR (coding rate). The detection system consists of 3 sensor nodes, 3 intermediate nodes, and 1 receiver node. Data from these sensors is sent to a cloud database. The SX1278 LoRa communication module works using a 433 MHz frequency. During the transmission process on the LoRa communication system, optimization is carried out for receiving data packets using the parameter coding method of physical spread factors, bandwidth, and coding rate. As a result of the research, it is shown that the greater the value of the third parameter (SF, BW, and CR), such as improvement in packet reception performance, improvement in bit security, and increasing packet resistance to various disturbances in transmission, but the time required for sending data be longer. The optimal parameters for detecting pipe leak locations include SF 10, BW 500 KHz, and CR 4/8. The LoRa SX1278 scenario is optimal with a distance of 400 meters, where packet and byte reception are obtained 100%.

Selecting Optimal Path in Multiple-Path Routing for MANETs Using Fuzzy Cost

Background/ Objectives: Mobile Ad Hoc Networks (MANETs) consists of a set of nodes, where the nodes tend to change their positions time to time because of their infrastructure less characteristic. In MANETs, the protocol that is considered to be the appropriate for constructing an efficient route is AODV. Broadcast storm is another approach that can be used for establishing a path between the sender and receiver. Due to the concerns related to contention and collision, broadcast is not considered as an efficient mechanism for path selection. Though the aim of broadcasting is to minimize the flooding other issues like bandwidth consumption, collision and contention cannot be controlled. Since MANETs are associated with inadequate bandwidth, the approach of broadcasting is not efficient. Multipath routing approach permits in constructing multiple paths between the communicating nodes (sender and receiver). This approach is complicated due to the problem of node mobility in MANETs. The other paths available are not reliable because of the ad hoc nature of MANETs. The intention is to design a fuzzy controller that assists in reducing the reconstruction of paths using fuzzy cost assigned to each node in the network. Methods: The concept of this paper is to establish an optimal path from sender node to the receiver node from the available multiple paths in MANETs. The path established in this approach uses fuzzy cost. Fuzzy measure is the criteria used for establishing a path. The concept ImRMR used in this paper has been included with few improvements. The basic functionality of ImRMR is that paths are classified based on rank fitness. The proposal is to classify the paths based on its fuzzy cost. This fuzzy cost classifies the paths fitness. Findings: The proposed fuzzy cost approach discussed in this study is compared with On-Demand Multicast Routing Protocol (ODMRP). The result exhibits that the proposed method works better under differing conditions like traffic load, transmission range between nodes and also considers node mobility. The proposed mechanism with inclusion of fuzzy cost shows 5% energy efficiency, reduces the collisions by about 35% and throughput is enhanced by 30%. There has been a considerable decrease in the number of queries by 23%. The simulation results indicate that ODMRP with fuzzy cost is more useful and significant. Hence, consideration of fuzzy cost as a means for selecting an effective route is assumed to be the best. Novelty: This method contributes in reducing the drawbacks of routing approaches whether it is unipath and multi-path approach. The proposed approach changes the value of the attributes for a given route with fuzzy cost. A threshold value will be considered initially and the route having a cost more than the initialized threshold would be advised as the best route. This route would be considered as the efficient route for transmission between the sender and the receiver. Keywords: Uni­path, multiple paths, Fuzzy cost, Fuzzy fitness, Rank fitness

Relay‐Assisted Aerial Communication over a Single‐Shadowed Communication Channel

This paper discusses amplify‐and‐forward relay‐assisted air‐to‐ground unmanned aerial vehicle communication over a recently proposed single‐shadowing‐based composite fading scenario. Included are the results derived from the Fluctuating Beckmann faded co‐channel interference at the receiver node and relay. Maximal ratio combining based diversity scheme is considered. The power splitting at the receiver for energy harvesting has been assimilated. The utilization of characteristic function leads to the derivation of outage, success probabilities, and capacity with outage expressions. These expressions represent the impact of path‐loss, aerial vehicle‐relay, relay‐receiver distances, and channel characteristics of desired and interference signals. Utilizing these expressions, numerical outcomes are presented and evaluated.

Integrated Shared Random Key Agreement Protocol for Wireless Sensor Network

The secured data transmission in Wireless Sensor Network (WSN) relies on effective key generation and secured sharing. The generated key must be random to enhance data confidentiality. The processes associated with the security in WSN must be designed at reduced computing time and communication cost. Our research work aims to design a novel lightweight key-sharing protocol that is needed for ensuring data confidentiality. The protocol must meet the constraints of WSN by being lightweight and consuming less energy. Security breaches in WSNs occur due to insecure keys. This can be overcome by generating shared keys which are generated once using the dynamic features of Sensor Nodes (SNs) when the Cluster Heads (CHs) are selected. In this research work, we have generated the Master Shared Key (MSK) at the transmitter node by forming a Galois Ring (GR) using WSN parameters and derived the Shared Random Key (SRK) using matched positions of exchanged Random Sequences (RSs). It is protected using a Physically Unclonable Function (PUF). The novelty lies in the SRK generation from MSK which is chosen at random from the polynomials generated during the formation of GR. The MSK is securely shared with the receiver node by encrypting using a Preloaded Key (PK). After this exchange, the key for encryption and decryption is derived by the transmitter and the receiver by exchanging RSs. The SRK is then encrypted using a key which is a unique fingerprint of the SN generated using PUF and stored in the SNs and the CHs to prevent node capture attack that occurs in WSN. Our proposed Shared Random Key Agreement Protocol (SRKAP) is comparable to the Localized Encryption and Authentication Protocol (LEAP) and performs better compared to the Elliptic Curve Diffie Hellman (ECDH) algorithm

A proportional-integral observer protocol for secure communication

In this work, we present a novel observer-based masking protocol in order to secure the communication between nodes of a cyber-physical system. The approach is based on including multiplicative disturbances generated from a known autonomous system in the source node and then including an observer in the receiver node that exactly removes the noise and recovers the original signal. It is shown that, if the masking signal is appropriately designed, the de-masking module can be implemented through a simple proportional-integral observer. The approach is then validated through numerical simulations.

The Role of Gossiping in Information Dissemination over a Network of Agents.

We consider information dissemination over a network of gossiping agents. In this model, a source keeps the most up-to-date information about a time-varying binary state of the world, and n receiver nodes want to follow the information at the source as accurately as possible. When the information at the source changes, the source first sends updates to a subset of m≤n nodes. Then, the nodes share their local information during the gossiping period, to disseminate the information further. The nodes then estimate the information at the source, using the majority rule at the end of the gossiping period. To analyze the information dissemination, we introduce a new error metric to find the average percentage of nodes that can accurately obtain the most up-to-date information at the source. We characterize the equations necessary to obtain the steady-state distribution for the average error and then analyze the system behavior under both high and low gossip rates. We develop an adaptive policy that the source can use to determine its current transmission capacity m based on its past transmission rates and the accuracy of the information at the nodes. Finally, we implement a clustered gossiping network model, to further improve the information dissemination.

Emission rate optimization in diffusion-based molecular communication among mobile bacteria

In quorum sensing (QS), bacteria exchange information by using molecular signals to work together. In this paper, we study diffusion-based molecular communication with the QS mechanism between the transmitter node and receiver node which are composed of a population of mobile bacteria in a cluster, respectively. The expression of average bit error probability (BEP) at a receiver bacterium is derived. Furthermore, we use the projected gradient descent (PGD) algorithm to solve the optimization problem whose objective is to minimize the average BEP under emission rate constraints which require that the emission rate of each transmitter bacterium has lower and upper bounds. Finally, the numerical results show the PGD algorithm has good convergence behaviors and it is more efficient in finding the optimal emission rate with fewer iterations than genetic algorithm. The obtained results are expected to provide guidance in designing QS-based molecular communication system with lower average BEP.

Lamb-Waves-Based Sparse Distributed Penetrating Communication via Phase-Position Modulation for Enclosed Metal Structures

Sensor nodes have been widely used for mechanical equipment condition monitoring, especially for enclosed metal structures. In these cases, it is important to achieve communication between the sensor nodes inside the enclosed metal structures and the outside receiver node. Conventional wired communication using cables will affect the structural integrity, and wireless communication using electromagnetic waves will be shielded by metal structures, so neither is desirable. Motivated by these issues, this study proposes a Lamb waves-based sparse distributed penetrating communication (SDPC) system using the propagation characteristics of Lamb waves considered harmful in previous studies to accomplish wireless simultaneous data communication. Combining phase shift keying and pulse position modulation mechanisms, a phase-position modulation (P-PM) technology is proposed to improve the communication rate. To overcome the intersymbol interference (ISI) problem caused by the propagation characteristics of Lamb waves, a phase-position sparse reconstruction (P-PSR) strategy is proposed for demodulation, which is more convenient and accurate compared with the conventional cross-correlation method. It should be noted that the maximum bit rate without bit error reaches 830.48 kbps via P-PM parameter optimization, which is 8.3 times higher than that of on-off keying modulation approach under the same experimental conditions. Finally, distributed communication experiments and simulations further verify the high accuracy, efficiency and strong robustness of the proposed SDPC system, which can meet the communication requirements of enclosed metal structures.

PF-IBDA: Provably secure and pairing-free identity-based deniable authentication protocol for MANET environments

Mobile Adhoc Network (MANET) is used in various real-time applications, such as e-voting, army tactical communication, health-care applications, disaster rescue, online message exchange, etc. However, source authentication and deniability are essential properties in such applications. Typically, these properties can be achieved using a deniable authentication (DA) protocol. With the help of a DA protocol, a mobile receiver node can directly verify the source, another mobile node, of a message without consulting a trusted third party (TTP). Recently, many identity-based deniable authentication (IBDA) protocols have been proposed. Most of these protocols are insecure and computationally expensive since they use costly operations, such as bilinear pairing and map-to-point hash function. We proposed a pairing-free identity-based deniable authentication (PF-IBDA) protocol for MANET environments. We proved that the PF-IBDA protocol could provide indistinguishability against adaptive chosen ciphertext attack (IND-CCA2) in the random oracle model (ROM) based on the hardness assumption of the elliptic curve computational Diffie–Hellman (ECCDH) problem. We have computed the execution time of PF-IBDA protocol in different security levels: 80-bit, 112-bit, 128-bit, 192-bit, and 256-bit on a mobile device using the JPBC library and compared it with the state-of-the-art IBDA protocols. We found that the proposed PF-IBDA protocol is more efficient than the existing IBDA protocols.

Three-dimensional electric-field vector resistivity imaging for deep subsurface fractures network in heterogeneous crystalline rocks

SUMMARY Crystalline rocks, exposed in different parts of the world and over about one-third of India, have complex aquifer systems, which pose a challenge to mapping groundwater dynamics. Electrical resistivity tomography in quasi-3-D and electrical logging of some borewells carried out in an experimental ‘hydrogeological park’ in southern India, which has numerous boreholes and other geophysical information for validation, were unable to map the existence of deeper bedrock fractures and their connectivity. We have attempted electric-field vector resistivity imaging (EVRI), a new tool, to resolve the possible fracture-induced deep interconnectivity in a hard rock aquifer system. In the experiment, multiple two-orthonormal-channels independent receiver nodes for potential measurements are deployed and illuminated with several current injections between ∼ 0.9–3.7 A in full 3-D fashion, which allowed for improved mapping of resistivity variation than earlier approaches. The EVRI-derived full 3-D model shows the presence of fractures for depths between 20 and 70 m with substantial resistivity variations, supported by some borewells hydraulic investigations. It has also enhanced lateral resolution for depths > 30 m and almost doubled the depth of investigation than earlier electrical models. EVRI results revealed unweathered/unfractured granitic rock with no significant signature of fractures beyond 70 m depth that corroborates with existing borehole logs and hydrogeological conceptual model. Therefore, this study demonstrates the potential of EVRI for 3-D mapping of heterogeneous crystalline rocks, which would greatly help in groundwater management.

A Review on Dynamic Network Using Flexible Active-Mode Period Scheme for Telemedicine

Challenges associated with transmitter node during the process of intelligent transceiver nodes attempting to be active state after receiving a message outside its time slot schedule which might result in energy depletion through receiver node are the most notable origin of excessive energy consumption in the system. Various methods have been carried out to minimize the overhead cost. In this article, we presented the Dynamic Network using Adaptive Wake-Up Interval Media Access Control (MAC) protocol for Wireless Body Area Networks (WBANs) for telemedicine which could lead to the minimization of the energy consumption in the network and maximization of network lifetime. A Receiver Controlled mechanism balances the number of wake-up periods between Receiver node and Transmitter nodes and estimation of traffic load. This article depicts no earlier examination of dynamic network using Flexible Active-Mode period scheme-based media access control protocol for WBAN. Therefore, this review work could lead to the improvement of dynamic network Flexible Active-Mode –media access control protocols and invigorate a clearer way of finding AWI-Media Access Control protocol problems.

A dynamic and multi-level key management method in wireless sensor networks (WSNs)

Wireless sensor networks include a set of ultralight sensor nodes with limited energy, low storage capacity, and constrained processing power. Security is a challenging issue in these networks. One approach to maintain security in these networks is key management. When designing key management schemes, the main challenge is to achieve the acceptable security level and manage resources, especially energy. Today, many key management methods use authentication mechanisms. However, these methods are faced with different challenges due to the limited computational capability of nodes and high energy consumption in the network. In this paper, we present a dynamic and multi-level key management method for homogeneous wireless sensor networks. The proposed key management approach uses an authentication mechanism based on message authentication code (MAC), which is calculated by the shared symmetric keys between the transmitter and receiver nodes. In our scheme, the network is divided into five levels. Then, the clustering process is performed at each level, so that the size of the clusters varies in different levels. The proposed approach includes four phases: (1) Network leveling phase (2) Clustering phase (3) Key establishment phase (cluster key, pairwise key, and gateway key) (4) Rekeying phase. In the proposed method, a symmetric encryption algorithm called RC5 is used for producing keys. Our method contributes to the state of the art in wireless sensor networks by proposing a dynamic and multi-level key management approach. The use of a MAC-based authentication mechanism and the division of the network into different levels and clusters allows for efficient key establishment and rekeying, while minimizing energy consumption and communication overhead. Our proposed method is implemented using the NS2 simulator. Then, the simulation results are compared with SKWN and KMP methods. The results show that our proposed method outperforms SKWN and KMP in terms of average energy consumption, required memory, and communication overhead. However, its computational overhead is slightly more than SKWN and KMP.

Enhancing energy utilization for high power node multicasting in wireless sensor networks

In multicasting packets of data from a node will be sent to a group of receiver nodes at the same time. Multicasting lowers transmission costs. Energy conservation is critical to a sensor network’s long-term viability. Sensor networks have limited and non-replenishable energy supplies, maximizing network lifetime is crucial in sensor nodes. As a result, clustering has become one of the popular methods for extending the lifetime of an entire system by integrating information at the cluster head. Cluster head (CH) selection is the important serving node in each cluster in the Wireless sensor networks (WSN). This paper introduces a High Power Node (HPN) multicasting approach which embeds a cluster of sink node data in packet headers to allow receiver for utilizing a approach for transferring multicast packet data via the shortest paths. The proposed Energy efficient multicasting cluster based routing (EEMCR) protocol utilized high power nodes, which shall play a critical role in minimal energy usage. The implementation findings demonstrate that, when compared with the previous methodologies, the suggested algorithm has enhanced in terms of packet delivery ratio (PDR), End to end delivery rate, efficiency and achieves low energy consumption. The proposed EEMCR obtain 95% efficiency. The results are then compared to other existing algorithms to determine the superiority of the proposed methodology.

Resource allocation scheme of netted radar system for target localisation

AbstractIn order to enhance the resource utilisation of the netted radar system, a receiving resource allocation (RRA) strategy for target localisation is developed in this article. Receiving resource refers to the receiving node and the processing approach adopted. The aim of the proposed RAA strategy is to select the receiver node and corresponding processing approach to minimise the resource cost while satisfying the desired target localisation accuracies. The resource cost includes the implementation cost of the processing approaches and the distance cost of data transmission. The Cramer‐Rao bound (CRB) incorporating the above controllable parameters is derived and used as the target localisation performance metric in the netted radar system. Whereafter, the RRA problem is modelled as a non‐convex constrained optimisation problem with the discrete variables. A scheme based on the modified depth‐first search is proposed to solve this problem. Simulation results demonstrate that the proposed scheme can effectively reduce resource consumption under the desired target localisation performance constraints.

A Novel Approach on Efficient Data Transfer in Multimedia Communication Network

In the Wireless sensor networks, the main crucial part as we observe based on literature analysis managing Real-time data, load balancing, security of data, managing data, and also transmitting large (multimedia data) from source to destination using WMSN. Using the proposed system work on energy efficiency and robustness of the system and based on result analysis achieve the better result as compared to the existing system.
 Introduction: The growth of wireless sensor networks during the past ten years has altered how data is gathered and retrieved from different areas. With the expansion of communication infrastructure, the requirement and use of Multimedia Wireless Sensor Networks is becoming more widespread on these days. These networks confront a number of difficulties in ensuring user data is secure, trustworthy, and private, just like any other WMSNs.
 Objectives: This paper works on multimedia data transmission in WMSN and for that works on 3-bit LSB Embedding for transmitting large-size data with min energy consumption rate as compared to other methods like AES, ECC, etc.
 Methods: 3-bit LSB Embedding will be done which provides secrecy of the data and then we will implement the Energy Efficient routing to the embedded multimedia data for WMSN .
 Results: The shortest path optimization, using energy efficient routing protocol, by sensor nodes to transfer multimedia-data from source-node to destination-node achieved in WMSN. The average energy consumption and throughput of 400 multimedia sensor nodes transferring large amount multimedia-data transfer from source-to-destination WMSN. Existing work shows that it has high energy consumption and low throughput as compare to the proposed work.
 Conclusions: In this paper, work on energy-efficient real time multimedia data trans receive using Wireless sensor network use 3-bit LSB data embedding in multimedia data transmission in a wireless sensor network for compress data. Based 3-bit LSB data embedding for digital audio, image, video, and 3D media. Given the tremendous developments in digital media communications ranging from conventional digital audio to immersive media, LSB data hiding plays an important role in providing high capacity and maintaining imperceptibility by considering mechanisms of the HAS and HVS. This paper uses a hybrid approach for secure data as well as compressing it using a 3-bit LSB embedding approach as well as for making energy optimization using a trust mechanism for set initial threshold values of parameters like min energy required, transmission power, location, transmission power, etc. in the transmission side source node and another surrounding node will be selected based on a parameter that we reserve than apply 3-bit LSB embedding on data and on the receiver and apply same de-embedding after selecting receiver node. And for establishing communication select the most appropriate and optimized path based on energy and location-based estimation. With the proposed structure we achieve significantly improve in results as achieve more throughput and less energy consumption as compared to the existing system.