scispace - formally typeset
Search or ask a question
Topic

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.


Papers
More filters
Proceedings ArticleDOI
Y. Rebahi1, V.E. Mujica-V1, D. Sisalem1
27 Jun 2005
TL;DR: A trust model extending routing protocols and based on the reputation concept is developed to provide a mechanism for detecting malicious incorrect packet forwarding attacks and how the reputation information is gathered, stored and exchanged between the nodes, and computed according to the different scenarios.
Abstract: The main characteristics of ad hoc networks are the lack of predefined infrastructure and the dynamic topology. These characteristics present some new security vulnerabilities for this emerging networking paradigm. Usually, security in ad hoc networks is handled through authentication and encryption. This can be considered as a first line of defense, however, this remain inefficient against some other kind of attacks such as malicious packet dropping. The purpose of this work is to provide a mechanism for detecting malicious incorrect packet forwarding attacks. To this end, a trust model extending routing protocols and based on the reputation concept is developed. Our model provides two main functionalities: monitoring the behavior of the neighboring nodes in the network and computing their reputations based on the information provided by the monitoring. This paper also discusses how the reputation information is gathered, stored and exchanged between the nodes, and computed according to the different scenarios. Our mechanism is also validated with some simulation work showing its feasibility, performance and benefits.

103 citations

Journal ArticleDOI
TL;DR: This work evaluates three routing protocols with INSIGNIA, an in-band signaling system that supports adaptive reservation-based services in mobile ad hoc networks supporting "operational transparency" between a number of IETFMobile ad hoc network routing protocols that include Ad Hoc On-Demand Distance Vector, Dynamic Source Routing, and the Temporally Ordered Routing Algorithm.
Abstract: There is a growing need to provide better service differentiation in mobile ad hoc networks; however, this is challenging. These networks are characterized as being multihop in nature where the wireless topology that interconnects mobile hosts/routers can change rapidly in unpredictable ways or remain relatively static over long periods of time. Power and bandwidth constrained, mobile ad hoc networks typically only support best effort communications where the transport protocol's "goodput" is often lower than the maximum radio transmission rate after encountering the effects of multiple access, fading, noise, and interference. We evaluate three routing protocols with INSIGNIA, an in-band signaling system that supports adaptive reservation-based services in mobile ad hoc networks. INSIGNIA represents a general-purpose approach to delivering quality of service in mobile ad hoc network supporting "operational transparency" between a number of IETF mobile ad hoc network routing protocols that include Ad Hoc On-Demand Distance Vector, Dynamic Source Routing, and the Temporally Ordered Routing Algorithm. We evaluate the performance gains delivered when using INSIGNIA with these MANET routing protocols in support of UDP and TCP traffic. The INSIGNIA ns-2 code used for the study reported in this article is available from the Web at comet.columbia.edu/insignia.

103 citations

Proceedings ArticleDOI
10 Dec 2002
TL;DR: This paper investigates the connectivity of wireless multihop networks with uniformly randomly distributed nodes and analyzes the required transmission range that creates, for a given node density, an almost surely k-connected topology.
Abstract: This paper investigates the connectivity of wireless multihop networks with uniformly randomly distributed nodes. We analyze the required transmission range that creates, for a given node density, an almost surely k-connected topology. Besides scenarios in which each node has the same range, we discuss inhomogeneous range assignments. Our results are of practical value for the task of setting parameters in network-level simulations of ad hoc networks and in the design of wireless sensor networks.

103 citations

Journal ArticleDOI
TL;DR: The unique characteristics of mobile ad hoc networks, which distinguishing this new network architecture from traditional infrastructured wired and wireless networks (i.e. cellular-based networks), are introduced.
Abstract: The general field of mobile ad hoc networking is still in its infancy. Particularly, the challenge of providing Quality-of-Service (QoS) support for ad hoc networks is an open problem and remains relatively uncharted territory. Providing a complete QoS solution for the ad hoc networking environment requires the interaction and cooperation of several components. These components include: (1) a QoS routing protocol, (2) a resource reservation scheme and (3) a QoS capable medium access control (MAC) layer. In this paper, we present a survey of the current research that has addressed each of these components in the context of ad hoc networks. This work is intended to provide a broad and comprehensive view of the various components and protocols required to provide QoS support in computer networks, focusing primarily on ad hoc networks. First, we introduce the unique characteristics of mobile ad hoc networks, which distinguishing this new network architecture from traditional infrastructured wired and wireless networks (i.e. cellular-based networks). We also discuss the impact of these characteristics on QoS provisioning. Next, we describe the first QoS model proposed for mobile ad hoc networks and its relationship to QoS models proposed for the Internet. We then present a review of the proposed algorithms for each QoS component (e.g. QoS routing, resource reservation and the MAC layer). Copyright © 2002 John Wiley & Sons, Ltd.

103 citations

Book ChapterDOI
01 Jan 2006
TL;DR: This work describes a distributed or decomposed semidefinite programming (SDP) method for solving Euclidean metric localization problems that arise from ad hoc wireless sensor networks.
Abstract: We describe a distributed or decomposed semidefinite programming (SDP) method for solving Euclidean metric localization problems that arise from ad hoc wireless sensor networks. Using the distributed method, we can solve very large scale semidefinite programs which are intractable for the centralized methods. Our distributed or decomposed SDP scheme also seems to be applicable to solving other Euclidean geometry problems where points are locally connected.

103 citations


Network Information
Related Topics (5)
Wireless ad hoc network
49K papers, 1.1M citations
96% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
95% related
Wireless network
122.5K papers, 2.1M citations
95% related
Network packet
159.7K papers, 2.2M citations
93% related
Wireless sensor network
142K papers, 2.4M citations
93% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202317
202261
20215
20202
20192
201856