Results 1  10
of
24
Geocasting with guaranteed delivery in sensor networks
 IEEE Wireless Communications
, 2004
"... In a geocasting problem, a message is sent from one node to all the nodes located in a designated region. For example, monitoring center needs to contact all active sensors within a monitored area to either gather data from them periodically, or to provide its location to sensors covering certain ar ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
In a geocasting problem, a message is sent from one node to all the nodes located in a designated region. For example, monitoring center needs to contact all active sensors within a monitored area to either gather data from them periodically, or to provide its location to sensors covering certain area for event reporting. Intelligent flooding methods exist for this task when all active sensors belong to the monitored area. However, when a particular area containing only a small subset of active sensors needs to be monitored, the problem reduces to geocasting. Most existing geocasting solutions are shown not to guarantee delivery. We then describe three approaches to guarantee delivery. Two of them are face traversal schemes and are based on depthfirst search of the face tree and traversal of all faces that intersect the border of geocasting region, respectively. In the entrance zone multicasting based approach, the monitoring center divides entrance ring of geocast region into zones of diameter equal to the transmission radius. The problem is decomposed into multicasting toward centers of each zone, and flooding from these nodes. Improvements to all methods can be made by applying neighbor or area dominating sets and coverage, and converting nodes that are not selected to sleep mode. All solutions that guarantee delivery are reported here for the first time (except a message inefficient version of face tree traversal scheme). 1.
Computing the maximum detour and spanning ratio of planar chains, trees and cycles
 In Proc. 19th Internat. Symp. Theor. Aspects of C.Sc., LNCS 2285:250–261
, 2002
"... Let G = (V, E) be an embedded connected graph with n vertices and m edges. Specifically, the vertex set V consists of points in R 2, and E consists ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
Let G = (V, E) be an embedded connected graph with n vertices and m edges. Specifically, the vertex set V consists of points in R 2, and E consists
Routing with Guaranteed Delivery in Geometric and Wireless Networks
, 2002
"... In this paper we study online local routing algorithms for communication networks. Our algorithms take advantage of the geometric properties of planar networks. We pay special attention to online local routing algorithms which guarantee that a message reaches its destination. A message cosists of ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
In this paper we study online local routing algorithms for communication networks. Our algorithms take advantage of the geometric properties of planar networks. We pay special attention to online local routing algorithms which guarantee that a message reaches its destination. A message cosists of packets of data that have to be sent to a destination node, i.e. the message itself plus a finite amount of space used to record a constant amount of data to aid it in its traversal, e.g. the address of the starting and destination nodes, a constant number of nodes visited, etc. Local means that at each site we have at our disposal only local information regarding a node and its neighbors, i.e. no global knowledge of the network is available at any time, other that the network is planar and connected. We then develop location aided local routing algorithms for wireless communication networks, in particularly cellular telephone networks.
Compact Routing for Graphs Excluding a Fixed Minor (Extended Abstract)
, 2005
"... This paper concerns compact routing schemes with arbitrary node names. We present a compact nameindependent routing scheme for unweighted networks with n nodes excluding a fixed minor. For any fixed minor, the scheme, constructible in polynomial time, has constant stretch factor and requires routin ..."
Abstract

Cited by 19 (10 self)
 Add to MetaCart
This paper concerns compact routing schemes with arbitrary node names. We present a compact nameindependent routing scheme for unweighted networks with n nodes excluding a fixed minor. For any fixed minor, the scheme, constructible in polynomial time, has constant stretch factor and requires routing tables with polylogarithmic number of bits at each node. For shortestpath labeled routing scheme in planar graphs, we prove an Ω(n ɛ) space lower bound for some constant ɛ>0. This lower bound holds even for bounded degree triangulations, and is optimal for polynomially weighted planar graphs (ɛ =1/2).
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
 In: 8 th Annual International Computing & Combinatorics Conference (COCOON). Volume 2387 of LNCS
, 2002
"... We address the problem of designing compact routing tables for an unlabeled connected nnode planar network G. For each node r of G, the designer is given a routing spanning tree Tr of G rooted at r, which speci es the routes for sending packets from r to the rest of G. ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We address the problem of designing compact routing tables for an unlabeled connected nnode planar network G. For each node r of G, the designer is given a routing spanning tree Tr of G rooted at r, which speci es the routes for sending packets from r to the rest of G.
A Position Based Ant Colony Routing Algorithm for Mobile Adhoc Networks
 Journal of Networks
