Internet of things (IoT) includes a lot of key technologies; In this emerging field, wireless sensors have a key role to play in sensing and collecting measures on the surrounding environment. In the deployment of large-scale observation systems in remote areas, when there is not a permanent connection with the Internet, the network requires distributed storage techniques for increasing the amount of data storage which decreases the probability of data loss. Unlike conventional networked data storage, distributed storage is constrained by the limited resources of the sensors. In this research, we present a distributed data storage method with the combined K-means and PSO clustering mechanism organized with the binary decision tree C4.5 in the IoT area with considering efficiency and reliability approach. This scheme can provide reliability in responding to inquiries while minimizing the use of energy and computational resources. Simulation results and evaluations show that the proposed approach, due to the distributed data storage with minimal repeat publishing according to the decision tree structure, increases the reliability and availability, reduces the communication costs, and improves the Energy consumption, saving memory consumption without registering the same event and compared to other methods performed in this area have good results.

Fault localization, a central part of network fault management, is a process of deducing the exact source of a failure from a set of observed failure indications. in the network, end systems and hosts communicate through routers and links connecting them. When a link or a router faces with a fault, the information sent through these components will be damaged. Hence, faulty components in a network need to be detected and repaired to sustain the health of the network. In this paper we introduce an end to end method that detect and repair the faulty components in the network. The proposed method is a heuristic algorithm that uses the embedded information retrieved from disseminated data over the network to detect and repair faulty components. Simulation results show that our heuristic scheme only requires testing a very small set of network components to detect and repair all faults in the network.

Mobile ad hoc networks are type of wireless networks in which any kind of infrastructure is not used, i.e. there are no infrastructures such as routers or switches or anything else on the network that can be used to support the network structure and the nodes has mobility. The routing is particularly a challenging task in MANETs that selecting paths in a network along which to send network traffic. In this paper, the performance analysis is carried out on Ad-hoc On-demand Distance Vector (AODV), Limited Hop Count AODV (LHC-AODV), Optimized Link State Routing (OLSR), Unnecessary Loop OLSR (UL-OLSR) and Destination Sequenced Distance Vector (DSDV) protocols using NS2 simulator. The delay, throughput, and packet delivery ratio are the three common measures used for the comparison of the performance of above protocols.

The AODV protocol is based on the minimum delay path as its route selection criteria, regardless of the paths load. This issue leads to unbalanced load dissemination in the network and the energy of the nodes on the shortest path deplete earlier than others. We proposed an improved AODV protocol with limited TTL (Time to Live) of RREP packet in which the route reply (RREP) packet of AODV is modified to limite TTL information of nodes. Experiments have been carried out using network simulator software (NS2). Simulation results show that our proposed routing protocol outperforms regular AODV in terms of packet delivery rate, good put, throughput, and jitter.

Mobile ad hoc networks are type of wireless networks in which any kind of infrastructure is not used, i.e. there are no infrastructures such as routers or switches or anything else on the network that can be used to support the network structure and the nodes has mobility. The purpose of this paper is to provide a better quality of the package delivery rate and the throughput, that is in need of powerful routing protocol standards, which can guarantee delivering of the packages to destinations, and the throughput on a network. For achieving this purpose, we use OLSR routing protocol that is a responsive protocol and is currently covered under the IETF standard (RFC 3626). At this paper, we improved the OLSR routing protocol by eliminating the unnecessary loops, and simulation results demonstrated a significant improvement in the criteria of package delivery rate and throughput.