Ad hoc wireless distribution service

About: Ad hoc wireless distribution service is a research topic. Over the lifetime, 17734 publications have been published within this topic receiving 488205 citations.

The quest for security in mobile ad hoc networks

Abstract: So far, research on mobile ad hoc networks has been forcused primarily on routing issues. Security, on the other hand, has been given a lower priority. This paper provides an overview of security problems for mobile ad hoc networks, distinguishing the threats on basic mechanisms and on security mechanisms. It then describes our solution to protect the security mechanisms. The original features of this solution include that (i) it is fully decentralized and (ii) all nodes are assigned equivalent roles.

Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges

Abstract: n the last few years, there has been much research activity in mobile, wireless, ad hoc networks (MANET). MANETs are infrastructure-less, and nodes in the networks are constantly moving. In MANETs, nodes can directly communicate with each other if they enter each others' communication range. A node can terminate packets or forward packets (serve as a relay). Thus, a packet traverses an ad hoc network by being relayed from one node to another, until it reaches its destination. As nodes are moving, this becomes a challenging task, since the topology of the network is in constant change. How to find a destination, how to route to that destination, and how to insure robust communication in the face of constant topology change are major challenges in mobile ad hoc networks. Routing in mobile ad hoc networks is a well-studied topic. To accommodate the dynamic topology of mobile ad hoc networks, an abundance of routing protocols have recent-For all these routing protocols, it is implicitly assumed that the network is connected and there is a contemporaneous end-to-end path between any source and destination pair. However, in a physical ad hoc network, the assumption that there is a contemporaneous end-to-end path between any source and destination pair may not be true, as illustrated below. In MANETs, when nodes are in motion, links can be obstructed by intervening objects. When nodes must conserve power, links are shut down periodically. These events result in intermittent connectivity. At any given time, when no path exists between source and destination, network partition is said to occur. Thus, it is perfectly possible that two nodes may never be part of the same connected portion of the network. Figure 1 illustrates the time evolving behavior in intermittent-ABSTRACT Recently there has been much research activity in the emerging area of intermittently connected ad hoc networks and delay/disruption tolerant networks (DTN). There are different types of DTNs, depending on the nature of the network environment. Routing in DTNs is one of the key components in the DTN architecture. Therefore, in the last few years researchers have proposed different routing protocols for different types of DTNs. In this article we capture the state of the art in routing protocols in DTNs. We categorize these routing protocols based on information used. For deter-ministic time evolving networks, three main approaches are discussed: the tree approach, the space and time approach, and the modified shortest …

SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks

Abstract: An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vector approaches, they have generally assumed a trusted environment. In this paper, we design and evaluate the Secure Efficient Ad hoc Distance vector routing protocol (SEAD), a secure ad hoc network routing protocol based on the design of the Destination-Sequenced Distance-Vector routing protocol. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic operations in the protocol. SEAD performs well over the range of scenarios we tested, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of any active attackers or compromised nodes in the network.

DakNet: rethinking connectivity in developing nations

Abstract: DakNet provides extraordinarily low-cost digital communication, letting remote villages leapfrog past the expense of traditional connectivity solutions and begin development of a full-coverage broadband wireless infrastructure. What is the basis for a progressive, market-driven migration from e-governance to universal broadband connectivity that local users will pay for? DakNet, an ad hoc network that uses wireless technology to provide asynchronous digital connectivity, is evidence that the marriage of wireless and asynchronous service may indeed be the beginning of a road to universal broadband connectivity. DakNet has been successfully deployed in remote parts of both India and Cambodia at a cost two orders of magnitude less than that of traditional landline solutions.

Securing ad hoc routing protocols

Abstract: We consider the problem of incorporating security mechanisms into routing protocols for ad hoc networks. Canned security solutions like IPSec are not applicable. We look at AODV[21] in detail and develop a security mechanism to protect its routing information. We also briefly discuss whether our techniques would also be applicable to other similar routing protocols and about how a key management scheme could be used in conjunction with the solution that we provide.