Honest Nodes Research Articles

Byzantine and Honest Nodes Distribution in Random Partitions Under an Adaptive Adversary

Byzantine and Honest Nodes Distribution in Random Partitions Under an Adaptive Adversary

Sublinear message bounds of authenticated implicit Byzantine agreement

This paper studies the message complexity of authenticated Byzantine agreement (BA) in synchronous, fully-connected distributed networks under an honest majority. We focus on the so-called implicit Byzantine agreement problem where each node starts with an input value and at the end a non-empty subset of the honest nodes should agree on a common input value by satisfying the BA properties (i.e., there can be undecided nodes)3. We show that a sublinear (in n, number of nodes) message complexity BA protocol under honest majority is possible in the standard PKI model when the nodes have access to an unbiased global coin and hash function. In particular, we present a randomized Byzantine agreement algorithm which, with high probability achieves implicit agreement, uses O˜(n) messages, and runs in O˜(1) rounds while tolerating (1/2−ϵ)n Byzantine nodes for any fixed ϵ>0, the notation O˜ hides a O(polylogn) factor4. The algorithm requires standard cryptographic setup PKI and hash function with a static Byzantine adversary. The algorithm works in the CONGEST model and each node does not need to know the identity of its neighbors, i.e., works in the KT0 model. The message complexity (and also the time complexity) of our algorithm is optimal up to a polylog n factor, as we show a Ω(n) lower bound on the message complexity. We further extend the result to Byzantine subset agreement, where a non-empty subset of nodes should agree on a common value. Lastly, we analyze several relevant results that follow from the construction of the main result.To the best of our knowledge, this is the first sublinear message complexity result of Byzantine agreement. A quadratic message lower bound is known for any deterministic BA protocol (due to Dolev-Reischuk [JACM 1985]). The existing randomized BA protocols have at least quadratic message complexity in the honest majority setting. Our result shows the power of a global coin in achieving significant improvement over the existing results. It can be viewed as a step towards understanding the message complexity of randomized Byzantine agreement in distributed networks with PKI.

Lightweight adaptive Byzantine fault tolerant consensus algorithm for distributed energy trading

With the rapid development of smart grid, constructing distributed energy trading market (DETM) based on blockchain to coordinate distributed energy resources (DER) has become a future direction. However, existing consensus algorithms of blockchain face many challenges in large-scale energy trading scenarios, such as high resource overhead, slow transaction procedure. To solve the above crucial problems for wide deployment of distributed energy trading, this study proposes a novel consensus algorithm named Lightweight adaptive Byzantine fault tolerant consensus (LA-BFT), and a reputation calculation method based on behavioral characteristics for selection of consensus nodes. The LA-BFT consists of two parts: (i) weak consensus for normal cases. By introducing threshold signature mechanism, weak consensus simplifies the consensus process to achieve linear communication complexity O(n). (ii) byzantine node detection scheme is enable for malicious cases. With consensus committee, the detection scheme can detect the potential byzantine nodes by cross-validation, which ensures transaction safety. The reputation calculation method is presented to cooperate with LA-BFT to elect leaders and candidates for consensus procedure. Once a round of consensus is completed, the reputation of each node needs to be updated, only nodes with high reputation are eligible to become leaders or committee nodes in the next round. With the reputation calculation method, honest nodes and byzantine nodes can be effectively identified, ensuring the security of the consensus process. Numerical results indicate that LA-BFT exhibits superior performance on communication overhead and bandwidth occupancy in large-scale concurrent energy trading scenarios. When the number of nodes is 50, under normal scenarios, LA-BFT’s communication overhead is notably lower, constituting a mere 6.02% of PBFT and 24.26% of SHBFT, while bandwidth occupancy amounts to merely 5.55% of PBFT and 9.76% of SHBFT.

Adaptive multidimensional trust-based recommendation model for peer to peer applications

