Cross Layer Routing for Multihop Cellular Networks

Abstract

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.

Access Mechanism for Multihop Cellular Networks

“…1 shows such a routing strategy with dashed lines for control messages and continuous lines for voice/data communications. We follow the unified routing strategy proposed in [9] to determine the routing path from source to destination. Whenever a node wants to initiate a communication, it will send a call initiation request to the base station through CCH.…”

“…Whenever a node wants to initiate a communication, it will send a call initiation request to the base station through CCH. Base station will find the route by using the algorithm proposed in [9] and will convey the route information to source and destination through CCH. Hereafter we assume that definite path exists for TCH and CCH from source to destination.…”