Abstract not found

Abstract not found

This paper presents the design of a new Internet routing architecture (NIRA). In today’s Internet, users can pick their own ISPs, but once the packets have entered the network, the users have no control over the overall routes their packets take. NIRA aims at providing end users the ability to choose the sequence of Internet service providers a packet traverses. User choice fosters competition, which imposes an economic discipline on the market, and fosters innovation and the introduction of new services. This paper explores various technical problems that would have to be solved to give users the ability to choose: how a user discovers routes and whether the dynamic conditions of the routes satisfy his requirements, how to efficiently represent routes, and how to properly compensate providers if a user chooses to use them. In particular, NIRA utilizes a hierarchical provider-rooted addressing scheme so that a common type of domainlevel route can be efficiently represented by a pair of addresses. In NIRA, each user keeps track of the topology information on domains that provide transit service for him. A source retrieves the topology information of the destination on demand and combines this information with his own to discover end-to-end routes. This route discovery process ensures that each user does not need to know the complete topology of the Internet.

A decade ago as wireless sensor network research took off many researchers in the field denounced the use of IP as inadequate and in contradiction to the needs of wireless sensor networking. Since then the field has matured, standard links have emerged, and IP has evolved. In this paper, we present the design of a complete IPv6-based network architecture for wireless sensor networks. We validate the architecture with a production-quality implementation that incorporates many techniques pioneered in the sensor network community, including duty-cycled link protocols, header compression, hop-by-hop forwarding, and efficient routing with effective link estimation. In addition to providing interoperability with existing IP devices, this implementation was able to achieve an average duty-cycle of 0.65%, average per-hop latency of 62ms, and a data reception rate of 99.98 % over a period of 4 weeks in a real-world home-monitoring application where each node generates one application packet per minute. Our results outperform existing systems that do not adhere to any particular standard or architecture. In light of this demonstration of full IPv6 capability, we review the central arguments that led the field away from IP. We believe that the presence of an architecture, specifically an IPv6-based one, provides a strong foundation for wireless sensor networks going forward.

Future internetworks will include large numbers of portable devices moving among small wireless cells. We propose a hierarchical mobility management scheme for such networks. Our scheme exploits locality in user mobility to restrict handoff processing to the vicinity of a mobile node. It thus reduces handoff latency and the load on the internetwork. Our design is based on the Internet Protocol (IP) and is compatible with the Mobile IP standard. We also present experimental results for the lowest level of the hierarchy. We implemented our local handoff mechanism on Unix-based portable computers and base stations, and measured its performance on a WaveLAN network. These measurements show that our handoffs are fast enough to avoid noticeable disruptions in interactive voice traffic. For example, our handoff protocol completes less than 10 milliseconds after a mobile node initiates it. Our mechanism also recovers from packet losses suffered during the transition from one cell to another. T...

Abstract. In the last few years, the performances of wireless technologies have increased tremendously thus opening new fields of application in the domain of networking. One of such fields concerns mobile ad hoc networks (MANETs) in which mobile nodes organise themselves in a network without the help of any predefined infrastructure. Securing MANETs is just as important, if not more, as securing traditional wired networks. Existing solutions can be used to obtain a certain level of security. Nevertheless, these solutions may not always be suitable to wireless networks. Furthermore, ad hoc networks have their own vulnerabilities that cannot be tackled by these solutions. To obtain an acceptable level of security in such a context, traditional security solutions should be coupled with an intrusion detection mechanism. In this paper we show how ad hoc networks can be, to a certain extent, secured using traditional techniques. We then examine the different intrusion detection techniques and point out the reasons why they usually cannot be used in an ad hoc context. Finally, we go through the requirements of an intrusion detection system for ad hoc networks, and define an adapted architecture for an intrusion detection system for manets. 1

Introduction Future internetworks will include networks of small wireless cells populated by large numbers of portable devices. Laptop computers and cellular telephones have proven their utility, while continuing advances in miniaturization promise increasingly functional portable devices. Networks of small wireless cells offer high aggregate bandwidth, support low-powered mobile transceivers, and provide accurate location information. In these networks, users will often carry devices across cell boundaries in the midst of data transfers. A handoff mechanism is needed to maintain connectivity as devices move, while minimizing disruption to ongoing transfers. This mechanism should exhibit low latency, incur little or no data loss, and scale to a large internetwork. The Mobile IP standard [22] specifies a general handoff protocol for the Internet, but does not fully meet these goals. Mobile IP can handle both local-area and wide-area movement in both wired and w

Abstract not found

The majority of attacks made upon modern computers have been successful due to the exploitation of the same errors and weaknesses that have plagued computer systems for the last thirty years. Because the industry has not learned from these mistakes, new protocols and systems are not designed with the aspect of security in mind; and security that is present is typically added as an afterthought. What makes these systems so vulnerable is that the security design process is based upon assumptions that have been made in the past; assumptions which now have become obsolete or irrelevant. In addition, fundamental errors in the design and implementation of systems repeatedly occur, which lead to failures. This

In today's networks, the evolution of wide-area services is constrained by standardization and compatibility concerns. The result is that the introduction of a new service occurs much more slowly than the emergence of new applications and technologies that benefit from it. To ameliorate this problem, an active network exploits mobile code and programmable infrastructure to provide rapid and specialized service introduction. A viable active network has the potential to change the way network protocols are designed and used, stimulating innovation and hastening the arrival of new functionality. There are, however, a number of challenges that must be overcome in the design of an active network. Chief among them are how to express new services as network programs, and how to execute these programs efficiently and securely.