Abstract In today’s world, the widespread utilization of services such as Nearby Share, Near Field Communication (NFC), and Wi-Fi Direct for deploying various applications has significantly bolstered the demand for reliable and secure distributed ad-hoc peer-to-peer networks. Yet, ensuring the trustworthiness of participating nodes remains a significant challenge. Trust among nodes plays a pivotal role in collaborative network applications, especially in environments like Mobile Ad-hoc Networks and VANET (Vehicular Ad-hoc Networks). Evaluating the trustworthiness of nodes is essential for promptly identifying misleading entities, thereby preemptively preventing their involvement in ongoing transactions. Attributes or characteristics exhibited by nodes, such as honesty, selfishness, or malicious behavior, serve as key factors in trust computation. The effectiveness of trust evaluation directly influences the encouragement of honest nodes and the deterrence of malicious ones, thereby nurturing a healthy and competitive network ecosystem. Recognizing the dynamic nature of network environments, trust computation methods must be adaptable and diverse. The adaptive multidimensional trust (AMT) model introduced in this article goes beyond simple reputation assessment. It offers three distinct methods such as Direct Trust ( Direct Trust ) \left({{\rm{Direct}}}_{{\rm{Trust}}}) , multiple security parameters, identification of qualified recommenders, which got selected dynamically as per change in trust ratings of peers. AMT advocates for an incentive-driven approach to identify legitimate peers, monitoring gradual increases in their performance ratings, whereas, spikes in performance alert to potential colluding peers or nodes displaying erratic behavior. This article evaluates the effectiveness of the AMT through a case study focused on an E-commerce application. It scrutinizes the model’s performance across different percentages of malicious nodes within the network, providing a thorough analysis and discussion of the results based on the trust value of malicious and benign peers and efficiency by selecting genuine service for transaction.

Erdos: A Novel Blockchain Consensus Algorithm with Equitable Node Selection and Deterministic Block Finalization

The introduction of blockchain technology has brought about significant transformation in the realm of digital transactions, providing a secure and transparent platform for peer-to-peer interactions that cannot be tampered with. The decentralised and distributed nature of blockchains guarantees the integrity and authenticity of the data, eliminating the need for intermediaries. The applications of this technology are not limited to the financial sector, but extend to various areas, such as supply chain management, identity verification, and governance. At the core of these blockchains is the consensus mechanism, which plays a crucial role in ensuring the reliability and integrity of a system. Consensus mechanisms are essential for achieving an agreement amongst network participants regarding the validity of transactions and the order in which they are recorded on the blockchain. By incorporating consensus mechanisms, blockchains ensure that all honest nodes in the network reach a consensus on whether to accept or reject a block, based on predefined rules and criteria. The aim of this study is to introduce a novel consensus mechanism named Erdos, which seeks to address the shortcomings of existing consensus algorithms, such as the Proof of Work and Proof of Stake. Erdos emphasises security, decentralisation, and fairness. One notable feature of this mechanism is its equitable node-selection algorithm, which ensures equal opportunities for all nodes to engage in block creation and validation. In addition, Erdos implements a deterministic block finalisation process that guarantees the integrity and authenticity of the blockchain. The main contribution of this research lies in its innovative approach to deterministic block finalisation, which effectively mitigates the various security risks associated with blockchain systems.

Asynchronous verifiable information dispersal protocol of achieving optimal communication

The evolution of distributed systems necessitates robust protocols to facilitate secure and efficient data storage and retrieval amid challenges like asynchronous communication and adversarial threats. However, achieving the theoretical lower bounds of communication cost in Asynchronous Verifiable Information Dispersal (AVID) protocols remains an unresolved issue, prompting the need for innovation in this domain.In this paper, we propose a new AVID protocol designed to optimize communication cost. In contrast to previous approaches, we leverage vector commitment (VC) technology combined with erasure codes, replacing conventional hash tree structures or error correction codes. This approach results in significant O(logn) communication savings. Additionally, our research reveals that while ensuring simultaneous output from all honest nodes is desirable to satisfy Totality, it is not necessary for all nodes to receive corresponding shares or proofs during the Dispersal phase. This insight allows us to circumvent the common O(n2κ) communication overhead.Our AVID protocol achieves an optimal dispersal cost of O(|M|+n2) compared to the prior best of O(|M|+κn2). Furthermore, each node in our protocol incurs a storage cost of O(|M|/n+κ) bits, while the retrieval cost per client is O(|M|+nκ).

Research on incentive mechanisms for anti-heterogeneous federated learning based on reputation and contribution

