z-logo
open-access-imgOpen Access
Heterogeneous Networks in 5g using Joint Path Selection and Efficient Self Organization Protocol
Author(s) -
B. Pavithra,
Komala James
Publication year - 2020
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.e1017.069520
Subject(s) - computer network , computer science , network packet , distributed computing , routing protocol , packet forwarding , network topology , average path length , network simulation , shortest path problem , graph , theoretical computer science
Tree networks are systematically spread across multiple networks. This project proposes a framework for effective self-organization for 5 G heterogeneous networks. All nodes in this network are classified into two types: network nodes, and non-network nodes. Network nodes are able to broadcast packets to neighboring nodes. A tree-based network can then be obtained from one layer to another. The topology is dynamically balanced to balance energy consumption and extend the service life of the network. To test the current technique we perform tests with it. Results from the simulation show our proposed protocol can easily create a stable tree-based network. As the network size rising, the time for self-organization, average hop and error ratio for packets does not change any more. In comparison, packet success rates in effective self-organization protocol are significantly higher compared to AODV and DSDV. Non-network nodes collect the packets being transmitted and decide whether to access the network. We use various metrics such as number of child nodes, hop, contact distance and residual energy to meet the available sink nodes weight during the self-organizing process, the node with highest weight is selected as sink node. Non-network nodes will be transformed to network nodes if they effectively join the network.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here