Dynamic Topology Control and Routing in Wireless Ad Hoc Networks

Kwangil LEE
Kapdong KIM

IEICE TRANSACTIONS on Information and Systems   Vol.E89-D    No.5    pp.1672-1675
Publication Date: 2006/05/01
Online ISSN: 1745-1361
DOI: 10.1093/ietisy/e89-d.5.1672
Print ISSN: 0916-8532
Type of Manuscript: Special Section LETTER (Special Section on Challenges in Ad-hoc and Multi-hop Wireless Communications)
topology control,  routing,  degree constraint,  point-to-point links,  link weight,  

Full Text: PDF(234.3KB)>>
Buy this Article

In this letter we consider topology control and routing problem in wireless networks where equipped with point-to-point wireless links such as directional antennas or free space optics. In point-to-point wireless networks, each node has a limited number of transceivers and hence can communicate with only a limited number of nodes within its transmission range. The selection of the limited number of neighbors is very critical for the network performance. In this letter, we propose a topology control algorithms which consider the topology control and routing of each demand is considered simultaneously. For this, we introduce the degree constraint shortest path problem for finding optimal (shortest) paths in wireless point-to-point networks. Also, we propose two topology control algorithms: minimum hop (MHA) and resource availability ratio (RAR) algorithm. The resource availability ratio algorithm considers not only the available link bandwidth but also the available interfaces between neighbors. By simulation experiments, we compare the performance of each algorithm.

open access publishing via