<abstract> <p>An optimization algorithm for federated learning, equipped with an incentive mechanism, is introduced to tackle the challenges of excessive iterations, prolonged training durations, and suboptimal efficiency encountered during model training within the federated learning framework. Initially, the algorithm establishes reputation values that are tied to both time and model loss metrics. This foundation enables the creation of incentive mechanisms aimed at rewarding honest nodes while penalizing malicious ones. Subsequently, a bidirectional selection mechanism anchored in blockchain technology is developed, allowing smart contracts to enroll nodes with high reputations in training sessions, thus filtering out malicious clients and enhancing local training efficiency. Furthermore, the integration of the Earth Mover's Distance (EMD) mechanism serves to lessen the impact of non-IID (non-Independent and Identically Distributed) data on the global model, leading to a reduction in the frequency of model training cycles and an improvement in model accuracy. Experimental results confirm that this approach maintains high model accuracy in non-IID data settings, outperforming traditional federated learning algorithms.</p> </abstract>

Research on Blockchain Architecture and Operating Principles Based on H-DAG

A hybrid blockchain structure (hybrid directed acyclic graph, or H-DAG) is proposed in this article to solve the existing problem of blockchain architectures using symmetric key encryption technology by combining the characteristics of single-chain blockchains and DAG distributed ledgers. By improving the block and transaction structures and optimizing the consensus mechanism, the H-DAG confirmed transaction orders while maintaining the high-throughput characteristics of a DAG, thus solving the transaction order dependence problem. We introduced a lightweight PoW mechanism to the H-DAG to improve the anti-fork ability of the blockchain. An incentive mechanism was adopted in our model to compel honest nodes to be more enthusiastic about participating in, maintaining, and enhancing the security of a given network. The blockchain states achieved strong levels of consistency, and their transaction confirmation times were predictable. We evaluated the performance of the H-DAG by comparing and analyzing multiple experiments, and we modeled a forking attack strategy, verifying the resistance of the H-DAG to this attack strategy. The experimental results demonstrated that the order of transactions in the H-DAG was globally consistent, and the confirmation time of transactions was predictable. The H-DAG improved the anti-fork ability and enhanced the security of the blockchain to ensure a degree of decentralization of the blockchain system. Therefore, the system throughput was enhanced by improving the block structure using symmetric key technology.

Distributed and Secure Federated Learning for Wireless Computing Power Networks

The explosively growth of mobile applications imposes much burden on the current computing networks. Wireless Computing Power Network (WCPN), as an emerging computing architecture, can sense and coordinate computing resources through agile wireless communications, and realize distributed intelligence based on federated learning. However, the mobility and heterogeneity of WCPN nodes typically impact the security (e.g., malicious node disturbance) and efficiency of federated learning in WCPN. In light of this, this paper proposes a provable secure and decentralized federated learning based on blockchain for WCPN, where nodes can freely participate or leave the WCPN federated training without authorization and security threats. Particularly, we design a blockchain with proof-of-accuracy (PoAcc) consensus scheme to deeply integrate with the federated learning procedure, in which high-accuracy local models have the priority of aggregation, thus accelerating the convergence of federated learning and improving the efficiency of WCPN. The proposed PoAcc is proved to be secure as long as the ratio of honest to malicious nodes is above a lower bound. To further meet the security requirement of PoAcc, we then propose an evolutionary game-based incentive scheme that incentivizes honest nodes to participate the WCPN federated learning under malicious node disturbance. Numerical results show that the proposed scheme ensures the consistency and security of federated learning in WCPN, while outperforming the benchmarks in terms of model accuracy and resource consumption.

Dynamic Transaction Confirmation Sharding Protocol for Alliance Chain

Alliance chain has gained widespread popularity in industrial and commercial fields due to its multi-centralization and node manageability. Current implementations of the alliance chain suffer from scalability obstacles, such as communication congestion and throughput drop, when the number of nodes increases. In this paper, a novel dynamic transaction confirmation sharding protocol is proposed, which improves transaction processing efficiency by partitioning nodes and assigning different transactions to different shards. It utilizes dynamic transaction confirmation consensus as a sharding intra-consensus mechanism to minimize message size and package transactions into microblocks, which modifies communication content during transaction propagation among shards and reduces network congestion and shard reconfigure cost. The protocol leverages a review system and reputation model to identify and punish malicious nodes and also incorporates a verifiable random function for node configuration, which ensures a sufficient number of honest nodes within the shard and prevents repeated consensus processes. Simulation results show that the proposed protocol outperforms mainstream used permissioned chain sharding protocols Attested HyperLedger and Sharper, achieving a throughput improvement of at least 20%. This protocol is suitable for scenarios requiring high throughput and reliability in industrial and commercial fields such as finance, logistics, and supply chain management. Even if the number of alliance chain nodes increases to the usual maximum, or there are some faulty nodes, the protocol can still maintain stable performance.

