Citation Context

... sensors. In order to increase the reliability and Sleeping Discovery Active International Journal of Computer Science & Engineering Survey (IJCSES) Vol.1, No.2, November 2010 69 capacity of the network, it is also possible to implement multipath routing in TBF where an alternate path is just another trajectory. TBM can be used for implementing networking functions, for example, flooding, discovery, and network management. TBF can also be used for resource discovery. Another interesting application of TBF is securing the perimeter of the network. Bounded Voronoi Greedy Forwarding [BVGF]: BVGF [24] uses the concept of Voronoi diagram [11] in which the sensors should be aware of their geographical positions. In BVGF, a network is modeled by a Voronoi diagram with sites representing the locations of sensors. In this type of greedy geographic routing, a sensor will always forward a packet to the neighbor that has the shortest distance to the destination. The sensors eligible for acting as the next hops are the ones whose Voronoi regions are traversed by the segment line joining the source and the destination. The BVGF protocol chooses as the next hop the neighbor that has the shortest Eucl...

Citation Context

...e of high rate changes of the network topology. G. Optimizations for Sparse Networks IGF targets sensing-covered dense sensor networks in which greedy forwarding has been proven to guarantee delivery =-=[17]-=-. However, we note that without the capability of circumventing voids (e.g., the absence of forwarding candidate nodes), IGF results in communication failure in sparse sensor networks. The stateless p...

Citation Context

... that guarantees packet delivery, e.g., face routing [11,14,18] or tree traversal [17]. Geographic routing algorithms tend to be most efficient when packets are forwarded greedily as much as possible =-=[33]-=-, since greedy Barbara Liskov and Robert Morris MIT Computer Science and Artificial Intelligence Laboratory {liskov, rtm}@csail.mit.edu (a) Physical topology (b) GSpring topology Fig. 1. Transformatio...

Citation Context

...loyed in each step until the desired coverage is achieved. Wang et al. [44] design several algorithms for mobile sensor nodes to move after an initial deployment to increase the coverage. Xing et al. =-=[45]-=- discuss several geographic routing algorithms for sensing covered networks. Sensor coverage in sensor network is different from the robot coverage discussed in this paper. Sensor coverage assumes sen...

Citation Context

...proposals to apply DT to geographic routing. None of them addressed the underlying technical issue that the DT graph of a wireless network is, in general, not a subgraph of its connectivity graph. In =-=[24]-=-, requirements are imposed on the placement of nodes and links in 2D such the DT graph is a subgraph of the connectivity graph. In other approaches, the restricted DT graph [10] and the k-localized DT...

Citation Context

...overed networks without obstacles a transmission range of at least twice the sensing range of the participating sensor nodes is sufficient to guarantee that Euclidian routing always provides progress =-=[29]-=-. In contrast, we assume that some areas of the network may contain larger obstacles and can therefore not ensure Euclidian progress. For example, the entire network may be sensing-covered, with the e...