scholarly journals Efficient Communication Protocols for Non DHT-based Pyramid Tree P2P Architecture

2021 ◽  
Vol 20 ◽  
pp. 108-125
Author(s):  
Indranil Roy ◽  
Swathi Kaluvakuri ◽  
Koushik Maddali ◽  
Ziping Liu ◽  
Bidyut Gupta
Keyword(s):  
Overlay Networks ◽  
Cluster Head ◽  
Common Interest ◽  
Modular Arithmetic ◽  
P2p Network ◽  
Cluster Data ◽  
Tree Traversal ◽  
Efficient Communication ◽  
Leaf Level ◽  
Level 1

In this paper, we have considered a recently reported 2-layer non-DHT-based structured P2P network. Residue Class based on modular arithmetic has been used to realize the overlay topology. At the heart of the architecture (layer-1), there exists a tree like structure, known as pyramid tree. It is not a conventional tree. A node i in this tree represents the cluster-head of a cluster of peers which are interested in a particular resource of type Ri (i.e. peers with a common interest). The cluster-head is the first among these peers to join the system. Root of the tree is assumed to be at level 1. Such a tree is a complete one if at each level j, there are j number of nodes. It is an incomplete one if only at its leaf level, say k, there are less than k number of nodes. Layer 2 consists of the different clusters. The network has some unique structural properties, e.g. each cluster has a diameter of only 1 overlay hop and the diameter of the network is just (2+2d); d being the number of levels of the layer-1 pyramid tree and d depends only on the number of distinct resources. Therefore, the diameter of the network is independent of the number of peers in the whole network. In the present work, we have used some such properties to design low latency intra and inter cluster data lookup protocols. Our choice of considering non-DHT and interest-based overlay networks is justified by the following facts: 1) intra-cluster data lookup protocol has constant complexity and complexity of inter-cluster data lookup is O(d) if tree traversal is used and 2) search latency is independent of the total number of peers present in the overlay network unlike any structured DHT-based network (as a matter fact unlike any existing P2P network, structured or unstructured). Experimental results as well show superiority of the proposed protocols to some noted structured networks from the viewpoints of search latency and complexity involved in it. In addition, we have presented in detail the process of handling churns and proposed a simple yet very effective technique related to cluster partitioning, which, in turn, helps in reducing the number of messages required to be exchanged to handle churns.

Optimal Cluster Head Spacing for Energy-Efficient Communication in Aerial-Backhauled Networks

2015 ◽  
Author(s):  
Akram Al-Hourani ◽  
Sathyanarayanan Chandrasekharan ◽  
Abbas Jamalipour ◽  
Laurent Reynaud ◽  
Sithamparanathan Kandeepan
Keyword(s):  
Energy Efficient ◽  
Cluster Head ◽  
Energy Efficient Communication ◽  
Efficient Communication ◽  
Optimal Cluster

scholarly journals Proficient Car Parking System Based on Cluster Head Routing Protocol Utilizing IEEE 802.15.4

2016 ◽  
Vol 12 (06) ◽  
pp. 58
Author(s):  
Razi Iqbal ◽  
Sharif Arif ◽  
H.H.R Sherazi
Keyword(s):  
Communication Technology ◽  
Routing Protocol ◽  
Ieee 802.15.4 ◽  
Low Cost ◽  
Cluster Head ◽  
Power Efficient ◽  
Proposed Model ◽  
Efficient Communication ◽  
Parking System ◽  
The Coordinator

The paper discusses a proposed model for car parking system based on cluster head routing protocol utilizing a low cost and power efficient communication technology, ZigBee (IEEE 802.15.4). The model is designed in a way that car parking is divided into different clusters and each cluster has a head which acts a messenger for transmitting information to other heads and the coordinator of the network. Each cluster head is a ZigBee Host (Router) which collects the information of car presence in the parking slot. This information is then passed to the coordinator of the network which is used to display the information of available parking slots in a specific car parking area. Since there is only one coordinator in the network, so heads can transmit information to the coordinator using multi-hop communication if direct communication is not possible. Several simulations were performed to gauge the efficiency of the proposed model, and results show that the proposed model is reliable in communication and efficient in its operation.

Continuous Join Query Processing over Structured Overlay Networks

2011 ◽  
Vol 467-469 ◽  
pp. 859-861
Author(s):  
Yang Liu ◽  
Ke Jun Zhao ◽  
Yi Hong Qiu ◽  
Qi Liu
Keyword(s):  
Query Processing ◽  
Network Traffic ◽  
Overlay Networks ◽  
Data Flow ◽  
P2p Network ◽  
Distributed Data ◽  
Structured Overlay ◽  
Structured Overlay Networks ◽  
Global Query ◽  
P2p Overlay

P2P network is more suitable for distributed data flow processing. This paper concentrates on how to answer continuous join query in structured p2p overlay networks. In the algorithm proposed, the data that cannot contribute the queries’ results will not be distributed in the network based on global query indices. Experiment shows that the algorithm ensures the availability of join query and network traffic is reduced.

Optimal Cluster Head Spacing for Energy-Efficient Communication in Aerial-Backhauled Networks

2014 ◽  
Author(s):  
Akram Al-Hourani ◽  
Sathyanarayanan Chandrasekharan ◽  
Abbas Jamalipour ◽  
Laurent Reynaud ◽  
Sithamparanathan Kandeepan
Keyword(s):  
Energy Efficient ◽  
Cluster Head ◽  
Energy Efficient Communication ◽  
Efficient Communication ◽  
Optimal Cluster

