
2/19

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 1st Marker 2nd Marker

Learning Outcome

Q1. Investigate the operation of

communications networks

30%

a. Identify and Describe the New

Development

6%

b. Describe how the technology works 6%

c. Describe the current scenario when

the technology was developed.

6%

d. Describe the implications in

communications

6%

e. Describe how the technology was

used.

6%

Q2. Analysis and

design of a communications network.

(ROUTING)

30%

a. Identify and describe the

locations

5%

b. Distance Calculation 10%


3/19

c. Calculation of the shortest Path 15%

Q3. Analysis and design of acommunications network. (RADIO LINK)

30%

a Design the communication link

i. Selection of transiever 5%

ii.Received power calculation

using MODEL 1

10%

ii.Received power calculationusing MODEL 2

10%

b. Analysis of the radio link 5%

Quality and Structure of Report

Discussion 5%

Conclusion 5%

Total Marks 100%

1st

makers Comment _______________________________________________________________

_____________________________________________________________________________________

_____________________________________________________________________________________

__________________________________________________________________________________________________________________________________________________________

2nd

makers Comment _______________________________________________________________

_____________________________________________________________________________________

_____________________________________________________________________________________

_____________________________________________________________________________________

_____________________________________________________________________


4/19

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.


5/19

Table of ContentsPROJECT/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


6/19

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 fromconnection 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


7/19

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 map2. North East line Indicate in purple color in the map3. 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 lineClementiand Tampines

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


8/19

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 =

=


9/19


Cost between Kranji to Clark Quey

C =

=

Cost between Kranji to Clementi

C =

=

Cost between Kranji to Tampines

C =

=

From Clark Queyto

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 =

=


10/19


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 betweenClementi to Marsiling

C =

=

Cost between Clementi to Kranji

C =

=

Cost between Clementi to Clark Quey


11/19


C =

=

Cost between Clementi to China Town

C =

=

Cost between Clementi to Tampines

C =

=

From Tampines to

Cost betweenTampines 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 =

=


12/19


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 Cost=

Marsiling -

Kranji 9

Clark Quey 140

China town 138

Clementi 87

Tampines 217

Kranji

From Cost=

Kranji -

Marsiling 9

Chinatown 129

Clark Quey 132

Clementi 78

Tampines 220


13/19


Clark Quey

From Cost=

Clark Quey -

Marsiling 140

Kranji 132

Chinatown 3

Clementi 54

Tampines 91

China Town

From Cost=

Chinatown -

Marsiling 138

Kranji 128

Clark Quey 3

Clementi 51

Tampines 98


14/19


Clementi

From Cost=

Clementi -

Marsiling 87

Kranji 78

Clark Quey 54

Chinatown 51

Tampines 142

Tampines

From Cost=

Tampines -

Marsiling 217

Kranji 220

Clark Quey 91

Chinatown 98

Clementi 142


15/19


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.


16/19


Diagram of Calculated Shortest path

From Station Chinatown to Path from Chinatown Cost

Kranji Kranji 220

Marsiling Marsiling 217

Clark Quey China Town, Clark Quey 101

Chinatown Chinatown 98

Clementi Clementi 142

Tampines - 0

Table 2.7


17/19


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


18/19


Discussion and ConclusionsThis 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.


19/19


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. Johnwiley & 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/parts-

kws/rf-antenna
http://www.smrt.com.sg/trains/network_map.asphttp://www.smrt.com.sg/trains/network_map.asphttps://maps.google.com/https://maps.google.com/http://parts.digikey.com/1/parts-kws/rf-antennahttp://parts.digikey.com/1/parts-kws/rf-antennahttp://parts.digikey.com/1/parts-kws/rf-antennahttp://parts.digikey.com/1/parts-kws/rf-antennahttp://parts.digikey.com/1/parts-kws/rf-antennahttp://parts.digikey.com/1/parts-kws/rf-antennahttps://maps.google.com/http://www.smrt.com.sg/trains/network_map.asp

a206se communications and network

Documents