[manet] Use of Planar Graphs
"Sivavakeesar S Mr (PG/R - Electronic Eng)" <S.Sivavakeesar@surrey.ac.uk> Fri, 22 October 2004 17:51 UTC
Received: from ietf-mx.ietf.org (ietf-mx.ietf.org [132.151.6.1]) by ietf.org (8.9.1a/8.9.1a) with ESMTP id NAA24436 for <manet-web-archive@ietf.org>; Fri, 22 Oct 2004 13:51:18 -0400 (EDT)
Received: from megatron.ietf.org ([132.151.6.71]) by ietf-mx.ietf.org with esmtp (Exim 4.33) id 1CL3mG-00039w-Ms for manet-web-archive@ietf.org; Fri, 22 Oct 2004 14:04:36 -0400
Received: from localhost.localdomain ([127.0.0.1] helo=megatron.ietf.org) by megatron.ietf.org with esmtp (Exim 4.32) id 1CL3V8-0003Vo-Bz; Fri, 22 Oct 2004 13:46:54 -0400
Received: from odin.ietf.org ([132.151.1.176] helo=ietf.org) by megatron.ietf.org with esmtp (Exim 4.32) id 1CL3RM-00027J-CD for manet@megatron.ietf.org; Fri, 22 Oct 2004 13:43:00 -0400
Received: from ietf-mx.ietf.org (ietf-mx.ietf.org [132.151.6.1]) by ietf.org (8.9.1a/8.9.1a) with ESMTP id NAA23775 for <manet@ietf.org>; Fri, 22 Oct 2004 13:42:57 -0400 (EDT)
Received: from mailg.surrey.ac.uk ([131.227.102.21]) by ietf-mx.ietf.org with smtp (Exim 4.33) id 1CL3e8-0002zP-9n for manet@ietf.org; Fri, 22 Oct 2004 13:56:15 -0400
Received: from ads40.surrey.ac.uk by mailg.surrey.ac.uk with SMTP Local (PP) with ESMTP; Fri, 22 Oct 2004 18:41:55 +0100
Received: from EVS-EC1-NODE1.surrey.ac.uk ([131.227.102.136]) by ads40.surrey.ac.uk with Microsoft SMTPSVC(6.0.3790.211); Fri, 22 Oct 2004 18:41:54 +0100
Content-class: urn:content-classes:message
MIME-Version: 1.0
X-MimeOLE: Produced By Microsoft Exchange V6.5.7226.0
Date: Fri, 22 Oct 2004 18:37:44 +0100
Message-ID: <A59EC876DF4FEB439771FDDD7E3C72CB4E84FA@EVS-EC1-NODE1.surrey.ac.uk>
Thread-Topic: Use of Planar Graphs
Thread-Index: AcS4XYKLu8M0XMWNRtSpGBsP/CPxiAAAFP+F
From: "Sivavakeesar S Mr (PG/R - Electronic Eng)" <S.Sivavakeesar@surrey.ac.uk>
To: manet <manet@ietf.org>
X-OriginalArrivalTime: 22 Oct 2004 17:41:54.0424 (UTC) FILETIME=[6B8FCF80:01C4B85E]
X-Spam-Score: 0.8 (/)
X-Scan-Signature: 4b800b1eab964a31702fa68f1ff0e955
Subject: [manet] Use of Planar Graphs
X-BeenThere: manet@ietf.org
X-Mailman-Version: 2.1.5
Precedence: list
List-Id: Mobile Ad-hoc Networks <manet.ietf.org>
List-Unsubscribe: <https://www1.ietf.org/mailman/listinfo/manet>, <mailto:manet-request@ietf.org?subject=unsubscribe>
List-Post: <mailto:manet@ietf.org>
List-Help: <mailto:manet-request@ietf.org?subject=help>
List-Subscribe: <https://www1.ietf.org/mailman/listinfo/manet>, <mailto:manet-request@ietf.org?subject=subscribe>
Content-Type: multipart/mixed; boundary="===============1584837880=="
Sender: manet-bounces@ietf.org
Errors-To: manet-bounces@ietf.org
X-Spam-Score: 0.5 (/)
X-Scan-Signature: 386e0819b1192672467565a524848168
Dear Collegues : I am sure some of you can help me out. Can somebody tell me why we always use planar graph in the case of finding shortests path within a network OR perimeter OR face-routing in the case of geocasting in mobile ad hoc networks. What happens if we opt for non-planerised graphs [ie: graphs in which edges might cross each other]. Since I am involved with routing in MANETs using graph theory principles, can you please suggest me any book that deals with graph theory in general OR preferably in the context of networking. Your timely help would be greatly appreciated. Thanks in advance. Cheers S. Siv
_______________________________________________ manet mailing list manet@ietf.org https://www1.ietf.org/mailman/listinfo/manet
- [manet] Use of Planar Graphs Sivavakeesar S Mr (PG/R - Electronic Eng)