AUSTON

INSTITUTE OF MANAGEMENT CEYLON

Faculty of Engineering
Advanced Diploma in Electrical and Electronics Engineering A203SE Analogue Electronics

Coursework

Student Name: Badurdeen Shakeal Student ID: T1-11-EEE-L2-86 Supervisor: Mr. Inham Hassan Submission Date: 2012.06.01

PROJECT/ASSIGNMENT SUBMISSION ACKNOWLEDGEMENT SLIP Name of Student: M. Badurdeen Shakeal Student No: T1-11-EEE-L2-86

Home Address:__________________________________________________________ Date of Submission: 2012.June.1st Name of Tutor: Mr. Inam Hassan Program/ Module: A206SE Communication and Networks Individual Assignment Received By: _________________________ Date: _____________________________

Max Marks Learning Outcome Q1. Investigate the operation communications networks a. Identify and Describe the New Development b. Describe how the technology works c. Describe the current scenario when the technology was developed. d. Describe the implications in communications e. Describe how the technology was used. Q2. Analysis and of 30%

1st Marker

2nd Marker

6%

6% 6%

6%

6%

30%

design of a communications network. (ROUTING) a. locations Identify and describe the 5%

b. Distance Calculation

10%

A206SE communications and Network

BADUR SHAKEAL

c.

Calculation of the shortest Path

15%

Q3. Analysis and design of a communications network. (RADIO LINK) a Design the communication link i. Selection of transiever ii.Received power calculation using MODEL 1 ii.Received power calculation using MODEL 2 b. Analysis of the radio link Quality and Structure of Report Discussion Conclusion

30%

5% 10%

10%

5%

5% 5%

Total Marks

100%

1st makers Comment _______________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________

2nd makers Comment _______________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________

A206SE communications and Network

BADUR SHAKEAL

Abstract
As communication technology is developing, the community styles obtain complicated. To discover the best parth the particular Dijkstra Formula is used. In this assignment in order to find the best way with inside Capital of Singapore MRT channels Dijkstra Algorithm is used. The actual ranges involving two MRT channels are calculated from your Search engines Road routes.

A206SE communications and Network

BADUR SHAKEAL

Table of Contents
PROJECT/ASSIGNMENT SUBMISSION ACKNOWLEDGEMENT SLIP .............................................................. 1 Abstract ........................................................................................................................................................ 3 Introduction .................................................................................................................................................. 5 Calculations.................................................................................................................................................. 6 Distance Calculations............................................................................................................................... 7 Rout Table.............................................................................................................................................. 11 Path Diagram ............................................................................................................................................. 14 Diagram of Calculated Shortest path ..................................................................................................... 15 Map of final Shortest path.......................................................................................................................... 16 Discussion and Conclusions ...................................................................................................................... 17 References .................................................................................................................................................. 18

A206SE communications and Network

BADUR SHAKEAL

Introduction
In the event the community style get complex it had been a difficult part of the system creative developers to decide the very best and useful course. To resolve this problem any Nederlander Researchers called Edsger Dijkstra designed an algorithm named individual supplier quickest route algorithm or so called Dijkstra Algorithm where can be find the least course from connection to all additional links. Withon this Algorithm the main objective is not only locating the least route from one node along with other nodes, but to get the simple version of the difficult system layout (that is more vital this particular era).

Singapore MRT Map

A206SE communications and Network

BADUR SHAKEAL

Calculations The path cost can be calculated using below equation Here d = Distance between two stations in Kilometers and C = path cost This formula is used to avoid decimal number involving in the cost calculation. There are four major MRT (Maximal Ratio Transmission) lines are in singapore. North South line Indicate in red color in the map North East line Indicate in purple color in the map East West line Indicate in green color in the map Circle line Indicate in yellow color in the map

From out of these four lines selected three lines are below. 1. North South line Indicate in red color in the map 2. North East line Indicate in purple color in the map 3. East West line Indicate in green color in the map The distance between MRT stations are calculated using google maps distance fares calculator. The selected MRT stations from above three lines are From North South line Marsiling and Kranji From North East line Clark Quey and China Town From West line Clementi and Tampines

Path costs of selected lines are (Distance are in Kilometers)

A206SE communications and Network BADUR SHAKEAL

Distance Calculations

From Marsiling to Cost between Marsiling to Kranji C= =

Cost between Marsiling to China Town C= =

Cost between Marsiling to Clark Quey C= =

Cost between Marsiling to Clementi C= =

Cost between Marsiling to Tampines C= =

From Kranji to Cost between Kranji to Marsiling C= =

Cost between Kranji to China Town C= =

A206SE communications and Network

BADUR SHAKEAL