Covering Set-Based Inner-Cluster Data Aggregation Scheme for Wireless Sensor Networks

2013 ◽  
Vol 321-324 ◽  
pp. 592-595
Author(s):  
Jiang Hong Guo ◽  
Yu Dong Luo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Reference Point ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Cluster Data ◽  
Aggregation Scheme ◽  
Covering Set

For reducing the communication overhead of data aggregation, authors proposed an covering set-based inner-cluster data aggregation scheme for wireless sensor networks. The network is clustered upon deployment; nodes achieve the inner-cluster neighbors’ identifiers by information exchanging and transmit the list of inner-cluster neighbors to the cluster head to help the cluster head deducing the inner-cluster covering set. Each node selects a neighbor form inner-cluster covering set as reference point and keeps silent if it has the same reading with reference point. Simulation shows that the proposed scheme lowers the communication overhead of data aggregation effectively.

Inner-Cluster Data Aggregation Scheme for Wireless Sensor Networks

2013 ◽  
Vol 347-350 ◽  
pp. 3945-3949
Author(s):  
Jiang Hong Guo ◽  
Yu Dong Luo ◽  
De Li Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Location Information ◽  
Communication Overhead ◽  
Cluster Data ◽  
Aggregation Scheme

For reducing the communication overhead of data aggregation, authors proposed an inner-cluster data aggre-gation scheme for wireless sensor networks. Agent nodes are selected with assist of location information and only the nodes have different readings with agent nodes transmit their data to cluster head, thus reduce the inner-cluster transmissions. Analysis and experiments show that our scheme reduces inner-cluster transmissions effectively and lowers the communication overhead.

scholarly journals Data Clustering Method in Wireless Sensor Networks Based on Residual Energy Perception

2018 ◽  
Vol 14 (06) ◽  
pp. 85 ◽  
Author(s):  
Xudong Yang
Keyword(s):  
Energy Consumption ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Data Gathering ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Data Forwarding ◽  
Cluster Data ◽  
Head Node

<p class="0abstract"><span lang="EN-US">To prolong the survival time of wireless sensor network, an iterative scheme was proposed. First of all, spectrum clustering algorithm iteratively segmented the network into clusters, and cluster head nodes in each sub cluster were determined depending on the size of residual energy of sensor nodes. Then, a data forwarding balance tree was constructed in each sub cluster. Data forwarding path of each non-cluster head node was defined, and the moving path of a mobile data collector was determined, which used the residual energy as the basis for the network optimization. Finally, this scheme was simulated, and two traditional data gathering algorithms were compared. The results showed that the algorithm designed in this experiment could effectively balance energy consumption among all WSN nodes and had great performance improvement compared with the traditional data collection algorithm. To sum up, this algorithm can significantly reduce the energy consumption of the network and improve the lifetime of the network. </span></p>

scholarly journals Structured Deployment using Clustering Mechanism for Improving the Performance of the RFID Network

2019 ◽  
Vol 8 (4) ◽  
pp. 7137-7142
Keyword(s):  
Energy Level ◽  
Cluster Head ◽  
Rfid Technology ◽  
Clustering Method ◽  
Rfid Tag ◽  
Efficient Communication ◽  
And Performance ◽  
Read Rate ◽  
Geographical Locations ◽  
Rfid Readers

RFID is one of the most suitable technologies for today’s world. RFID technology is mainly focused for tracking and locating the objects. The objects may be either moving or immovable. Normally RFID communication is based on the RFID Tag and the Reader permutations. The Readers were deployed in different locations for the better communication between the tag and reader. This paper is focused on the structured deployment of RFID readers to form a network using clustering mechanism. The performance of the network will be analyzed by various network attribute such as throughput, Accuracy, Missing tag ratio, Read Rate and Delay. For an efficient communication, the structured deployment of the RFID Reader’s is most important. The clustering method is used for the proper deployment of RFID readers for efficient communication. Cluster is the grouping of RFID readers based on the geographical locations. Every cluster has a cluster head (CH) and these Cluster heads are responsible for every transaction between the cluster to cluster communications. This cluster head have selected according to their energy level and the centrality of the adjunct. This paper detailed how the RFID readers and tags are communicated using the clustering mechanism and performance of the RFID network is analyzed and discuss the results.

Uneven Cluster-Routing Protocol of Base on Energy for Wireless Sensor Networks

2014 ◽  
Vol 687-691 ◽  
pp. 1823-1826 ◽  
Author(s):  
Duo Peng ◽  
Suo Ping Li
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Cluster Data ◽  
Constraint Problem ◽  
Energy Efficient Clustering ◽  
Hot Zone

For severe energy constraint problem of wireless sensor networks, a non-uniform energy efficient clustering routing protocol (EUCRP) is proposed based on the analysis of the existing clustering routing protocol the characteristics and shortcomings. In EUCRP, we use a limiting cluster size optimization formation algorithm to produce clusters in descending order of the size of the cluster. Improved multi-hop inter-cluster data forwarding, saving energy cluster head and energy consumption of inter-cluster is balanced. Propose using “watering pot path” in the last hop to effectively solve the “hot zone” problem caused by uneven load energy. Simulation results show that the protocol can effectively reduce network energy consumption and prolong the network lifetime.

Sign in / Sign up

Export Citation Format

Share Document