Learn More
Many sensor networks (especially networks of mobile sensors or networks that are deployed to monitor crisis situations) are deployed in an arbitrary and unplanned fashion. Thus, any sensor in such a network can end up being adjacent to any other sensor in the network. To secure the communications between every pair of adjacent sensors in such a network,(More)
—The World Wide Web famously supports two transport protocols: HTTP and HTTPS. These two protocols are at the opposite ends of three dimensions: security guarantees, cost of use, and compatibility with middle boxes (e.g. cache proxies) in the Internet. At one end, HTTP provides no security guarantees, but it is inexpensive to use, and is compatible with(More)
Most networks require that their users have " identities " , i.e. have names that are fixed for a relatively long time, unique, and have been approved by a central authority (in order to guarantee their uniqueness). Unfortunately, this requirement, which was introduced to simplify the design of networks, has its own drawbacks. First, this requirement can(More)
Combinatorial Mobile IP, a new mobility management scheme for Mobile IP, is proposed and analyzed. We present how to adopt mobility management schemes on cellular networks and adapt them in Mobile IP without disrupting the nature of the Internet. We apply widely used mobility management schemes such as hierarchical architecture and paging in cellular(More)
Overlay routing has been successful as an incremental method to improve Internet routing by allowing its own users to select their logical routing. In the meantime, traffic engineering (TE) are being used to reduce the whole network cost by adapting physical routing in response to varying traffic patterns. Previous studies [1, 2] have shown that the(More)
For any non-negative integer K, a K-observer P of a network N is a set of nodes in N such that each message, that travels at least K hops in N , is handled (and so observed) by at least one node in P. A K-observer P of a network N is minimum iff the number of nodes in P is less than or equal the number of nodes in every K-observer of N. The nodes in a(More)
—Although the widespread deployment of cellular networks guarantees mobility in large ranges, it cannot completely support multimedia data. Similarly, although the explosive growth of WLAN provides the convenience of wireless with high bandwidth, it lacks large range support. Thus, in this paper, we propose a new approach, ABC 2 , for seamless mobility such(More)
  • 1