Cost between Kranji to Clark Quey C= =

Cost between Kranji to Clementi C= =

Cost between Kranji to Tampines C= =

From Clark Quey to Cost between Clark Quey to Marsiling C= =

Cost between Clark Quey to Kranji C= =

Cost between Clark Quey to China Town C= =

Cost between Clark Quey to Clementi C= =

Cost between Clark Quey to Tampines C= =

A206SE communications and Network

BADUR SHAKEAL

From China Town to Cost between China Town to Marsiling C= =

Cost between China Town to Kranji C= =

Cost between China Town to Clark Quey C= =

Cost between China Town to Clementi C= =

Cost between China Town to Tampines C= =

From Clementi to Cost between Clementi to Marsiling C= =

Cost between Clementi to Kranji C= =

Cost between Clementi to Clark Quey

A206SE communications and Network

BADUR SHAKEAL

C=

Cost between Clementi to China Town C= =

Cost between Clementi to Tampines C= =

From Tampines to Cost between Tampines to Marsiling C= =

Cost between Tampines to Kranji C= =

Cost between Tampines to Clark Quey C= =

Cost between Tampines to China Town C= =

Cost between Tampines to Clementi C= =

A206SE communications and Network

BADUR SHAKEAL

Rout Table The Routing table for a particular MRT Station to all other MRT stations in the Network as follows. Where the cost of the MRT line can be calculated using the formula mentioned above Distance between stations Marsiling From Marsiling Kranji Clark Quey China town Clementi Tampines Cost= 9 140 138 87 217

Kranji From Kranji Marsiling Chinatown Clark Quey Clementi Tampines Cost= 9 129 132 78 220

A206SE communications and Network

BADUR SHAKEAL

Clark Quey From Clark Quey Marsiling Kranji Chinatown Clementi Tampines Cost= 140 132 3 54 91

China Town From Chinatown Marsiling Kranji Clark Quey Clementi Tampines Cost= 138 128 3 51 98

A206SE communications and Network

BADUR SHAKEAL

Clementi From Clementi Marsiling Kranji Clark Quey Chinatown Tampines Cost= 87 78 54 51 142

Tampines From Tampines Marsiling Kranji Clark Quey Chinatown Clementi Cost= 217 220 91 98 142

A206SE communications and Network

BADUR SHAKEAL

Path Diagram According to the values which are calculated the path map can be drown like follow.

As mention in the question one MRT statin (Tempines) is selected as base station and calculated lest cost path between all other stations with the selected MRT station Chinatown.

A206SE communications and Network

BADUR SHAKEAL

Diagram of Calculated Shortest path

From Station Chinatown to Kranji Marsiling Clark Quey Chinatown Clementi Tampines

Path from Chinatown Kranji Marsiling China Town, Clark Quey Chinatown Clementi Table 2.7

Cost 220 217 101 98 142 0

A206SE communications and Network

BADUR SHAKEAL

According to the shortest path algorithm the MRT station map is shown below. The map is created by selecting Chinatown as the base MRT Station. Map of final Shortest path

A206SE communications and Network

BADUR SHAKEAL

Discussion and Conclusions

This is the way that is finding out the shortest/efficient path when the network is very simple but as networking topologies develops, when networks get too complicated we have to move for a standard mechanism to calculate for the best path. As we can see here the MRT stations are situated in a complicated manner, which is very difficult to come up with a shortest path map. But from studying the Dijkstra algorithm and with the help of distance calculator it is easy to design the shortest path from a selected base MRT station.

A206SE communications and Network

BADUR SHAKEAL

References
Ghosh, A., Zhang, J., Jeffrey, G. and Mohamed, R. (ed. By Rajive, L. 2011. Fundamentals of LTE. 1st edn.:Boston) Ralf kreher and karsten gaenger 2011.LTE Signaling:Troubleshooting & Optimization. John wiley & Sons Ltd. West Sussex. Stefania Sesia, Issam Toufik andMatthew Baker. 2011. LTE the UMTS Long Term Evolution: From the theory to practice. John wiley & Sons Ltd. West Sussex. Harri Holma Anti Toskala. 2009. LTE for UMTS: OFDMA and SC-FDMA Based Radio Access. John wiley & Sons Ltd. West Sussex. Tara Ali-Yahiya. 2011. Understanding LTE and its performance. Springer science. London. Find out the MRT Maps [Online] [2012.05.22] http://www.smrt.com.sg/trains/network_map.asp Find out the MRT Station distances [Online] [2012.05.12] https://maps.google.com/ Select Antennas and their Data Sheets [Online] [2012.05.12] http://parts.digikey.com/1/partskws/rf-antenna

A206SE communications and Network

BADUR SHAKEAL