1 Performance Evaluation of Mobile Relays in CDMA System Presented By: Md. Faisal Murad Hossain Communications Laboratory Helsinki University.

Slides:



Advertisements
Similar presentations
The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
Advertisements

Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
AALTO UNIVERSITY School of Science and Technology Wang Wei
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
DYNAMIC POWER ALLOCATION AND ROUTING FOR TIME-VARYING WIRELESS NETWORKS Michael J. Neely, Eytan Modiano and Charles E.Rohrs Presented by Ruogu Li Department.
A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks Slides by Alex Papadimitriou.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
The Capacity of Wireless Ad Hoc Networks
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Muhammad Mahmudul Islam Ronald Pose Carlo Kopp School of Computer Science & Software Engineering Monash University, Australia.
802.11n MAC layer simulation Submitted by: Niv Tokman Aya Mire Oren Gur-Arie.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
Ncue-csie1 A QoS Guaranteed Multipolling Scheme for Voice Traffic in IEEE Wireless LANs Der-Jiunn Deng 、 Chong-Shuo Fan 、 Chao-Yang Lin Speaker:
Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Vikram Kanodia.
Mobility Increases Capacity In Ad-Hoc Wireless Networks Lecture 17 October 28, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor.
1 Minimizing End-to-End Delay: A Novel Routing Metric for Multi- Radio Wireless Mesh Networks Hongkun Li, Yu Cheng, Chi Zhou Department of Electrical and.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Project Title: Data Access Points in Tiered Wireless Networks PI: Shalinee Kishore, Ph.D. Graduate Assistant: Zhenlei Shen Introduction & Objective In.
Optimal Multicast Capacity and Delay Tradeoffs in MANETs: A Global Perspective Yun Wang, Xiaoyu Chu, Xinbing Wang Department of Electronic Engineering.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
1 Power Control for Distributed MAC Protocols in Wireless Ad Hoc Networks Wei Wang, Vikram Srinivasan, and Kee-Chaing Chua National University of Singapore.
VIRTUAL ROUTER Kien A. Hua Data Systems Lab School of EECS University of Central Florida.
A Distributed Scheduling Algorithm for Real-time (D-SAR) Industrial Wireless Sensor and Actuator Networks By Kiana Karimpour.
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.
6: Wireless and Mobile Networks6-1 Chapter 6 Wireless and Mobile Networks Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition.
The Case for Addressing the Limiting Impact of Interference on Wireless Scheduling Xin Che, Xi Ju, Hongwei Zhang {chexin, xiju,
Algorithms for Allocating Wavelength Converters in All-Optical Networks Authors: Goaxi Xiao and Yiu-Wing Leung Presented by: Douglas L. Potts CEG 790 Summer.
1 Multicast Algorithms for Multi- Channel Wireless Mesh Networks Guokai Zeng, Bo Wang, Yong Ding, Li Xiao, Matt Mutka Michigan State University ICNP 2007.
نیمسال اوّل افشین همّت یار دانشکده مهندسی کامپیوتر مخابرات سیّار (626-40) ارتباطات همکارانه.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
Converge-Cast: On the Capacity and Delay Tradeoffs Xinbing Wang Luoyi Fu Xiaohua Tian Qiuyu Peng Xiaoying Gan Hui Yu Jing Liu Department of Electronic.
Delay-Based Back-Pressure Scheduling in Multi-Hop Wireless Networks 1 Bo Ji, 2 Changhee Joo and 1 Ness B. Shroff 1 Department of ECE, The Ohio State University.
Statistical-Time Access Fairness Index of One-Bit Feedback Fair Scheduler Fumio Ishizaki Dept. of Systems Design and Engineering Nanzan University, Japan.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Providing End-to-End Delay Guarantees for Multi-hop Wireless Sensor Networks I-Hong Hou.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
A Joint Bandwidth Allocation and Routing Scheme for the IEEE 802
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
Ch 12. Multiple Access. Multiple Access for Shared Link Dedicated link – Point-to-point connection is sufficient Shared link – Link is not dedicated –
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
Stretchable Architectures for Next Generation Cellular Networks Presented By Shashidhar Lakkavalli, Ansuya Negi and Dr. Suresh Singh Portland State University.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
1 A Multi-Rate Routing Protocol with Connection Entropy for MANETs Cao Trong Hieu, Young Cheol Bang, Jin Ho Kim, Young An Kim, and Choong Seon Hong Presenter:
Queueing in switched networks Damon Wischik, UCL thanks to Devavrat Shah, MIT TexPoint fonts used in EMF. Read the TexPoint manual before you delete this.
Video Streaming Transmission Over Multi-channel Multi-path Wireless Mesh Networks Speaker : 吳靖緯 MA0G WiCOM '08. 4th International.
1 11 Distributed Channel Assignment in Multi-Radio Mesh Networks Bong-Jun Ko, Vishal Misra, Jitendra Padhye and Dan Rubenstein Columbia University.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
Multicast Scaling Laws with Hierarchical Cooperation Chenhui Hu, Xinbing Wang, Ding Nie, Jun Zhao Shanghai Jiao Tong University, China.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
On Exploiting Diversity and Spatial Reuse in Relay-enabled Wireless Networks Karthikeyan Sundaresan, and Sampath Rangarajan Broadband and Mobile Networking,
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
ComNets, RWTH Aachen University Relays in CDMA2000 Martha Clavijo Chair of Communication Networks RWTH Aachen University, Germany FFV 2007, ,
Distance Vector Routing
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Performance Evaluation of Scheduling in IEEE based Wireless Mesh Networks Bo Han, Weijia Jia,and Lidong Lin Computer Communications, 2007 Mei-zhen.
Satellite Packet Communications A UNIT -V Satellite Packet Communications.
Presentation transcript:

1 Performance Evaluation of Mobile Relays in CDMA System Presented By: Md. Faisal Murad Hossain Communications Laboratory Helsinki University of Technology Supervisor: Prof. Sven Gustav Häggman Instructor: Prof. Riku Jäntti HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

2 Outline Introduction Wireless Network Overview (i) Cellular CDMA Network (ii) Infostation Network (iii) Multihop Cellular Network (MCN) Relaying Design Objective in MCN Mobility Model Basketball Multihop Scheduling –Overview –Pseudocode –Relay Selection Performance Analysis –Effect of User Density –Effect of Cell Radius Conclusion HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

3 Introduction The study of this thesis includes proposing a Scheduling Algorithm, for Mobile Relays in Uplink DS-CDMA, which we name as Basketball Multihop Scheduling Algorithm. We also compare its performance with other existing technologies e.g; pure CDMA and Infostation Systems. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

4 Wireless Network Overview(I) Cellular CDMA Network –The area that a base station covers around it, in which communication from and to the base station is achievable, is called its cell, thus the term comes “cellular network” –It uses the multiplexing scheme CDMA, Code Division Multiple Access. –Mobile stations communicate only with Base Stations. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

5 Wireless Network Overview(II) Infostation Network –Any mobile node communicates with the base station only when they are close enough (within the transmit range). HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

6 Wireless Network Overview(III) Multihop Cellular Network(MCN) –In MCN the base station and mobile stations are not always reciprocally accessible in a single hop. –The key advantage is that the mobile stations can directly communicate with each other provided that they are mutually reachable. –MCN can perform multihop routing. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

7 Relaying Design Objective in MCN –Communication range extension.  Transmission through several hops. –Higher data rates.  Short hops-high data rate –Better Quality.  Cooperative Relaying  original signal is received by several relays and forwarded to the destination through different paths so that it does not get stuck with a bad path and can be switched to a good path. –Improved Capacity Again.  simultaneous transmissions by both the BS and the relays. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

8 Mobility Model –We used Directional Random Walk Mobility model. –In the beginning of the simulation, each mobile node picks a random destination and traverses to that destination in a straight line at a uniform speed. –When the destination is reached, each mobile node chooses a new destination –Each mobile node has a higher probability in moving in the same direction as the previous move. And we assigned different probabilities for all other directions as shown in the figure, so that –The new location of the mobile node depends on the previous location/direction and speed of the mobile node. When a mobile node reaches the boundary of the cell, it should flip-over to the reverse direction of the cell. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

9 Basketball Multihop Scheduling(I) Overview –Basic idea is to deploy Multihop transmission from mobile nodes back to the base station. –We utilize the similarity between the basketball game and our Multihop uplink packet scheduling problem. By regarding players, the basket and the ball as mobiles, the base station and data packet, respectively, we can mimic passing (Multihopping) patterns of the basketball players. –A major difference between the two is that in the Multihopping problem, there are many packets (balls) while in the basket ball game, there is only one ball to shoot into the basket. –For each CDMA time slot, a number of mobile nodes are selected as relays to let other nodes nearby to send the packets to them. –A transmitting terminal may select a relaying node that is close to it and meanwhile the relaying node is located closer to the base station than that transmitting one. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

10 Basketball Multihop Scheduling(II) Overview (Contd.)  There are two control parameters: Transmission range r, and relay probability p.  Scheduling rule –A mobile will act as a relay with probability p.  If it switch to relay mode, it only receives packet during the time slot. –A mobile who does not act as relay will try to transmit  If the base station is in its transmission range r, it will transmit to it directly.  If base station is not in its range, the mobile will select the relay node which is closest to the base station and transmit the packet to it.  If there are no relay nodes closer to the base station than the mobile itself, the mobile will remain idle during the slot. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

11 Basketball Multihop Scheduling(III) HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain r Node that tries to transmit Relay node Communication link Base station

12 Basketball Multihop Scheduling(IV) HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Is base station within radio range Is there any relays within radio range Is any relay closer to The base station than the mobile itself Transmit to the best relay within radio range Stay idle Transmit directly to the base station No Yes No Yes Best relay = relay closest to the base station Transmit mode

13 Basketball Multihop Scheduling(V) Pseudocode At each slot –We determined packet arrivals for all users –We Checked which mobiles are relays –We went through transmit mode users and determined active links –We also determined SINR at the receiver of active links. –Then we determined the packet transmissions in active link  We removed transmitted packets from the transmission buffer of the source nodes and added them to the end of the queue at the destination nodes  If packet were transmitted to the base station, we recorded the packet delay. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

14 Basketball Multihop Scheduling(VI) Relay Selection –Let d ij (t) denote the distance between mobile i and mobile j at time t. Let index 0 denote the base station so that d i0 (t) is the distance between mobile i and the base station at time instant t. Clearly, d 00 (t)=0 for all t. –Let M={1,2,…,N} denote the set of all mobiles and let N={0,1,2,…,N} denote the set of nodes including the base station (i=0). –Let R(t)µN denote the set of relay nodes at time slot, t. We assumed that a node i becomes a relay at time t with probability p i (t)¸ 0, p 0 (t)=1. That is the base station is always willing to act as a relay for all the nodes. All other nodes are wireless relays except the base station which relays the packet to the core network (e.g. internet). –Let A(t)µM denote the set of active nodes. I.e. the nodes that are not acting as relays HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

15 Basketball Multihop Scheduling (VII) Relay Selection (Contd.) –A node i2A(t) selects relay k i using the following rule where 0· ·1 is a weighting parameter and F i (t) denotes the set of feasible relays from mobile i. –The feasible set includes all the nodes that are within the radio range r from the mobile i and are closer to the base station than the node i. The parameter 0<  ·1 denotes a margin. A relay node is only accepted if its distance to the base station is less than that for node i. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

16 Basketball Multihop Scheduling (VIII) HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain i j d i0 d ij  d i0 d j0 r Feasible relays Must lie in the intersection of the two circles Feasible (candidate) relay Unfeasible relay Node transmitting a packet Relay Selection (Contd.)

17 Performance Analysis(I) Performance Analysis –Simulation results are analyzed for the comparison of Basketball Multihop system with CDMA and Infostation systems with the help of CDF plots. –Analysis based on Packet Delays and Throughputs for different systems. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

18 Performance Analysis(II) Table 1: Simulation Parameters ParameterValue No. of Nodes100 Relay Probability0.2 Simulation Time120 sec Radius of Cell5 Km Attenuation Factor4 MS Transmit power0.1 W Noise Power1 pW Slot Length10 mS Mean Inter-Arrival Time(80e-3)/3 sec Std. of Inter-Arrival Time5e-3 Transmission Range250 m Min. Mobile Speed70*1000/3600 m/s Max. Mobile Speed100*1000/3600 m/s Packet Size10 bytes Bandwidth1.25e6 Hz HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

19 Performance Analysis(III) Effect of User Density HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Packet DelayNormalized Throughput CasesMean (sec.) Variance (sec.) MeanVarianceSystem Packet Delay (sec.) System Throughput (pkts/sec) Basketball Multihop 0.6e+3 CI: e+51.1 CI: Pure CDMA1.3e+3 CI: e+66.9 CI: One hop Infostation 2.2e+3 CI: e+61.0 CI: Table 2: Mean and Variance of data (N=100) From Table 2, it can be said that with 100 users in the cell, the Basketball Multihop system incurs less mean packet delay than CDMA and Infostation systems. System Packet Delay for Basketball Multihop system is almost similar as Infostation system but significantly less than CDMA system. Again from Table 2, Throughput for Basketball Multihop is almost similar as Infostation system but worse than CDMA system.

20 Performance Analysis(IV) HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Figure 1: Comparison of Packet Delays for different systems, N=100 It can be seen from Figure 1 that for Basketball Multihop case, 80% of the time the packets will be delivered within 2000 time- slots whereas for CDMA case, 80% of the time the packets will be delivered within around 3000 time-slots and for Infostation case, 80% of the time the packets will be delivered within 4400 time-slots. Hence Basketball Multihop system is clearly better than the other two systems as the Service probability is better in this system with less delay maintaining good Quality of Service (QoS).

21 Performance Analysis(V) Our results indicate that for Basketball Multihop case 100 users can be supported with 90% probability whereas for CDMA case 92 users can be supported with 90% probability and for Infostation case 98 users can be supported with 90% probability. Hence Basketball Multihop system is better than the other two systems with respect to Throughput. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Figure 2: Comparison of Throughputs for different systems, N=100

22 Performance Analysis(VI) HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Packet DelayNormalized Throughput CasesMean (sec.) Variance (sec.) MeanVarianceSystem Packet Delay (sec.) System Throughput (pkts/sec) Basketball Multihop 2.5e+3 CI: e CI: e+3 Pure CDMA2.1e+3 CI: e+62.0 CI: e+3 One hop Infostation 1.8e+3 CI: e+60.8 CI: Table 3: Mean and Variance of data (N=750) Effect of User Density (Contd.) From Table 3, it can be seen that with 750 users in the cell, the Basketball Multihop system incurs more packet delay than CDMA and Infostation systems. Again from Table 3, Throughput for Basketball Multihop is greatly increased than the other two systems.

23 Performance Analysis(VII) HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Figure 3: Comparison of Packet Delays for different systems, N=750 The results indicate that for Basketball Multihop case, 80% of the time the packets will be delivered within 6400 time-slots with 0.8 service probability and 0.2 outage probability, whereas for CDMA case, 80% of the time the packets will be delivered within around 4400 time-slots and for Infostation case, 80% of the time the packets will be delivered within 3800 time-slots. Hence Basketball Multihop system is worse than other two systems with respect to packet delays.

24 Performance Analysis(VIII) The results suggest that for basketball Multihop case 750 users can be supported with 95% probability whereas for CDMA case 750 users can be supported with 95% probability and for Infostation case 750 users can be supported with 85% probability. Thus, it can be said that if the number of user is increased, the Throughput for Basketball Multihop system is increased significantly, becomes stable with good service probability but incurs much packet delay. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Figure 4: Comparison of Throughputs for different systems, N=750

25 Performance Analysis(IX) Effect of Cell Radius HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Table 4: Mean and Variance of data (R=1 Km) Packet DelayNormalized Throughput CasesMean (sec.)Variance (sec.) MeanVarianceSystem Packet Delay (sec.) System throughput (pkts/sec) Basketball Multihop CI: e CI: e+3 Pure CDMA2.4 e+3 CI: e CI: e+3 One hop Infostation 2.6e+3 CI: e CI: e+3 It can be seen from Table 4, that Basketball Multihop system can provide less packet delay and more throughput than CDMA and Infostation systems in a small cell with 1 km radius.

26 Performance Analysis(X) HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Figure 5: Comparison of Packet Delays for different systems, R= 1Km From the Figure 5, it can be seen that for Basketball Multihop case, 80% of the time the packets will be delivered within 4000 time-slots with 0.8 service probability and 0.2 outage probability, whereas for CDMA case, 80% of the time the packets will be delivered within around 4200 time-slots and for Infostation case, 80% of the time the packets will be delivered within 5100 time-slots. Basketball Multihop system is better than the other two systems with respect to packet delays.

27 Performance Analysis(XI) The results indicate that for basketball Multihop case 100 users can be supported with 100% probability whereas for CDMA case 100 users can be supported with 96% probability and for Infostation case 100 users can be supported with 96% probability. Basketball Multihop system is again better than other two systems with respect to Throughput. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Figure 6: Comparison of Throughputs for different systems, R= 1Km

28 Performance Analysis(XII) Effect of Cell Radius (Contd.) HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Table 5: Mean and Variance of data (R=5 Km) Packet DelayNormalized Throughput CasesMean (sec.)Variance (sec.) MeanVarianceSystem Packet Delay (sec.) System throughput (pkts/sec) Basketball Multihop 0.7e+3 CI: e+57.1 CI: Pure CDMA1.1e+3 CI: e+64.9 CI: One hop Infostation2.2e+3 CI: e+61.0 CI: From Table 5, it can be said that with large cell radius (5 Km) Basketball Multihop system provides less delay than the other two systems CDMA and Infostation systems. Again from Table 5, Throughput for Basketball Multihop is better than Infostation and CDMA systems when the cell radius is increased to 5Km.

29 Performance Analysis(XIII) HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Figure 7: Comparison of Packet Delays for different systems, R= 5Km The results suggest that for Basketball Multihop case, 80% of the time the packets will be delivered within 800 time-slots, whereas for CDMA case, 80% of the time the packets will be delivered within around 3000 time- slots and for Infostation case, 80% of the time the packets will be delivered within 3500 time-slots. Hence Basketball Multihop system is clearly better than the other two systems with respect to packet delays.

30 Performance Analysis(XIV) From the Figure 8, it can be seen that for Basketball Multihop case, from 28 to 100 users can be supported with 100% probability whereas for CDMA case from 32 to 100 users can be supported with 100% probability and for Infostation case from 28 to 100 users can be supported with 100% probability. Yet Basketball Multihop system is more stable than CDMA because it can provide any user with more than 80% probability which CDMA cannot provide. Thus we can see that the Basketball Multihop system works better in a larger cell with respect to both Packet Delay and Throughput. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Figure 8: Comparison of Throughputs for different systems, R= 5Km

31 Conclusion  The simulations have shown that there certainly is a need for relaying in cellular networks due to improved capacity and shorter delays.  However the Basketball Multihop system works better for the following conditions: –More users for increased throughput and stability –Larger cell for both shorter delay and improved throughput –Highway-vehicle users for both increased throughput and improved delay –High traffic volume for both shorter delays and higher throughput –Short Transmission range for both improved delays and increased throughput. HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain

32 HELSINKI UNIVERSITY OF TECHNOLOGY Performance Evaluation of Mobile Relays in CDMA System Md. Faisal Murad Hossain Thank You Questions?