There is an increasing research interest in solving routing problems in Wireless Sensor Networks (WSN) and most of the existing routing protocols for WSN consider homogeneous nodes wherein, all sensor nodes have the same capabilities in terms of sensing, communication and computation capabilities. However, deployment of a homogeneous sensor network may suffer from poor performance. In this paper, we present a novel QoS routing scheme that adaptively learns an optimal routing strategy, depending on multiple optimization goals. We base our approach on Ant Colony Optimization (ACO) technique which is insensitive to initial setting, thus ideal in the context of WHSNs. The key feature of the protocol is its ability to meet diverse QoS requirements posed by different kinds of traffic generated due to heterogeneous nature of nodes thus maximizing network performance and utilization. Experimental results suggest a significant gain in the performance of proposed protocol over AODV protocol.

Peer-to-Peer (P2P) systems are widely used for data sharing applications in an autonomous and decentralized mode. P2P systems are suitable for large-scale distributed environments in which nodes can share resources other than data such as computing power, memory and network bandwidth. Some of important parameters that affect the performance of P2P systems are peer availability, data availability, network overhead, overlay structure, churn rate, and data access time.
In this paper a self organized replica overlay scheme "Improved Hierarchical Quorum Consensus" (IHQC) for P2P systems is proposed. This scheme organizes replicas in a Self Organized Hierarchical Logical Structure (SOHLS) that has special properties. The scheme improves performance of the system by reducing search time to form read/write quorums, reducing probability of accessing stale data, improving degree of intersection among consecutive quorums and reducing network overhead. This scheme is highly fault tolerant (tolerate up to faults) due to replication of data and inherits the best property of Read-One-Write-All (ROWA) protocol in a dynamic environment of P2P network. The architecture for IHQC is also proposed for implementing the scheme that supports improved performance of P2P systems. This scheme also maximizes the degree of intersection set of read and write quorums; hence, having higher probability to get updated data as compared to all other schemes. The mathematical correctness of the scheme is also presented in the paper. The results of simulation study of the proposed scheme also support and verify its better performance than Random and Hierarchical Quorum Scheme.