Analyzing Finite MANETs by Transformations to Equivalent Static Graphs

Because of their importance in military and other applications, Mobile Ad-Hoc Wireless Networks or MANETs have attracted significant attention in the research community. However, almost virtually all of the literature has focused on analyzing MANETs in an asymptotic case with a very large number of nodes under varying levels of node density and distribution. While the asymptotic analysis is extremely valuable, practical usage of MANETs requires us to be able to analyze networks of finite size. In this paper, we present an approach to analyze MANETs with a fixed number of nodes which can be used in many practical applications related to MANETs. Our approach is based on simplifying the motion paths of a MANETs by applying a set of transformations, and decomposing the motion paths into a generalized Fourier series transformation of simpler periodic motions.

By: Dinesh Verma; Bong Jun Ko; Ananthram Swami

Published in: RC24497 in 2008

LIMITED DISTRIBUTION NOTICE:

This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

rc24497.pdf

Questions about this service can be mailed to reports@us.ibm.com .