NDLI: MDPF: Minimum Distance Packet Forwarding for Search Applications in Mobile Ad Hoc Networks

Content Provider	IEEE Xplore Digital Library
Author	Artail, H. Mershad, K.
Copyright Year	2002
Abstract	This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance Packet Forwarding (MDPF), uses routing information to select the node with the minimum distance. The goal of the proposed algorithm is to minimize the average number of hops taken to reach the node that holds the desired data. Numerical analysis and experimental evaluations using the network simulation software ns2 were performed to derive the lower and upper bounds of the confidence interval for the mean hop count between the source node of the data request, on one hand, and the node that holds the desired data and the last node in the set of search nodes, on the other hand. In the experimental evaluation, the performance of MDPF was compared to that of Random Packet Forwarding (RPF) and Minimal Spanning Tree Forwarding (MSTF). The results agreed with the numerical analysis results and demonstrated that MDPF offers significant hop count savings and smaller delays when compared to RPF and MSTF.
Sponsorship	IEEE Computer Society
Starting Page	1412
Ending Page	1426
Page Count	15
File Size	4640239
File Format	PDF
ISSN	15361233
Volume Number	8
Issue Number	10
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-10-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Mobile ad hoc networks Routing protocols Delay Numerical analysis Energy consumption Internet Algorithm design and analysis Analytical models Software performance Performance evaluation simulations. Data search message forwarding routing MANET shortest path
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Electrical and Electronic Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath routing

Modeling and Performance Analysis of Address Allocation Schemes for Mobile Ad Hoc Networks

Cluster overlay broadcast (COB): MANET routing with complexity polynomial in source-destination distance

Optimised adaptive power on-demand routing protocol for mobile ad hoc wireless network

Message Complexity Analysis of Mobile Ad Hoc Network Address Autoconfiguration Protocols

Study And Analysis Of Routingpath Management In Manet Routing Protocols

Analytical Estimation of Path Duration in Mobile Ad Hoc Networks

Routing approaches for enhancing security against packet forwarding misbehaviors in mobile ad hoc networks

OPHMR: An Optimized Polymorphic Hybrid Multicast Routing Protocol for MANET

MDPF: Minimum Distance Packet Forwarding for Search Applications in Mobile Ad Hoc Networks

Similar Documents

Improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath routing

Modeling and Performance Analysis of Address Allocation Schemes for Mobile Ad Hoc Networks

Cluster overlay broadcast (COB): MANET routing with complexity polynomial in source-destination distance

Optimised adaptive power on-demand routing protocol for mobile ad hoc wireless network

Message Complexity Analysis of Mobile Ad Hoc Network Address Autoconfiguration Protocols

Study And Analysis Of Routingpath Management In Manet Routing Protocols

Analytical Estimation of Path Duration in Mobile Ad Hoc Networks

Routing approaches for enhancing security against packet forwarding misbehaviors in mobile ad hoc networks

OPHMR: An Optimized Polymorphic Hybrid Multicast Routing Protocol for MANET

MDPF: Minimum Distance Packet Forwarding for Search Applications in Mobile Ad Hoc Networks