Optimized DPoS consensus strategy: Credit-weighted comprehensive election

Consensus algorithm, which allows distrust nodes to reach a consensus in the overall state of the blockchain, is one of the basic characteristics of the blockchain network. Since the delegate nodes elected in the DPoS consensus algorithm are always nodes with a large amount of currency, it usually leads to low voting activity of other nodes. To solve this problem, we propose a credit-weighted comprehensive election, codenamed as CW-DPoS. We propose that the voting weight of nodes is positively correlated with the credit value. First calculate the activity of the node based on k-shell,second calculate the weighted voting value of the node. Finally, the delegator is selected through the comprehensive method of node activity and weighted votes. The performance of the proposed method is compared with the existing consensus mechanism of DPoS, and the experimental result shows that the activity of the nodes has been improved to about 84 % and selects honest nodes more fairly.

Cluster-Based Secure Aggregation for Federated Learning

In order to protect each node’s local learning parameters from model inversion attacks, secure aggregation has become the essential technique for federated learning so that the federated learning server knows only the combined result of all local parameters. In this paper, we introduced a novel cluster-based secure aggregation model that effectively deals with dropout nodes while reducing communicational and computational overheads. Specifically, we considered a federated learning environment with heterogeneous devices deployed across the country. The computing power of each node and the amount of training data can be heterogeneous. Because of this, each node had a different local processing time, and the response time to the server is also different. To clearly determine the dropout nodes in this environment, our model clusters nodes with similar response times based on each node’s local processing time and location and then performs the aggregation on a pre-cluster basis. In addition, we propose a new practical additive sharing-based masking protocol to hide the actual local updates of nodes during aggregation. The new masking protocol makes it easy to remove the share of dropout nodes from the aggregation without using a (t, n) threshold scheme, and updates from dropout nodes are still secure even if they are delivered to the server after the dropout shares have been revealed. In addition, our model provides mask verification for reliable aggregation. Nodes can publicly verify the correctness and integrity of the masks received from others using a discrete logarithm problem before the aggregation. As a result, the proposed aggregation model is robust to dropout nodes and ensures the privacy of local updates if at least three honest nodes are alive in each cluster. Since the masking process is performed on a cluster basis, our model effectively reduces the overhead of generating and sharing the masking value. For an average cluster size C and a total number of nodes N, the computation and communication cost of each node is O(C), the computation cost of the server is O(N), and the communication cost is O(NC). We analyzed the security and efficiency of our protocol by simulating diverse dropout scenarios. The simulated results showed that our cluster-based secure aggregation outputs about a 91% learning accuracy regardless of dropout rate with four clusters for one hundred nodes.

Advanced DAG-Based Ranking (ADR) Protocol for Blockchain Scalability

In the past decade, blockchain has evolved as a promising solution to develop secure distributed ledgers and has gained massive attention. However, current blockchain systems face the problems of limited throughput, poor scalability, and high latency. Due to the failure of consensus algorithms in managing nodes’identities, blockchain technology is considered inappropriate for many applications, e.g., in IoT environments, because of poor scalability. This paper proposes a blockchain consensus mechanism called the Advanced DAG-based Ranking (ADR) protocol to improve blockchain scalability and throughput. The ADR protocol uses the directed acyclic graph ledger, where nodes are placed according to their ranking positions in the graph. It allows honest nodes to use the Direct Acyclic Graph (DAG) topology to write blocks and verify transactions instead of a chain of blocks. By using a three-step strategy, this protocol ensures that the system is secured against doublespending attacks and allows for higher throughput and scalability. The first step involves the safe entry of nodes into the system by verifying their private and public keys. The next step involves developing an advanced DAG ledger so nodes can start block production and verify transactions. In the third step, a ranking algorithm is developed to separate the nodes created by attackers. After eliminating attacker nodes, the nodes are ranked according to their performance in the system, and true nodes are arranged in blocks in topological order. As a result, the ADR protocol is suitable for applications in the Internet of Things (IoT). We evaluated ADR on EC2 clusters with more than 100 nodes and achieved better transaction throughput and liveness of the network while adding malicious nodes. Based on the simulation results, this research determined that the transaction’s performance was significantly improved over blockchains like Internet of Things Applications (IOTA) and ByteBall.

