期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2014
卷号：2
期号：11
出版社：S&S Publications
摘要：We suggest an algorithm that allows (i) each node to detect when the connectivity to a particularlychosen node has been lost, and (ii) one or more nodes (that are connected to the special node after the cut) to notice theincidence of the cut. The algorithm is dispersed and asynchronous: every node wants to converse with only those nodesthat are within its message range. The algorithm is based on the iterative calculation of a fictitious “electrical potential”of the nodes. The meeting rate of the underlying iterative scheme is self-governing of the size and arrangement of thenetwork. We demonstrate the effectiveness of the proposed algorithm through simulations and a real hardwareimplementation. In this paper, employ a sensible restricted random mobility model, we try to fill this gap. Specifically,we suppose that a network of unit area with n nodes is evenly divided into cells with an area of n each of which isfurther evenly divided into squares with an area of n . All nodes can only move inside the cell whichthey are at first dispersed in, and at the start of each time slot, every node moves from its current square to a uniformlychosen point in a time after time chosen adjacent square. By proposing a new multi hop relay scheme, we there smoothtrade-offs between throughput and delay by scheming nodes’ mobility. We also consider a network of area nand find that system size does not affect the results obtain before.
