On routing in CDMA multihop cellular networks

Kusuma, A. A. N. Ananda; Andrew, Lachlan L. H.; Hanly, Stephen V.

doi:10.1109/glocom.2004.1378915

Cited by 4 publications

(5 citation statements)

References 15 publications

(13 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…-Interference Aware Routing (IAR) proposed in [31] -Optimum Hop Size Routing (OHSR) proposed in [21] -Nearest neighbour routing…”

Section: Simulations and Resultsmentioning

confidence: 99%

“…The base station and the nodes use CDMA as the access method for their interconnections as CDMA is considered for third generation 3GPP, [21][22][23]. Every node is assigned with a CDMA code and the dynamic allocation of CDMA code and its reuse in far-away nodes are not considered in this paper, since such an analysis merits a separate paper.…”

Section: Assumptions and Proposed Mcn Architecturementioning

confidence: 99%

See 1 more Smart Citation

A Cross Layer Routing Protocol for Multihop Cellular Networks

Kannan

Huang

Bhatti

et al. 2009

Wireless Pers Commun

View full text Add to dashboard Cite

We propose a cross-layer routing protocol for a Code Division Multiple Access (CDMA) Multihop Cellular Network (MCN). In designing the routing protocol for MCN, multiple constraints are imposed on intermediate relay node selection and end-to-end path selection. The constraints on relay nodes include willingness for cooperation, sufficient neighbourhood connectivity and the level of interference offered on the path. Path constraints include end-to-end throughput and end-to-end delay. A facile incentive mechanism is presented to motivate the cooperation between nodes in call forwarding. In addition, we present a route resilience scheme in the event of dynamic call dropping. In particular, a fast neighbour detection scheme for route resilience is proposed. Instead of using periodic HELLO messages as in traditional ad-hoc routing, the proposed neighbour detection scheme adopts an explicit handshake mechanism to reduce neighbour detection latency. We conclude the paper by demonstrating the superior performance of the proposed routing protocol compared with the other well known routing algorithms.

show abstract

“…-Interference Aware Routing (IAR) proposed in [31] -Optimum Hop Size Routing (OHSR) proposed in [21] -Nearest neighbour routing…”

Section: Simulations and Resultsmentioning

confidence: 99%

Section: Assumptions and Proposed Mcn Architecturementioning

confidence: 99%

A Cross Layer Routing Protocol for Multihop Cellular Networks

Kannan

Huang

Bhatti

et al. 2009

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…To validate the performance of the proposed model, Monte-Carlo simulation was carried out by randomly selecting the source, destination nodes and the results were averaged over at least 500 realizations of the nodes distribution. We compared our proposed algorithm with interference aware routing proposed in [5], optimum hop size routing proposed in [6] and nearest neighbor routing in underling simulation environment. Fig.…”

Section: Simulations and Resultsmentioning

confidence: 99%

“…We assume that the base station and nodes use CDMA as access technique for their interconnections [6]. Perfect power control is assumed for this CDMA network, so that all the transmitters use just the transmission power level that is required to let the receiver decode the signal with proper quality.…”

Section: System Model and Assumptionsmentioning

confidence: 99%

“…We address one such important issue known as routing. Most of the protocols currently are designed to optimize one or more of the following metrics: energy, delay, distance, end-to-end throughput and interference [4], [5], [6], [7]. Nevertheless, we believe that there is a need to design a global optimal routing protocol for MCNs by taking all necessary issues into considerations to maximize the utility.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cross Layer Routing for Multihop Cellular Networks

Kannan

Merchant

Desai

2007

21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)

View full text Add to dashboard Cite

Abstract-We propose a unified cross layer routing protocol with multiple constraints for CDMA multihop cellular networks (MCN). Multiple constraints are imposed on intermediate relay node selection and source to destination path selection. The relay node constraints for routing protocol design are cooperation, interference caused to other nodes and suf f icient neighborhood connectivity. Path constraints for routing are end-to-end throughput and end-to-end delay. We do not assume full cooperation for call forwarding and present a facile incentive mechanism to motivate the cooperation for call forwarding. We incorporate a realistic mobility model and dynamic call dropping notion in our system. Flat fading i.i.d Rayleigh channel is assumed between mobile nodes. Simulation results show that the proposed algorithm reduces intracell interference by more than 70% as compared to nearest neighbour routing algorithm. Furthermore, the proposed algorithm achieves better throughput and maintains the delay at tolerable level. We also demonstrate that the proposed routing algorithm is superior to many standard routing protocols.

show abstract