Nash Equilibrium Control Policy Against Bus-off Attacks in CAN Networks

A bus-off attack is a denial-of-service (DoS) attack which exploits error handling in the controller area network (CAN) to induce an honest node to disconnect itself from the CAN bus. This paper develops a stochastic transmission policy as a countermeasure for the controller-transmitter pair against the bus-off attack. We model this as a non-zero-sum linear-quadratic-Gaussian game between the controller-transmitter pair and the attacker. We derive Nash equilibria of the game for two different information structures of the attacker. We show that the attacker has a dominant attack strategy under both information structures. Under the dominant attack strategy, we show that the optimal control policy is linear in the system state. We further identify a necessary and a sufficient conditions on the transmission policy to have bounded average cost. The theoretical results are complemented by a detailed case study of a bus-off attack on a vehicular adaptive cruise control model.

An incentive system for decentralized DAG-based platforms

Decentralized public platforms are becoming increasingly popular due to a growing number of applications for various areas ofbusiness, finance, and social life. Authorless nodes can easily join such networks without any confirmation, making a transparent system of rewards and punishments crucial for the self-sustainability of public platforms. To achieve this, a system for incentivizing and punishing Workers’ behavior should be tightly harmonized with the corresponding consensus protocol, taking into account all of its features, and facilitating a favorable and supportive environment with equal rights for all participants. The main purpose of re-wards is to incentivize Workers to follow the protocol properly, and to penalize them for any type of misbehavior. The issues of block rewarding and punishing in decentralized networks have been well studied, but the DAG referential structure of the distributed ledger forces us to design methods that are more relevant. Since referential structures cannot be reliably validated due to the fact that they are built on the basis of the instantaneous visibility of blocks by a certain node, we propose to set rewards for blocksin the DAG network based on the degree of confidence of topological structures. In doing so, all honest nodes make common decisions based only on information recorded into the ledger, without overloading the network with additional interactions, since such data are al-ways identical and available.The main goal of this work is to design a fair distribution of rewards among honest Workers and estab-lish values for penalties for faulty ones, to ensure the general economic equilibrium of the Waterfall platform. The proposedap-proach has a flexible and transparent architecture that allows for its use for a wide range of PoS-based consensus protocols. The core principles are that Workers' rewards depend on the importance of the conducted work for block producing and achieving consensusand their penalties must not be less than the potential profit from possible attacks. The incentivizing system can facilitate protection from various kinds of attacks, namely, so-called Nothing-at-stake, Rich-get-richer, Sybil, and Splitting attacks, and from some specif-ic threats related to a DAG structure.

LWSBFT: Leaderless weakly synchronous BFT protocol

Asynchronous or partially synchronous Byzantine fault-tolerant (BFT) protocols can tolerate up to one-third Byzantine faults, while synchronous Byzantine fault-tolerant protocols can tolerate up to one-half Byzantine faults. The existing synchronous Byzantine fault-tolerant protocols are leader-based protocols, which may lead to unbalanced load between nodes, and constitute a bottleneck that influences the performance of the whole system. In addition, the synchronous BFT protocols rely on a strong assumption: every message sent by an honest node will arrive at its destination within a known bounded time. In this work, in order to obtain better fairness and allow some degree of asynchrony while tolerating one-half faults, we designed LWSBFT, a leaderless BFT protocol in a weakly synchronous model where the synchronous assumption does not have to hold for all nodes all the time. The leaderless BFT protocol is comprised of the weakly synchronous Byzantine reliable broadcast (RBC) protocol and the weakly synchronous binary Byzantine agreement (BA) protocol, both of which can tolerate one-half faults. The weakly synchronous RBC protocol is used by each node to propose its input, and the weakly synchronous binary BA protocol is used to make a decision for each proposed value. The proposed leaderless BFT protocol can ensure both safety and liveness in a weakly synchronous model. We implement our consensus mechanism in Go, and evaluate the proposed consensus mechanism’s performance in terms of throughput and latency.

Privacy Preserving via Secure Summation in Distributed Kalman Filtering

