CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Article:Optimization on Control Overhead in MANET

by Swarnali Hazra, Sanjit Setua
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 12 - Number 4
Year of Publication: 2010
Authors: Swarnali Hazra, Sanjit Setua
10.5120/1666-2244

Swarnali Hazra, Sanjit Setua . Article:Optimization on Control Overhead in MANET. International Journal of Computer Applications. 12, 4 ( December 2010), 16-21. DOI=10.5120/1666-2244

@article{ 10.5120/1666-2244,
author = { Swarnali Hazra, Sanjit Setua },
title = { Article:Optimization on Control Overhead in MANET },
journal = { International Journal of Computer Applications },
issue_date = { December 2010 },
volume = { 12 },
number = { 4 },
month = { December },
year = { 2010 },
issn = { 0975-8887 },
pages = { 16-21 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume12/number4/1666-2244/ },
doi = { 10.5120/1666-2244 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:00:49.569274+05:30
%A Swarnali Hazra
%A Sanjit Setua
%T Article:Optimization on Control Overhead in MANET
%J International Journal of Computer Applications
%@ 0975-8887
%V 12
%N 4
%P 16-21
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

MANETs are comprised of mobile hosts communicating via their wireless interfaces and their topology is continuously changing. During communication process between mobile hosts or nodes, control message-transfers among the nodes occur. Control messages consume bandwidth, processing resources to both transmit and receive a message. Since bandwidth is at a premium, routing protocols should not send more than the optimal number of control messages they need for operation, and should be designed so that this number is relatively small. In this paper, Optimized AODV and Optimized DSR are proposed to minimize mainly the control overhead

References
  1. C. Perkins. AODV Routing Implementation for Scalable Wireless Ad-Hoc Network Simulation (SWANS). http://jist.ece.cornell.edu/docs/040421-swans-aodv.pdf
  2. C. Perkins, E. Belding-Royer, S. Das. Ad hoc On-Demand Distance Vector (AODV) Routing. 2003. http://www.ietf.org/rfc/rfc3561.txt
  3. D. Johnson, Y. Hu, D. Maltz. The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4. 2007. http://www.ietf.org/rfc/rfc4728.txt
  4. David B. Johnson and David A. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks. COMPUTER SCIENCE. Mobile Computing. The International Series in Engineering and Computer Science, 1996, Volume 353, 153-181
  5. Liu Chao and Hu Aiqun. Reducing the Message Overhead of AODV by Using Link Availability Prediction. Lecture Notes in Computer Science, 2007, Volume 4864/2007, 113-122,
  6. Stefano Basagni, Marko Conti, Silvia Giordano and Ivan Stojmenovic. Mobile Ad Hoc Networking (chapter: 9). A JOHN WILEY & SONS, INC., PUBLICATION.
  7. Xia ofeng Zhong,Youzheng Wang, Shunliang Mei, and Jing Wang . A Stable Adaptive Optimization for DSR Protocol. Lecture Notes in Computer Science, 2003, Volume 2524 /2003, 179-199
Index Terms

Computer Science
Information Sciences

Keywords

Control overhead optimal path RREQ RREP AODV DSR

Powered by PhDFocusTM