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
13 Apr 2008
TL;DR: A cross-layering approach is a promising tradeoff between generic solutions and solutions optimized for a specific application in wireless ad hoc and sensor networks to maximize network lifetime.
Abstract: The diversity of the applications supported by wireless ad hoc and sensor networks explain the success of these networks. However, their energy constrained nature requires the use of energy efficient strategies to maximize network lifetime. We can classify these strategies in four categories: 1. energy efficient routing, 2. scheduling the nodes sleeping state, 3. topology control by tuning node transmission power and 4. reducing the volume of information transferred. For each category, a state of the art is given and new protocols are presented. The best energy efficiency will be obtained by combining all the four categories of strategies. A cross-layering approach is a promising tradeoff between generic solutions and solutions optimized for a specific application.

109 citations

Proceedings ArticleDOI
22 Apr 2001
TL;DR: This paper first analyzes an ideal centralized fair queueing algorithm developed for ad hoc networks, and extracts the desired global properties that the localized algorithms should possess, and proposes three localizedFair queueing models, in which local schedulers self-coordinate their local interactions and collectively achieve the desiredglobal properties.
Abstract: Distributed fair queueing in shared-medium ad hoc wireless networks is non-trivial because of the unique design challenges in such networks, such as location-dependent contention, distributed nature of ad hoc fair queueing, channel spatial reuse, and scalability in the presence of node mobility. In this paper, we seek to devise new distributed, localized, scalable and efficient solutions to this problem. We first analyze an ideal centralized fair queueing algorithm developed for ad hoc networks, and extract the desired global properties that the localized algorithms should possess. We then propose three localized fair queueing models, in which local schedulers self-coordinate their local interactions and collectively achieve the desired global properties. We further describe a novel implementation of the proposed models within the framework of the popular CSMA/CA paradigm and address several practical issues. Our simulations and analysis demonstrate the effectiveness of our proposed design.

109 citations

Proceedings ArticleDOI
14 Mar 2004
TL;DR: This analysis reveals several aspects that are usually neglected in simulation studies and presents a channel model for an 802.11 network that indicates virtual carrier sensing is generally not necessary and the RTS/CTS mechanism only introduces additional overhead.
Abstract: In this paper we investigate the performance of IEEE 802.11b ad hoc networks by means of an experimental study. This analysis reveals several aspects that are usually neglected in simulation studies. Firstly, since different transmission rates are used for control and data frames, different transmission ranges and carrier-sensing ranges may exist at the same time in the network. In addition, the transmission ranges are in practice much shorter than usually assumed in simulation analysis, not constant but highly variable (even in the same session) and depends on several factors (i.e., mobile height, interference condition, etc.). Finally, exploiting our performance measurements, we present a channel model for an 802.11 network that indicates virtual carrier sensing is generally not necessary and the RTS/CTS mechanism only introduces additional overhead.

109 citations

01 Jan 1999
TL;DR: This paper shows that using five different power-aware metrics based on battery power consumption at nodes for determining broadcast routes in wireless ad hoc networks reduces the cost/broadcast of routing packets to all destinations by 5-50% over a broadcast tree constructed using a greedy strategy based on network topology information only.
Abstract: In this paper we present five different power-aware metrics based on battery power consumption at nodes for determining broadcast routes in wireless ad hoc networks. We show that using these metrics in a power-aware broadcasting algorithm reduces the cost/broadcast of routing packets to all destinations by 5-50% over a broadcast tree constructed using a greedy strategy based on network topology information only (this cost reduction is on top of a 40-70% reduction in energy consumption obtained by using PAMAS, our MAC layer protocol). We also show that the maximum node cost after many broadcasts is reduced by 20-150% with the power-aware algorithm compared to the nonpower-aware algorithm, thereby increasing the life of the network significantly. For comparison purposes, we also ran simulations with the flooding algorithm for broadcasting which performs worse by a factor of 10 compared to the power-aware algorithm. An interesting property of using power-aware broadcasting is that the average packet delays do not increase. Technical Subject Area: Adaptive Traffic and Access Control Protocol, Radio Resource Management

109 citations

Proceedings ArticleDOI
09 Nov 2015
TL;DR: The existing routing protocols for FANETs are classified into six major categories which are critically analyzed and compared based on various performance criteria to help network engineers in choosing appropriate routing protocols based on the specific scenario where the FANet will be deployed.
Abstract: The usage of Unmanned Aerial Vehicles (UAVs) is increasing day by day. In recent years, UAVs are being used in increasing number of civil applications, such as policing, fire-fighting, etc in addition to military applications. Instead of using one large UAV, multiple UAVs are nowadays used for higher coverage area and accuracy. Therefore, networking models are required to allow two or more UAV nodes to communicate directly or via relay node(s). Flying Ad-Hoc Networks (FANETs) are formed which is basically an ad hoc network for UAVs. This is relatively a new technology in network family where requirements vary largely from traditional networking model, such as Mobile Ad-hoc Networks and Vehicular Ad-hoc Networks. In this paper, Flying Ad-Hoc Networks are surveyed along with its challenges compared to traditional ad hoc networks. The existing routing protocols for FANETs are then classified into six major categories which are critically analyzed and compared based on various performance criteria. Our comparative analysis will help network engineers in choosing appropriate routing protocols based on the specific scenario where the FANET will be deployed.

109 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