DHT

In this paper, we report a smart street lighting control system using the ESP8266 which is a low-cost Wi-Fi chip with full TCP/IP stack and microcontroller capability. Our system is equipped with a web server developed in HTML code. Hence, our smart street lighting system can be controlled wirelessly to turn ON or turn OFF, and it can be monitored its environmental condition (i.e., temperature and humidity around the system). All sensors used in this system are pure digitally-outputted sensor: DHT11 to monitor the ambient temperature and humidity and BH1750 to adjust the street light intensity automatically. The dimming technique was applied in the control system by using Pulse Width Modulation (PWM). The system was divided into two main parts: Gateway and Node in which these two parts employ the ESP8266. The Gateway as a coordinator will send a message to the node as an end device (in this work, the streetlight act as a Node). Later, the node will send the ACK to the Gateway. As re...

The survey and classification of the different security attacks in structured peer-to-peer (P2P) overlay networks can be useful to computer system designers, programmers, administrators, and users. In this paper, we attempt to provide a taxonomy of structured P2P overlay networks security attacks. We have specially focused on the way these attacks can arise at each level of the network. Moreover, we observed that most of the existing systems such as Content Addressable Network (CAN), Chord, Pastry, Tapestry, Kademlia, and Viceroy suffer from threats and vulnerability which lead to disrupt and corrupt their functioning. We hope that our survey constitutes a good help for who-s working on this area of research.

Distributed computer architectures labeled "peer-to-peer" are designed for the sharing of computer resources (content, storage, CPU cycles) by direct exchange, rather than requiring the intermediation or support of a centralized server or authority. Peer-to-peer architectures are characterized by their ability to adapt to failures and accommodate transient populations of nodes while maintaining acceptable connectivity and performance.Content distribution is an important peer-to-peer application on the Internet that has received considerable research attention. Content distribution applications typically allow personal computers to function in a coordinated manner as a distributed storage medium by contributing, searching, and obtaining digital content.In this survey, we propose a framework for analyzing peer-to-peer content distribution technologies. Our approach focuses on nonfunctional characteristics such as security, scalability, performance, fairness, and resource man...

Todays’ DNS resolving platforms have been designed for DNS with fast and light resolutions over the Internet. With signature checks and larger payload, experimental measurements [10] showed that DNSSEC resolutions require up to 4 times more CPU. While DNSSEC requires more CPU than DNS, this paper proposes PREFETCHX, an architecture that optimizes the use of CPU and thus avoids that resolving platforms increase their size for DNSSEC migration. Current resolving platforms IPXOR split the traffic between the nodes according to the IP addresses. Alternatively, PREFETCHX takes advantage of the FQDN’s popularity distribution (Zipf), a layered cache and cache sharing mechanisms between the nodes and requires at least 4 times less nodes. Furthermore PREFETCHX does not impact the network infrastructure which eases its deployment. Then, defining X the number of prefetched FQDNs makes PREFETCHX highly scalable and flexible to different type of traffic.

Todays’ DNS resolving platforms have been designed for DNS with fast and light resolutions over the Internet. With signature checks and larger payload, experimental measurements [10] showed that DNSSEC resolutions require up to 4 times more CPU. While DNSSEC requires more CPU than DNS, this paper proposes PREFETCHX, an architecture that optimizes the use of CPU and thus avoids that resolving platforms increase their size for DNSSEC migration. Current resolving platforms IPXOR split the traffic between the nodes according to the IP addresses. Alternatively, PREFETCHX takes advantage of the FQDN’s popularity distribution (Zipf), a layered cache and cache sharing mechanisms between the nodes and requires at least 4 times less nodes. Furthermore PREFETCHX does not impact the network infrastructure which eases its deployment. Then, defining X the number of prefetched FQDNs makes PREFETCHX highly scalable and flexible to different type of traffic.

Digital camera is the main medium for digital photography. Digital image takes more memory space and more energy to store, as a digital camera operates on portable battery. Hence, it limits its performance and longitivity. An efficient energy management is required to limit this drawback. This paper proposes a new technique by using Discrete Hartley Transform which will give the same result as that of the existing algorithms with low power consumption.

In this paper, we address data reconciliation in peer-to-peer (P2P) collaborative applications. We propose P2P-LTR (Logging and Timestamping for Reconciliation) which provides P2P logging and timestamping services for P2P reconciliation over a distributed hash table (DHT). While updating at collaborating peers, updates are timestamped and stored in a highly available P2P log. During reconciliation, these updates are retrieved in total order to enforce eventual consistency. In this paper, we first give an overview of P2P- ...

