Dynamic partitioning of IP-based wireless access networks

Barkoosaraei, A. Mirsayar; Aghvami, A.H.

doi:10.1016/j.comnet.2012.09.005

Cited by 2 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, less congestion translates to less packet delay at the MAPs because of queuing. In [12], three heuristic, Kernighan-Lin-based partitioning algorithms are proposed to assign ARs to MAPs and create overlapping MAP domains. The aim was to minimise the total inter-area handover rate and bottleneck effect of MAPs in HMIPv6 access networks.…”

Section: Novelty and Contributionsmentioning

confidence: 99%

See 1 more Smart Citation

Adaptive quality of service aware multi‐mobility anchor point registration in hierarchical mobile IPv6 wireless access networks

2014

Self Cite

View full text Add to dashboard Cite

In hierarchical mobile IPv6 (HMIPv6), mobility anchor points (MAPs) are introduced to reduce the signalling cost by localising the signalling traffic of mobile nodes (MNs). However, the presence of MAPs introduces areas of bottleneck within the network. This study evaluates the impact of overlapped domains of consecutive MAPs in HMIPv6 access networks. In this novel network architecture, an MAP registration algorithm is also proposed to enable MNs to register with more than one MAP simultaneously. For each flow, the proposed algorithm determines a primary and a secondary MAP according to the quality of service (QoS) requirements of the traffic flow. Load balancing is also introduced to provide an even distribution of load among MAPs. In addition, an extended router advertisement is proposed to enable multiple MAP registration of MNs. The impact of the proposed algorithm in the new HMIPv6 network architectures is compared with a non-QoS aware multi-MAP registration algorithm in access network with no overlapped MAP domains. The simulation-based comparison study illustrates a maximum of 71 and 74% improvements in total amount of rejected bandwidth and the mean satisfied flow requests in network, respectively.

show abstract

Section: Novelty and Contributionsmentioning

confidence: 99%

“…For each n ЄN r attached to AR i, the handover signalling cost imposed by each MAP k accessible by AR i is computed. The cost is sum cost of expected intra-domain and inter-domain handover signalling costs, formulated in (11) and (12), respectively…”

Section: Handover Signalling Delay Costmentioning

confidence: 99%