Average consensus is a major operation in distributed Kalman filtering. It requires neighboring nodes to exchange state information with each other, which may result in undesirable private data leakage. Since distributed Kalman filtering requires that the estimate at each time instant is accurate, it brings more challenges to design privacy-preserving scheme for operation. In this article, we design a privacy-preserving scheme for distributed Kalman filtering without the loss of estimation performance, which is also suitable for average consensus or dynamic average consensus of multiagent systems. We first build a secure multihop communication based on an encryption scheme. We then calculate the sum of the states of neighboring nodes with secure summation, which ensures that the state update will not reveal the state of the node to its neighboring nodes. We employ different methods to calculate the sum of the states of neighboring nodes against noncollusive and collusive adversaries. For the noncollusive case, the privacy of the honest nodes is preserved. For the collusive case, if there are too many adversaries, the privacy of the honest nodes could be exposed when accurate distributed Kalman filtering is accomplished. Therefore, we measure the risk of the global system suffering privacy leakage as the privacy index and improve the ability of the system to defend the collusive adversaries by using a group-based method. Some numerical examples are provided to illustrate the effectiveness of the proposed schemes.

Fairness Matters

The proof-of-work (PoW) based blockchains are more secure nowadays since profit-oriented miners contribute more computing powers in exchange for fair revenues. This virtuous circle only works under an incentive-compatible consensus, which is found to be fragile under selfish mining attacks. Specifically, selfish miners can conceal and reveal blocks strategically to earn unfairly higher revenue compared to honest behaviors. Previous countermeasures either require incompatible modifications or fail to consider the asynchronous network and multiple honest nodes setting in reality. In this paper, we introduce the unfairness measurement based on the KL-divergence from the computing power distribution to the revenue distribution of miners. To improve fairness with the existence of selfish miners, we propose a novel block promotion strategy namely Tit-for-Tat (TFT), for honest miners. In particular, based on a miner's local observation of forks, we design the suspicious probability measurement of other nodes. Rather than promoting a fresh block instantly, miners withhold it for different time periods according to others' suspicious probability before delivery. Meanwhile, to minimize the attacker's unfair revenue, we formulate the delay vector (DV) problem for honest miners to determine the optimal withholding time. We prove that DV problem is nonconvex, and thus propose two approximation algorithms that yield ϵ-suboptimal solutions. In addition, we extend TFT strategy to support dynamic networks. Extensive experiments validate the efficiency and effectiveness of our strategy and algorithms to reduce unfairness by 54.62% within bounded withholding time.

Mitigating Traffic Remapping Attacks in Autonomous Multihop Wireless Networks

Multihop wireless networks with autonomous nodes are susceptible to selfish traffic remapping attacks (TRAs). Nodes launching TRAs leverage the underlying channel access function to receive an unduly high Quality of Service (QoS) for packet flows traversing source-to-destination routes. TRAs are easy to execute, impossible to prevent, difficult to detect, and harmful to the QoS of honest nodes. Recognizing the need for providing QoS security, we use a novel network-oriented QoS metric to propose a self-enforcing game-theoretic mitigation approach. By switching between TRA and honest behavior, selfish nodes engage in a noncooperative multistage game in pursuit of high QoS. We analyze feasible node strategies and design a distributed signaling mechanism called DISTRESS, under which, given certain conditions, the game produces a desirable outcome: after an upper bounded play time, honesty tends to become a selfish node’s best reply behavior, while yielding acceptable QoS to most or all nodes. We verify these findings by Monte Carlo and ns-3 simulations of static and mobile nodes.

Honesty aware congestion concerned secured edge disjoint multi path routing with fuzzy rule descriptors

Congestion and security plays a most important key role in the wireless sensor network. In our previous work, energy balances routing is ensured by introducing the Energy Balancing and Optimal Routing Based Secured Data Transmission (EBORDT). But in this research work, congestion and security is not focused. This will lead to increased data loss rate along with entire network collision. These issues are focused and resolved in the proposed research work by introducing the method namely Honest aware Congestion concerned Secured Edge Disjoint Multipath Routing (HC-SEDMR) Scheme. In this work cluster head selection is done using hybridized simulated annealing with fuzzy rule descriptors. Base on these selected cluster head, clustering is done using Normalized optimal clustering algorithm. After clustering Energy and Edge disjoint aware optimal routing is done using Congestion and Collision aware Edge Disjoint multipath routing. Here secured routing is ensured by choosing honest nodes for the forwarding process. This is done by using honest forwarding node selection method. The performance analysis of the research work is done in the NS2 simulation environment from which it is proved that the proposed method attains better performance than the existing methodology.