Hierarchical Multicast Tree Algorithms for Application Layer Mesh Networks

Wireless Mesh networks (WMN’s) are prone to a number of attacks & these attacks compromise the security of these networks. Attaining security in these networks is a challenging task. It is logical to consider that there are many types of scripts in the internet. The virus can either be a key logger or somebody else's mischief. With this script we can steal any information. Since the existence of virus cannot be ignored, therefore the authors have tried to present their work on first detecting it and later on fixing it. With the help of different protocols present in the Application Layer, a hacker takes information out of the script. The authors have used Covert Channel, which has been mentioned in many essays. Now with the help of this channel, the information will go to all and it will not go to any of the informatics. This research proposal envisions a methodology to first detect the selfish node in the network & later on provides a technique for mitigation of the same.NS2 simulator has been used to simulate & analyze the performance of our proposed methodology for Open Shortest Path First (OSPF) protocol in WMN’s.

Download Full-text

Application Layer Multicast Based Services on Hierarchical Peer to Peer Architecture

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.892.64 ◽

2019 ◽

Vol 892 ◽

pp. 64-71

Author(s):

Mourad Amad ◽

Abdelmalek Boudries ◽

Lyes Badis

Keyword(s):

Peer To Peer ◽

Multicast Tree ◽

Second Step ◽

Application Layer Multicast ◽

Core Network ◽

Application Layer ◽

Construction Algorithm ◽

Tree Construction ◽

Proposed Model ◽

Multicast Services

Application Layer Multicast (ALM) is considered as an attractive approach for implementing wide area multicast services. In ALM, multicast functionality is implemented at the edge instead of the core network (routers). As opposed to network-layer multicast, application layer multicast requires no infrastructure support and can be easily deployed in the Internet. In this paper, we propose a new efficient and scalable model for optimizing application layer multicast using HPM architecture (HPM: A novel hierarchical Peer-to-Peer model for lookup acceleration with provision of physical proximity). This approach benefits from P2P properties and characteristics. In this contribution, we consider our optimized tree construction algorithm simultaneously for each ring of HPM. The global tree construction algorithm is composed of two steps. In the first step, we construct a sub-tree for each ring; the second step is to build a global tree using sub sets of adjacent rings in HPM architecture. The proposed model inherits from main P2P attributes such as: scalability, fault tolerance characterized HPM. Preliminarily performance evaluations show that results are globally satisfactory, the depth of the resulting multicast tree is optimized.

Download Full-text

A Simple Yet Effective Diversifying Improvement of the Minimum Power Multicast Tree Algorithms in Wireless Ad Hoc Networks

Wireless Algorithms, Systems, and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-88582-5_8 ◽

2008 ◽

pp. 52-62 ◽

Cited By ~ 1

Author(s):

Manki Min

Keyword(s):

Ad Hoc Networks ◽

Wireless Ad Hoc Networks ◽

Ad Hoc ◽

Multicast Tree ◽

Minimum Power ◽

Tree Algorithms ◽

Hoc Networks

Download Full-text