Efficient route discovery in hybrid networks

Authors:
Roy Friedman;Ari Shotland;Gwendal Simon
Affiliations:
Technion Israel Institute of Technology, Computer Science Department, Haifa 32000, Israel;Technion Israel Institute of Technology, Computer Science Department, Haifa 32000, Israel;Institut TELECOM, TELECOM Bretagne, Computer Science Department, Brest 29238, France
Venue:
Ad Hoc Networks
Year:
2009

Citing 26
Cited 0

Tree-Based Broadcasting in Multihop Radio Networks

IEEE Transactions on Computers
A cluster-based approach for routing in dynamic networks

ACM SIGCOMM Computer Communication Review
On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
A scalable location service for geographic ad hoc routing

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
MIPMANET: mobile IP for mobile ad hoc networks

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Cluster based routing using a k-tree core backbone for mobile ad hoc networks

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Mobility increases the capacity of ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
K-clustering in wireless ad hoc networks

Proceedings of the second ACM international workshop on Principles of mobile computing
On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?

Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Load-Balancing Clusters in Wireless Ad Hoc Networks

ASSET '00 Proceedings of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology (ASSET'00)
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Supporting Hierarchy and Heterogeneous Interfaces in Multi-Hop Wireless Ad Hoc Networks

ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Geographic routing for wireless networks

Geographic routing for wireless networks
Geographic routing without location information

Proceedings of the 9th annual international conference on Mobile computing and networking
Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Locating cache proxies in manets

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Capacity bounds for ad hoc and hybrid wireless networks

ACM SIGCOMM Computer Communication Review
On the scalability and capacity of planar wireless networks with omnidirectional antennas: Research Articles

Wireless Communications & Mobile Computing - Special Issue: Scalability Issues in Wireless Networks—Architectures, Protocols and Services
Capacity upgrading in mobile ad hoc access networks (MAHANs) using CSMA/CAPA

Proceedings of the 4th ACM international workshop on Mobility management and wireless access
Tackling group-to-tree matching in large scale group communications

Computer Networks: The International Journal of Computer and Telecommunications Networking
The capacity of wireless networks

IEEE Transactions on Information Theory
Routing schemes in heterogeneous wireless networks based on access advertisement and backward utilities for QoS support [Quality of Service based Routing Algorithms for Heterogeneous Networks]

IEEE Communications Magazine
Efficient on-demand routing for mobile ad hoc wireless access networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hybrid networks are formed by a combination of access points and mobile nodes such that the mobile nodes can communicate both through the access points and using ad-hoc networking among themselves. This work deals with providing efficient routing between mobile devices in hybrid networks. Specifically, we assume the existence of a spanning tree from each access point to all mobile devices within the transitive transmission range of the access point. We utilize this spanning tree to design a family of efficient point-to-point routing protocols for communication between the mobile devices themselves. The protocols utilize the tree structure in order to avoid expensive flooding of the entire network. The paper includes a detailed simulation study of several representative communication patterns, which compares our approaches to DSR.