Comments: the file is in my home on hadar. ContactPerson: joyghosh@cse.buffalo.edu Remote host: c-24-6-184-136.hsd1.ca.comcast.net ### Begin Citation ### Do not delete this line ### %R 2005-12 %U /home/csgrad/joyghosh/public_html/TR_SOLAR_DTN.pdf %A Ghosh, Joy %A Qiao, Chunming %A Philip, Sumesh %A Ngo, Hung %A Yoon, Seokhoon %T Sociological Orbit aware Location Approximation and Routing (SOLAR) in DTN %D April 6, 2005 %I Department of Computer Science and Engineering, SUNY Buffalo %K Mobility framework, Routing protocol, Delay %X 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, such knowledge may not be applicable to mobile ad hoc networks. In this work, we introduce a novel concept of a partially repetitive ?orbital? pattern of mobile users (nodes) involving a set of ?hubs?, that may be better suited for a semi-deterministic mobility modeling of DTN users. This partially deterministic movement pattern is both practical as well as useful in the sense that the hub list information can be useful for locating nodes and routing packets to them in a DTN.