Sumesh J. Philip

Learn More
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(More)
In this paper, we characterize analytically the multiaccess interference in wireless code-division multiple-access sensor networks with uniformly random distributed nodes and study the tradeoff between interference and connectivity. To provide a guideline for improving system behavior, three competitive deterministic topologies are evaluated along with the(More)
In a mobile wireless ad-hoc network, nodes move about and relay packets destined for other nodes. One of the biggest challenges in this area is the design of scalable routing protocols. Recently, a family of routing protocols has emerged that is potentially more scalable than the protocols that discover and/or maintain end-to-end routes. These protocols are(More)
In this paper, we introduce a novel concept of integrating “macro-mobility” information obtained from the sociological movement pattern of mobile MANET users into routing. The extraction of this mobility information is based on our observation that the movement of a mobile user exhibits a partially repetitive “orbital” pattern involving a set of “hubs” in(More)
In networks where nodes are aware of their locations via the use of a GPS receiver or other localization techniques, geographic routing has been suggested to be the candidate of choice for robust and resource efficient routing. However, efficient location management algorithms are required for the source node to obtain the destination node’s location before(More)
Geometric routing using source-destination locations has been widely suggested as a scalable alternative to conventional routing approaches in mobile ad hoc networks. Recently, there has been considerable attention on face routing in planar graphs constructed from overlay graphs in wireless networks. Given a plane tiled into an infinite mesh of polygons, an(More)
Geography based routing in mobile ad hoc networks is an application that uses the location information of nodes in a network to route data packets. Since the amount of network state information that each node needs to maintain in order to route packets is minimal, location based routing is considered scalable compared to existing routing protocols in ad hoc(More)
Recently, a new family of protocols has been introduced for large scale ad hoc networks that make use of the approximate location of nodes in the network for geographic routing. Location management plays an important role in such protocols, and in this paper, we propose a deterministic hierachical scheme for managing the location information of nodes, and(More)