This paper presents a routing performance analysis of structured P2P overlay network. Due to the rapid development and hectic life, sharing data wirelessly is essential. P2P allows participating peers move freely by joining and leaving the network at any convenience time. Therefore, it exists constraint when one measuring the network performance. Moreover, the design of structured overlay networks is fragmented and with various design. P2P networks need to have a reliable routing protocol. In order to analyse the routing performance, this work simulates three structured overlay protocols-Chord, Pastry and Kademlia using OMNeT++ with INET and OverSim module. The result shows that Pastry is the best among others with 100% routing efficiency. However, Kademlia leads with 12.76% and 18.78% better than Chord and Pastry in lookup hop count and lookup success latency respectively. Hence, Pastry and Kamelia architectures will have a better choice for implementing structured overlay P2P netw...

Todays’ DNS resolving platforms have been designed for DNS with fast and light resolutions over the Internet. With signature checks and larger payload, experimental measurements [10] showed that DNSSEC resolutions require up to 4 times more CPU. While DNSSEC requires more CPU than DNS, this paper proposes PREFETCHX, an architecture that optimizes the use of CPU and thus avoids that resolving platforms increase their size for DNSSEC migration. Current resolving platforms IPXOR split the traffic between the nodes according to the IP addresses. Alternatively, PREFETCHX takes advantage of the FQDN’s popularity distribution (Zipf), a layered cache and cache sharing mechanisms between the nodes and requires at least 4 times less nodes. Furthermore PREFETCHX does not impact the network infrastructure which eases its deployment. Then, defining X the number of prefetched FQDNs makes PREFETCHX highly scalable and flexible to different type of traffic.

This paper presents a routing performance analysis of structured P2P overlay network. Due to the rapid development and hectic life, sharing data wirelessly is essential. P2P allows participating peers move freely by joining and leaving the network at any convenience time. Therefore, it exists constraint when one measuring the network performance. Moreover, the design of structured overlay networks is fragmented and with various design. P2P networks need to have a reliable routing protocol. In order to analyse the routing performance, this work simulates three structured overlay protocols-Chord, Pastry and Kademlia using OMNeT++ with INET and OverSim module. The result shows that Pastry is the best among others with 100% routing efficiency. However, Kademlia leads with 12.76% and 18.78% better than Chord and Pastry in lookup hop count and lookup success latency respectively. Hence, Pastry and Kamelia architectures will have a better choice for implementing structured overlay P2P network.

Proficient sleeve enquiry is vital to the largely feat of multi smack dossier sharing systems. Clustering nobles by their widespread safety can appreciably boost the efficiency of file uncertainty. Clustering aristocrats by their corporal closeness can also progress file uncertainty concert. Yet, few contemporary machinery are able to huddle peers base on both examine awareness and material propinquity. Although prearranged MULTINODEs offer elevated file answer effectiveness than amorphous, it is knotty to grasp it due to their sternly clear topologies. In this job, we pioneer a Proximity-Aware and Interest-clustered multimode heading partaking method based on a controlled, which forms physically-close nodes into a collect and supplementary assemblage physically-close PAIS defences the bud sift marks in order, allowing for that a freshly visit file tend to be visit another time, the bud clean based loom is superior by only scrutiny the lately extra bloom sort out in sequence to shrink file probing delay. The untried grades demonstrate the lofty efficacy of the intra-sub-cluster file sharp loom in recovering file incisive competence.

Distributed Hash Tables (DHTs) have been used in several applications, but most DHTs have opted to solve lookups with multiple hops, to minimize bandwidth costs while sacrificing lookup latency. This paper presents D1HT, an original DHT which has a peer-to-peer and self-organizing architecture and maximizes lookup performance with reasonable maintenance traffic, and a Quarantine mechanism to reduce overheads caused by volatile peers. We implemented both D1HT and a prominent single-hop DHT, and we performed an extensive and highly representative DHT experimental comparison, followed by complementary analytical studies. In comparison with current single-hop DHTs, our results showed that D1HT consistently had the lowest bandwidth requirements, with typical reductions of up to one order of magnitude, and that D1HT could be used even in popular Internet applications with millions of users. In addition, we ran the first latency experiments comparing DHTs to directory servers, which revealed that D1HT can achieve latencies equivalent to or better than a directory server, and confirmed its greater scalability properties. Overall, our extensive set of results allowed us to conclude that D1HT can provide a very effective solution for a broad range of environments, from large-scale corporate datacenters to widely deployed Internet applications 1,2 .

The BitTorrent protocol should (in the long run) be overseen by the International Telecommunications Union (ITU), in the capacity of providing "a framework for documenting the protocol state machines" (Client to Client, Client to Tracker & Torrent File Syntax).

The ITU should in no way interfere with the evolution of distributed file transfer protocols, but assist where possible to make these networks as compatible and interoperable with IP and Non-IP networks as possible.