From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: From: Marek Lindner Date: Fri, 24 Aug 2012 15:53:17 +0200 References: <6567295.mkEhlW2YzJ@bentobox> In-Reply-To: MIME-Version: 1.0 Content-Type: Text/Plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit Message-Id: <201208241553.17222.lindner_marek@yahoo.de> Subject: Re: [B.A.T.M.A.N.] editing the routing information Reply-To: The list for a Better Approach To Mobile Ad-hoc Networking List-Id: The list for a Better Approach To Mobile Ad-hoc Networking List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , To: The list for a Better Approach To Mobile Ad-hoc Networking On Friday, August 24, 2012 14:01:15 Dominic Follett-Smith wrote: > I will have a closer look at the code and send some more details over > the weekend. Essentially I understand that neighbor ranking for a > destination node 'D' is performed on the number of OGM's received in > the sliding window. This is not entirely correct. Only single hop neighbors will count the received OGMs and also count the re-broadcasted OGMs repeated by its neighbors. Then they derive the TQ from that which is then propagated through the network (plus hop penalty and asym penalty). In other words: N1 will never count the OGMs originating at D. Cheers, Marek