In this article we present a survey of secure ad hoc routing protocols for mobile wireless networks. A mobile ad hoc network is a collection of nodes that is connected through a wireless medium forming rapidly changing topologies. The widely accepted existing routing protocols designed to accommodate the needs of such self-organized networks do not address possible threats aiming at the disruption of the protocol itself. The assumption of a trusted environment is not one that can be realistically expected; hence, several efforts have been made toward the design of a secure and robust routing protocol for ad hoc networks. We briefly present the most popular protocols that follow the table-driven and the source-initiated on-demand approaches. Based on this discussion we then formulate the threat model for ad hoc routing and present several specific attacks that can target the operation of a protocol. In order to analyze the proposed secure ad hoc routing protocols in a structured way we have classified them into five categories: solutions based on asymmetric cryptography; solutions based on symmetric cryptography; hybrid solutions; reputation-based solutions; and a category of add-on mechanisms that satisfy specific security requirements. A comparison between these solutions can provide the basis for future research in this rapidly evolving area.SECURE ROUTING FOR MOBILE AD HOC NETWORKS THIRD QUARTER 2005, VOLUME 7, NO. 3 www.comsoc.org/pubs/surveys uring the last few years we have all witnessed steadily increasing growth in the deployment of wireless and mobile communication networks. Mobile ad hoc networks consist of nodes that are able to communicate through the use of wireless mediums and form dynamic topologies. The basic characteristic of these networks is the complete lack of any kind of infrastructure, and therefore the absence of dedicated nodes that provide network management operations as do the traditional routers in fixed networks. In order to maintain connectivity in a mobile ad hoc network all participating nodes have to perform routing of network traffic. The cooperation of nodes cannot be enforced by a centralized administration authority since one does not exist. Therefore, a network-layer protocol designed for such self-organized networks must enforce connectivity and security requirements in order to guarantee the undisrupted operation of the higherlayer protocols.Unfortunately all of the widely used ad hoc routing protocols have no security considerations and trust all the participants to correctly forward routing and data traffic. This assumption can prove to be disastrous for an ad hoc network that relies on intermediate nodes for packet forwarding. Simulations have shown that if 10 percent to 40 percent of the nodes that participate in an ad hoc network perform malicious operations, then the average throughput degradation reaches 16 percent to 32 percent [1]. Earlier surveys and review papers presenting comparisons of ad hoc routing protocols completely ignored security problems ...

Abstract-Large public cloud infrastructure can utilise power which is generated by a multiplicity of power plants. The cost of electricity will vary among the power plants and each will emit different amounts of carbon for a given amount of energy generated. This infrastructure services traffic that can come from anywhere on the planet. It is desirable, for latency purposes, to route the traffic to the data centre that is closest in terms of geographical distance, costs the least to power and emits the smallest amount of carbon for a given request. It is not always possible to achieve all of these goals so we model both the networking and computational components of the infrastructure as a graph and propose the Stratus system which utilises Voronoi partitions to determine which data centre requests should be routed to based on the relative priorities of the cloud operator.

No abstract

Abstract. Whilst much effort has been put into the creation of routing algorithms to handle all sorts of mobility scenarios in ad-hoc networks, other fundamental issues, such as the addresses used by nodes, haven't been dealt with adequately. This addressing problem has recently attracted increased attention and a few proposals have been made, though often these schemes only work in limited scenarios. In this paper we present an autoconfiguration protocol designed to work in a mobile ad hoc network (MANET). The scheme allows joining nodes to dynamically obtain addresses, and has been designed to efficiently manage addressing, and to handle such scenarios as the merging and partitioning of networks. We discuss an implementation used within an emulated environment and a real self-organising ad-hoc network.

Abstract