The aim of this paper is to consider the problem of node localization for geographical routing protocols in ad hoc networks. We propose a distributed positioning algorithm that does not rely only on GPS-like systems (Global Positioning System). Instead, it is assumed that just a part of the nodes belonging to that network is GPS-compliant. Therefore in this paper it is proposed to give position...

Location services are used in mobile ad hoc and hybrid networks either to locate the geographic position of a given node in the network or for locating a data item (content). One of the main usages of position location services is in location based routing algorithms. In particular, geographic routing protocols can route messages more efficiently to their destinations based on the destination n...

Routing in delay tolerant networks poses a challenging problem compared to a conventional data network due to the uncertainty and time varying nature of network connectivity. Initial research in this area has considered algorithms based on deterministic mobility of the nodes in DTN. While the assumption of deterministic mobility can lay the groundwork for a theoretical understanding of DTN, suc...

Locating objects with topology-independent identifiers has emerged as a key functionality in recent content networking approaches. Numerous designs have been proposed to address the obvious scalability and efficiency challenges such systems face in Internetscale deployments. These designs have often been based on implicit assumptions of full deployment and a homogeneous autonomous system struct...

As sensor-driven applications become progressively more integrated into our lives; issues linked to sensor privacy will become increasingly important. In wireless sensor networks, adversaries can make use of the traffic information for locating the monitored objects. Network coding has been shown to be an efficient approach to improve the wireless system performance. In a wormhole attack, the a...

Mobile IP and Network Mobility are the IETF proposals to obtain mobility. However, both of them have routing limitations, due to the presence of an entity (Home Agent) in the communication path. Those problems have been tried to be solved in different ways. A family of solutions tries to improve the routing by locating closer Home Agents making shorter the communication path. These techniques r...

Locating and accessing information in a large distributed system is a di cult problem of growing importance. This paper reports on our experience building and using a prototype system for transparent, user-guided associative access to the contents of a large, distributed set of WAIS servers. Our system is based on content routing, an architecture that makes use of content labels for locating an...

We consider the problem of location management in cell-hopping networks, where the only infrastructure used for routing and switching user data is a set of ad-hoc basestations owned by small individual operators. Such networks do not have any reliable fixed infrastructure to host central or distributed location register databases. We propose a novel location management protocol, which obviates ...

Consider a matrix valued function A(x) ∈ R, m ≥ n, smoothly depending on parameters x ∈ Ω ⊂ R, where Ω is simply connected and bounded. We consider a technique to locate parameter values where some of the q dominant (q ≤ n) singular values of A coalesce, in the specific case when A is large and m > n ≫ q. Notation. An m × n real matrix is indicated with A ∈ Rm×n. We always consider the 2-norm f...

‎let $f$ be a proper $k$-coloring of a connected graph $g$ and‎ ‎$pi=(v_1,v_2,ldots,v_k)$ be an ordered partition of $v(g)$ into‎ ‎the resulting color classes‎. ‎for a vertex $v$ of $g$‎, ‎the color‎ ‎code of $v$ with respect to $pi$ is defined to be the ordered‎ ‎$k$-tuple $c_{{}_pi}(v)=(d(v,v_1),d(v,v_2),ldots,d(v,v_k))$‎, ‎where $d(v,v_i)=min{d(v,x):~xin v_i}‎, ‎1leq ileq k$‎. ‎if‎ ‎distinct...