, 2008
"... Abstract — Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile adhoc networks. Previously proposed position based routing algorithms may fail to find a route from a source to a destination in some types of adhoc networks and if they find a ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract — Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile adhoc networks. Previously proposed position based routing algorithms may fail to find a route from a source to a destination in some types of adhoc networks and if they find a route, it may be much longer than the shortest path. On the other hand, routing algorithms which are based on ant colony optimization find routing paths that are close in length to the shortest paths. The drawback of these algorithms is the large number of control messages that needs to be sent or the long delay before the routes are established from a source to a destination. In this paper we propose a new reactive routing algorithm for mobile ad hoc networks, called POSANT (Position based Ant Colony Routing Algorithm), which combines the idea of ant colony optimization with information about the position of nodes. In contrast to the other ant colony optimization based routing algorithms, our simulations show that POSANT has a relatively short route establishment time while using a small number of control messages which makes it a scalable reactive routing algorithm. Index Terms — mobile adhoc networks, routing algorithms, position based routing, ant colony optimization I.
Localized Routing for Wireless Ad Hoc Networks
"... We show that, given a set of randomly distributed wireless nodes with density n, when the transmission range r_n of wireless nodes satisfies #r log n+c(n) n , the localized Delaunay triangulation (LDel) [1] is the same as the Delaunay triangulation with high probability, where c(n) → ∞ as ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We show that, given a set of randomly distributed wireless nodes with density n, when the transmission range r_n of wireless nodes satisfies #r log n+c(n) n , the localized Delaunay triangulation (LDel) [1] is the same as the Delaunay triangulation with high probability, where c(n) → ∞ as n goes infinity. Our experiments show that the delivery rates of existing localized routing protocols are increased when localized Delaunay triangulation is used instead of several previously proposed topologies, and the localized routing protocol based on Delaunay triangulation works well in practice.
Geocasting in ad hoc and sensor networks
 In Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless and PeertoPeer Networks (Jie
, 2004
"... In a geocasting problem in ad hoc networks, a message is sent from one node to all the nodes located in a designated region. For example, monitoring center needs to contact all active sensors within a monitored area to either gather data from them periodically, or to provide its location to sensors ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
In a geocasting problem in ad hoc networks, a message is sent from one node to all the nodes located in a designated region. For example, monitoring center needs to contact all active sensors within a monitored area to either gather data from them periodically, or to provide its location to sensors covering certain area for event reporting. Intelligent flooding methods exist for this task when all active sensors belong to the monitored area. However, when a particular area containing only a small subset of active sensors needs to be monitored, the problem reduces to geocasting. This article surveys existing solutions to the geocasting problem, with particular consideration on whether or not they guarantee delivery. Most existing solutions are shown not to guarantee delivery. Three approaches to guarantee delivery are then described. Two of them are face traversal schemes and are based on depthfirst search of the face tree and traversal of all faces that intersect the border of geocasting region, respectively. In the entrance zone multicasting based approach, the monitoring center divides entrance ring of geocast region into zones of diameter equal to the transmission radius. The problem is decomposed into multicasting toward centers of each zone, and flooding from these nodes. Improvements to all methods can be made by applying neighbor or area dominating sets and coverage, and converting nodes that are not selected to sleep mode. 1.
QoSbased geographic routing for eventdriven image sensor networks, in
 Proc. of IEEE/CreateNet Intl. Workshop on Broadband Advanced Sensor Networks (BaseNets
, 2005
"... Abstract — We investigate the use of distributed image sensing for network localization, dynamic routing, and load balancing in wireless sensor networks. In particular, the image sensors are first used to obtain angular bearing information between each network node and a set of other nodes, mobile a ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract — We investigate the use of distributed image sensing for network localization, dynamic routing, and load balancing in wireless sensor networks. In particular, the image sensors are first used to obtain angular bearing information between each network node and a set of other nodes, mobile agents, or targets. This data is used to construct the relative geographic topology of the network. The image sensors are then employed to make periodic measurements, which are reported to the destination via multihop routing. Nodes may also infrequently detect an event from which a set of image frames need to be reported. These highbandwidth event reports may cause packet queues to develop at the routing nodes along paths to the destination. We propose a distributed routing scheme that employs a cost function based on location data, innode queue sizes, and energy levels at neighboring nodes. Our scheme also implements a set of relative priority levels for the eventbased and periodic data packets. Simulation results are presented and indicate improved network lifetime, lower endtoend average and maximum delays, and significantly reduced buffer size requirements for the network nodes. I.
Navigation on a Poisson point process
 RR, n o 5790, INRIA, Rocquencourt
, 2006
"... On a locally finite point set, a navigation defines a path through the point set from a point to another. The set of paths leading to a given point defines a tree, the navigation tree. In this article, we analyze the properties of the navigation tree when the point set is a Poisson point process on ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
On a locally finite point set, a navigation defines a path through the point set from a point to another. The set of paths leading to a given point defines a tree, the navigation tree. In this article, we analyze the properties of the navigation tree when the point set is a Poisson point process on R d. We examine the local weak convergence of the navigation tree, the asymptotic average of a functional along a path, the shape of the navigation tree and its topological ends. We illustrate our work in the small world graphs where new results are established. AMS Classification: Primary 60D05, 05C05; secondary 90C27, 60G55.