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
TL;DR: This work provides an overview of existing multicast routing mechanisms based on routing categories that helps in multimedia communication over MANETs and point to directions for future research and development.

188 citations

Proceedings ArticleDOI
17 Mar 2002
TL;DR: A mobility metric called virtual mobility is introduced that is based on the measured signal quality instead of the geometric distance between nodes, hence it reflects how a routing protocol actually perceives the network's dynamics.
Abstract: We have built an ad hoc protocol evaluation testbed (APE) in order to perform large-scale, reproducible experiments. APE aims at assessing several different routing protocols in a real-world environment instead of by simulation. We present the APE testbed architecture and report on initial experiments with up to 37 physical nodes that show the reproducibility and scalability of our approach. Several scenario scripts have been written that include strict choreographic instructions to the testers who walk around with ORiNOCO equipped laptops. We introduce a mobility metric called virtual mobility that we use to compare different test runs. This metric is based on the measured signal quality instead of the geometric distance between nodes, hence it reflects how a routing protocol actually perceives the network's dynamics.

187 citations

Journal ArticleDOI
01 Jan 2011
TL;DR: The results reveal that MP-OLSR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints.
Abstract: Multipath routing protocols for Mobile Ad hoc NETwork (MANET) address the problem of scalability, security (confidentiality and integrity), lifetime of networks, instability of wireless transmissions, and their adaptation to applications. Our protocol, called MultiPath OLSR (MP-OLSR), is a multipath routing protocol based on OLSR [1]. The Multipath Dijkstra Algorithm is proposed to obtain multiple paths. The algorithm gains great flexibility and extensibility by employing different link metrics and cost functions. In addition, route recovery and loop detection are implemented in MP-OLSR in order to improve quality of service regarding OLSR. The backward compatibility with OLSR based on IP source routing is also studied. Simulation based on Qualnet simulator is performed in different scenarios. A testbed is also set up to validate the protocol in real world. The results reveal that MP-OLSR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints.

187 citations

Journal ArticleDOI
TL;DR: It is shown that minimum latency broadcasting is NP-complete for ad hoc networks and a simple distributed collision-free broadcasting algorithm for broadcasting a message is presented.
Abstract: Network wide broadcasting is a fundamental operation in ad hoc networks. In broadcasting, a source node sends a message to all the other nodes in the network. In this paper, we consider the problem of collision-free broadcasting in ad hoc networks. Our objective is to minimize the latency and the number of transmissions in the broadcast. We show that minimum latency broadcasting is NP-complete for ad hoc networks. We also present a simple distributed collision-free broadcasting algorithm for broadcasting a message. For networks with bounded node transmission ranges, our algorithm simultaneously guarantees that the latency and the number of transmissions are within O(1) times their re spective optimal values. Our algorithm and analysis extend to the case when multiple messages are broadcast from multiple sources. Experimental studies indicate that our algorithms perform much better in practice than the analytical guarantees provided for the worst case.

186 citations

Journal ArticleDOI
TL;DR: An improved mechanism to estimate the available bandwidth in IEEE 802.11-based ad hoc networks is proposed and the accuracy of the estimation is compared to the estimation performed by other state-of-the-art CoS protocols, BRulT, AAC, and CoS-AODV.
Abstract: Since 2005, IEEE 802.11-based networks have been able to provide a certain level of quality of service (QoS) by the means of service differentiation, due to the IEEE 802.11e amendment. However, no mechanism or method has been standardized to accurately evaluate the amount of resources remaining on a given channel. Such an evaluation would, however, be a good asset for bandwidth-constrained applications. In multihop ad hoc networks, such evaluation becomes even more difficult. Consequently, despite the various contributions around this research topic, the estimation of the available bandwidth still represents one of the main issues in this field. In this paper, we propose an improved mechanism to estimate the available bandwidth in IEEE 802.11-based ad hoc networks. Through simulations, we compare the accuracy of the estimation we propose to the estimation performed by other state-of-the-art CoS protocols, BRulT, AAC, and CoS-AODV.

186 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