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.

Stochastic geometry and wireless networks

Abstract: Preface. Preface to Volume II. Contents of Volume II. Part IV Medium Access Control 1 Spatial Aloha: the Bipole Model 2 Receiver Selection in Spatial 3 Carrier Sense Multiple 4 Code Division Multiple Access in Cellular Networks Bibliographical Notes on Part IV. Part V Multihop Routing in Mobile ad Hoc Networks: 5 Optimal Routing 6 Greedy Routing 7 Time-Space Routing Bibliographical Notes on Part V. Part VI Appendix:Wireless Protocols and Architectures: 8 RadioWave Propagation 9 Signal Detection 10 Wireless Network Architectures and Protocols Bibliographical Notes on Part VI Bibliography Table of Notation Index.

Mesh networks: commodity multihop ad hoc networks

Abstract: In spite of the massive efforts in researching and developing mobile ad hoc networks in the last decade, this type of network has not yet witnessed mass market deployment. The low commercial penetration of products based on ad hoc networking technology could be explained by noting that the ongoing research is mainly focused on implementing military or specialized civilian applications. On the other hand, users are interested in general-purpose applications where high bandwidth and open access to the Internet are consolidated and cheap commodities. To turn mobile ad hoc networks into a commodity, we should move to more pragmatic "opportunistic ad hoc networking" in which multihop ad hoc networks are not isolated self-configured networks, but rather emerge as a flexible and low-cost extension of wired infrastructure networks coexisting with them. Indeed, a new class of networks is emerging from this view: mesh networks. This article provides an overview of mesh networking technology. In particular, starting from commercial case studies we describe the core building blocks and distinct features on which wireless mesh networks should be based. We provide a survey of the current state of the art in off-the-shelf and proprietary solutions to build wireless mesh networks. Finally, we address the challenges of designing a high-performance, scalable, and cost-effective wireless mesh network.

Security in wireless sensor networks

Abstract: With sensor networks on the verge of deployment, security issues pertaining to the sensor networks are in the limelight. Though the security in sensor networks share many characteristics with wireless ad hoc networks, the two fields are rapidly diverging due to the fundamental differences between the make-up and goals of the two types of networks. Perhaps the greatest dividing difference is the energy and computational abilities. Sensor nodes are typically smaller, less powerful, and more prone to failure than nodes in an ad hoc network. These differences indicate that protocols that are valid in the context of ad-hoc networks may not be directly applicable for sensor networks. In this paper, we survey the state of art in securing wireless sensor networks. We review several protocols that provide security in sensor networks, with an emphasis on authentication, key management and distribution, secure routing, and methods for intrusion detection. Copyright © 2006 John Wiley & Sons, Ltd.

Distributed quality-of-service routing in ad hoc networks

Abstract: In an ad hoc network, all communication is done over wireless media, typically by radio through the air, without the help of wired base stations. Since direct communication is allowed only between adjacent nodes, distant nodes communicate over multiple hops. The quality-of-service (QoS) routing in an ad hoc network is difficult because the network topology may change constantly, and the available state information for routing is inherently imprecise. In this paper, we propose a distributed QoS routing scheme that selects a network path with sufficient resources to satisfy a certain delay (or bandwidth) requirement in a dynamic multihop mobile environment. The proposed algorithms work with imprecise state information. Multiple paths are searched in parallel to find the most qualified one. Fault-tolerance techniques are brought in for the maintenance of the routing paths when the nodes move, join, or leave the network. Our algorithms consider not only the QoS requirement, but also the cost optimality of the routing path to improve the overall network performance. Extensive simulations show that high call admission ratio and low-cost paths are achieved with modest routing overhead. The algorithms can tolerate a high degree of information imprecision.

Self-organized public-key management for mobile ad hoc networks

Abstract: In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories are not well-suited for securing ad hoc networks. We propose a fully self-organized public-key management system that allows users to generate their public-private key pairs, to issue certificates, and to perform authentication regardless of the network partitions and without any centralized services. Furthermore, our approach does not require any trusted authority, not even in the system initialization phase.