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
Journal ArticleDOI
11 Aug 2003
TL;DR: Passive clustering introduces many benefits, including efficient flooding and density adaptation, and reduces control overhead of ad hoc routing protocols significantly and, as a consequence, enablesAd hoc routing in large, dense sensor networks.
Abstract: High capacity real-time data communications in sensor networks usually require multihop routing and ad hoc routing protocols. Unfortunately, ad hoc routing protocols usually do not scale well and cannot handle dense situations efficiently. These two issues-scalability and density-are the major limitations when we apply ad hoc routing schemes to sensor networks. Passive clustering (PC) classifies ad hoc/sensor nodes into critical and noncritical nodes without any extra transmission. By 2-b piggybacking and monitoring user traffic (e.g., data polling requests from a sink), PC deploys the clustering structure "for free". Moreover, PC makes even the first flooding as efficient as all subsequent floodings (i.e., no initialization overhead). PC introduces many benefits, including efficient flooding and density adaptation. As a result, PC reduces control overhead of ad hoc routing protocols significantly and, as a consequence, enables ad hoc routing in large, dense sensor networks. The resulting structure can be utilized in cluster-based ad hoc network/sensor networking as well as for active node selection.

161 citations

Proceedings ArticleDOI
30 Nov 2006
TL;DR: The experimental results have shown that GVGrid could provide routes with longer lifetime, compared with an existing routing protocol for VANETs.
Abstract: In this paper, we present a QoS routing protocol called GVGrid for multi-hop mobile ad hoc networks constructed by vehicles, i.e., vehicular ad hoc networks (VANETs). GVGrid constructs a route on demand from a source (a fixed node or a base station) to vehicles that reside in or drive through a specified geographic region. The goal of GVGrid is to maintain a high quality route, i.e. a robust route for the vehicles' movement. Such a route can be used for high quality communication and data transmission between roadsides and vehicles, or between vehicles. The experimental results have shown that GVGrid could provide routes with longer lifetime, compared with an existing routing protocol for VANETs.

161 citations

Journal ArticleDOI
Ze Li1, Haiying Shen1
TL;DR: It is found that the strategies of using a threshold to determine the trustworthiness of a node in the reputation system and of rewarding cooperative nodes in the price-based system may be manipulated by clever or wealthy but selfish nodes.
Abstract: In mobile ad hoc networks (MANETs), tasks are conducted based on the cooperation of nodes in the networks. However, since the nodes are usually constrained by limited computation resources, selfish nodes may refuse to be cooperative. Reputation systems and price-based systems are two main solutions to the node noncooperation problem. A reputation system evaluates node behaviors by reputation values and uses a reputation threshold to distinguish trustworthy nodes and untrustworthy nodes. A price-based system uses virtual cash to control the transactions of a packet forwarding service. Although these two kinds of systems have been widely used, very little research has been devoted to investigating the effectiveness of the node cooperation incentives provided by the systems. In this paper, we use game theory to analyze the cooperation incentives provided by these two systems and by a system with no cooperation incentive strategy. We find that the strategies of using a threshold to determine the trustworthiness of a node in the reputation system and of rewarding cooperative nodes in the price-based system may be manipulated by clever or wealthy but selfish nodes. Illumined by the investigation results, we propose and study an integrated system. Theoretical and simulation results show the superiority of the integrated system over an individual reputation system and a price-based system in terms of the effectiveness of cooperation incentives and selfish node detection.

161 citations

Journal ArticleDOI
TL;DR: PMAC is proposed, a new MAC protocol that incorporates an efficient mechanism for neighbor discovery, and a scheduling based medium sharing that allows for exclusive directional transmissions and receptions and is seen to outperform both the traditional IEEE 802.11 and previously proposed MAC protocols for use with directional antennas in ad hoc networks.
Abstract: Many MAC sub-layer protocols for supporting the usage of directional antennas in ad hoc networks have been proposed in literature. However, there remain two open issues that are yet to be resolved completely. First, in order to fully exploit the spatial diversity gains possible due to the use of directional antennas, it is essential to shift to the exclusive usage of directional antennas for the transmission and reception of all the MAC layer frames. This would facilitate maximal spatial reuse and will efface the phenomena of asymmetry in gain. Second, in the presence of mobility the MAC protocol should incorporate mechanisms by which a node can efficiently discover and track its neighbors. In this paper we propose PMAC, a new MAC protocol that addresses both the issues in an integrated way. PMAC incorporates an efficient mechanism for neighbor discovery, and a scheduling based medium sharing that allows for exclusive directional transmissions and receptions. We perform analysis and simulations to understand the performance of our scheme. We find that each node, on average, can achieve a per node utilization of about 80% in static and about 45% in mobile scenarios. In terms of throughput, our protocol is seen to outperform both the traditional IEEE 802.11 and previously proposed MAC protocols for use with directional antennas in ad hoc networks

161 citations

Proceedings ArticleDOI
20 Mar 2003
TL;DR: This paper describes and analyzes the problem of congestion in wireless networks and provides a backward-compatible solution, called RTS validation, which leads to a 60% gain in the peak throughput in addition to stabilizing the throughput at high load.
Abstract: The RTS/CTS mechanism is widely used in wireless networks in order to avoid packet collisions and, thus, achieve high throughput. In ad hoc networks, however the current implementation of the RTS/CTS mechanism may lead to interdependencies so that nodes become unable to transmit any packets during long periods of time. This effect manifests itself in the form of congestion where, after a certain point, the network throughput decreases with increasing load instead of maintaining its peak value. In this paper, we describe and analyze this problem in detail and provide a backward-compatible solution, called RTS validation. Our simulations show that this solution leads to a 60% gain in the peak throughput in addition to stabilizing the throughput at high load.

160 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