earticle

논문검색

Performance Comparison of Broadcasting methods in Mobile Ad Hoc Network

초록

영어

A Mobile Ad hoc Network (MANET) is an autonomous system of mobile nodes with routing capabilities connected by wireless links, the union of which forms a communication network modeled in the form of an arbitrary graph. The vision of Mobile Ad Hoc Network (MANET) is wireless internet, where users can move anywhere anytime and still remaining connected with the rest of the world. The main challenges in MANET are reliability, bandwidth and battery power. The network has unpredictable characteristics such as its topology, signal strengths fluctuates with environment and time, communication routes breaks and new ones are formed dynamically. In this context, communication algorithms and protocols should have very light in computational and storage needs in order to conserve energy and bandwidth. Broadcasting is the process in which a source node sends a message to all other nodes in MANET. Network wide broadcasting in Mobile Ad Hoc Network provides important control and route establishment functionality for a number of unicast and multicast protocols. Broadcasting in MANET poses more challenges than in wired networks due to node mobility and scarce system resources. Broadcasting a packet to the entire network is a basic operation and has extensive applications in mobile ad hoc networks (MANETs). This paper presents an overview of the broadcasting techniques in mobile ad hoc networks, and simulating the simple Flooding algorithm and Probability based flooding algorithm using NS2 simulation.

목차

Abstract
 1. Introduction
 2. Broadcasting in MANET
 3. Broadcasting methods
  3.1 Simple flooding method
  3.2 Probability based approach
  3.3 Area based methods
  3.4. Neighbor Knowledge method
  3.5. Cluster Based methods
  3.6. Shortcoming of existing broadcasting methods
 4. The Broadcasting Algorithms under Evaluation
  4.1. Simple flooding algorithm - Algorithm I
  4.2. Probability based flooding algorithm - Algorithm II
 5. Simulation Results and Analysis
  5.1. Normalized Routing Load Chart for Simple Flooding Algorithm-Algorithm I
  5.2 Normalized Routing Load Chart for Probability Based Flooding Algorithm - Algorithm II
 6. Conclusions and Future work
 References

저자정보

  • N.Karthikeyan Research Scholar, Department of Computer Application, SNS College of Technology
  • V.Palanisamy Principal, Info Institute of Engineering
  • K.Duraiswamy Dean, K.S. Rangasamy College of Technology

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.